Scale-Based Description and Recognition of Planar Curves and Two-Dimensional Shapes
IEEE Transactions on Pattern Analysis and Machine Intelligence
Three-dimensional object recognition from single two-dimensional images
Artificial Intelligence
On the Detection of Dominant Points on Digital Curves
IEEE Transactions on Pattern Analysis and Machine Intelligence
Non-parametric dominant point detection
Pattern Recognition
An algorithm for detection of dominant points and polygonal approximation of digitized curves
Pattern Recognition Letters
Optimum polygonal approximation of digitized curves
Pattern Recognition Letters
IEEE Transactions on Pattern Analysis and Machine Intelligence
Techniques for Assessing Polygonal Approximations of Curves
IEEE Transactions on Pattern Analysis and Machine Intelligence
Convexity rule for shape decomposition based on discrete contour evolution
Computer Vision and Image Understanding
A boundary concavity code to support dominant point detection
Pattern Recognition Letters
Image Editing in the Contour Domain
IEEE Transactions on Pattern Analysis and Machine Intelligence
Reduced-search dynamic programming for approximation of polygonal curves
Pattern Recognition Letters
Hierarchical representation of digitized curves through dominant point detection
Pattern Recognition Letters
Eye Gaze Correction with Stereovision for Video-Teleconferencing
IEEE Transactions on Pattern Analysis and Machine Intelligence
Polygonal approximation of closed discrete curves
Pattern Recognition
A novel approach to polygonal approximation of digital curves
Journal of Visual Communication and Image Representation
Iterative area filtering of multichannel images
Image and Vision Computing
Dominant point detection by reverse polygonization of digital curves
Image and Vision Computing
Polygonal approximation of digital planar curves through break point suppression
Pattern Recognition
Data reduction of large vector graphics
Pattern Recognition
A discrete geometry approach for dominant point detection
Pattern Recognition
A new measurement for assessing polygonal approximation of curves
Pattern Recognition
Edge curvature and convexity based ellipse detection method
Pattern Recognition
Fast Polygonal Approximation of Digital Curves Using Relaxed Straightness Properties
IEEE Transactions on Pattern Analysis and Machine Intelligence
Hi-index | 0.00 |
Most dominant point detection methods require heuristically chosen control parameters. One of the commonly used control parameter is maximum deviation. This paper uses a theoretical bound of the maximum deviation of pixels obtained by digitization of a line segment for constructing a general framework to make most dominant point detection methods non-parametric. The derived analytical bound of the maximum deviation can be used as a natural bench mark for the line fitting algorithms and thus dominant point detection methods can be made parameter-independent and non-heuristic. Most methods can easily incorporate the bound. This is demonstrated using three categorically different dominant point detection methods. Such non-parametric approach retains the characteristics of the digital curve while providing good fitting performance and compression ratio for all the three methods using a variety of digital, non-digital, and noisy curves.