.png){kind=icon}
返回
Attractable snakes based on the greedy algorithm for contour extraction
.png){kind=icon}
PRE
AI
DOI：10.1016/S0031-3203(01)00085-1.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
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. (C) 2002 Pattern Recognition Society. Published by Elsevier Science Ltd. All rights reserved.
Keyword:
segmentation
active contour
snakes
edge detection
optimization
greedy algorithm
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
7.6
论文数:
1.3W
被引数:
4.5W
机构
暂无机构信息
引用论文
Reinvestigation of Metal Ion Specificity for Quinone Cofactor Biogenesis in Bacterial Copper Amine Oxidase,.png)
Biochemistry
BiochemistryIF0
PREAI
分享收藏分享收藏
分享收藏
查看更多内容