The DOI matches its Crossref record; 14 of the 14 references it cites were found in a registry or an index.
Optimized orthogonal matching pursuit approach
Open accessAbstract
An adaptive procedure for signal representation is proposed. The representation is built up through functions (atoms) selected from a redundant family (dictionary). At each iteration, the algorithm gives rise to an approximation of a given signal, which is guaranteed (1) to be the orthogonal projection of a signal onto the subspace generated by the selected atoms and (2) to minimize the norm of the corresponding residual error. The approach is termed optimized orthogonal matching pursuit because it improves upon the earlier proposed matching pursuit and orthogonal matching pursuit approaches.
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
Daubechies, I., & Heil, C. (1992) · Computers in Physics · doi:10.1063/1.4823127 · Cited by 15,631
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
Atomic Decomposition by Basis Pursuit
Chen, S. S., Donoho, D. L., & Saunders, M. A. (1998) · SIAM Journal on Scientific Computing · doi:10.1137/s1064827596304010 · Cited by 6,845
The wavelet transform, time-frequency localization and signal analysis
Daubechies, I. (1990) · IEEE Transactions on Information Theory · doi:10.1109/18.57199 · Cited by 6,483
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
Orthogonal least squares learning algorithm for radial basis function networks
Chen, S., Cowan, C. F. N., & Grant, P. M. (1991) · IEEE Transactions on Neural Networks · doi:10.1109/72.80341 · Cited by 3,362
Entropy-based algorithms for best basis selection
Coifman, R. R., & Wickerhauser, M. V. (1992) · IEEE Transactions on Information Theory · doi:10.1109/18.119732 · Cited by 3,188
A class of nonharmonic Fourier series
Duffin, R. J., & Schaeffer, A. C. (1952) · Transactions of the American Mathematical Society · doi:10.1090/s0002-9947-1952-0047179-6 · Cited by 2,277
An introduction to non-harmonic Fourier series
Young, R. M. (1980) · Cited by 1,424
Cited by
Spatially Sparse Precoding in Millimeter Wave MIMO Systems
Ayach, O. E., Rajagopal, S., Abu-Surra, S., Pi, Z., & Heath, R. W. (2014) · IEEE Transactions on Wireless Communications · doi:10.1109/twc.2014.011714.130846 · Cited by 3,557
Analysis K-SVD: A Dictionary-Learning Algorithm for the Analysis Sparse Model
Rubinstein, R., Peleg, T., & Elad, M. (2013) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2012.2226445 · Cited by 471
Sparse Coding via Thresholding and Local Competition in Neural Circuits
Rozell, C. J., Johnson, D. H., Baraniuk, R. G., & Olshausen, B. A. (2008) · Neural Computation · doi:10.1162/neco.2008.03-07-486 · Cited by 456
Metadata
- Authors
- Rebollo-Neira, L., & Lowe, D.
- Venue
- IEEE Signal Processing Letters
- Published
- 2002-04
- Volume
- 9
- Issue
- 4
- Pages
- 137-140
- ISSN
- 1070-9908 (ISSN-L)
- 1558-2361
- OpenAlex
- W2065829287
- Cited by
- 293
- References
- 14
- FWCI
- 3.31
- Type
- journal article
- Language
- en
- Open access
- green
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: Optimized orthogonal matching pursuit approach. https://app.cochat.ai/papers/10.1109/lsp.2002.1001652
- The paper
- Rebollo-Neira, L., & Lowe, D. (2002). Optimized orthogonal matching pursuit approach. IEEE Signal Processing Letters. https://doi.org/10.1109/lsp.2002.1001652
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.