BMVC IndexControllability and Observability: Tools for Kalman Filter DesignComputer Vision: TechniqueSpatial Filtering Requirements for Gradient-Based Optical Flow Measurement

Planar Curve Representation and Matching
View the PDF File

M. Al-Khaiyat, F. Kamangar

The University of Texas at Arlington
P.O. Box 194309
Arlington
Texas 76019 USA

Contact: mkhaiy@uta.edu

Abstract

In this paper, we discuss a method for representing and matching planar curves. The technique is based on using calculations from concentric circles to represent each curve by two sets of angles. The angles are defined by vectors constructed from the center point of the circles and the points on the curve trace that intersect each circle. The circles have incrementally increasing radii represented by the minimum radius and the radius increment value. The number of circles used specifies the level of abstraction at which the curves are represented. This representation is invariant to translation and rotation transformations. Experiments with different classes of curves have shown that our technique is robust to digitization errors and noise effects, and can perform well when the number of concentric circles are relatively small. In particular, we describe the potential applicability of this technique to fingerprint identification problem.

Keywords: Curve Matching, Fingerprint Recognition
Search the full conference index by: Title Author Keyword 
View the full paper as:  PDF 
BMVC IndexControllability and Observability: Tools for Kalman Filter DesignComputer Vision: TechniqueSpatial Filtering Requirements for Gradient-Based Optical Flow Measurement

This page created by John N. Carter on 09/10/98