General plane curve matching under affine transformations

Y. Zhu, L. D. Seneviratne, S. W.E. Earles

Research output: Contribution to conferencePaperpeer-review

Abstract

A unique solution to the parameters of an affine transformation with up to second order derivates is presented using differential variants as well as the available global information. The computational time on verification has been significantly reduced. In computer vision, derivatives are obtained by numerical means. Smoothing with a Gaussian filter modified by a linear combination of Hermite polynomials, can preserved the accuracy of continuous polynomials with powers up to the same order as the Hermite polynomials. The introduction of Hermite polynomials lead to a choice of large smoothing scale in order to reduce the computational errors, at the expense of a reduction of local controllability and over-smoothing of the curve. It is shown that using a large smoothing scale proportional to the order of the derivatives is more reliable in applications.

Original languageBritish English
Pages1425-1432
Number of pages8
StatePublished - 1996
EventProceedings of the 1996 IEEE/RSJ International Conference on Intelligent Robots and Systems, IROS. Part 3 (of 3) - Osaka, Jpn
Duration: 4 Nov 19968 Nov 1996

Conference

ConferenceProceedings of the 1996 IEEE/RSJ International Conference on Intelligent Robots and Systems, IROS. Part 3 (of 3)
CityOsaka, Jpn
Period4/11/968/11/96

Fingerprint

Dive into the research topics of 'General plane curve matching under affine transformations'. Together they form a unique fingerprint.

Cite this