• 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

Fast Constrained Surface Extraction by Minimal Paths

Thumbnail
View/Open
2005-34.pdf (1.241Mb)
Date
2006
Notes
La version de travail s'intitule " Minimal Paths and Surface Segmentation"
Dewey
Probabilités et mathématiques appliquées
Sujet
active surfaces; active contours; minimal paths; level set method; object extraction
Journal issue
International Journal of Computer Vision
Volume
69
Number
1
Publication date
2006
Article pages
127-136
Publisher
Springer
DOI
http://dx.doi.org/10.1007/s11263-006-6850-z
URI
https://basepub.dauphine.fr/handle/123456789/6823
Collections
  • CEREMADE : Publications
Metadata
Show full item record
Author
Ardon, Roberto
Cohen, Laurent D.
Type
Article accepté pour publication ou publié
Abstract (EN)
In this paper we consider a new approach for single object segmentation in 3D images. Our method improves the classical geodesic active surface model. It greatly simplifies the model initialization and naturally avoids local minima by incorporating user extra information into the segmentation process. The initialization procedure is reduced to introducing 3D curves into the image. These curves are supposed to belong to the surface to extract and thus, also constitute user given information. Hence, our model finds a surface that has these curves as boundary conditions and that minimizes the integral of a potential function that corresponds to the image features. Our goal is achieved by using globally minimal paths. We approximate the surface to extract by a discrete network of paths. Furthermore, an interpolation method is used to build a mesh or an implicit representation based on the information retrieved from the network of paths. Our paper describes a fast construction obtained by exploiting the Fast Marching algorithm and a fast analytical interpolation method. Moreover, a Level set method can be used to refine the segmentation when higher accuracy is required. The algorithm has been successfully applied to 3D medical images and synthetic images.

  • 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.