Curve/surface representation and evolution using vector level sets with application to the shape-based segmentation problem

被引:29
作者
El Munim, Hossam E. Abd [1 ]
Farag, Aly A. [1 ]
机构
[1] Univ Louisville, Comp Vis & Image Proc Lab, CVIP LAB Dept Elect & Comp Engn, Louisville, KY 40292 USA
关键词
shape representation; level sets; deformable models; shape-based segmentation; IMAGE; REGISTRATION; INFORMATION; OBJECTS; SNAKES;
D O I
10.1109/TPAMI.2007.1100
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
In this paper, we revisit the implicit front representation and evolution using the vector level set function (VLSF) proposed in [1]. Unlike conventional scalar level sets, this function is designed to have a vector form. The distance from any point to the nearest point on the front has components (projections) in the coordinate directions included in the vector function. This kind of representation is used to evolve closed planar curves and 3D surfaces as well. Maintaining the VLSF property as the distance projections through evolution will be considered together with a detailed derivation of the vector partial differential equation (PDE) for such evolution. A shape-based segmentation framework will be demonstrated as an application of the given implicit representation. The proposed level set function system will be used to represent shapes to give a dissimilarity measure in a variational object registration process. This kind of formulation permits us to better control the process of shape registration, which is an important part in the shape-based segmentation framework. The method depends on a set of training shapes used to build a parametric shape model. The color is taken into consideration besides the shape prior information. The shape model is fitted to the image volume by registration through an energy minimization problem. The approach overcomes the conventional methods problems like point correspondences and weighing coefficients tuning of the evolution (PDEs). It is also suitable for multidimensional data and computationally efficient. Results in 2D and 3D of real and synthetic data will demonstrate the efficiency of the framework.
引用
收藏
页码:945 / 958
页数:14
相关论文
共 36 条
[11]   Cortex segmentation: A fast variational geometric approach [J].
Goldenberg, R ;
Kimmel, R ;
Rivlin, E ;
Rudzsky, M .
IEEE TRANSACTIONS ON MEDICAL IMAGING, 2002, 21 (12) :1544-1551
[12]   The Vector Distance Functions [J].
Gomes, J ;
Faugeras, O .
INTERNATIONAL JOURNAL OF COMPUTER VISION, 2003, 52 (2-3) :161-187
[13]  
GOMES J, 1999, 3666 INRIA
[14]  
GOMES J, 2000, 4011 INRIA
[15]   Shape registration in implicit spaces using information theory and free form deformations [J].
Huang, Xiaolei ;
Paragios, Nikos ;
Metaxas, Dimitris N. .
IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, 2006, 28 (08) :1303-1318
[16]  
Huang XL, 2003, LECT NOTES COMPUT SC, V2879, P926
[17]  
Huang XL, 2004, PROC CVPR IEEE, P496
[18]   Recognizing objects by matching oriented points [J].
Johnson, AE ;
Hebert, M .
1997 IEEE COMPUTER SOCIETY CONFERENCE ON COMPUTER VISION AND PATTERN RECOGNITION, PROCEEDINGS, 1997, :684-689
[19]   SNAKES - ACTIVE CONTOUR MODELS [J].
KASS, M ;
WITKIN, A ;
TERZOPOULOS, D .
INTERNATIONAL JOURNAL OF COMPUTER VISION, 1987, 1 (04) :321-331
[20]   Multidimensional alignment using the Euclidean distance transform [J].
Kozinska, D ;
Tretiak, OJ ;
Nissanov, J ;
Ozturk, C .
GRAPHICAL MODELS AND IMAGE PROCESSING, 1997, 59 (06) :373-387