Full metadata record
DC FieldValueLanguage
dc.contributor.authorHast, Anders
dc.contributor.authorNysjö, Johan
dc.contributor.authorMarchetti, Andrea
dc.contributor.editorSkala, Václav
dc.identifier.citationJournal of WSCG. 2013, vol. 21, no. 1, p.en
dc.identifier.issn1213–6972 (hardcopy)
dc.identifier.issn1213-6980 (CD-ROM)
dc.identifier.issn1213–6964 (on-line)
dc.description.abstractA novel idea on how to make RANSAC repeatable is presented, which will find the optimal set in nearly every run for certain types of applications. The proposed algorithm can be used for such transformations that can be constructed by more than the minimal points required. We give examples on matching of aerial images using the Direct Linear Transformation, which requires at least four points. Moreover, we give examples on how the algorithm can be used for finding a plane in 3D using three points or more. Due to its random nature, standard RANSAC is not always able to find the optimal set even for moderately contaminated sets and it usually performs badly when the number of inliers is less than 50%. However, our algorithm is capable of finding the optimal set for heavily contaminated sets, even for an inlier ratio under 5%. The proposed algorithm is based on several known methods, which we modify in a unique way and together they produce a result that is quite different from what each method can produce on its own.en
dc.format10 s.cs
dc.publisherVáclav Skala - Union Agencycs
dc.relation.ispartofseriesJournal of WSCGen
dc.rights© Václav Skala - UNION Agencycs
dc.subjectletecké snímkycs
dc.subjectkombinování snímkůcs
dc.subjectrozpoznání tvarucs
dc.titleOptimal RANSAC - Towards a Repeatable Algorithm for Finding the Optimal Seten
dc.subject.translatedaerial imagesen
dc.subject.translatedimage stitchingen
dc.subject.translatedfeature matchingen
Appears in Collections:Volume 21, Number 1 (2013)

Files in This Item:
File Description SizeFormat 
Hast.pdfPlný text6,2 MBAdobe PDFView/Open

Please use this identifier to cite or link to this item: http://hdl.handle.net/11025/6869

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.