The DOI matches its Crossref record; 23 of the 23 references it cites were found in a registry or an index.
Compression of facial images using the K-SVD algorithm
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
$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
Self-citationMatching 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
Vector Quantization and Signal Compression
Gersho, A., & Gray, R. M. (1992) · Springer eBooks · doi:10.1007/978-1-4615-3626-0 · Cited by 7,003
The Laplacian pyramid as a compact image code
Burt, P., & Adelson, E. (1983) · IEEE Transactions on Communications · doi:10.1109/tcom.1983.1095851 · Cited by 6,077
Image Denoising Via Sparse and Redundant Representations Over Learned Dictionaries
Elad, M., & Aharon, M. (2006) · IEEE Transactions on Image Processing · doi:10.1109/tip.2006.881969 · Cited by 5,321
Self-citationAtomic Decomposition by Basis Pursuit
Chen, S. S., Donoho, D. L., & Saunders, M. A. (2001) · SIAM Review · doi:10.1137/s003614450037906x · Cited by 5,085
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
Greed is Good: Algorithmic Results for Sparse Approximation
Tropp, J. A. (2004) · IEEE Transactions on Information Theory · doi:10.1109/tit.2004.834793 · Cited by 3,635
JPEG2000: Image Compression Fundamentals, Standards and Practice
Taubman, D. S. (2002) · Journal of Electronic Imaging · doi:10.1117/1.1469618 · Cited by 3,159
Cited by
Discriminative K-SVD for dictionary learning in face recognition
Zhang, Q., & Li, B. (2010) · 2010 IEEE Computer Society Conference on Computer Vision and Pattern Recognition · doi:10.1109/cvpr.2010.5539989 · Cited by 1,237
Fisher Discrimination Dictionary Learning for sparse representation
Yang, M., Zhang, L., Feng, X., & Zhang, D. (2011) · 2011 International Conference on Computer Vision · doi:10.1109/iccv.2011.6126286 · Cited by 934
Double Sparsity: Learning Sparse Dictionaries for Sparse Signal Approximation
Rubinstein, R., Zibulevsky, M., & Elad, M. (2010) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2009.2036477 · Cited by 616
Self-citationSparse Representation Based Fisher Discrimination Dictionary Learning for Image Classification
Yang, M., Zhang, L., Feng, X., & Zhang, D. (2014) · International Journal of Computer Vision · doi:10.1007/s11263-014-0722-8 · Cited by 489
Pixel-level image fusion with simultaneous orthogonal matching pursuit
Yang, B., & Li, S. (2012) · Information Fusion · doi:10.1016/j.inffus.2010.04.001 · Cited by 377
Metadata
- Authors
- Bryt, O., & Elad, M.
- Venue
- Journal of Visual Communication and Image Representation
- Publisher
- Elsevier BV
- Published
- 2008-05
- Volume
- 19
- Issue
- 4
- Pages
- 270-282
- ISSN
- 1047-3203 (ISSN-L)
- OpenAlex
- W1972959470
- Cited by
- 311
- References
- 23
- FWCI
- 17.66
- 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: Compression of facial images using the K-SVD algorithm. https://app.cochat.ai/papers/10.1016/j.jvcir.2008.03.001
- The paper
- Bryt, O., & Elad, M. (2008). Compression of facial images using the K-SVD algorithm. Journal of Visual Communication and Image Representation. https://doi.org/10.1016/j.jvcir.2008.03.001
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.
