Attractable snakes based on the greedy algorithm for contour extraction
Research output: Journal Publications and Reviews › RGC 21 - Publication in refereed journal › peer-review
Author(s)
Detail(s)
Original language | English |
---|---|
Pages (from-to) | 791-806 |
Journal / Publication | Pattern Recognition |
Volume | 35 |
Issue number | 4 |
Publication status | Published - Apr 2002 |
Externally published | Yes |
Link(s)
Abstract
While most improved snakes were built under the original variational scheme, this paper presents an attractable snake based on the greedy snake (Williams and Shah, CVGIP: Image Understanding 55(1) (1992) 14-26). By use of a direct feedback mechanism that is seamlessly consistent with the search strategy of the greedy algorithm, the proposed approach is capable of inheriting the simplicity and efficiency of that algorithm and performing competitively with related snakes. To avoid undesirable local minima, an overall optimal edge detector is designed. A suitable synthetic convergent criterion is proposed which enables snakes to converge normally or oscillatingly on target objects. An adaptive interpolation scheme that encourages snakes to accurately sense the details of object shapes is also described. This model is applied to extract contours from various images with encouraging results. © 2002 Pattern Recognition Society. Published by Elsevier Science Ltd. All rights reserved.
Research Area(s)
- Active contour, Edge detection, Greedy algorithm, Optimization, Segmentation, Snakes
Citation Format(s)
Attractable snakes based on the greedy algorithm for contour extraction. / Ji, Lilian; Yan, Hong.
In: Pattern Recognition, Vol. 35, No. 4, 04.2002, p. 791-806.
In: Pattern Recognition, Vol. 35, No. 4, 04.2002, p. 791-806.
Research output: Journal Publications and Reviews › RGC 21 - Publication in refereed journal › peer-review