A Benchmark for Sparse Coding: When Group Sparsity Meets Rank Minimization
2017-09-12Unverified0· sign in to hype
Zhiyuan Zha, Xin Yuan, Bihan Wen, Jiantao Zhou, Jiachao Zhang, Ce Zhu
Unverified — Be the first to reproduce this paper.
ReproduceAbstract
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....