The DOI matches its Crossref record.
Singular Value Decomposition (SVD) Image Coding
Abstract
The numerical techniques of transform image coding are well known in the image bandwidth compression literature. This concise paper presents a new transform method in which the singular values and singular vectors of an image are computed and transmitted instead of transform coefficients. The singular value decomposition (SVD) method is known to be the deterministically optimal transform for energy compaction [2]. A systems implementation is hypothesized, and a variety of coding strategies is developed. Statistical properties of the SVD are discussed and a self adaptive set of experimental results is presented, Imagery compressed to 1, 1.5, and 2.5 bits per pixel with less than 1.6, 1, and 1/3 percent, respective mean-square error is displayed. Finally, additional image coding scenarios are postulated for further consideration.
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
Cited by
Guaranteed Minimum-Rank Solutions of Linear Matrix Equations via Nuclear Norm Minimization
Recht, B., Fazel, M., & Parrilo, P. A. (2010) · SIAM Review · doi:10.1137/070697835 · Cited by 3,471
An SVD-based watermarking scheme for protecting rightful ownership
Liu, R., & Tan, T. (2002) · IEEE Transactions on Multimedia · doi:10.1109/6046.985560 · Cited by 995
Image data compression: A review
Jain, A. K. (1981) · Proceedings of the IEEE · doi:10.1109/proc.1981.11971 · Cited by 709
The Moore–Penrose Pseudoinverse: A Tutorial Review of the Theory
Barata, J. C. A., & Hussein, M. S. (2012) · Brazilian Journal of Physics · doi:10.1007/s13538-011-0052-z · Cited by 413
Advances in mathematical models for image processing
Jain, A. K. (1981) · Proceedings of the IEEE · doi:10.1109/proc.1981.12021 · Cited by 402
Robust DWT-SVD domain image watermarking: embedding data in all frequencies
Ganic, E., & Eskicioglu, A. M. (2004) · Proceedings of the 2004 workshop on Multimedia and security · doi:10.1145/1022431.1022461 · Cited by 334
Haldar, J. P. (2014) · IEEE Transactions on Medical Imaging · doi:10.1109/tmi.2013.2293974 · Cited by 326
SVD Compression for Magnetic Resonance Fingerprinting in the Time Domain
McGivney, D. F., Pierre, E., Ma, D., Jiang, Y., Saybasili, H., Gulani, V., & Griswold, M. A. (2014) · IEEE Transactions on Medical Imaging · doi:10.1109/tmi.2014.2337321 · Cited by 314
A Survey of Data Mining and Deep Learning in Bioinformatics
Lan, K., Wang, D.-T., Fong, S., Liu, L.-S., Wong, K. K. L., & Dey, N. (2018) · Journal of Medical Systems · doi:10.1007/s10916-018-1003-9 · Cited by 288
Image compression techniques: A survey in lossless and lossy algorithms
Hussain, A. J., Al-Fayadh, A., & Radi, N. (2018) · Neurocomputing · doi:10.1016/j.neucom.2018.02.094 · Cited by 275
An overview of steganography techniques applied to the protection of biometric data
Douglas, M., Bailey, K., Leeney, M., & Curran, K. (2018) · Multimedia Tools and Applications · doi:10.1007/s11042-017-5308-3 · Cited by 122
“If A is an nxnmatrix, then SVD of matrix A can be defined as follows: [5].”
BackgroundSystematic Survey on Visually Meaningful Image Encryption Techniques
Himthani, V., Dhaka, V. S., Kaur, M., Singh, D., & Lee, H.-N. (2022) · IEEE Access · doi:10.1109/access.2022.3203173 · Cited by 20
Amortized Neural Networks for Low-Latency Speech Recognition
Macoskey, J., Strimel, G. P., Su, J., & Rastrow, A. (2021) · Interspeech 2021 · doi:10.21437/interspeech.2021-712 · Cited by 12
Metadata
- Authors
- Andrews, H., & Patterson, C.
- Venue
- IEEE Transactions on Communications
- Published
- 1976-04
- Volume
- 24
- Issue
- 4
- Pages
- 425-432
- ISSN
- 0096-2244 (ISSN-L)
- OpenAlex
- W1987570579
- Cited by
- 304
- References
- 0
- FWCI
- 1.40
- 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.