The DOI matches its Crossref record; 2 of the 2 references it cites were found in a registry or an index.
Dictionary Learning for Sparse Approximations With the Majorization Method
Abstract
In order to find sparse approximations of signals, an appropriate generative model for the signal class has to be known. If the model is unknown, it can be adapted using a set of training samples. This paper presents a novel method for dictionary learning and extends the learning problem by introducing different constraints on the dictionary. The convergence of the proposed method to a fixed point is guaranteed, unless the accumulation points form a continuum. This holds for different sparsity measures. The majorization method is an optimization method that substitutes the original objective function with a surrogate function that is updated in each optimization step. This method has been used successfully in sparse approximation and statistical estimation [ e.g., expectation-maximization (EM)] problems. This paper shows that the majorization method can be used for the dictionary learning problem too. The proposed method is compared with other methods on both synthetic and real data and different constraints on the dictionary are compared. Simulations show the advantages of the proposed method over other currently available dictionary learning methods not only in terms of average performance but also in terms of computation time.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Daubechies, I. (1992) · doi:10.1137/1.9781611970104 · Cited by 15,979
Sparse coding with an overcomplete basis set: A strategy employed by V1?
Olshausen, B. A., & Field, D. J. (1997) · Vision Research · doi:10.1016/s0042-6989(97)00169-7 · Cited by 3,642
Cited by
Majorization-Minimization Algorithms in Signal Processing, Communications, and Machine Learning
Sun, Y., Babu, P., & Palomar, D. P. (2017) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2016.2601299 · Cited by 1,820
MR Image Reconstruction From Highly Undersampled k-Space Data by Dictionary Learning
Ravishankar, S., & Bresler, Y. (2011) · IEEE Transactions on Medical Imaging · doi:10.1109/tmi.2010.2090538 · Cited by 1,059
Tosic, I., & Frossard, P. (2011) · IEEE Signal Processing Magazine · doi:10.1109/msp.2010.939537 · Cited by 897
Recursive Least Squares Dictionary Learning Algorithm
Skretting, K., & Engan, K. (2010) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2010.2040671 · Cited by 387
Learning Sparsifying Transforms
Ravishankar, S., & Bresler, Y. (2013) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2012.2226449 · Cited by 344
Metadata
- Authors
- Yaghoobi, M., Blumensath, T., & Davies, M. E.
- Venue
- IEEE Transactions on Signal Processing
- Published
- 2009-06
- Volume
- 57
- Issue
- 6
- Pages
- 2178-2191
- ISSN
- 1053-587X (ISSN-L)
- 1941-0476
- OpenAlex
- W2126534699
- Cited by
- 213
- References
- 2
- FWCI
- 13.83
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Dictionary Learning for Sparse Approximations With the Majorization Method. https://app.cochat.ai/papers/10.1109/tsp.2009.2016257
- The paper
- Yaghoobi, M., Blumensath, T., & Davies, M. E. (2009). Dictionary Learning for Sparse Approximations With the Majorization Method. IEEE Transactions on Signal Processing. https://doi.org/10.1109/tsp.2009.2016257
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.