Quality Versus Sparsity in Image Recovery by Dictionary Learning Using Iterative Shrinkage
Fuente:
arXiv
Enregistré dans:
| Auteurs principaux: | , , , |
|---|---|
| Format: | Preprint |
| Publié: |
2025
|
| Sujets: | |
| Accès en ligne: | |
| Tags: |
Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
|
| _version_ | 1866909723628929024 |
|---|---|
| author | Khoshghiaferezaee, Mohammadsadegh Krauth, Moritz Shabani, Shima Breuß, Michael |
| author_facet | Khoshghiaferezaee, Mohammadsadegh Krauth, Moritz Shabani, Shima Breuß, Michael |
| contents | Sparse dictionary learning (SDL) is a fundamental technique that is useful for many image processing tasks. As an example we consider here image recovery, where SDL can be cast as a nonsmooth optimization problem. For this kind of problems, iterative shrinkage methods represent a powerful class of algorithms that are subject of ongoing research. Sparsity is an important property of the learned solutions, as exactly the sparsity enables efficient further processing or storage. The sparsity implies that a recovered image is determined as a combination of a number of dictionary elements that is as low as possible. Therefore, the question arises, to which degree sparsity should be enforced in SDL in order to not compromise recovery quality. In this paper we focus on the sparsity of solutions that can be obtained using a variety of optimization methods. It turns out that there are different sparsity regimes depending on the method in use. Furthermore, we illustrate that high sparsity does in general not compromise recovery quality, even if the recovered image is quite different from the learning database. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2508_03492 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Quality Versus Sparsity in Image Recovery by Dictionary Learning Using Iterative Shrinkage Khoshghiaferezaee, Mohammadsadegh Krauth, Moritz Shabani, Shima Breuß, Michael Computer Vision and Pattern Recognition 65K05, 68T30 I.4.5; I.2.6 Sparse dictionary learning (SDL) is a fundamental technique that is useful for many image processing tasks. As an example we consider here image recovery, where SDL can be cast as a nonsmooth optimization problem. For this kind of problems, iterative shrinkage methods represent a powerful class of algorithms that are subject of ongoing research. Sparsity is an important property of the learned solutions, as exactly the sparsity enables efficient further processing or storage. The sparsity implies that a recovered image is determined as a combination of a number of dictionary elements that is as low as possible. Therefore, the question arises, to which degree sparsity should be enforced in SDL in order to not compromise recovery quality. In this paper we focus on the sparsity of solutions that can be obtained using a variety of optimization methods. It turns out that there are different sparsity regimes depending on the method in use. Furthermore, we illustrate that high sparsity does in general not compromise recovery quality, even if the recovered image is quite different from the learning database. |
| title | Quality Versus Sparsity in Image Recovery by Dictionary Learning Using Iterative Shrinkage |
| topic | Computer Vision and Pattern Recognition 65K05, 68T30 I.4.5; I.2.6 |
| url | https://arxiv.org/abs/2508.03492 |