AUB ScholarWorks

A fundamental framework for image matching based on large image features dataset

Show simple item record

dc.contributor.author Affara, Lama Ahmed.
dc.date.accessioned 2013-10-02T09:23:40Z
dc.date.available 2013-10-02T09:23:40Z
dc.date.issued 2013
dc.identifier.uri http://hdl.handle.net/10938/9657
dc.description Thesis (M.S.)--American University of Beirut, Department of Computer Science, 2013.
dc.description Advisor : Dr. Maha El Choubassi, Assistant Professor, Department of Computer Science--Committee Members : Dr. George Turkiyyah, Professor, Department of Computer Science ; Dr. Wassim El-Hajj, Assistant Professor, Department of Computer Science.
dc.description Includes bibliographical references (leaves 55-58)
dc.description.abstract Image matching is a fundamental component of various compelling applications such as object recognition, 3D-reconstruction, and image stitching. Matching images is basically applied through matching visual features. Scale Invariant Feature Transform (SIFT) [11], a state-of-the-art feature extraction approach, identifies distinctive feature keypoints in an image that are invariant to scale and orientation. The authors use the distance ratio (DR) test to match the SIFT features of two images. Although the popular DR test is simple, fast, and easily applicable to image feature matching, it is only based on heuristics. In this thesis, we aim to find a good match for a query image feature within a database of features. We apply SIFT on a huge ground truth dataset of image patches to extract the feature descriptors and compute the distances between the features. We use the Bayesian decision theory, which minimizes the probability of error, to achieve the optimal features' matching. However, the Bayesian approach is mathematically intractable in this case. Instead, we adopt a linear discriminant model (LDM) for classification. LD models, while suboptimal, are powerful classifiers and smoothly amenable to analysis. The LDM used, and especially the sorted LDM, one particular LDM classifier, is a generalization of the DR test. Leveraging the dataset of matching and non-matching distances, we thus analyse the DR test and the LDM models and investigate fitting the best model based on the structure of the images to be matched. Our analysis fundamentally justifies the capabilities of the DR test in identifying correct matches. We show that the DR test, by deciding based on the first and second minimum distance, is a particular case of the LDM classifier. However, since the DR test is conservative when classifying a feature match, we found that it misses true matches. When having a repetitive structure in the image, where the query feature matches more than one feature in the candidate matching image, the DR test ignores the
dc.format.extent xi, 58 leaves : ill. (some col.) ; 30 cm.
dc.language.iso eng
dc.relation.ispartof Theses, Dissertations, and Projects
dc.subject.classification T:005849 AUBNO
dc.subject.lcsh Image processing.
dc.subject.lcsh Image registration.
dc.subject.lcsh Three-dimensional imaging.
dc.subject.lcsh Computational intelligence.
dc.subject.lcsh Bayesian statistical decision theory.
dc.subject.lcsh Artificial intelligence.
dc.title A fundamental framework for image matching based on large image features dataset
dc.type Thesis
dc.contributor.department American University of Beirut. Faculty of Arts and Sciences. Department of Computer Science.


Files in this item

This item appears in the following Collection(s)

Show simple item record

Search AUB ScholarWorks


Browse

My Account