On detecting dominant points

Nirwan Ansari, Edward J. Delp

Research output: Contribution to journalArticlepeer-review

128 Scopus citations

Abstract

Detecting dominant points is a crucial preprocessing step for shape recognition and point-based motion estimation. Polygonal approximation has been a commonly used approach in detecting dominant points. This paper presents two alternatives which detect stable dominant points. In the first method, we find a set of positive maximum and negative minimum curvature points along the Gaussian smoothed boundary, followed by a split-and-merge polygonal approximation algorithm. The resulting break points, vertices of the approximated polygon, are the dominant points. Experimental results show that dominant points obtained by this method are less sensitive to the orientation of the boundary than other polygonal approximation algorithms in the sense that the number and the location of the dominant points along the contour remain relatively unchanged. In the second method, we smooth a boundary by a Gaussian filter using various widths until the extreme curvature points remain relatively unchanged for a range of filter widths. The resulting extreme curvature points which are stable to orientation and a reasonable range of scaling are the dominant points.

Original languageEnglish (US)
Pages (from-to)441-451
Number of pages11
JournalPattern Recognition
Volume24
Issue number5
DOIs
StatePublished - Jan 1 1991

All Science Journal Classification (ASJC) codes

  • Software
  • Signal Processing
  • Computer Vision and Pattern Recognition
  • Artificial Intelligence

Keywords

  • Dominant points
  • Gaussian smoothing
  • Landmarks
  • Polygonal approximation

Fingerprint

Dive into the research topics of 'On detecting dominant points'. Together they form a unique fingerprint.

Cite this