Harnessing machine learning for fiber-induced nonlinearity mitigation in long-haul coherent optical OFDM

© 2018 by the authors. Licensee MDPI, Basel, Switzerland. This article is an open access article distributed under the terms and conditions of the Creative Commons Attribution (CC BY) license (http://creativecommons.org/licenses/by/4.0/).Coherent optical orthogonal frequency division multiplexing (CO-OFDM) has attracted a lot of interest in optical fiber communications due to its simplified digital signal processing (DSP) units, high spectral-efficiency, flexibility, and tolerance to linear impairments. However, CO-OFDM’s high peak-to-average power ratio imposes high vulnerability to fiber-induced non-linearities. DSP-based machine learning has been considered as a promising approach for fiber non-linearity compensation without sacrificing computational complexity. In this paper, we review the existing machine learning approaches for CO-OFDM in a common framework and review the progress in this area with a focus on practical aspects and comparison with benchmark DSP solutions.Peer reviewe

Solution Path Algorithm for Twin Multi-class Support Vector Machine

The twin support vector machine and its extensions have made great achievements in dealing with binary classification problems, however, which is faced with some difficulties such as model selection and solving multi-classification problems quickly. This paper is devoted to the fast regularization parameter tuning algorithm for the twin multi-class support vector machine. A new sample dataset division method is adopted and the Lagrangian multipliers are proved to be piecewise linear with respect to the regularization parameters by combining the linear equations and block matrix theory. Eight kinds of events are defined to seek for the starting event and then the solution path algorithm is designed, which greatly reduces the computational cost. In addition, only few points are combined to complete the initialization and Lagrangian multipliers are proved to be 1 as the regularization parameter tends to infinity. Simulation results based on UCI datasets show that the proposed method can achieve good classification performance with reducing the computational cost of grid search method from exponential level to the constant level

Investigating Brain Functional Networks in a Riemannian Framework

The brain is a complex system of several interconnected components which can be categorized at different Spatio-temporal levels, evaluate the physical connections and the corresponding functionalities. To study brain connectivity at the macroscale, Magnetic Resonance Imaging (MRI) technique in all the different modalities has been exemplified to be an important tool. In particular, functional MRI (fMRI) enables to record the brain activity either at rest or in different conditions of cognitive task and assist in mapping the functional connectivity of the brain. The information of brain functional connectivity extracted from fMRI images can be defined using a graph representation, i.e. a mathematical object consisting of nodes, the brain regions, and edges, the link between regions. With this representation, novel insights have emerged about understanding brain connectivity and providing evidence that the brain networks are not randomly linked. Indeed, the brain network represents a small-world structure, with several different properties of segregation and integration that are accountable for specific functions and mental conditions. Moreover, network analysis enables to recognize and analyze patterns of brain functional connectivity characterizing a group of subjects. In recent decades, many developments have been made to understand the functioning of the human brain and many issues, related to the biological and the methodological perspective, are still need to be addressed. For example, sub-modular brain organization is still under debate, since it is necessary to understand how the brain is functionally organized. At the same time a comprehensive organization of functional connectivity is mostly unknown and also the dynamical reorganization of functional connectivity is appearing as a new frontier for analyzing brain dynamics. Moreover, the recognition of functional connectivity patterns in patients affected by mental disorders is still a challenging task, making plausible the development of new tools to solve them. Indeed, in this dissertation, we proposed novel methodological approaches to answer some of these biological and neuroscientific questions. We have investigated methods for analyzing and detecting heritability in twin's task-induced functional connectivity profiles. in this approach we are proposing a geodesic metric-based method for the estimation of similarity between functional connectivity, taking into account the manifold related properties of symmetric and positive definite matrices. Moreover, we also proposed a computational framework for classification and discrimination of brain connectivity graphs between healthy and pathological subjects affected by mental disorder, using geodesic metric-based clustering of brain graphs on manifold space. Within the same framework, we also propose an approach based on the dictionary learning method to encode the high dimensional connectivity data into a vectorial representation which is useful for classification and determining regions of brain graphs responsible for this segregation. We also propose an effective way to analyze the dynamical functional connectivity, building a similarity representation of fMRI dynamic functional connectivity states, exploiting modular properties of graph laplacians, geodesic clustering, and manifold learning

Grassmann Learning for Recognition and Classification

Computational performance associated with high-dimensional data is a common challenge for real-world classification and recognition systems. Subspace learning has received considerable attention as a means of finding an efficient low-dimensional representation that leads to better classification and efficient processing. A Grassmann manifold is a space that promotes smooth surfaces, where points represent subspaces and the relationship between points is defined by a mapping of an orthogonal matrix. Grassmann learning involves embedding high dimensional subspaces and kernelizing the embedding onto a projection space where distance computations can be effectively performed. In this dissertation, Grassmann learning and its benefits towards action classification and face recognition in terms of accuracy and performance are investigated and evaluated. Grassmannian Sparse Representation (GSR) and Grassmannian Spectral Regression (GRASP) are proposed as Grassmann inspired subspace learning algorithms. GSR is a novel subspace learning algorithm that combines the benefits of Grassmann manifolds with sparse representations using least squares loss §¤1-norm minimization for improved classification. GRASP is a novel subspace learning algorithm that leverages the benefits of Grassmann manifolds and Spectral Regression in a framework that supports high discrimination between classes and achieves computational benefits by using manifold modeling and avoiding eigen-decomposition. The effectiveness of GSR and GRASP is demonstrated for computationally intensive classification problems: (a) multi-view action classification using the IXMAS Multi-View dataset, the i3DPost Multi-View dataset, and the WVU Multi-View dataset, (b) 3D action classification using the MSRAction3D dataset and MSRGesture3D dataset, and (c) face recognition using the ATT Face Database, Labeled Faces in the Wild (LFW), and the Extended Yale Face Database B (YALE). Additional contributions include the definition of Motion History Surfaces (MHS) and Motion Depth Surfaces (MDS) as descriptors suitable for activity representations in video sequences and 3D depth sequences. An in-depth analysis of Grassmann metrics is applied on high dimensional data with different levels of noise and data distributions which reveals that standardized Grassmann kernels are favorable over geodesic metrics on a Grassmann manifold. Finally, an extensive performance analysis is made that supports Grassmann subspace learning as an effective approach for classification and recognition

Developing of Ultrasound Experimental Methods using Machine Learning Algorithms for Application of Temperature Monitoring of Nano-Bio-Composites Extrusion

In industry fiber degradation during processing of biocomposite in the extruder is a problem that requires a reliable solution to save time and money wasted on producing damaged material. In this thesis, We try to focus on a practical solution that can monitor the change in temperature that causes fiber degradation and material damage to stop it when it occurs. Ultrasound can be used to detect the temperature change inside the material during the process of material extrusion. A monitoring approach for the extruder process has been developed using ultrasound system and the techniques of machine learning algorithms. A measurement cell was built to form a dataset of ultrasound signals at different temperatures for analysis. Machine learning algorithms were applied through machine-learning algorithm’s platform to classify the dataset based on the temperature. The dataset was classified with accuracy 97% into two categories representing over and below damage temperature (190oc) ultrasound signal. This approach could be used in industry to send an alarm or a temperature control signal when material damage is detected. Biocomposite is at the core of automotive industry material research and development concentration. Melt mixing process was used to mix biocomposite material with multi-walled carbon nanotubes (MWCNTs) for the purpose of enhancing mechanical and thermal properties of biocomposite. The resulting composite nano-bio- composite was tested via different types of thermal and mechanical tests to evaluate its performance relative to biocomposite. The developed material showed enhancement in mechanical and thermal properties that considered a high potential for applications in the future