The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
Best wavelet packet bases in a rate-distortion sense
Open accessAbstract
A fast rate-distortion (R-D) optimal scheme for coding adaptive trees whose individual nodes spawn descendents forming a disjoint and complete basis cover for the space spanned by their parent nodes is presented. The scheme guarantees operation on the convex hull of the operational R-D curve and uses a fast dynamic programing pruning algorithm to markedly reduce computational complexity. Applications for this coding technique include R. Coefman et al.'s (Yale Univ., 1990) generalized multiresolution wavelet packet decomposition, iterative subband coders, and quadtree structures. Applications to image processing involving wavelet packets as well as discrete cosine transform (DCT) quadtrees are presented.
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
Bellman, R. E. (2010) · doi:10.1515/9781400835386 · Cited by 14,588
Cited by
Gray, R. M., & Neuhoff, D. L. (1998) · IEEE Transactions on Information Theory · doi:10.1109/18.720541 · Cited by 1,642
Sparse geometric image representations with bandelets
Le Pennec, E., & Mallat, S. (2005) · IEEE Transactions on Image Processing · doi:10.1109/tip.2005.843753 · Cited by 860
Salembier, P., & Garrido, L. (2000) · IEEE Transactions on Image Processing · doi:10.1109/83.841934 · Cited by 587
Metadata
- Authors
- Ramchandran, K., & Vetterli, M.
- Venue
- IEEE Transactions on Image Processing
- Published
- 1993-04
- Volume
- 2
- Issue
- 2
- Pages
- 160-175
- ISSN
- 1057-7149 (ISSN-L)
- OpenAlex
- W2099627681
- Cited by
- 679
- References
- 1
- FWCI
- 26.79
- 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: Best wavelet packet bases in a rate-distortion sense. https://app.cochat.ai/papers/10.1109/83.217221
- The paper
- Ramchandran, K., & Vetterli, M. (1993). Best wavelet packet bases in a rate-distortion sense. IEEE Transactions on Image Processing. https://doi.org/10.1109/83.217221
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.