A Robust Affine Matching Algorithm Using an Exponentially Decreasing Distance Function

DMCA

A Robust Affine Matching Algorithm Using an Exponentially Decreasing Distance Function (1995)

Cached

Download Links

Other Repositories/Bibliography

DBLP

by Axel Pinz , Manfred Prantl , Harald Ganster

Venue:	Journal of Universal Computer Science
Citations:	7 - 0 self

BibTeX

@ARTICLE{Pinz95arobust,
    author = {Axel Pinz and Manfred Prantl and Harald Ganster},
    title = {A Robust Affine Matching Algorithm Using an Exponentially Decreasing Distance Function},
    journal = {Journal of Universal Computer Science},
    year = {1995},
    volume = {1},
    pages = {614--631}
}

OpenURL

Abstract

: We describe a robust method for spatial registration, which relies on the coarse correspondence of structures extracted from images, avoiding the establishment of point correspondences. These structures (tokens) are points, chains, polygons and regions at the level of intermediate symbolic representation (ISR). The algorithm recovers conformal transformations (4 affine parameters), so that 2-dimensional scenes as well as planar structures in 3D scenes can be handled. The affine transformation between two different tokensets is found by minimization of an exponentially decreasing distance function. As long as the tokensets are kept sparse, the method is very robust against a broad variety of common disturbances (e.g. incomplete segmentations, missing tokens, partial overlap). The performance of the algorithm is demonstrated using simple 2D shapes, medical, and remote sensing satellite images. The complexity of the algorithm is quadratic on the number of affine parameters. Categories:...

Keyphrases

robust affine matching algorithm exponentially decreasing distance function affine parameter different tokensets coarse correspondence point correspondence incomplete segmentation distance function satellite image broad variety robust method 2-dimensional scene planar structure affine transformation spatial registration algorithm recovers conformal transformation intermediate symbolic representation common disturbance kept sparse partial overlap

DMCA