Non-Parametric Adaptive Approach for the Detection of Dominant Points on Boundary Curves Based on Non-Symmetric Region of Support

In this paper, we propose an efficient and effective non-parametric method for detecting dominant points on a closed boundary curve. The proposed method determines a region of support which is not necessarily symmetric for a point on a curve without requiring any input parameter. The statistical and geometrical properties associated with the small eigenvalue of the covariance matrix of a sequence of connected points are explored for determining the region of support adaptively for a point. Once the region of support of a point is determined, the reciprocal of the angle made at that point due to its left and right arms is estimated as the curvature at that point and that estimated curvature signifies the point as a dominant point. The points that bear local maxima curvature are selected as dominant points. If two or more points are selected as local maximum points within small vicinity then the point which bears longer region of support is retained. The results of the experiments conducted reveal that the proposed method is highly consistent with human perception and outperforms other well known methods.

[1]  Soo-Chang Pei,et al.  Corner point detection using nest moving average , 1994, Pattern Recognit..

[2]  Asif Masood,et al.  Optimized polygonal approximation by dominant point deletion , 2008, Pattern Recognit..

[3]  Nirwan Ansari,et al.  Non-parametric dominant point detection , 1991, Pattern Recognition.

[4]  Terence M. Cronin,et al.  A boundary concavity code to support dominant point detection , 1999, Pattern Recognit. Lett..

[5]  F. Attneave Some informational aspects of visual perception. , 1954, Psychological review.

[6]  Philippe Cornic,et al.  Another look at the dominant point detection of digital curves , 1997, Pattern Recognit. Lett..

[7]  Asif Masood,et al.  A novel approach to polygonal approximation of digital curves , 2007, J. Vis. Commun. Image Represent..

[8]  Asif Masood,et al.  Dominant point detection by reverse polygonization of digital curves , 2008, Image Vis. Comput..

[9]  P. Nagabhushan,et al.  A simple and robust line detection algorithm based on small eigenvalue analysis , 2004, Pattern Recognit. Lett..

[10]  Larry S. Davis,et al.  A Corner-Finding Algorithm for Chain-Coded Curves , 1977, IEEE Transactions on Computers.

[11]  P. Sankar,et al.  A parallel procedure for the detection of dominant points on a digital curve , 1978 .

[12]  Du-Ming Tsai,et al.  Boundary-based corner detection using eigenvalues of covariance matrices , 1999, Pattern Recognit. Lett..

[13]  Du-Ming Tsai,et al.  Boundary-based corner detection using neural networks , 1997, Pattern Recognit..

[14]  Roland T. Chin,et al.  On the Detection of Dominant Points on Digital Curves , 1989, IEEE Trans. Pattern Anal. Mach. Intell..

[15]  Azriel Rosenfeld,et al.  An Improved Method of Angle Detection on Digital Curves , 1975, IEEE Transactions on Computers.

[16]  Azriel Rosenfeld,et al.  Angle Detection on Digital Curves , 1973, IEEE Transactions on Computers.

[17]  Bimal Kumar Ray,et al.  An algorithm for detection of dominant points and polygonal approximation of digitized curves , 1992, Pattern Recognit. Lett..