Fast Object Segmentation by Growing Minimal Paths from a Single Point on 2D or 3D Images

被引:56
作者
Benmansour, Fethallah [1 ]
Cohen, Laurent D. [1 ]
机构
[1] Univ Paris 09, CEREMADE, CNRS, UMR 7534, F-75775 Paris 16, France
关键词
Image segmentation; Minimal paths; Energy minimizing curves; Surface meshing; Object extraction; Digital topology; Fast marching method; LEVEL SET METHOD; SHAPE;
D O I
10.1007/s10851-008-0131-0
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
In this paper, we present a new method for segmenting closed contours and surfaces. Our work builds on a variant of the minimal path approach. First, an initial point on the desired contour is chosen by the user. Next, new keypoints are detected automatically using a front propagation approach. We assume that the desired object has a closed boundary. This a-priori knowledge on the topology is used to devise a relevant criterion for stopping the keypoint detection and front propagation. The final domain visited by the front will yield a band surrounding the object of interest. Linking pairs of neighboring keypoints with minimal paths allows us to extract a closed contour from a 2D image. This approach can also be used for finding an open curve giving extra information as stopping criteria. Detection of a variety of objects on real images is demonstrated. Using a similar idea, we can extract networks of minimal paths from a 3D image called Geodesic Meshing. The proposed method is applied to 3D data with promising results.
引用
收藏
页码:209 / 221
页数:13
相关论文
共 22 条
[1]   A new implicit method for surface segmentation by minimal paths in 3D images [J].
Ardon, Roberto ;
Cohen, Laurent D. ;
Yezzi, Anthony .
APPLIED MATHEMATICS AND OPTIMIZATION, 2007, 55 (02) :127-144
[2]  
BENMANSOUR F, 2007, MMBIA07, P1
[3]   Single quantum dot tracking based on perceptual grouping using minimal paths in a spatiotemporal volume [J].
Bonneau, S ;
Dahan, M ;
Cohen, LD .
IEEE TRANSACTIONS ON IMAGE PROCESSING, 2005, 14 (09) :1384-1395
[4]  
BONNEAU S, 2006, THESIS U PARIS DAUPH
[5]   Geodesic active contours [J].
Caselles, V ;
Kimmel, R ;
Sapiro, G .
INTERNATIONAL JOURNAL OF COMPUTER VISION, 1997, 22 (01) :61-79
[6]  
Cohen L.D., 2005, MATH MODELS COMPUTER
[7]   Global minimum for active contour models: A minimal path approach [J].
Cohen, LD ;
Kimmel, R .
INTERNATIONAL JOURNAL OF COMPUTER VISION, 1997, 24 (01) :57-78
[8]   Multiple contour finding and perceptual grouping using minimal paths [J].
Cohen, LD .
JOURNAL OF MATHEMATICAL IMAGING AND VISION, 2001, 14 (03) :225-236
[9]   Fast extraction of minimal paths in 3D images and applications to virtual endoscopy [J].
Deschamps, T ;
Cohen, LD .
MEDICAL IMAGE ANALYSIS, 2001, 5 (04) :281-299
[10]  
Dijkstra E. W., 1959, Numerische Mathematik, DOI [10.1007/BF01386390, DOI 10.1007/BF01386390]