A Benchmark for Sparse Coding: When Group Sparsity Meets Rank Minimization

@article{Zha2020ABF,
  title={A Benchmark for Sparse Coding: When Group Sparsity Meets Rank Minimization},
  author={Zhiyuan Zha and Xin Yuan and Bihan Wen and Jiantao Zhou and Jiachao Zhang and Ce Zhu},
  journal={IEEE Transactions on Image Processing},
  year={2020},
  volume={29},
  pages={5094-5109}
}
  • Zhiyuan Zha, Xin Yuan, +3 authors Ce Zhu
  • Published 2020
  • Medicine, Computer Science, Mathematics
  • IEEE Transactions on Image Processing
Sparse coding has achieved a great success in various image processing tasks. However, a benchmark to measure the sparsity of image patch/group is missing since sparse coding is essentially an NP-hard problem. This work attempts to fill the gap from the perspective of rank minimization. We firstly design an adaptive dictionary to bridge the gap between group-based sparse coding (GSC) and rank minimization. Then, we show that under the designed dictionary, GSC and the rank minimization problems… Expand
Image Restoration via Reconciliation of Group Sparsity and Low-Rank Models
TLDR
This paper proposes a novel NSS-based sparsity model, namely, low-rank regularized group sparse coding (LR-GSC), to bridge the gap between the popular GSC and JS and demonstrates that the proposed LR-G SC algorithm outperforms many popular or state-of-the-art methods in terms of objective and perceptual metrics. Expand
Group Sparsity Residual Constraint With Non-Local Priors for Image Restoration
TLDR
Experimental results on image denoising, image inpainting and image compressive sensing recovery, demonstrate that the proposed GSRC-NLP based image restoration algorithm is comparable to state-of-the-art Denoising methods and outperforms several testing image in painting and image CS recovery methods in terms of both objective and perceptual quality metrics. Expand
Single image restoration through ℓ2-relaxed truncated ℓ0 analysis-based sparse optimization in tight frames
TLDR
A novel tight frame-based l 2 -relaxed truncated truncated l 0 analysis-sparsity model that simultaneously exploiting the sparsity and support priors is proposed that outperforms several state-of-the-art methods in both objective and perceptual quality. Expand
Image Restoration Using Joint Patch-Group-Based Sparse Representation
TLDR
Compared with existing sparse representation models, the proposed JPG-SR provides an effective mechanism to integrate the local sparsity and nonlocal self-similarity of images and outperforms many state-of-the-art methods in both objective and perceptual quality. Expand
A Set-Theoretic Study of the Relationships of Image Models and Priors for Restoration Problems
TLDR
This paper presents a theoretical analysis on the image models, to bridge the gap between applications and image prior understanding, including sparsity, group-wiseSparsity, joint sparsity and low-rankness, etc, and quantitatively demonstrates the image properties that are inexplicitly exploited by deep learning method. Expand
The Power Of Triply Complementary Priors For Image Compressive Sensing
TLDR
A joint low-rank and deep (LRD) image model, which contains a pair of triply complementary priors, namely external and internal, deep and shallow, and local and nonlocal priors is proposed, which is a novel hybrid plug-and-play (H-PnP) framework based on the LRD model for image CS. Expand
Fast & Robust Image Interpolation Using Gradient Graph Laplacian Regularizer
In the graph signal processing (GSP) literature, it has been shown that signal-dependent graph Laplacian regularizer (GLR) can efficiently promote piecewise constant (PWC) signal reconstruction forExpand
Triply Complementary Priors for Image Restoration
TLDR
Extensive experimental results demonstrate that the proposed H-PnP algorithm achieves favorable performance compared to many popular or state-of-the-art IR methods in terms of both objective and visual perception. Expand
Image Restoration via Simultaneous Nonlocal Self-Similarity Priors
TLDR
Experimental results on three image restoration applications demonstrate that the proposed SNSS produces superior results compared to many popular or state-of-the-art methods in both objective and perceptual quality measurements. Expand
Snapshot Compressive Imaging: Theory, Algorithms, and Applications
TLDR
Recent advances in SCI hardware, theory, and algorithms are reviewed, including both optimizationbased and deep learning-based algorithms. Expand
...
1
2
...

References

SHOWING 1-10 OF 103 REFERENCES
Analyzing the group sparsity based on the rank minimization methods
TLDR
It is proved that group-based sparse coding is equivalent to the rank minimization problem, and thus the sparse coefficients of each group are measured by estimating the singular values of each groups. Expand
Group-Based Sparse Representation for Image Restoration
TLDR
The proposed group-based sparse representation (GSR) is able to sparsely represent natural images in the domain of group, which enforces the intrinsic local sparsity and nonlocal self-similarity of images simultaneously in a unified framework. Expand
Group-Sparse Representation With Dictionary Learning for Medical Image Denoising and Fusion
TLDR
A novel dictionary learning method, called Dictionary Learning with Group Sparsity and Graph Regularization (DL-GSGR), where the geometrical structure of atoms is modeled as the graph regularization and the group coherence of learned dictionary can be enforced small enough such that any signal can be group sparse coded effectively. Expand
Structural Group Sparse Representation for Image Compressive Sensing Recovery
TLDR
This paper proposes a new framework for image compressive sensing recovery via structural group sparse representation (SGSR) modeling, which enforces image sparsity and self-similarity simultaneously under a unified framework in an adaptive group domain, thus greatly confining the CS solution space. Expand
$rm K$-SVD: An Algorithm for Designing Overcomplete Dictionaries for Sparse Representation
TLDR
A novel algorithm for adapting dictionaries in order to achieve sparse signal representations, the K-SVD algorithm, an iterative method that alternates between sparse coding of the examples based on the current dictionary and a process of updating the dictionary atoms to better fit the data. Expand
Structured Overcomplete Sparsifying Transform Learning with Convergence Guarantees and Applications
TLDR
The promising performance of the proposed approach in image denoising is shown, which compares quite favorably with approaches involving a single learned square transform or an overcomplete synthesis dictionary, or gaussian mixture models. Expand
Enhancing Sparsity by Reweighted ℓ1 Minimization
TLDR
A novel method for sparse signal recovery that in many situations outperforms ℓ1 minimization in the sense that substantially fewer measurements are needed for exact recovery. Expand
Image reconstruction with locally adaptive sparsity and nonlocal robust regularization
TLDR
Two sets of complementary ideas for regularizing image reconstruction process are proposed: the sparsity regularization parameters are locally estimated for each coefficient and updated along with adaptive learning of PCA-based dictionaries; a nonlocal self-similarity constraint is introduced into the overall cost functional to improve the robustness of the model. Expand
Partial Sum Minimization of Singular Values in Robust PCA: Algorithm and Applications
TLDR
Instead of minimizing the nuclear norm, this paper proposes to minimize the partial sum of singular values, which implicitly encourages the target rank constraint, and shows that its results outperform those obtained by the conventional nuclear norm rank minimization method. Expand
Fast and Accurate Matrix Completion via Truncated Nuclear Norm Regularization
TLDR
This paper proposes to achieve a better approximation to the rank of matrix by truncated nuclear norm, which is given by the nuclear norm subtracted by the sum of the largest few singular values, and develops a novel matrix completion algorithm by minimizing the Truncated Nuclear Norm. Expand
...
1
2
3
4
5
...