Polygonal approximation of digital planar curves through break point suppression

Authors:
A. Carmona-Poyato;F. J. Madrid-Cuevas;R. Medina-Carnicer;R. Muñoz-Salinas
Affiliations:
Department of Computing and Numerical Analysis, Córdoba University, 14071 Córdoba, Spain;Department of Computing and Numerical Analysis, Córdoba University, 14071 Córdoba, Spain;Department of Computing and Numerical Analysis, Córdoba University, 14071 Córdoba, Spain;Department of Computing and Numerical Analysis, Córdoba University, 14071 Córdoba, Spain
Venue:
Pattern Recognition
Year:
2010

Citing 34
Cited 11

Three-dimensional object recognition from single two-dimensional images

Artificial Intelligence
Finding Trajectories of Feature Points in a Monocular Image Sequence

IEEE Transactions on Pattern Analysis and Machine 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
A Theory of Multiscale, Curvature-Based Shape Representation for Planar Curves

IEEE Transactions on Pattern Analysis and Machine Intelligence
Detection of significant points and polygonal approximation of digitized curves

Pattern Recognition Letters
An algorithm for detection of dominant points and polygonal approximation of digitized curves

Pattern Recognition Letters
A simple algorithm for detection of significant vertices for polygonal approximation of chain-coded curves

Pattern Recognition Letters
Matching Point Features with Ordered Geometric, Rigidity, and Disparity Constraints

IEEE Transactions on Pattern Analysis and Machine Intelligence
Optimum polygonal approximation of digitized curves

Pattern Recognition Letters
Another look at the dominant point detection of digital curves

Pattern Recognition Letters
Techniques for Assessing Polygonal Approximations of Curves

IEEE Transactions on Pattern Analysis and Machine Intelligence
The DEDALE system for complex spatial queries

SIGMOD '98 Proceedings of the 1998 ACM SIGMOD international conference on Management of data
2D object recognition based on curvature functions obtained from local histograms of the contour chain code

Pattern Recognition Letters
Planar shape recognition by directional flow-change method

Pattern Recognition Letters
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
An efficient algorithm for the optimal polygonal approximation of digitized curves

Pattern Recognition Letters
Chord-to-point distance accumulation and planar curvature: a new approach to discrete curvature

Pattern Recognition Letters
Silhouette-Based Isolated Object Recognition through Curvature Scale Space

IEEE Transactions on Pattern Analysis and Machine Intelligence
On Critical Point Detection of Digital Shapes

IEEE Transactions on Pattern Analysis and Machine Intelligence
Improving fitting quality of polygonal approximation by using the dynamic programming technique

Pattern Recognition Letters
An automatic and efficient dynamic programming algorithm for polygonal approximation of digital curves

Pattern Recognition Letters
Multiscale contour corner detection based on local natural scale and wavelet transform

Image and Vision Computing
A novel approach to polygonal approximation of digital curves

Journal of Visual Communication and Image Representation
Optimized polygonal approximation by dominant point deletion

Pattern Recognition
A Corner-Finding Algorithm for Chain-Coded Curves

IEEE Transactions on Computers
An Improved Method of Angle Detection on Digital Curves

IEEE Transactions on Computers
Dominant point detection by reverse polygonization of digital curves

Image and Vision Computing
Novel efficient two-pass algorithm for closed polygonal approximation based on LISE and curvature constraint criteria

Journal of Visual Communication and Image Representation
Angle Detection on Digital Curves

IEEE Transactions on Computers
Dominant point detection: A new proposal

Image and Vision Computing
Corner detection and curve segmentation by multiresolution chain-code linking

Pattern Recognition
Curvature and Tangential Deflection of Discrete Arcs: A Theory Based on the Commutator of Scatter Matrix Pairs and Its Application to Vertex Detection in Planar Shape Data

IEEE Transactions on Pattern Analysis and Machine Intelligence

Polygonal approximation of digital planar curves through adaptive optimizations

Pattern Recognition Letters
A new measurement for assessing polygonal approximation of curves

Pattern Recognition
A line-based representation for matching words in historical manuscripts

Pattern Recognition Letters
A method for recognizing overlapping elliptical bubbles in bubble image

Pattern Recognition Letters
A non-heuristic dominant point detection based on suppression of break points

ICIAR'12 Proceedings of the 9th international conference on Image Analysis and Recognition - Volume Part I
On stop conditions about methods to obtain polygonal approximations relied on break point suppression

Image and Vision Computing
On the generation and pruning of skeletons using generalized Voronoi diagrams

Pattern Recognition Letters
A novel framework for making dominant point detection methods non-parametric

Image and Vision Computing
Polygonal approximation of digital planar curves through vertex betweenness

Information Sciences: an International Journal
Contour-based shape representation using principal curves

Pattern Recognition
ε-Isometry based shape approximation for image content representation

Signal Processing

Quantified Score

Hi-index	0.01

Visualization

Abstract

This paper presents a new algorithm that detects a set of dominant points on the boundary of an eight-connected shape to obtain a polygonal approximation of the shape itself. The set of dominant points is obtained from the original break points of the initial boundary, where the integral square is zero. For this goal, most of the original break points are deleted by suppressing those whose perpendicular distance to an approximating straight line is lower than a variable threshold value. The proposed algorithm iteratively deletes redundant break points until the required approximation, which relies on a decrease in the length of the contour and the highest error, is achieved. A comparative experiment with another commonly used algorithm showed that the proposed method produced efficient and effective polygonal approximations for digital planar curves with features of several sizes.