Share Email Print

Proceedings Paper

Pattern matching by scan-converting polygons
Format Member Price Non-Member Price
PDF $17.00 $21.00

Paper Abstract

Pattern matching is one of the well-known pattern recognition techniques. When using points as matching features, a pattern matching problem becomes a point pattern matching problem. This paper proposes a novel point pattern matching algorithm that searches transformation space by transformation sampling. The algorithm defines a constraint set (a polygonal region in transformation space) for each possible pairing of a template point and a target point. Under constrained polynomial transformations that have no more than two parameters on each coordinate, the constraint sets and the transformation space can be represented as Cartesian products of 2D polygonal regions. The algorithm then rasterizes the transformation space into a discrete canvas and calculates the optimal matching at each sampled transformation efficiently by scan-converting polygons. Preliminary experiments on randomly generated point patterns show that the algorithm is effective and efficient. In addition, the running time of the algorithm is stable with respect to missing points.

Paper Details

Date Published: 15 July 2004
PDF: 10 pages
Proc. SPIE 5438, Visual Information Processing XIII, (15 July 2004);
Show Author Affiliations
Mingtian Ni, Univ. of Nebraska/Lincoln (United States)
Stephen E. Reichenbach, Univ. of Nebraska/Lincoln (United States)

Published in SPIE Proceedings Vol. 5438:
Visual Information Processing XIII
Zia-ur Rahman; Robert A. Schowengerdt; Stephen E. Reichenbach, Editor(s)

© SPIE. Terms of Use
Back to Top
Sign in to read the full article
Create a free SPIE account to get access to
premium articles and original research
Forgot your username?