Show simple item record

dc.contributor.authorCohen, Laurent D.
HAL ID: 738939
dc.contributor.authorRouchdy, Youssef
dc.subjectTree Structure Segmentationen
dc.subjectMinimal Pathsen
dc.subjectLevel Seten
dc.subjectFast Marchingen
dc.subjectGeodesic Votingen
dc.titleGeodesic voting for the automatic extraction of tree structures. Methods and applicationsen
dc.typeArticle accepté pour publication ou publié
dc.description.abstractenThis paper presents new methods to segment thin tree structures, which are, for example present in microglia extensions and cardiac or neuronal blood vessels. Many authors have used minimal cost paths, or geodesics relative to a local weighting potential P, to find a vessel pathway between two end points. We utilize a set of such geodesic paths to find a tubular tree structure by seeking minimal interaction. We introduce a new idea that we call Geodesic Voting or Geodesic Density. The approach consists of computing geodesics from a set of end points scattered in the image which flow toward a given source point. The target structure corresponds to image points with a high geodesic density. The ”Geodesic density” is defined at each pixel of the image as the number of geodesics that pass over this pixel. The potential P is defined in such way that it takes low values along the tree structure, therefore geodesics will migrate toward this structure thereby yielding a high geodesic density. We further adapt these methods to segment complex tree structures in a noisy medium and apply them to segment microglia extensions from confocal microscope images as well as vessels.en
dc.relation.isversionofjnlnameComputer Vision and Image Understanding
dc.relation.isversionofjnlnameComputer Vision and Image Understanding
dc.subject.ddclabelIntelligence artificielleen

Files in this item


There are no files associated with this item.

This item appears in the following Collection(s)

Show simple item record