A Benchmark for Sparse Coding : When Group Sparsity Meets Rank Minimization
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 d...
Ausführliche Beschreibung
Bibliographische Detailangaben
| Veröffentlicht in: | IEEE transactions on image processing : a publication of the IEEE Signal Processing Society. - 1992. - (2020) vom: 10. März
|
|---|
| 1. Verfasser: |
Zha, Zhiyuan
(VerfasserIn) |
|---|
| Weitere Verfasser: |
Yuan, Xin,
Wen, Bihan,
Zhou, Jiantao,
Zhang, Jiachao,
Zhu, Ce |
|---|
| Format: | Online-Aufsatz
|
|---|
| Sprache: | English |
|---|
| Veröffentlicht: |
2020
|
|---|
| Zugriff auf das übergeordnete Werk: | IEEE transactions on image processing : a publication of the IEEE Signal Processing Society
|
|---|
| Schlagworte: | Journal Article |
|---|