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 条
[1]  
Abd El Munim HE, 2005, IEEE I CONF COMP VIS, P930
[2]  
[Anonymous], 2003, Geometric Level Set Methods in Imaging Vision and Graphics
[3]   A METHOD FOR REGISTRATION OF 3-D SHAPES [J].
BESL, PJ ;
MCKAY, ND .
IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, 1992, 14 (02) :239-256
[4]  
Blake A., 1987, VISUAL RECONSTRUCTIO
[5]   Using prior shapes in geometric active contours in a variational framework [J].
Chen, YM ;
Tagare, HD ;
Thiruvenkadam, S ;
Huang, F ;
Wilson, D ;
Gopinath, KS ;
Briggs, RW ;
Geiser, EA .
INTERNATIONAL JOURNAL OF COMPUTER VISION, 2002, 50 (03) :315-328
[6]   Curves matching using geodesic paths [J].
Cohen, I ;
Herlin, I .
1998 IEEE COMPUTER SOCIETY CONFERENCE ON COMPUTER VISION AND PATTERN RECOGNITION, PROCEEDINGS, 1998, :741-746
[7]   Shape statistics in kernel space for variational image segmentation [J].
Cremers, D ;
Kohlberger, T ;
Schnörr, C .
PATTERN RECOGNITION, 2003, 36 (09) :1929-1943
[8]  
CREMERS D, 2003, P 2 IEEE WORKSH VAR, P169
[9]   MOTION OF LEVEL SETS BY MEAN-CURVATURE .1. [J].
EVANS, LC ;
SPRUCK, J .
JOURNAL OF DIFFERENTIAL GEOMETRY, 1991, 33 (03) :635-681
[10]  
Fitzgibbon A., 2001, PROC BRIT MACHINE VI, P411