返回
A fast minimal path active contour model
DOI:10.1109/83.923283.png)
摘要
En 中文
A new minimal path active contour model for boundary extraction is presented. Implementing the new approach requires four steps 1) users place some initial end points on or near the desired boundary through an interactive interface; 2) potential searching window is defined between two end points; 3) graph search method based on conic curves is used to search the boundary; 4) wriggling procedure is used to calibrate the contour and reduce sensitivity of the search results on the selected initial end points. The last three steps are performed automatically. In the proposed approach, the potential window systematically provides a new node connection for the later graph search, which is different from the row-by-row and column-by-column methods used in the classical graph search. Furthermore, this graph search also suggests ways to design a wriggling procedure to evolve the contour in the direction nearly perpendicular to itself by creating a list of displacement vectors in the potential window. The proposed minimal path active contour model speeds up the search and reduces the metrication error frequently encountered in the classical graph search methods e,g,, the dynamic programming minimal path (DPMP) method.
Keyword:
active contour model
graph search
potential window
wriggling
AI总结
对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
13.7
论文数:
1.0W
被引数:
8.4W
机构
暂无机构信息
引用论文
Damage Identification Algorithm of Hinged Joints for Simply Supported Slab Bridges Based on Modified Hinge Plate Method and Artificial Bee Colony Algorithms
Algorithms
IF0
Development and Validation of the University of Washington Clinical Assessment of Music Perception Test华盛顿大学音乐知觉临床评估测试的开发和验证
Accelerated urban sprawl in Montreal, Quebec City, and Zurich: Investigating the differences using time series 1951–2011蒙特利尔,魁北克市和苏黎世的加速城市蔓延: 使用时间序列1951 2011调查差异

