Sciweavers

Share
ICIP
2008
IEEE

Robust snake convergence based on dynamic programming

9 years 4 months ago
Robust snake convergence based on dynamic programming
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 dramati...
Akshaya Kumar Mishra, Paul W. Fieguth, David A. Cl
Added 20 Oct 2009
Updated 27 Oct 2009
Type Conference
Year 2008
Where ICIP
Authors Akshaya Kumar Mishra, Paul W. Fieguth, David A. Clausi
Comments (0)
books