• français
    • English
  • English 
    • français
    • English
  • Login
JavaScript is disabled for your browser. Some features of this site may not work without it.
BIRD Home

Browse

This CollectionBy Issue DateAuthorsTitlesSubjectsJournals BIRDResearch centres & CollectionsBy Issue DateAuthorsTitlesSubjectsJournals

My Account

Login

Statistics

View Usage Statistics

Anisotropic Geodesics for Perceptual Grouping and Domain Meshing

Thumbnail
Date
2008
Link to item file
https://hal.archives-ouvertes.fr/hal-00360797
Dewey
Probabilités et mathématiques appliquées
Sujet
Fast Marching; Geodesic; perceptual grouping.; anisotropy; meshing
DOI
http://dx.doi.org/10.1007/978-3-540-88688-4_10
Conference country
FRANCE
Book title
Computer Vision – ECCV 200810th European Conference on Computer Vision, Marseille, France, October 12-18, 2008, Proceedings, Part II
Author
David Forsyth, Philip Torr, Andrew Zisserman
Publisher
Springer
Publisher city
Berlin Heidelberg
Year
2008
ISBN
978-3-540-88685-3
Book URL
10.1007/978-3-540-88688-4
URI
https://basepub.dauphine.fr/handle/123456789/436
Collections
  • CEREMADE : Publications
Metadata
Show full item record
Author
Bougleux, Sébastien
Peyré, Gabriel
Cohen, Laurent D.
Type
Communication / Conférence
Item number of pages
129-142
Abstract (EN)
This paper shows how computational Riemannian manifold can be used to solve several problems in computer vision and graphics. Indeed, Voronoi segmentations and Delaunay graphs computed with geodesic distances are shaped according to the anisotropy of the metric. A careful design of a Riemannian manifold can thus help to solve some important difficulties in computer vision and graphics. The first contribution of this paper is thus a detailed exposition of Riemannian metrics as a tool for computer vision and graphics. The second contribution of this paper is the use of this new framework to solve two important problems in computer vision and graphics. The first problem studied is perceptual grouping which is a curve reconstruction problem where one should complete in a meaningful way a sparse set of curves. Our anisotropic grouping algorithm works over a Riemannian metric that propagates the direction of a sparse set of noisy incomplete curves over the whole domain. The proposed method prunes the Delaunay graph in order to correctly link together salient features in the image. The second problem studied is planar domain meshing, where one should build a good quality triangulation of a given domain. Our anisotropic meshing algorithm is a geodesic Delaunay refinement method that exploits a Riemannian metric in order to locally impose the orientation and aspect ratio of the created triangles.

  • Accueil Bibliothèque
  • Site de l'Université Paris-Dauphine
  • Contact
SCD Paris Dauphine - Place du Maréchal de Lattre de Tassigny 75775 Paris Cedex 16

 Content on this site is licensed under a Creative Commons 2.0 France (CC BY-NC-ND 2.0) license.