作者
DS Guru, R Dinesh, P Nagabhushan
发表日期
2004/5/17
研讨会论文
Computer and Robot Vision, 2004. Proceedings. First Canadian Conference on
页码范围
417-423
出版商
IEEE
简介
In this paper, a novel boundary based corner detection algorithm is proposed. The proposed algorithm is computationally fast and efficient. The proposed method computes an expected point for every point on a boundary curve. An expected point corresponding to a point on the boundary curve is defined to be the geometrical centroid of the symmetrical boundary segment of size 2k+1, for some integer k>0, within the neighborhood of the point in consideration. A new 'cornerity' index for a point on the boundary curve is defined to be the distance between the point and its corresponding expected point. The larger the cornerity index, the stronger is the evidence that the boundary point is a corner point. A set of rules is worked out to guide the process of locating true corner points. The conducted experiments establish that the proposed approach is invariant to image transformations viz., rotation, translation and scaling.
引用总数
2005200620072008200920102011201220132014201520162017201820192020202120223686545452211
学术搜索中的文章
DS Guru, R Dinesh, P Nagabhushan - First Canadian Conference on Computer and Robot …, 2004