The DOI matches its Crossref record; 72 of the 72 references it cites were found in a registry or an index.
Data compression and harmonic analysis
Open accessAbstract
In this paper we review some recent interactions between harmonic analysis and data compression. The story goes back of course to Shannon's R(D) theory in the case of Gaussian stationary processes, which says that transforming into a Fourier basis followed by block coding gives an optimal lossy compression technique; practical developments like transform-based image compression have been inspired by this result. In this paper we also discuss connections perhaps less familiar to the information theory community, growing out of the field of harmonic analysis. Recent harmonic analysis constructions, such as wavelet transforms and Gabor transforms, are essentially optimal transforms for transform coding in certain settings. Some of these transforms are under consideration for future compression standards. We discuss some of the lessons of harmonic analysis in this century. Typically, the problems and achievements of this field have involved goals that were not obviously related to practical data compression, and have used a language not immediately accessible to outsiders. Nevertheless, through an extensive generalization of what Shannon called the "sampling theorem", harmonic analysis has succeeded in developing new forms of functional representation which turn out to have significant data compression interpretations. We explain why harmonic analysis has interacted with data compression, and we describe some interesting recent ideas in the field that may affect data compression in the future.
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
A Mathematical Theory of Communication
Shannon, C. E. (1948) · Bell System Technical Journal · doi:10.1002/j.1538-7305.1948.tb01338.x · Cited by 88,486
A Mathematical Theory of Communication
Shannon, C. E. (1948) · Bell System Technical Journal · doi:10.1002/j.1538-7305.1948.tb00917.x · Cited by 48,949
Elements of Information Theory
Cover, T. M., & Thomas, J. A. (2001) · Wiley eBooks · doi:10.1002/0471200611 · Cited by 36,808
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
Daubechies, I. (1992) · doi:10.1137/1.9781611970104 · Cited by 15,979
Self-citationDaubechies, I., & Heil, C. (1992) · Computers in Physics · doi:10.1063/1.4823127 · Cited by 15,631
Self-citationSingular Integrals and Differentiability Properties of Functions.
Stein, E. M. (1971) · Cited by 10,183
Orthonormal bases of compactly supported wavelets
Daubechies, I. (1988) · Communications on Pure and Applied Mathematics · doi:10.1002/cpa.3160410705 · Cited by 8,190
Self-citationVector Quantization and Signal Compression
Gersho, A., & Gray, R. M. (1992) · Springer eBooks · doi:10.1007/978-1-4615-3626-0 · Cited by 7,003
Communication in the presence of noise
Shannon, C. E. (1949) · Proceedings of the IRE · doi:10.1109/jrproc.1949.232969 · Cited by 6,539
Cited by
Donoho, D. L. (2006) · IEEE Transactions on Information Theory · doi:10.1109/tit.2006.871582 · Cited by 23,994
Self-citationNear-Optimal Signal Recovery From Random Projections: Universal Encoding Strategies?
Candes, E. J., & Tao, T. (2006) · IEEE Transactions on Information Theory · doi:10.1109/tit.2006.885507 · Cited by 6,839
Halko, N., Martinsson, P. G., & Tropp, J. A. (2011) · SIAM Review · doi:10.1137/090771806 · Cited by 4,002
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
Self-citationNew tight frames of curvelets and optimal representations of objects with piecewise C2 singularities
Candès, E. J., & Donoho, D. L. (2004) · Communications on Pure and Applied Mathematics · doi:10.1002/cpa.10116 · Cited by 1,545
Self-citationIterative Thresholding for Sparse Approximations
Blumensath, T., & Davies, M. E. (2008) · Journal of Fourier Analysis and Applications · doi:10.1007/s00041-008-9035-z · Cited by 1,248
Beyond Nyquist: Efficient Sampling of Sparse Bandlimited Signals
Tropp, J. A., Laska, J. N., Duarte, M. F., Romberg, J. K., & Baraniuk, R. G. (2010) · IEEE Transactions on Information Theory · doi:10.1109/tit.2009.2034811 · Cited by 1,089
Computational Methods for Sparse Solution of Linear Inverse Problems
Tropp, J. A., & Wright, S. J. (2010) · Proceedings of the IEEE · doi:10.1109/jproc.2010.2044010 · Cited by 1,046
Sparse directional image representations using the discrete shearlet transform
Easley, G., Labate, D., & Lim, W.-Q. (2008) · Applied and Computational Harmonic Analysis · doi:10.1016/j.acha.2007.09.003 · Cited by 1,040
Imaging via Compressive Sampling
Romberg, J. (2008) · IEEE Signal Processing Magazine · doi:10.1109/msp.2007.914729 · Cited by 1,014
The finite ridgelet transform for image representation
Do, M. N., & Vetterli, M. (2003) · IEEE Transactions on Image Processing · doi:10.1109/tip.2002.806252 · Cited by 711
Self-citationOptimally Sparse Multidimensional Representation Using Shearlets
Guo, K., & Labate, D. (2007) · SIAM Journal on Mathematical Analysis · doi:10.1137/060649781 · Cited by 700
Optimal selection of wavelet basis function applied to ECG signal denoising
Singh, B. N., & Tiwari, A. K. (2006) · Digital Signal Processing · doi:10.1016/j.dsp.2005.12.003 · Cited by 509
Noninvasive, near-field terahertz imaging of hidden objects using a single-pixel detector
Stantchev, R. I., Sun, B., Hornett, S. M., Hobson, P. A., Gibson, G. M., Padgett, M. J., & Hendry, E. (2016) · Science Advances · doi:10.1126/sciadv.1600190 · Cited by 499
Regularization of Wavelet Approximations
Antoniadis, A., & Fan, J. (2001) · Journal of the American Statistical Association · doi:10.1198/016214501753208942 · Cited by 498
Segmentation of Multivariate Mixed Data via Lossy Data Coding and Compression
Ma, Y., Derksen, H., Hong, W., & Wright, J. (2007) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2007.1085 · Cited by 481
Sparse multidimensional representation using shearlets
Labate, D., Lim, W.-Q., Kutyniok, G., & Weiss, G. (2005) · SPIE Proceedings · doi:10.1117/12.613494 · Cited by 455
Sampling Moments and Reconstructing Signals of Finite Rate of Innovation: Shannon Meets Strang–Fix
Dragotti, P. L., Vetterli, M., & Blu, T. (2007) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2006.890907 · Cited by 428
Self-citationThe Discrete Shearlet Transform: A New Directional Transform and Compactly Supported Shearlet Frames
Lim, W.-Q. (2010) · IEEE Transactions on Image Processing · doi:10.1109/tip.2010.2041410 · Cited by 424
Toeplitz Compressed Sensing Matrices With Applications to Sparse Channel Estimation
Haupt, J., Bajwa, W. U., Raz, G., & Nowak, R. (2010) · IEEE Transactions on Information Theory · doi:10.1109/tit.2010.2070191 · Cited by 424
The Mathematics of Learning: Dealing With Data
Smale, S. (2005) · 2005 International Conference on Neural Networks and Brain · doi:10.1109/icnnb.2005.1614860 · Cited by 398
A Stochastic Grammar of Images
Zhu, S.-C., & Mumford, D. (2006) · now publishers, Inc. eBooks · doi:10.1561/9781601980618 · Cited by 395
A Stochastic Grammar of Images
Zhu, S.-C., & Mumford, D. (2006) · Foundations and Trends® in Computer Graphics and Vision · doi:10.1561/0600000018 · Cited by 332
One Network to Solve Them All — Solving Linear Inverse Problems Using Deep Projection Models
Chang, J. H. R., Li, C.-L., Poczos, B., Vijaya Kumar, B. V. K., & Sankaranarayanan, A. C. (2017) · 2017 IEEE International Conference on Computer Vision (ICCV) · doi:10.1109/iccv.2017.627 · Cited by 327
Directionlets: anisotropic multidirectional representation with separable filtering
Velisavljevic, V., Beferull-Lozano, B., Vetterli, M., & Dragotti, P. L. (2006) · IEEE Transactions on Image Processing · doi:10.1109/tip.2006.877076 · Cited by 326
Self-citationVerdu, S. (1998) · IEEE Transactions on Information Theory · doi:10.1109/18.720531 · Cited by 316
Directional multiresolution image representations
Do, M. N. (2002) · doi:10.5075/epfl-thesis-2500 · Cited by 312
Signal recovery from random projections
Candes, E. J., & Romberg, J. K. (2005) · SPIE Proceedings · doi:10.1117/12.600722 · Cited by 299
A Theory for Sampling Signals From a Union of Subspaces
Lu, Y. M., & Do, M. N. (2008) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2007.914346 · Cited by 286
The curvelet representation of wave propagators is optimally sparse
Candès, E. J., & Demanet, L. (2005) · Communications on Pure and Applied Mathematics · doi:10.1002/cpa.20078 · Cited by 272
One sketch for all: fast algorithms for compressed sensing
Gilbert, A. C., Strauss, M. J., Tropp, J. A., & Vershynin, R. (2007) · Proceedings of the thirty-ninth annual ACM symposium on Theory of computing · doi:10.1145/1250790.1250824 · Cited by 270
Compressive Sampling and Lossy Compression
Goyal, V. K., Fletcher, A. K., & Rangan, S. (2008) · IEEE Signal Processing Magazine · doi:10.1109/msp.2007.915001 · Cited by 252
Complete Dictionary Recovery Over the Sphere I: Overview and the Geometric Picture
Sun, J., Qu, Q., & Wright, J. (2017) · IEEE Transactions on Information Theory · doi:10.1109/tit.2016.2632162 · Cited by 213
Metadata
- Authors
- Donoho, D. L., Vetterli, M., DeVore, R. A., & Daubechies, I.
- Venue
- IEEE Transactions on Information Theory
- Published
- 1998
- Volume
- 44
- Issue
- 6
- Pages
- 2435-2476
- ISSN
- 0018-9448 (ISSN-L)
- OpenAlex
- W2096613063
- Cited by
- 432
- References
- 72
- FWCI
- 21.37
- 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
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.