Low-Rank and Sparse Decomposition for Hyperspectral Image Enhancement and Clustering

In this dissertation, some new algorithms are developed for hyperspectral imaging analysis enhancement. Tensor data format is applied in hyperspectral dataset sparse and low-rank decomposition, which could enhance the classification and detection performance. And multi-view learning technique is applied in hyperspectral imaging clustering. Furthermore, kernel version of multi-view learning technique has been proposed, which could improve clustering performance. Most of low-rank and sparse decomposition algorithms are based on matrix data format for HSI analysis. As HSI contains high spectral dimensions, tensor based extended low-rank and sparse decomposition (TELRSD) is proposed in this dissertation for better performance of HSI classification with low-rank tensor part, and HSI detection with sparse tensor part. With this tensor based method, HSI is processed in 3D data format, and information between spectral bands and pixels maintain integrated during decomposition process. This proposed algorithm is compared with other state-of-art methods. And the experiment results show that TELRSD has the best performance among all those comparison algorithms. HSI clustering is an unsupervised task, which aims to group pixels into different groups without labeled information. Low-rank sparse subspace clustering (LRSSC) is the most popular algorithms for this clustering task. The spatial-spectral based multi-view low-rank sparse subspace clustering (SSMLC) algorithms is proposed in this dissertation, which extended LRSSC with multi-view learning technique. In this algorithm, spectral and spatial views are created to generate multi-view dataset of HSI, where spectral partition, morphological component analysis (MCA) and principle component analysis (PCA) are applied to create others views. Furthermore, kernel version of SSMLC (k-SSMLC) also has been investigated. The performance of SSMLC and k-SSMLC are compared with sparse subspace clustering (SSC), low-rank sparse subspace clustering (LRSSC), and spectral-spatial sparse subspace clustering (S4C). It has shown that SSMLC could improve the performance of LRSSC, and k-SSMLC has the best performance. The spectral clustering has been proved that it equivalent to non-negative matrix factorization (NMF) problem. In this case, NMF could be applied to the clustering problem. In order to include local and nonlinear features in data source, orthogonal NMF (ONMF), graph-regularized NMF (GNMF) and kernel NMF (k-NMF) has been proposed for better clustering performance. The non-linear orthogonal graph NMF combine both kernel, orthogonal and graph constraints in NMF (k-OGNMF), which push up the clustering performance further. In the HSI domain, kernel multi-view based orthogonal graph NMF (k-MOGNMF) is applied for subspace clustering, where k-OGNMF is extended with multi-view algorithm, and it has better performance and computation efficiency

Symmetry and Complexity

Symmetry and complexity are the focus of a selection of outstanding papers, ranging from pure Mathematics and Physics to Computer Science and Engineering applications. This collection is based around fundamental problems arising from different fields, but all of them have the same task, i.e. breaking the complexity by the symmetry. In particular, in this Issue, there is an interesting paper dealing with circular multilevel systems in the frequency domain, where the analysis in the frequency domain gives a simple view of the system. Searching for symmetry in fractional oscillators or the analysis of symmetrical nanotubes are also some important contributions to this Special Issue. More papers, dealing with intelligent prognostics of degradation trajectories for rotating machinery in engineering applications or the analysis of Laplacian spectra for categorical product networks, show how this subject is interdisciplinary, i.e. ranging from theory to applications. In particular, the papers by Lee, based on the dynamics of trapped solitary waves for special differential equations, demonstrate how theory can help us to handle a practical problem. In this collection of papers, although encompassing various different fields, particular attention has been paid to the common task wherein the complexity is being broken by the search for symmetry

Channel Estimation in Massive Multi-User MIMO Systems Based on Low-Rank Matrix Approximation

In recent years, massive Multi-User Multi-Input Multi-Output (MU-MIMO) system has attracted significant research interests in mobile communication systems. It has been considered as one of the promising technologies for 5G mobile wireless networks. In massive MU-MIMO system, the base station (BS) is equipped with a very large number of antenna elements and simultaneously serves a large number of single-antenna users. Compared to traditional MIMO system with fewer antennas, massive MU-MIMO system can offer many advantages such as significant improvements in both spectral and power efficiencies. However, the channel estimation in massive MU-MIMO system is particularly challenging due to large number of channel matrix entries to be estimated within a limited coherence time interval. This problem occurs in a single-cell case where both dimensions of the channel matrix grow large. Also, It happens in the multi-cell setting due to the pilot contamination effect. In this thesis, the problem of channel estimation in both single-cell and multi-cell time division duplex (TDD) massive MU-MIMO systems is studied. Thus, two-channel estimation namely “nuclear norm (NN)” and “iterative weighted nuclear norm (IWNN)” approximation techniques are proposed to solve the channel estimation problem in both systems. First, channel estimation in a single-cell TDD massive MU-MIMO system is formulated as a convex nuclear norm optimization problem with regularization parameter γ. In this study, the regularization parameter γ is selected based on the cross-validation (CV) curve method. The simulation results in terms of the normalized mean square error (NMSE) and uplink achievable sum-rate (ASR) are provided to show the effectiveness of the NN proposed scheme compared to the conventional least square (LS) estimator. Then, the IWNN approximation is proposed to improve the performance of the NN method. Thus, the channel estimation in a single-cell TDD massive MU-MIMO system is formulated as a weighted nuclear norm optimization problem. The simulation results show the effectiveness of the IWNN estimation approach compared to the standard NN and conventional LS estimation methods in terms of the NMSE and ASR. Second, both previous estimation techniques are extended to apply in a multi-cell TDD massive MU-MIMO system to mitigate pilot contamination effect. The simulation results in terms of the NMSE and uplink ASR show that the IWNN scheme outperforms the NN and LS estimations in the presence of high pilot contamination effect. Finally, a novel channel estimation scheme namely “Approximate minimum mean square error (AMMSE)” is proposed to reduce the computational complexity of the minimum mean square error (MMSE) estimator which was proposed for multi-cell TDD massive MU-MIMO system. Furthermore, a brief analysis of the computational complexity regarding the number of multiplications of the proposed AMMSE estimator is provided. It has been shown that the complexity of the proposed AMMSE estimator is reduced compared to the conventional MMSE estimator. The simulation results in terms of the NMSE and the uplink ASR performances show the proposed AMMSE estimation performance is almost the same as the conventional MMSE estimator under two different scenarios: noise-limited and pilot contamination