Papers › Accurate Dictionary Learning with Direct Sparsity Control

Accurate Dictionary Learning with Direct Sparsity Control

1 Oct 2018ICIP 2018 10archive 2025-07-28

Hongyu Mou, Adrian Barbu

Dictionary learning is a popular method for obtaining sparse linear representations for high dimensional data, with many applications in image classification, signal processing and machine learning. In this paper, we introduce a novel dictionary learning method based on a recent variable selection algorithm called Feature Selection with Annealing (FSA). Because FSA uses an L0 constraint instead of the L1 penalty, it does not introduce any bias in the coefficients and obtains a more accurate sparse representation. Furthermore, the L0 constraint makes it easy to directly specify the desired sparsity level instead of indirectly through a L1 penalty. Finally, experimental validation on real gray-scale images shows that the proposed method obtains higher accuracy and efficiency in dictionary learning compared to classical methods based on the L1 penalty.

PaperPDFCode

Code

Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.

Code Syntology ran Syntology

Not run by Syntology. Nothing on this page verifies that the listed code works.

Tasks

Dictionary LearningImage ClassificationVariable Selectionfeature selectionimage-classification

Results from the paper archive 2025-07-28

No leaderboard rows for this paper in the archive.

Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections