The DOI matches its Crossref record; 26 of the 26 references it cites were found in a registry or an index.
Recursive Least Squares Dictionary Learning Algorithm
Abstract
We present the recursive least squares dictionary learning algorithm, RLS-DLA, which can be used for learning overcomplete dictionaries for sparse signal representation. Most DLAs presented earlier, for example ILS-DLA and K-SVD, update the dictionary after a batch of training vectors has been processed, usually using the whole set of training vectors as one batch. The training set is used iteratively to gradually improve the dictionary. The approach in RLS-DLA is a continuous update of the dictionary as each training vector is being processed. The core of the algorithm is compact and can be effectively implemented. The algorithm is derived very much along the same path as the recursive least squares (RLS) algorithm for adaptive filtering. Thus, as in RLS, a forgetting factor ¿ can be introduced and easily implemented in the algorithm. Adjusting ¿ in an appropriate way makes the algorithm less dependent on the initial dictionary and it improves both convergence properties of RLS-DLA as well as the representation ability of the resulting dictionary. Two sets of experiments are done to test different methods for learning dictionaries. The goal of the first set is to explore some basic properties of the algorithm in a simple setup, and for the second set it is the reconstruction of a true underlying dictionary. The first experiment confirms the conjectural properties from the derivation part, while the second demonstrates excellent performance.
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
(1967) · Cited by 23,719
Daubechies, I. (1992) · doi:10.1137/1.9781611970104 · Cited by 15,979
Least squares quantization in PCM
Lloyd, S. (1982) · IEEE Transactions on Information Theory · doi:10.1109/tit.1982.1056489 · Cited by 15,836
Daubechies, I., & Heil, C. (1992) · Computers in Physics · doi:10.1063/1.4823127 · Cited by 15,631
Advances in neural information processing systems 7
(1996) · Computers & Mathematics with Applications · doi:10.1016/s0898-1221(96)90463-0 · Cited by 14,281
$rm K$-SVD: An Algorithm for Designing Overcomplete Dictionaries for Sparse Representation
Aharon, M., Elad, M., & Bruckstein, A. (2006) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2006.881199 · Cited by 9,451
Matching pursuits with time-frequency dictionaries
Mallat, S. G., & Zhang, Z. (1993) · IEEE Transactions on Signal Processing · doi:10.1109/78.258082 · Cited by 9,112
An Algorithm for Vector Quantizer Design
Linde, Y., Buzo, A., & Gray, R. (1980) · IEEE Transactions on Communications · doi:10.1109/tcom.1980.1094577 · Cited by 7,201
Pati, Y. C., Rezaiifar, R., & Krishnaprasad, P. S. (2002) · Proceedings of 27th Asilomar Conference on Signals, Systems and Computers · doi:10.1109/acssc.1993.342465 · Cited by 4,323
Algorithms for the Assignment and Transportation Problems
Munkres, J. (1957) · Journal of the Society for Industrial and Applied Mathematics · doi:10.1137/0105003 · Cited by 3,986
Cited by
Dictionaries for Sparse Representation Modeling
Rubinstein, R., Bruckstein, A. M., & Elad, M. (2010) · Proceedings of the IEEE · doi:10.1109/jproc.2010.2040551 · Cited by 1,306
The cosparse analysis model and algorithms
Nam, S., Davies, M. E., Elad, M., & Gribonval, R. (2013) · Applied and Computational Harmonic Analysis · doi:10.1016/j.acha.2012.03.006 · Cited by 353
Learning Sparsifying Transforms
Ravishankar, S., & Bresler, Y. (2013) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2012.2226449 · Cited by 344
Sparse Modeling for Image and Vision Processing
Mairal, J. (2014) · now publishers, Inc. eBooks · doi:10.1561/9781680830095 · Cited by 322
Data-Driven-Aided Linear Three-Phase Power Flow Model for Distribution Power Systems
Liu, Y., Li, Z., & Zhou, Y. (2022) · IEEE Transactions on Power Systems · doi:10.1109/tpwrs.2021.3130301 · Cited by 57
Metadata
- Authors
- Skretting, K., & Engan, K.
- Venue
- IEEE Transactions on Signal Processing
- Published
- 2010-04
- Volume
- 58
- Issue
- 4
- Pages
- 2121-2130
- ISSN
- 1053-587X (ISSN-L)
- OpenAlex
- W2167188281
- Cited by
- 387
- References
- 26
- FWCI
- 17.05
- 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: Recursive Least Squares Dictionary Learning Algorithm. https://app.cochat.ai/papers/10.1109/tsp.2010.2040671
- The paper
- Skretting, K., & Engan, K. (2010). Recursive Least Squares Dictionary Learning Algorithm. IEEE Transactions on Signal Processing. https://doi.org/10.1109/tsp.2010.2040671
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.