Image Compression with Anisotropic Geodesic Triangulations - Archive ouverte HAL Access content directly
Conference Papers Year : 2009

Image Compression with Anisotropic Geodesic Triangulations


We propose a new image compression method based on geodesic Delaunay triangulations. Triangulations are generated by a progressive geodesic meshing algorithm which exploits the anisotropy of images through a farthest point sampling strategy. This seeding is performed according to anisotropic geodesic distances which force the anisotropic Delaunay triangles to follow the geometry of the image. Geodesic computations are performed using a Riemannian Fast Marching, which recursively updates the geodesic distance to the seed points. A linear spline approximation on this triangulation allows to approximate faithfully sharp edges and directional features in images. The compression is achieved by coding both the coefficients of the spline approximation and the deviation of the geodesic triangulation from an Euclidean Delaunay triangulation. Numerical results show that taking into account the anisotropy improves the approximation by isotropic triangulations of complex images. The resulting geodesic encoder competes well with wavelet-based encoder such as JPEG-2000 on geometric images.
Fichier principal
Vignette du fichier
BougleuxPeyreCohen-ICCV09.pdf (759.32 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-00366933 , version 1 (10-03-2009)



Sébastien Bougleux, Gabriel Peyré, Laurent D. Cohen. Image Compression with Anisotropic Geodesic Triangulations. IEEE 12th International Conference o Computer Vision, Sep 2009, Kyoto, Japan. pp.2343-2348, ⟨10.1109/ICCV.2009.5459425⟩. ⟨hal-00366933⟩
249 View
262 Download



Gmail Facebook X LinkedIn More