mlsanityData to 7 Oct 2026

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

arXiv 1709.03979 ↗First posted 12 Sep 2017cs.CVcited by 10

Not on the map. Why?

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....

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

Builds on

No reference list yet.

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2021: 2; 2022: 0; 2023: 2; 2024: 3; 2025: 2; 2026: 1.

10 papers.