.png){kind=icon}
返回
A Benchmark for Sparse Coding: When Group Sparsity Meets Rank Minimization
.png){kind=icon}
OA
AI
DOI：10.1109/TIP.2020.2972109.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
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. We firstly design an adaptive dictionary to bridge the gap between group-based sparse coding (GSC) and rank minimization. Then, we show that under the designed dictionary, GSC and the rank minimization problems are equivalent, and therefore the sparse coefficients of each patch group can be measured by estimating the singular values of each patch group. We thus earn a benchmark to measure the sparsity of each patch group because the singular values of the original image patch groups can be easily computed by the singular value decomposition (SVD). This benchmark can be used to evaluate performance of any kind of norm minimization methods in sparse coding through analyzing their corresponding rank minimization counterparts. Towards this end, we exploit four well-known rank minimization methods to study the sparsity of each patch group and the weighted Schatten $p$ -norm minimization (WSNM) is found to be the closest one to the real singular values of each patch group. Inspired by the aforementioned equivalence regime of rank minimization and GSC, WSNM can be translated into a non-convex weighted -norm minimization problem in GSC. By using the earned benchmark in sparse coding, the weighted -norm minimization is expected to obtain better performance than the three other norm minimization methods, i.e., -norm, -norm and weighted -norm. To verify the feasibility of the proposed benchmark, we compare the weighted -norm minimization against the three aforementioned norm minimization methods in sparse coding. Experimental results on image restoration applications, namely image inpainting and image compressive sensing recovery, demonstrate that the proposed scheme is feasible and outperforms many state-of-the-art methods.
Keyword:
Sparse coding
GSC
rank minimization
adaptive dictionary
weighted l(p)-norm minimization
image restoration
compressive sensing
nuclear norm.
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
13.7
论文数:
1.0W
被引数:
8.4W
机构
引用论文
.png){kind=icon}
Presenting Concerns of Veterans Entering Treatment for Posttraumatic Stress Disorder提出退伍军人进入创伤后应激障碍治疗的担忧
PREAI
分享收藏A micromachined efficient parametric array loudspeaker with a wide radiation frequency band具有宽辐射频带的微机械高效参量阵列扬声器
PREAI
分享收藏
查看更多内容