A Benchmark for Sparse Coding When Group Sparsity Meets Rank Minimization
Abstract: Sparse coding excels in image processing. Since sparse coding is NP-hard, there is no image patch/group sparsity benchmark. This rank minimization-based work fills the gap. We first design an adaptive dictionary to bridge group-based…