• xmlui.mirage2.page-structure.header.title
    • français
    • English
  • Help
  • Login
  • Language 
    • Français
    • English
View Item 
  •   BIRD Home
  • CEREMADE (UMR CNRS 7534)
  • CEREMADE : Publications
  • View Item
  •   BIRD Home
  • CEREMADE (UMR CNRS 7534)
  • CEREMADE : Publications
  • View Item
JavaScript is disabled for your browser. Some features of this site may not work without it.

Browse

BIRDResearch centres & CollectionsBy Issue DateAuthorsTitlesTypeThis CollectionBy Issue DateAuthorsTitlesType

My Account

LoginRegister

Statistics

Most Popular ItemsStatistics by CountryMost Popular Authors
Thumbnail - No thumbnail

Image Compression with Anisotropic Geodesic Triangulations

Bougleux, Sébastien; Peyré, Gabriel; Cohen, Laurent D. (2009), Image Compression with Anisotropic Geodesic Triangulations, 12th IEEE International Conference on Computer Vision (ICCV 2009), IEEE : Piscataway, NJ. 10.1109/ICCV.2009.5459425

Type
Communication / Conférence
External document link
https://hal.archives-ouvertes.fr/hal-00366933
Date
2009
Conference country
JAPAN
Book title
12th IEEE International Conference on Computer Vision (ICCV 2009)
Publisher
IEEE
Published in
Piscataway, NJ
ISBN
978-1-4244-4420-5
Publication identifier
10.1109/ICCV.2009.5459425
Metadata
Show full item record
Author(s)
Bougleux, Sébastien

Peyré, Gabriel

Cohen, Laurent D.
Abstract (EN)
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.
Subjects / Keywords
geodesic; Image compression; farthest point; Fast Marching; anisotropy; triangulation

Related items

Showing items related by title and author.

  • Thumbnail
    Compression d'images par triangulation géodésique anisotrope 
    Bougleux, Sébastien; Peyré, Gabriel; Cohen, Laurent D. (2009) Communication / Conférence
  • Thumbnail
    Anisotropic Geodesics for Perceptual Grouping and Domain Meshing 
    Bougleux, Sébastien; Peyré, Gabriel; Cohen, Laurent D. (2008) Communication / Conférence
  • Thumbnail
    Combination of piecewise-geodesic curves for interactive image segmentation 
    Mille, Julien; Bougleux, Sébastien; Cohen, Laurent D. (2014) Communication / Conférence
  • Thumbnail
    Non-local Regularization of Inverse Problems 
    Peyré, Gabriel; Bougleux, Sébastien; Cohen, Laurent D. (2008) Communication / Conférence
  • Thumbnail
    Non-local regularization of inverse problems 
    Cohen, Laurent D.; Bougleux, Sébastien; Peyré, Gabriel (2011) Article accepté pour publication ou publié
Dauphine PSL Bibliothèque logo
Place du Maréchal de Lattre de Tassigny 75775 Paris Cedex 16
Phone: 01 44 05 40 94
Contact
Dauphine PSL logoEQUIS logoCreative Commons logo