2002 · 50 citations · 12 references
ComputingComputer ScienceComputational GeometryComputer VisionDigital ImagingData CompressionDigital Image ProcessingDistortion AnalysisImage CompressionImage ProcessingRate-distortion TheoryApproximation PropertiesCompressionCompression AlgorithmsDistortion MeasuresPiecewise FunctionsQuadtree DecompositionRate-distortion BoundsRate-distortion Coding
It is well known that wavelets provide good non-linear approximation of one-dimensional (1-D) piecewise smooth functions. However, it has been shown that the use of a basis with good approximation properties does not necessarily lead to a good compression algorithm. The situation in 2-D is much more complicated since wavelets are not good for modeling piecewise smooth signals (where discontinuities are along smooth curves). The purpose of this work is to analyze the performance of compression algorithms for 2-D piecewise smooth functions directly in a rate distortion context. We consider some simple image models and compute rate distortion bounds achievable using oracle based methods. We then present a practical compression algorithm based on optimal quadtree decomposition that, in some cases, achieve the oracle performance.
12
Wedgelets: nearly minimax estimation of edges
David L. Donoho · The Annals of Statistics · 1999 · 642 citations · Full text
Data compression and harmonic analysis
David L. Donoho, Martin Vetterli, Ronald DeVore et al. · IEEE Transactions on Information Theory · 1998 · 434 citations · Full text