$\ell_1$-K-SVD: A Robust Dictionary Learning Algorithm With Simultaneous Update
Subhadip Mukherjee, Rupam Basu, and Chandra Sekhar Seelamantula

TL;DR
The paper introduces $ abla$-K-SVD, a dictionary learning algorithm that minimizes the $ abla$-norm for robustness against non-Gaussian noise, updating dictionary atoms and sparse coefficients simultaneously.
Contribution
It proposes a novel $ abla$-K-SVD algorithm that enhances noise robustness and improves atom recovery in small training sets compared to existing methods.
Findings
Higher atom recovery rate than K-SVD and RDL in Gaussian and non-Gaussian noise.
Outperforms K-SVD and RDL with small training datasets.
Achieves better denoising performance, especially in structural similarity for Laplacian noise.
Abstract
We develop a dictionary learning algorithm by minimizing the distortion metric on the data term, which is known to be robust for non-Gaussian noise contamination. The proposed algorithm exploits the idea of iterative minimization of weighted error. We refer to this algorithm as -K-SVD, where the dictionary atoms and the corresponding sparse coefficients are simultaneously updated to minimize the objective, resulting in noise-robustness. We demonstrate through experiments that the -K-SVD algorithm results in higher atom recovery rate compared with the K-SVD and the robust dictionary learning (RDL) algorithm proposed by Lu et al., both in Gaussian and non-Gaussian noise conditions. We also show that, for fixed values of sparsity, number of dictionary atoms, and data-dimension, the -K-SVD algorithm outperforms the K-SVD and RDL algorithms…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsText and Document Classification Technologies · Video Analysis and Summarization
