|Title||Accurate boundary localization using dynamic programming on snakes|
|Publication Type||Conference Paper|
|Year of Publication||2008|
|Authors||Mishra, A., P. Fieguth, and D. A. Clausi|
|Conference Name||4th Annual Canadian Conference on Computer and Robot Vision|
|Conference Location||Windsor, Ontario, Canada|
|Keywords||Curvature guided importance sampling, HMM, Snake, Statistical data fusion, Viterbi Algorithm|
The extraction of contours using deformable models, such as snakes, is a problem of great interest in computer vision, particular in areas of medical imaging and tracking. Snakes have been widely studied, and many methods are available. In most cases, the snake converges towards the optimal contour by minimizing a sum of internal (prior) and external (image measurement) energy terms. This approach is elegant, but frequently mis-converges in the presence of noise or complex contours.
To address these limitations, a novel discrete snake is proposed which treats the two energy terms separately. Essentially, the proposed method is a deterministic iterative statistical data fusion approach, in which the visual boundaries of the object are extracted, ignoring any prior, employing a Hidden Markov Model(HMM) and Viterbi search, and then applying importance sampling to the boundary points, on which the shape prior is asserted.
The proposed implementation is straightforward and achieves dramatic speed and accuracy improvement. Compared to four other published methods and across six different images (two original, four published), the proposed method is demonstrated to be, on average, 7 times faster with a 45 percent reduction in the mean square error. Only the proposed method was able to successfully segment the desired object in each test image