检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:廉蔺[1] 李国辉[1,2] 张军[1] 涂丹[1]
机构地区:[1]国防科学技术大学信息系统与管理学院系统工程系,长沙410073 [2]国防科学技术大学信息系统工程国防科技重点实验室,长沙410073
出 处:《计算机辅助设计与图形学学报》2013年第6期823-831,共9页Journal of Computer-Aided Design & Computer Graphics
基 金:国家自然科学基金(60902093)
摘 要:针对传统角点的缺陷,提出一种能够提取局部结构信息的分支点检测算法.首先在梯度强度图像中按照梯度方向进行非最大抑制,得到边缘点的亚像素位置;然后利用方位一致性滤除噪声及不相关边缘的干扰,并根据倾角方向对剩余的边缘点进行分组;再对分支点的整数位置进行求精,得到分支点的亚像素位置;最后根据分支点的最优位置更新边缘点倾角,计算最优的分支边缘倾角.实验结果证明,该算法具有较好的分支点定位精度和分支边缘倾角精度,对噪声干扰及对比度变化具有较好的鲁棒性.Aiming at the shortcomings of traditional corners, a novel junction point detection algorithm which can extract local and structural information is proposed. First, sub-pixel positions of edge points are obtained using non-maximal suppression operation carried out in the gradient magnitude image according to gradient directions. Second, noises and irrelevant edges are filtered out based on azimuth consensus, and the remaining edge points are grouped relied on their inclination angles. And then, sup-pixel location of a junction points is found by a refinement strategy applied to the initial integer location of the junction. Finally, the inclination angles of edges points are updated according to the refined location of the junction, and optimal inclination angles is computed. Experimental results show that the proposed algorithm has good accuracy both in positioning and in inclination angles of branch edges, and has satisfactory robustness to noise disturbance and contrast change.
分 类 号:TP391.41[自动化与计算机技术—计算机应用技术]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.232