首页 | 本学科首页   官方微博 | 高级检索  
     


Search strategies for shape regularized active contour
Authors:Tianli Yu  Jiebo Luo  Narendra Ahuja  
Affiliation:aLike.com, 3 Waters Park Drive San Mateo, CA 94403, USA;bKodak R&D Labs, Foundation Science Center, Eastman Kodak Company, Rochester, NY 14650, USA;cBeckman Institute for Advanced Science and Technology, University of Illinois at Urbana-Champaign, 405 N. Mathews Ave., Urbana, IL 61801, USA
Abstract:Nonlinear shape models have been shown to improve the robustness and flexibility of contour-based object segmentation when there are appearance ambiguities between the object and the background. In this paper, we focus on a new search strategy for the shape regularized active contour (ShRAC) model, which adopts existing nonlinear shape models to segment objects that are similar to a set of training shapes. The search for optimal contour is performed by a coarse-to-fine algorithm that iterates between combinatorial search and gradient-based local optimization. First, multi-solution dynamic programming (MSDP) is used to generate initial candidates by minimizing only the image energy. In the second step, a combination of image energy and shape energy is minimized starting from these initial candidates using a local optimization method and the best one is selected. To generate diverse initial candidates while reducing invalid shapes, we apply two pruning methods to the search space of MSDP. Our search strategy combines the advantages of global combinatorial search and local optimization, and has shown excellent robustness to local minima caused by distracting suboptimal solutions. Experimental results on segmentation of different anatomical structures using ShRAC, as well as preliminary results on human silhouette segmentation are provided.
Keywords:Active contour  Object segmentation  Dynamic programming  Local optimization  Nonlinear shape models
本文献已被 ScienceDirect 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号