A Geodesic Voting Shape Prior to Constrain the Level Set Evolution for the Segmentation of Tubular Trees
dc.contributor.author | Rouchdy, Youssef | |
dc.contributor.author | Cohen, Laurent D.
HAL ID: 738939 | |
dc.date.accessioned | 2012-01-09T10:54:30Z | |
dc.date.available | 2012-01-09T10:54:30Z | |
dc.date.issued | 2012 | |
dc.identifier.uri | https://basepub.dauphine.fr/handle/123456789/7836 | |
dc.language.iso | en | en |
dc.subject | Geodesic paths | en |
dc.subject.ddc | 519 | en |
dc.title | A Geodesic Voting Shape Prior to Constrain the Level Set Evolution for the Segmentation of Tubular Trees | en |
dc.type | Communication / Conférence | |
dc.description.abstracten | This paper presents a geodesic voting method to segment tree structures, such as retinal or cardiac blood vessels. Many authors have used minimal cost paths, or similarly geodesics relative to a weight potential P, to find a vessel between two end points. Our goal focuses on the use of a set of such geodesic paths for finding a tubular tree structures, using minimal interaction. This work adapts the geodesic voting method that we have introduced for the segmentation of thin tree structures to the segmentation of tubular trees. The original approach of geodesic voting consists in computing geodesics from a set of end points scattered in the image to a given source point. The target structure corresponds to image points with a high geodesic density. Since the potential takes low values on the tree structure, geodesics will locate preferably on this structure and thus the geodesic density should be high. Geodesic voting method gives a good approximation of the localization of the tree branches, but it does not allow to extract the tubular aspect of the tree. Here, we use the geodesic voting method to build a shape prior to constrain the level set evolution in order to segment the boundary of the tubular structure. We show results of the segmentation with this approach on 2D angiogram images and 3D simulated data. | en |
dc.identifier.citationpages | 362-373 | en |
dc.relation.ispartoftitle | Scale Space and Variational Methods in Computer Vision Third International Conference, SSVM 2011, Ein-Gedi, Israel, May 29 – June 2, 2011, Revised Selected Papers | en |
dc.relation.ispartofeditor | Bruckstein, Alfred M. | |
dc.relation.ispartofeditor | Ter Haar Romeny, Bart M. | |
dc.relation.ispartofeditor | Bronstein, Alexander M. | |
dc.relation.ispartofeditor | Bronstein, Michael M. | |
dc.relation.ispartofpublname | Springer | en |
dc.relation.ispartofpublcity | Berlin | en |
dc.relation.ispartofdate | 2012 | |
dc.relation.ispartofpages | 798 | en |
dc.relation.ispartofurl | http://dx.doi.org/10.1007/978-3-642-24785-9 | en |
dc.description.sponsorshipprivate | oui | en |
dc.subject.ddclabel | Probabilités et mathématiques appliquées | en |
dc.relation.ispartofisbn | 978-3-642-24784-2 | en |
dc.relation.conftitle | Third International Conference on Scale Space and Variational Methods in Computer Vision (SSVM 2011) | en |
dc.relation.confdate | 2011-05 | |
dc.relation.confcity | Ein-Gedi | en |
dc.relation.confcountry | Israël | en |