The DOI matches its Crossref record; 20 of the 20 references it cites were found in a registry or an index.
Embedded image coding using zerotrees of wavelet coefficients
Abstract
The embedded zerotree wavelet algorithm (EZW) is a simple, yet remarkably effective, image compression algorithm, having the property that the bits in the bit stream are generated in order of importance, yielding a fully embedded code. The embedded code represents a sequence of binary decisions that distinguish an image from the "null" image. Using an embedded coding algorithm, an encoder can terminate the encoding at any point thereby allowing a target rate or target distortion metric to be met exactly. Also, given a bit stream, the decoder can cease decoding at any point in the bit stream and still produce exactly the same image that would have been encoded at the bit rate corresponding to the truncated bit stream. In addition to producing a fully embedded bit stream, the EZW consistently produces compression results that are competitive with virtually all known compression algorithms on standard test images. Yet this performance is achieved with a technique that requires absolutely no training, no pre-stored tables or codebooks, and requires no prior knowledge of the image source. The EZW algorithm is based on four key concepts: (1) a discrete wavelet transform or hierarchical subband decomposition, (2) prediction of the absence of significant information across scales by exploiting the self-similarity inherent in images, (3) entropy-coded successive-approximation quantization, and (4) universal lossless data compression which is achieved via adaptive arithmetic coding.>
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
A theory for multiresolution signal decomposition: the wavelet representation
Mallat, S. G. (1989) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/34.192463 · Cited by 21,372
Orthonormal bases of compactly supported wavelets
Daubechies, I. (1988) · Communications on Pure and Applied Mathematics · doi:10.1002/cpa.3160410705 · Cited by 8,190
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
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
The JPEG still picture compression standard
Wallace, G. K. (1991) · Communications of the ACM · doi:10.1145/103085.103089 · Cited by 3,784
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
Arithmetic coding for data compression
Witten, I. H., Neal, R. M., & Cleary, J. G. (1987) · Communications of the ACM · doi:10.1145/214762.214771 · Cited by 2,877
Wavelets and signal processing
Rioul, O., & Vetterli, M. (1991) · IEEE Signal Processing Magazine · doi:10.1109/79.91217 · Cited by 2,786
Multifrequency channel decompositions of images and wavelet models
Mallat, S. G. (1989) · IEEE Transactions on Acoustics, Speech, and Signal Processing · doi:10.1109/29.45554 · Cited by 1,955
No, P. (1986) · Cited by 1,532
Barratt, K. H. (1985) · Electronics and Power · doi:10.1049/ep.1985.0201 · Cited by 1,523
Bell, T., Cleary, J. G., & Witten, I. H. (1990) · Cited by 988
Wavelets and Dilation Equations: A Brief Introduction
Strang, G. (1989) · SIAM Review · doi:10.1137/1031128 · Cited by 953
Image compression through wavelet transform coding
DeVore, R. A., Jawerth, B., & Lucier, B. J. (1992) · IEEE Transactions on Information Theory · doi:10.1109/18.119733 · Cited by 910
Image compression using the 2-D wavelet transform
Lewis, A. S., & Knowles, G. (1992) · IEEE Transactions on Image Processing · doi:10.1109/83.136601 · Cited by 718
(1991) · Springer eBooks · doi:10.1007/978-1-4757-2119-5 · Cited by 336
Orthogonal Pyramid Transforms For Image Coding.
Adelson, E. H., Simoncelli, E., & Hingorani, R. (1987) · SPIE Proceedings · doi:10.1117/12.976485 · Cited by 292
Image compression with variable block size segmentation
Vaisey, J., & Gersho, A. (1992) · IEEE Transactions on Signal Processing · doi:10.1109/78.150005 · Cited by 200
Application of compactly supported wavelets to image compression
Zettler, W. R., Huffman, J. C., & Linden, D. C. P. (1990) · Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE · doi:10.1117/12.19505 · Cited by 73
A practical approach to fractal-based image compression
Pentland, A., & Horowitz, B. (2002) · DCC · doi:10.1109/dcc.1991.213385 · Cited by 58
Cited by
Image quality assessment: from error visibility to structural similarity
Wang, Z., Bovik, A. C., Sheikh, H. R., & Simoncelli, E. P. (2004) · IEEE Transactions on Image Processing · doi:10.1109/tip.2003.819861 · Cited by 57,892
A new, fast, and efficient image codec based on set partitioning in hierarchical trees
Said, A., & Pearlman, W. A. (1996) · IEEE Transactions on Circuits and Systems for Video Technology · doi:10.1109/76.499834 · Cited by 5,353
Image information and visual quality
Sheikh, H. R., & Bovik, A. C. (2006) · IEEE Transactions on Image Processing · doi:10.1109/tip.2005.859378 · Cited by 4,104
The contourlet transform: an efficient directional multiresolution image representation
Do, M. N., & Vetterli, M. (2005) · IEEE Transactions on Image Processing · doi:10.1109/tip.2005.859376 · Cited by 3,952
Image coding using wavelet transform
Antonini, M., Barlaud, M., Mathieu, P., & Daubechies, I. (1992) · IEEE Transactions on Image Processing · doi:10.1109/83.136597 · Cited by 3,525
Metadata
- Authors
- Shapiro, J. M.
- Venue
- IEEE Transactions on Signal Processing
- Published
- 1993
- Volume
- 41
- Issue
- 12
- Pages
- 3445-3462
- ISSN
- 1053-587X (ISSN-L)
- OpenAlex
- W2053691921
- Cited by
- 4,815
- References
- 20
- FWCI
- 52.99
- 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.