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
cited by Murphy (2008, p. 39): `An approximation to the original signal can be obtained by inverse transforming all of
the approximation coefficients and a subset of the detail coefficients, selected on the basis of
having the largest magnitude. Since wavelets are localized in both time and scale, wavelet
coefficients will be larger near discontinuities and abrupt changes. This method of wavelet
compression is described by Donoho et al. as being especially appropriate for functions that
are ” piecewise-smooth away from discontinuities”'
%0 Journal Article
%1 citeulike:2248499
%A Donoho, D. L.
%A Vetterli, M.
%A DeVore, R. A.
%A Daubechies, I.
%B Information Theory, IEEE Transactions on
%D 1998
%I IEEE
%J Information Theory, IEEE Transactions on
%K 94a29-source-coding 68p30-coding-and-information-theory 42c40-wavelets-and-other-special-systems 65t60-wavelets
%N 6
%P 2435--2476
%R 10.1109/18.720544
%T Data compression and harmonic analysis
%U http://dx.doi.org/10.1109/18.720544
%V 44
%X 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
@article{citeulike:2248499,
abstract = {{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}},
added-at = {2017-06-29T07:13:07.000+0200},
author = {Donoho, D. L. and Vetterli, M. and DeVore, R. A. and Daubechies, I.},
biburl = {https://www.bibsonomy.org/bibtex/2b279a457b66f5b31fc7f74a8af307583/gdmcbain},
booktitle = {Information Theory, IEEE Transactions on},
citeulike-article-id = {2248499},
citeulike-attachment-1 = {DCHA.pdf; /pdf/user/gdmcbain/article/2248499/947502/DCHA.pdf; 1b7ffae8feb4d5ec9f2bf396f355ca0fdbfb64c6},
citeulike-linkout-0 = {http://dx.doi.org/10.1109/18.720544},
citeulike-linkout-1 = {http://ieeexplore.ieee.org/xpls/abs\_all.jsp?arnumber=720544},
comment = {cited by Murphy (2008, p. 39): `An approximation to the original signal can be obtained by inverse transforming all of
the approximation coefficients and a subset of the detail coefficients, selected on the basis of
having the largest magnitude. Since wavelets are localized in both time and scale, wavelet
coefficients will be larger near discontinuities and abrupt changes. This method of wavelet
compression is described by Donoho et al. as being especially appropriate for functions that
are ” piecewise-smooth away from discontinuities”'},
doi = {10.1109/18.720544},
file = {DCHA.pdf},
interhash = {d70b280d8b4bb4b10e03f16511031338},
intrahash = {b279a457b66f5b31fc7f74a8af307583},
issn = {0018-9448},
journal = {Information Theory, IEEE Transactions on},
keywords = {94a29-source-coding 68p30-coding-and-information-theory 42c40-wavelets-and-other-special-systems 65t60-wavelets},
month = oct,
number = 6,
pages = {2435--2476},
posted-at = {2014-02-04 01:09:08},
priority = {2},
publisher = {IEEE},
timestamp = {2020-02-19T00:13:46.000+0100},
title = {{Data compression and harmonic analysis}},
url = {http://dx.doi.org/10.1109/18.720544},
volume = 44,
year = 1998
}