A Robust Affine Matching Algorithm Using an Exponentially Decreasing Distance Function

Простая страница элемента
dc.creatorPinz,Axel
dc.creatorPrantl,Manfred
dc.creatorGanster,Harald
dc.date1995
dc.date.accessioned2024-02-06T12:47:53Z
dc.date.available2024-02-06T12:47:53Z
dc.descriptionWe 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.
dc.formattext/html
dc.identifierhttps://doi.org/10.3217/jucs-001-08-0614
dc.identifierhttps://lib.jucs.org/article/27154/
dc.identifier.urihttps://openrepository.mephi.ru/handle/123456789/6838
dc.languageen
dc.publisherJournal of Universal Computer Science
dc.relationinfo:eu-repo/semantics/altIdentifier/eissn/0948-6968
dc.relationinfo:eu-repo/semantics/altIdentifier/pissn/0948-695X
dc.rightsinfo:eu-repo/semantics/openAccess
dc.rightsJ.UCS License
dc.sourceJUCS - Journal of Universal Computer Science 1(8): 614-631
dc.subjectAffine Matching
dc.subjectSpatial Registration
dc.subjectInformation Fusion
dc.subjectImage Understanding
dc.titleA Robust Affine Matching Algorithm Using an Exponentially Decreasing Distance Function
dc.typeResearch Article
Файлы
Коллекции