Simultaneous Tracking of Multiple Objects Using Fast Level Set-Like Algorithm

A topological flexibility of implicit active contours is of great benefit, since it allows simultaneous detection of several objects without any a priori knowledge about their number and shapes. However, in tracking applications it is often required to keep desired objects mutually separated as well as allow each object to evolve itself, i.e. different objects cannot be merged together, but each object can split into several regions that can be merged again later in time. The former can be achieved by applying topology-preserving constraints exploiting either various repelling forces or the simple point concept from digital geometry, which brings, however, an indispensable increase in the execution time and also prevent the latter. In this paper, we propose more efficient and more flexible topology-preserving constraint based on a region indication function, that can be easily integrated into a fast level set-like algorithm by Maska et al. (2010) in order to obtain a fast and robust algorithm for simultaneous tracking of multiple objects. The potential of the modified algorithm is demonstrated on both synthetic and real image data.

[1]  Pavel Matula,et al.  A Fast Level Set-Like Algorithm for Region-Based Active Contours , 2010, ISVC.

[2]  Tony F. Chan,et al.  Active contours without edges , 2001, IEEE Trans. Image Process..

[3]  V. Caselles,et al.  A geometric model for active contours in image processing , 1993 .

[4]  Michael Unser,et al.  B-spline snakes: a flexible tool for parametric contour detection , 2000, IEEE Trans. Image Process..

[5]  Ross T. Whitaker,et al.  A Level-Set Approach to 3D Reconstruction from Range Data , 1998, International Journal of Computer Vision.

[6]  F. Santosa,et al.  A topology-preserving level set method for shape optimization , 2004, math/0405142.

[7]  W. Clem Karl,et al.  A Real-Time Algorithm for the Approximation of Level-Set-Based Curve Evolution , 2008, IEEE Transactions on Image Processing.

[8]  Roman Goldenberg,et al.  Fast Geodesic Active Contours , 1999, Scale-Space.

[9]  Anders Heyden,et al.  A fast algorithm for level set-like active contours , 2003, Pattern Recognit. Lett..

[10]  J A Sethian,et al.  A fast marching level set method for monotonically advancing fronts. , 1996, Proceedings of the National Academy of Sciences of the United States of America.

[11]  D. Mumford,et al.  Optimal approximations by piecewise smooth functions and associated variational problems , 1989 .

[12]  Demetri Terzopoulos,et al.  Snakes: Active contour models , 2004, International Journal of Computer Vision.

[13]  Xiao Han,et al.  A Topology Preserving Level Set Method for Geometric Deformable Models , 2003, IEEE Trans. Pattern Anal. Mach. Intell..

[14]  Grégoire Malandain,et al.  Fast characterization of 3D simple points , 1992, Proceedings., 11th IAPR International Conference on Pattern Recognition. Vol. III. Conference C: Image, Speech and Signal Analysis,.

[15]  J. Sethian,et al.  A Fast Level Set Method for Propagating Interfaces , 1995 .

[16]  Xue-Cheng Tai,et al.  A binary level set model and some applications to Mumford-Shah image segmentation , 2006, IEEE Transactions on Image Processing.

[17]  W. Clem Karl,et al.  Real-time tracking using level sets , 2005, 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05).

[18]  Anthony J. Yezzi,et al.  Curve evolution implementation of the Mumford-Shah functional for image segmentation, denoising, interpolation, and magnification , 2001, IEEE Trans. Image Process..

[19]  Jiangwen Deng,et al.  A fast level set method for segmentation of low contrast noisy biomedical images , 2002, Pattern Recognit. Lett..

[20]  Ronald Fedkiw,et al.  Level set methods and dynamic implicit surfaces , 2002, Applied mathematical sciences.

[21]  Guillermo Sapiro,et al.  Geodesic Active Contours , 1995, International Journal of Computer Vision.

[22]  Pavel Matula,et al.  A Fast Level Set-Like Algorithm with Topology Preserving Constraint , 2009, CAIP.

[23]  J. Sethian,et al.  Fronts propagating with curvature-dependent speed: algorithms based on Hamilton-Jacobi formulations , 1988 .

[24]  Luminita A. Vese,et al.  Self-Repelling Snakes for Topology-Preserving Segmentation Models , 2008, IEEE Transactions on Image Processing.

[25]  Xiaofeng Wang,et al.  An efficient local Chan-Vese model for image segmentation , 2010, Pattern Recognit..