Compression of facial images using the K-SVD algorithm
The DOI matches its Crossref record; 23 of the 23 references it cites were found in a registry or an index.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
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 · cited 1×
“This method can be applied on a Laplacian pyramid of the original (warped) image with several scales [33].”
MethodImage 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
Optimally sparse representation in general (nonorthogonal) dictionaries via ℓ 1 minimization
Donoho, D. L., & Elad, M. (2003) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.0437847100 · Cited by 2,898
Self-citationStable recovery of sparse overcomplete representations in the presence of noise
Donoho, D. L., Elad, M., & Temlyakov, V. N. (2006) · IEEE Transactions on Information Theory · doi:10.1109/tit.2005.860430 · Cited by 2,183
Self-citationUncertainty principles and ideal atomic decomposition
Donoho, D. L., & Huo, X. (2001) · IEEE Transactions on Information Theory · doi:10.1109/18.959265 · Cited by 1,949
Sparse signal reconstruction from limited data using FOCUSS: a re-weighted minimum norm algorithm
Gorodnitsky, I. F., & Rao, B. D. (1997) · IEEE Transactions on Signal Processing · doi:10.1109/78.558475 · Cited by 1,834
Just relax: convex programming methods for identifying sparse signals in noise
Tropp, J. A. (2006) · IEEE Transactions on Information Theory · doi:10.1109/tit.2005.864420 · Cited by 1,407
Automatic interpretation and coding of face images using flexible models
Lanitis, A., Taylor, C. J., & Cootes, T. F. (1997) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/34.598231 · Cited by 625
On the uniqueness of overcomplete dictionaries, and a practical way to retrieve them
Aharon, M., Elad, M., & Bruckstein, A. M. (2006) · Linear Algebra and its Applications · doi:10.1016/j.laa.2005.06.035 · Cited by 194
Self-citationLinear image coding for regression and classification using the tensor-rank principle
Shashua, A., & Levin, A. (2005) · Proceedings of the 2001 IEEE Computer Society Conference on Computer Vision and Pattern Recognition. CVPR 2001 · doi:10.1109/cvpr.2001.990454 · Cited by 193
Vector quantization of image subbands: a survey
Cosman, P. C., Gray, R. M., & Vetterli, M. (1996) · IEEE Transactions on Image Processing · doi:10.1109/83.480760 · Cited by 178
Sparse image coding using a 3D non-negative tensor factorization
Hazan, T., Polak, S., & Shashua, A. (2005) · Tenth IEEE International Conference on Computer Vision (ICCV'05) Volume 1 · doi:10.1109/iccv.2005.228 · Cited by 170
Low Bit-Rate Compression of Facial Images
Elad, M., Goldenberg, R., & Kimmel, R. (2007) · IEEE Transactions on Image Processing · doi:10.1109/tip.2007.903259 · Cited by 54
Self-citationImage compression using an edge adapted redundant dictionary and wavelets
Peotta, L., Granai, L., & Vandergheynst, P. (2005) · Signal Processing · doi:10.1016/j.sigpro.2005.05.023 · Cited by 41
A Region-Based Scheme Using RKLT and Predictive Classified Vector Quantization
Sakalli, M., Yan, H., & Fu, A. M. N. (1999) · Computer Vision and Image Understanding · doi:10.1006/cviu.1999.0776 · Cited by 8
Cited by
From Sparse Solutions of Systems of Equations to Sparse Modeling of Signals and Images
Bruckstein, A. M., Donoho, D. L., & Elad, M. (2009) · SIAM Review · doi:10.1137/060657704 · Cited by 2,183
Self-citationSparse Representation for Computer Vision and Pattern Recognition
Wright, J., Ma, Y., Mairal, J., Sapiro, G., Huang, T. S., & Yan, S. (2010) · Proceedings of the IEEE · doi:10.1109/jproc.2010.2044470 · Cited by 1,847
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
A Survey of Sparse Representation: Algorithms and Applications
Zhang, Z., Xu, Y., Yang, J., Li, X., & Zhang, D. (2015) · IEEE Access · doi:10.1109/access.2015.2430359 · Cited by 1,092
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
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
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.