Issue No. 02 - February (2011 vol. 33)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/TPAMI.2010.83
Akshaya Kumar Mishra , University of Waterloo, Waterloo
Paul W. Fieguth , University of Waterloo, Waterloo
David A. Clausi , University of Waterloo, Waterloo
The accurate detection of object boundaries via active contours is an ongoing research topic in computer vision. Most active contours converge toward some desired contour by minimizing a sum of internal (prior) and external (image measurement) energy terms. Such an approach is elegant, but suffers from a slow convergence rate and frequently misconverges in the presence of noise or complex contours. To address these limitations, a decoupled active contour (DAC) is developed which applies the two energy terms separately. Essentially, the DAC consists of a measurement update step, employing a Hidden Markov Model (HMM) and Viterbi search, and then a separate prior step, which modifies the updated curve based on the relative strengths of the measurement uncertainty and the nonstationary prior. By separating the measurement and prior steps, the algorithm is less likely to misconverge; furthermore, the use of a Viterbi optimizer allows the method to converge far more rapidly than energy-based iterative solvers. The results clearly demonstrate that the proposed approach is robust to noise, can capture regions of very high curvature, and exhibits limited dependence on contour initialization or parameter settings. Compared to five other published methods and across many image sets, the DAC is found to be faster with better or comparable segmentation accuracy.
Snake, deformable model, active contour, importance sampling, Viterbi algorithm, statistical data fusion.
P. W. Fieguth, A. K. Mishra and D. A. Clausi, "Decoupled Active Contour (DAC) for Boundary Detection," in IEEE Transactions on Pattern Analysis & Machine Intelligence, vol. 33, no. , pp. 310-324, 2010.