检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
机构地区:[1]陕西师范大学计算机科学学院,西安710062
出 处:《计算机应用》2008年第10期2633-2635,共3页journal of Computer Applications
基 金:陕西省自然科学基金资助项目(2005A12)
摘 要:将图割理论与GVF Snake模型有机结合,提出了一种凹型目标的快速提取算法。首先用图割算法对初始轮廓线迭代变形,使其在快速提取非凹型段目标边界的同时将轮廓线有效地置于梯度矢量流力场的"有效逼近域"内,然后用GVF Snake算法继续对轮廓线迭代变形,提取凹型段目标边界。实验表明,该算法能快速、准确提取凹型目标。Combining Gradient Vector Flow (GVF) Snake model with graph cuts theory, a fast concave object extraction algorithm was proposed. First the initial contour was deformed with the graph cuts algorithm, which could put the initial contour in the valid approach region of the GVF field to extract non-concave part of the object boundary. Then the active contour was input to Snake model and began its evolvement to concave part of the object boundary. Experimental results show that the algorithm can converge to concave object boundary fast and accurately.
分 类 号:TP391.41[自动化与计算机技术—计算机应用技术]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.15