# Sparse geometric image representations with bandelets

@article{Pennec2005SparseGI, title={Sparse geometric image representations with bandelets}, author={Erwan Le Pennec and St{\'e}phane Mallat}, journal={IEEE Transactions on Image Processing}, year={2005}, volume={14}, pages={423-438} }

This paper introduces a new class of bases, called bandelet bases, which decompose the image along multiscale vectors that are elongated in the direction of a geometric flow. This geometric flow indicates directions in which the image gray levels have regular variations. The image decomposition in a bandelet basis is implemented with a fast subband-filtering algorithm. Bandelet bases lead to optimal approximation rates for geometrically regular images. For image compression and noise removalâ€¦Â

## Figures from this paper

## 938 Citations

### Bandelet Image Approximation and Compression

- Computer ScienceMultiscale Model. Simul.
- 2005

For functions that are uniformly regular outside a set of edge curves that are geometrically regular, the main theorem proves that bandelet approximations satisfy an optimal asymptotic error decay rate.

### A review of Bandlet methods for geometrical image representation

- Mathematics, Computer ScienceNumerical Algorithms
- 2007

This article reviews bandlet approaches to geometric image representations using an adaptive segmentation and a local geometric flow well suited to capture the anisotropic regularity of edge structures to lead to state of the art results for image denoising and super-resolution.

### Surface compression with geometric bandelets

- Computer ScienceSIGGRAPH '05
- 2005

This paper describes the construction of second generation bandelet bases and their application to 3D geometry compression and has an error decay that is asymptotically optimal for geometrically regular surfaces.

### Multiscale bandelet image compression

- Mathematics2007 International Symposium on Intelligent Signal Processing and Communication Systems
- 2007

The estimation of basis shapes, the partition of image and the optimization of geometric flows are three key issues in the implementation of the second Bandelets proposed by peyer. Compared withâ€¦

### Compressive sampling of natural images using bandelet basis

- Computer Science2011 4th International Congress on Image and Signal Processing
- 2011

The experimental results show that natural images can be reconstructed by using bandelet basis with higher PSNR and good visual quality and the bandelets based compressive sampling method outperformed conventional compressive imaging frameworks.

### Color Image Compression Using Geometric Wavelets

- Computer Science
- 2014

This paper extends the geometric wavelet image coding method for monochromatic images to color images and introduces vector valued geometric wavelets to color image compression.

### Fast Geometric Image Representation Using Wedgelets and Multitree Dictionaries

- Computer Science
- 2014

Numerical results suggest that new methods with desirable rate-distortion behavior reduce computation complexity for searching different dyadic squares and capture natural geometric structure of image effectively.

### Nonlinear Image Representation via Local Multiscale Orientation

- Mathematics
- 2005

We present a nonlinear image representation based on multiscale local orientation measurements. Specifically, an image is first decomposed using a two-orientation steerable pyramid, a tight-frameâ€¦

### Anisotropic multiscale sparse learned bases for image compression

- Computer ScienceElectronic Imaging
- 2010

A new compression algorithm based on multi-scale learned bases is proposed based on the construction of a set of image bases using a bintree segmentation and the optimization procedure used to select the image basis from this set.

### Sparse orthonormal transforms for image compression

- Computer Science2008 15th IEEE International Conference on Image Processing
- 2008

A block-based transform optimization and associated image compression technique that exploits regularity along directional image singularities and an EZW/SPIHT like entropy coder is used to encode the transform coefficients to show that the designs have competitive rate-distortion performance.

## References

SHOWING 1-10 OF 63 REFERENCES

### Bandelet Image Approximation and Compression

- Computer ScienceMultiscale Model. Simul.
- 2005

For functions that are uniformly regular outside a set of edge curves that are geometrically regular, the main theorem proves that bandelet approximations satisfy an optimal asymptotic error decay rate.

### Image compression with geometrical wavelets

- Computer ScienceProceedings 2000 International Conference on Image Processing (Cat. No.00CH37101)
- 2000

A sparse image representation that takes advantage of the geometrical regularity of edges in images is introduced, and two dimensional "bandelets" define orthonormal families that can restore close approximations of regular edges with few non-zero coefficients.

### Rate-distortion optimized image compression using wedgelets

- Computer ScienceProceedings. International Conference on Image Processing
- 2002

This paper proposes an extension of the zerotree-based space-frequency quantization (SFQ) algorithm by adding a wedgelet symbol to its tree-pruning optimization, which incorporates wedgelets into a rate-distortion compression framework and allows simple, coherent descriptions of the wavelet coefficients near edges.

### Multiscale image processing using normal triangulated meshes

- Computer ScienceProceedings 2001 International Conference on Image Processing (Cat. No.01CH37205)
- 2001

This work proposes an image representation and processing framework using a multiscale triangulation of the grayscale function, and demonstrates the approximation performance of the normal mesh representation through mathematical analyses for simple functions and simulations for real images.

### Analysis of low bit rate image transform coding

- Computer ScienceIEEE Trans. Signal Process.
- 1998

Calculations based on high-resolution quantizations prove that the distortion rate D(R) of an image transform coding is proportional to 2/sup -2R/ when R is large enough, and shows that the compression performance of an orthonormal basis depends mostly on its ability to approximate images with a few nonzero vectors.

### Best wavelet packet bases in a rate-distortion sense

- Computer ScienceIEEE Trans. Image Process.
- 1993

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â€¦

### Image denoising using scale mixtures of Gaussians in the wavelet domain

- MathematicsIEEE Trans. Image Process.
- 2003

The performance of this method for removing noise from digital images substantially surpasses that of previously published methods, both visually and in terms of mean squared error.

### Image compression based on multi-scale edge compensation

- Computer ScienceProceedings 1999 International Conference on Image Processing (Cat. 99CH36348)
- 1999

This paper introduces a new image model called MSEC (Multi-Scale Edge Compensation) and implements an image compression system based on MSEC, which permits some image analysis operations such as edge detection, enhancement, and content-based retrieval to be carried out directly in the compression domain.

### Rate-distortion optimized tree-structured compression algorithms for piecewise polynomial images

- Computer ScienceIEEE Transactions on Image Processing
- 2005

Novel coding algorithms based on tree-structured segmentation achieve the correct asymptotic rate-distortion (R-D) behavior for a simple class of signals, known as piecewise polynomials, by using an R-D based prune and join scheme.

### Curvelets: A Surprisingly Effective Nonadaptive Representation for Objects with Edges

- Computer Science
- 2000

The basic issues of efficient m-term approximation, the construction of efficient adaptive representation, theConstruction of the curvelet frame, and a crude analysis of the performance of curvelet schemes are explained.