Group-based Sparse Representation for Image Compressive Sensing Reconstruction with Non-Convex Regularization
원문 초록
Patch-based sparse representation modeling has shown great potential in image compressive sensing (CS) reconstruction. However, this model usually suffers from some limits, such as dictionary learning with great computational complexity, neglecting the relationship among similar patches. In this paper, a group-based sparse representation method with non-convex regularization (GSR-NCR) for image CS reconstruction is proposed. In GSR-NCR, the local sparsity and nonlocal self-similarity of images is simultaneously considered in a unified framework. Different from the previous methods based on sparsity-promoting convex regularization, we extend the non-convex weighted Lp (0 < p < 1) penalty function on group sparse coefficients of the data matrix, rather than conventional L1-based regularization. To reduce the computational complexity, instead of learning the dictionary with a high computational complexity from natural images, we learn the principle component analysis (PCA) based dictionary for each group. Moreover, to make the proposed scheme tractable and robust, we have developed an efficient iterative shrinkage/thresholding algorithm to solve the non-convex optimization problem. Experimental results demonstrate that the proposed method outperforms many state-of-the-art techniques for image CS reconstruction.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
Sparse Models for Machine Learning
Learning a Common Dictionary for CSI Feedback in FDD Massive MU-MIMO-OFDM Systems
A Targeted Sampling Strategy for Compressive Cryo Focused Ion Beam Scanning Electron Microscopy
Hybrid mmWave MIMO Systems under Hardware Impairments and Beam Squint: Channel Model and Dictionary Learning-aided Configuration
Unitary Approximate Message Passing for Matrix Factorization
Decomposing MLP Activations into Interpretable Features via Semi-Nonnegative Matrix Factorization
토론
이 논문과 연결된 포럼 글이 아직 없습니다.