Optimal matching of general polygons based on the minimum zone error

Authors:
Jose A. Ventura;Ling-Ying Nain;Wenhua Wan
Affiliations:
-;-;-
Venue:
Pattern Recognition Letters
Year:
1995

Citing 9
Cited 1

Segmentation of two-dimensional boundaries using the chain code

Pattern Recognition
Linear programming and network flows (2nd ed.)

Linear programming and network flows (2nd ed.)
Matching polygon fragments

Pattern Recognition Letters
Inspection of 2-D objects using pattern matching method

Pattern Recognition
An Efficiently Computable Metric for Comparing Polygonal Shapes

IEEE Transactions on Pattern Analysis and Machine Intelligence
Polygonal shape recognition using string-matching techniques

Pattern Recognition
Optimal matching of nonconvex polygons

Pattern Recognition Letters
On the approximation of curves by line segments using dynamic programming

Communications of the ACM
Segmentation of Plane Curves

IEEE Transactions on Computers

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

Pattern Recognition Letters

Quantified Score

Hi-index	0.10

Visualization

Abstract

This paper presents a parametric approach for the matching of polygonal profiles based on the tolerancing requirements defined by the ANSI standards. The polygonal matching problem is formulated as a minimax optimization model and a procedure for solving this optimization model is developed.