Show simple item record

dc.contributor.authorHajjdiab Hassan
dc.contributor.authorLaganiere Robert
dc.date.accessioned2018-05-23T10:28:12Z
dc.date.available2018-05-23T10:28:12Z
dc.date.issued2009
dc.identifier.urihttps://dspace.adu.ac.ae/handle/1/1359
dc.descriptionHajjdiab, H., & Laganiere, R. (2009). Complexity analysis of featured-based image matching. World Academy of Science, Engineering and Technology, 51, 281-284.en_US
dc.description.abstractA fundamental problem in computer vision is to map a pixel in one image to a pixel in another image of the same scene. This is called the image correspondence problem. Many algorithms have been proposed in literature to solve the problem, however no rigorous analysis has been conducted to study the parameters that contribute to the complexity. The main objective of this paper is to investigate the complexity of matching feature points (pixels) between multiple views of a given scene. The advantage of this work is that a formal analysis is introduced to explore the relationship between the minimum Euclidean distance between the feature points detected on the image and the area of the search region on the overall computational time complexity of the problem.en_US
dc.language.isoen_USen_US
dc.publisherWorld Academy of Science, Engineering and Technologyen_US
dc.subjectCorrespondence problemen_US
dc.subjectComplexity Analysisen_US
dc.subjectImage Matchingen_US
dc.titleComplexity Analysis of Featured-Based Image Matchingen_US
dc.typeArticleen_US


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record