2000 character limit reached
A Benchmark for Sparse Coding: When Group Sparsity Meets Rank Minimization
Published 12 Sep 2017 in cs.CV | (1709.03979v5)
Abstract: 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....
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.