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

arXiv: https://arxiv.org/abs/1709.03979 · HTML: https://mlsanity.com/paper/1709.03979/

## Key facts

- Cited by 10 papers in the map (data through 14 Oct 2026).
- First posted on arXiv 12 Sep 2017.

## Built on by (most cited first, 10 of 10)

- [Plug-and-Play Algorithms for Video Snapshot Compressive Imaging](https://mlsanity.com/paper/2101.04822/) (2021)
- [Dual-Scale Transformer for Large-Scale Single-Pixel Imaging](https://mlsanity.com/paper/2404.05001/) (2024)
- [Image super-resolution via dynamic network](https://mlsanity.com/paper/2310.10413/) (2023)
- [Label Learning Method Based on Tensor Projection](https://mlsanity.com/paper/2402.16544/) (2024)
- [Multi-View Clustering via Semi-non-negative Tensor Factorization](https://mlsanity.com/paper/2303.16748/) (2023)
- [Robust Low-Rank Tensor Completion based on M-product with Weighted Correlated Total Variation and Sparse Regularization](https://mlsanity.com/paper/2604.13525/) (2026)
- [Snapshot Compressive Imaging: Principle, Implementation, Theory, Algorithms and Applications](https://mlsanity.com/paper/2103.04421/) (2021)
- [One-Step Multi-View Clustering Based on Transition Probability](https://mlsanity.com/paper/2403.01460/) (2024)
- [Triply Laplacian Scale Mixture Modeling for Seismic Data Noise Suppression](https://mlsanity.com/paper/2502.14355/) (2025)
- [Physics-guided Deep Unfolding Network for Enhanced Kronecker Compressive sensing](https://mlsanity.com/paper/2508.09528/) (2025)

## Abstract (arXiv)

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. More details please see the manuscript....