Image Compression with Anisotropic Geodesic Triangulations

@inproceedings{Bougleux2009ImageCW,
  title={Image Compression with Anisotropic Geodesic Triangulations},
  author={S{\'e}bastien Bougleux and Gabriel Peyr{\'e} and Laurent Cohen},
  year={2009}
}
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… CONTINUE READING

References

Publications referenced by this paper.
Showing 1-10 of 18 references

Geodesic Remeshing Using Front Propagation

International Journal of Computer Vision • 2006
View 4 Excerpts

Triangulations and Applications

O. Hjelle, M. Daehlen
Springer • 2006
View 1 Excerpt

Sparse geometric image representations with bandelets

IEEE Transactions on Image Processing • 2005
View 1 Excerpt

Mesh generation and mesh adaptivity: theory

P. George, H. Borouchaki, P. Frey, P. Laug, E. Saltel
techniques. Encyclopedia of computational mechanics, E. Stein, R. de Borst and T.J.R. Hughes ed., John Wiley & Sons Ltd. • 2004
View 1 Excerpt

Similar Papers

Loading similar papers…