5 September 2022 in IEEE Transactions on Pattern Analysis and Machine Intelligence
It is known that the decomposition in low-rank and sparse matrices ( L+S for short) can be achieved by several Robust PCA techniques. Besides the low rankness, the local smoothness ( LSS ) is a vitally essential prior for many real-world matrix data such as hyperspectral images and surveillance videos, which makes such matrices have low-rankness and local smoothness property at the same time. This poses an interesting question: Can we make a matrix decomposition in terms of L&LSS +S form exactly? To address this issue, we propose in this paper a new RPCA model based on three-dimensional correlated total variation regularization (3DCTV-RPCA for short) by fully exploiting and encoding the prior expression underlying such joint low-rank and local smoothness matrices. Specifically, using a modification of Golfing scheme, we prove that under some mild assumptions, the proposed 3DCTV-RPCA model can decompose both components exactly, which should be the first theoretical guarantee among all such related methods combining low rankness and local smoothness. In addition, by utilizing Fast Fourier Transform (FFT), we propose an efficient ADMM algorithm with a solid convergence guarantee for solving the resulting optimization problem. Finally, a series of experiments on both simulations and real applications are carried out to demonstrate the general validity of the proposed 3DCTV-RPCA model.
7 September 2015 in Soft Computing
24 January 2024 in IEEE Transactions on Geoscience and Remote Sensing
Fully characterizing the spatial-spectral priors of hyperspectral images (HSI) is crucial for HSI denoising tasks. Recently, HSI denoising models based on representative coefficient images (RCIs) under the spectral low-rank decomposition framework have garnered significant attention due to their clever utilization of spatial-spectral information in HSI at a low cost. However, current methods either employ handcrafted classical denoisers or off-the-shelf deep denoisers to denoise RCIs, failing to fully capture the structural information of RCIs. In this paper, we propose a specific optimization framework for learning an RCI denoiser under the low-rank decomposition framework for the first time. Since low-rank decomposition can characterize the global low-rank property of HSI, our RCI denoiser only needs to learn the spatial prior of RCIs. Consequently, our optimization framework is inclined to learn a more powerful RCI denoiser. However, learning an RCI denoiser is not an easy task, primarily due to the lack of paired clean-noisy RCI data. To address this issue, we employ parametric techniques to represent the to-be-restored HSI as a function of RCI denoiser network parameters. In this way, the parameters of the RCI denoiser can thus be updated using noisy-clean HSI pairs. Furthermore, we adopt residual learning and Gaussian whitening techniques to enhance the RCI denoiser’s denoising ability for HSIs with various noise levels and different rank settings. Extensive experiments demonstrate that our method can achieve significant improvements in both denoising effectiveness and speed compared to state-of-the-art methods. The code of our algorithm is released at https://github.com/andrew-pengjj/RCILD.git.
18 January 2024 in IEEE Transactions on Vehicular Technology
In order to break through the development bottleneck of modern wireless communication networks, a critical issue is the out-of-date channel state information (CSI) in high mobility scenarios. In general, non-stationary CSI has statistical properties which vary with time, implying that the data distribution changes continuously over time. This temporal distribution shift behavior undermines the accurate channel prediction and it is still an open problem in the related literature. In this paper, a hypernetwork based framework is proposed for non-stationary channel prediction. The framework aims to dynamically update the neural network (NN) parameters as the wireless channel changes to automatically adapt to various input CSI distributions. Based on this framework, we focus on low-complexity hypernetwork design and present a deep learning (DL) based channel prediction method, termed as LPCNet, which improves the CSI prediction accuracy with acceptable complexity. Moreover, to maximize the achievable downlink spectral efficiency (SE), a joint channel prediction and beamforming (BF) method is developed, termed as JLPCNet, which seeks to predict the BF vector. Our numerical results showcase the effectiveness and flexibility of the proposed framework, and demonstrate the superior performance of LPCNet and JLPCNet in various scenarios for fixed and varying user speeds.
20 August 2015 in International Journal of Machine Learning and Cybernetics
14 October 2021 in Mathematical Problems in Engineering
The cumulative sum (CUSUM) and the exponentially weighted moving average (EWMA) charts are renowned classical memory charts used to monitor small and moderate shifts in the process(s). Mixed memory charts like mixed EWMA-CUSUM (MEC) and mixed CUSUM-EWMA (MCE) are the advanced forms of classical memory charts used to identify shifts quickly in process parameters (location and/or dispersion). Similarly, the homogeneously weighted moving average (HWMA) chart is used for improved process monitoring. It will be worthwhile to combine the HWMA chart features with the existing mixed memory (MCE and MEC) charts to enhance the effectiveness of the mixed memory charts. Therefore, we proposed new charts: mixed HWMA-homogeneously CUSUM (MHWHC) and mixed homogeneously CUSUM-HWMA (MHCHW) charts. The Monte Carlo simulations are used to evaluate the proposed charts’ effectiveness. The average run length (ARL) is utilized to compare the proposed MHWHC and MHCHW charts’ performance with existing charts such as classical CUSUM and EWMA, MEC, MCE, and HWMA charts. The comparison revealed that the proposed mixed charts are superior to the existing counterparts, specifically monitoring small and moderate shifts. Finally, a real-life application using the manufacturing process’s data set is also provided from a practical point of view.