An Efficient and Fast Active Contour Model for Salient Object Detection

In this paper, we investigate the polarity information toimprove the active contour model proposed by Chunming etal. [12]. Unlike the traditional level set formulations, thevariational level set formulation proposed by [12] forcesthe level set function to be close to a signed distance function,and therefore completely eliminates the need of the reinitializationprocedure and speeds up the curve evolution.However, like the majority of classical active contour models,the model proposed by [12] relies on a gradient basedstopping function, depending on the image gradient, to stopthe curve evolution. Consequently, using gradient informationfor noisy and textured images, the evolving curve maypass through or stop far from the salient object boundaries.Moreover, in this case, the isotropic smoothing Gaussianhas to be strong, which will smooth the edges too. For thesereasons, we propose the use of a polarity based stoppingfunction. In fact, comparatively to the gradient information,the polarity information accurately distinguishes theboundaries or edges of the salient objects. Hence, Combiningthe polarity information with the active contour modelof [12] we obtain a fast and efficient active contour modelfor salient object detection. Experiments are performed onseveral images to show the advantage of the polarity basedactive contour.

[1]  Chunming Li,et al.  Level set evolution without re-initialization: a new variational formulation , 2005, 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05).

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

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

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

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

[6]  Olivier D. Faugeras,et al.  Reconciling Distance Functions and Level Sets , 1999, Scale-Space.

[7]  Djemel Ziou,et al.  Globally adaptive region information for automatic color-texture image segmentation , 2007, Pattern Recognit. Lett..

[8]  G. M.,et al.  Partial Differential Equations I , 2023, Applied Mathematical Sciences.

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

[10]  Vladimir Igorevich Arnold,et al.  Geometrical Methods in the Theory of Ordinary Differential Equations , 1983 .

[11]  Jerry L. Prince,et al.  Snakes, shapes, and gradient vector flow , 1998, IEEE Trans. Image Process..

[12]  Baba C. Vemuri,et al.  Shape Modeling with Front Propagation: A Level Set Approach , 1995, IEEE Trans. Pattern Anal. Mach. Intell..

[13]  Yunmei Chen,et al.  Joint Image Registration and Segmentation , 2003 .

[14]  S. Osher,et al.  Regular Article: A PDE-Based Fast Local Level Set Method , 1999 .

[15]  Benjamin B. Kimia,et al.  Shapes, shocks, and deformations I: The components of two-dimensional shape and the reaction-diffusion space , 1995, International Journal of Computer Vision.

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

[17]  Jitendra Malik,et al.  Blobworld: Image Segmentation Using Expectation-Maximization and Its Application to Image Querying , 2002, IEEE Trans. Pattern Anal. Mach. Intell..

[18]  T. Chan,et al.  A Variational Level Set Approach to Multiphase Motion , 1996 .

[19]  S. Osher,et al.  A PDE-Based Fast Local Level Set Method 1 , 1998 .

[20]  James A. Sethian,et al.  Level Set Methods and Fast Marching Methods , 1999 .