Image matching using relational graph representation

Image matching is a process to establish correspondence between primitives of two or more images that capturing a scene from different viewing position. Various image matching techniques using image features have been known in literature. Feature-based matching algorithm cannot tackle the problem of...

Full description

Saved in:

Bibliographic Details
Main Author:	Lai, Chui Yen
Format:	Thesis
Language:	English
Published:	2005
Subjects:	QA75 Electronic computers Computer science
Online Access:	http://eprints.utm.my/id/eprint/4179/1/LaiChuiYenMFSKSM2005.pdf
Tags:	Add Tag No Tags, Be the first to tag this record!

id	my-utm-ep.4179
record_format	uketd_dc
spelling	my-utm-ep.41792018-01-15T07:21:03Z Image matching using relational graph representation 2005-06 Lai, Chui Yen QA75 Electronic computers. Computer science Image matching is a process to establish correspondence between primitives of two or more images that capturing a scene from different viewing position. Various image matching techniques using image features have been known in literature. Feature-based matching algorithm cannot tackle the problem of matching ambiguities easily. This study presents an image matching technique using the structural descriptions of image. Structural descriptions are consist of lines and interline relationship in the line-extracted image. Three conditions of inter-line relationship, namely ordering, intersection and co-linearity, were defined and derived in this study. The method involves the representation of the structural descriptions of image in relational graph and the matching between relational graphs to perform image matching. The methodology is consists of six steps: (1) input image, (2) line segment extraction from the image, (3) the interpretation and derivation of structural descriptions from the line-extracted image, (4) the construction of relational graph to represent the structural descriptions, (5) the derivation of association graph from relational graphs to perform relational graph matching, and (6) the searching of the largest maximal clique in the association graph to determine the best matching. Hence, image matching is transformed as a relational graph matching problem in this study. Experiments are carried out to evaluate the applicability of incorporating structural information into the image matching algorithm. The data is consisting of 14 pairs of stereo images. From the result obtained, it was found that the usage of structural information of image is only plausible for the matching of images of simple scene. The matching accuracy of images of complicated scene remains low even after the incorporation of inter-line descriptions into the image matching algorithm. 2005-06 Thesis http://eprints.utm.my/id/eprint/4179/ http://eprints.utm.my/id/eprint/4179/1/LaiChuiYenMFSKSM2005.pdf application/pdf en public masters Universiti Teknologi Malaysia, Faculty of Computer Science and Information System Faculty of Computer Science and Information System
institution	Universiti Teknologi Malaysia
collection	UTM Institutional Repository
language	English
topic	QA75 Electronic computers Computer science
spellingShingle	QA75 Electronic computers Computer science Lai, Chui Yen Image matching using relational graph representation
description	Image matching is a process to establish correspondence between primitives of two or more images that capturing a scene from different viewing position. Various image matching techniques using image features have been known in literature. Feature-based matching algorithm cannot tackle the problem of matching ambiguities easily. This study presents an image matching technique using the structural descriptions of image. Structural descriptions are consist of lines and interline relationship in the line-extracted image. Three conditions of inter-line relationship, namely ordering, intersection and co-linearity, were defined and derived in this study. The method involves the representation of the structural descriptions of image in relational graph and the matching between relational graphs to perform image matching. The methodology is consists of six steps: (1) input image, (2) line segment extraction from the image, (3) the interpretation and derivation of structural descriptions from the line-extracted image, (4) the construction of relational graph to represent the structural descriptions, (5) the derivation of association graph from relational graphs to perform relational graph matching, and (6) the searching of the largest maximal clique in the association graph to determine the best matching. Hence, image matching is transformed as a relational graph matching problem in this study. Experiments are carried out to evaluate the applicability of incorporating structural information into the image matching algorithm. The data is consisting of 14 pairs of stereo images. From the result obtained, it was found that the usage of structural information of image is only plausible for the matching of images of simple scene. The matching accuracy of images of complicated scene remains low even after the incorporation of inter-line descriptions into the image matching algorithm.
format	Thesis
qualification_level	Master's degree
author	Lai, Chui Yen
author_facet	Lai, Chui Yen
author_sort	Lai, Chui Yen
title	Image matching using relational graph representation
title_short	Image matching using relational graph representation
title_full	Image matching using relational graph representation
title_fullStr	Image matching using relational graph representation
title_full_unstemmed	Image matching using relational graph representation
title_sort	image matching using relational graph representation
granting_institution	Universiti Teknologi Malaysia, Faculty of Computer Science and Information System
granting_department	Faculty of Computer Science and Information System
publishDate	2005
url	http://eprints.utm.my/id/eprint/4179/1/LaiChuiYenMFSKSM2005.pdf
_version_	1747814498115256320

Image matching using relational graph representation

Similar Items