Improving fitting quality of polygonal approximation by using the dynamic programming technique

Authors:
Ji-Hwei Horng
Affiliations:
Department of Information Management, National Kaohsiung University of Applied Sciences, Kinmen Campus, Taiwan, ROC
Venue:
Pattern Recognition Letters
Year:
2002

Citing 19
Cited 10

Frequency Domain Analysis and Synthesis of Image Pyramid Generating Kernels

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
A new approach to polygonal approximation

Pattern Recognition Letters
Non-parametric dominant point detection

Pattern Recognition
Scale-Based Detection of Corners of 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 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 non-parametric sequential method for polygonal approximation of digital curves

Pattern Recognition Letters
Optimum polygonal approximation of digitized curves

Pattern Recognition Letters
A new split-and-merge technique for polygonal approximation of chain coded curves

Pattern Recognition Letters
Segmentation of digital plane curves: a dynamic focusing approach

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

Pattern Recognition Letters
An effective algorithm for the segmentation of digital plane curves - The isoparametric formulation

Pattern Recognition Letters
A new method for polygonal approximation using genetic algorithms

Pattern Recognition Letters
A boundary concavity code to support dominant point detection

Pattern Recognition Letters
On Critical Point Detection of Digital Shapes

IEEE Transactions on Pattern Analysis and Machine Intelligence
An automatic and efficient dynamic programming algorithm for polygonal approximation of digital curves

Pattern Recognition Letters
A rotationally invariant two-phase scheme for corner detection

Pattern Recognition

Hierarchical representation of digitized curves through dominant point detection

Pattern Recognition Letters
Polygonal approximation of closed discrete curves

Pattern Recognition
Optimized polygonal approximation by dominant point deletion

Pattern Recognition
A PSO-Based Method for Min-ε Approximation of Closed Contour Curves

ISNN '08 Proceedings of the 5th international symposium on Neural Networks: Advances in Neural Networks
A genetic algorithm with chromosome-repairing for min-# and min-ε polygonal approximation of digital curves

Journal of Visual Communication and Image Representation
Polygonal approximation of digital planar curves through break point suppression

Pattern Recognition
Multiprimitive segmentation based on meaningful breakpoints for fitting digital planar curves with line segments and conic arcs

Image and Vision Computing
Tabu split and merge for the simplification of polygonal curves

SMC'09 Proceedings of the 2009 IEEE international conference on Systems, Man and Cybernetics
ISE-bounded polygonal approximation of digital curves

Pattern Recognition Letters
A moment-based polygonal approximation algorithm for regular digital curves

Proceedings of the Fifth International Conference on Internet Multimedia Computing and Service

Quantified Score

Hi-index	0.10

Visualization

Abstract

The dynamic programming technique is applied to improve the fitting quality of polygonal approximation. The dominant points of a digital curve are detected by applying a scale-based approach. Then, a polygonal approximation of the digital curve can be obtained by connecting its dominant points. The fitting quality of the polygonal approximation is improved by using a novel dynamic programming algorithm. The combination of the dominant point detection and the dynamic programming can produce a description that has high geometric importance and good fitting quality. Experimental results are provided and compared with several existing methods to show the excellence of the proposed method.