IMAGE MATCHING USING RELATIONAL GRAPH REPRESENTATION

Lai Chui Yen, Daut Daman, Mohd Shafry Mohd Rahim

2006

Abstract

A stereo matching strategy that involves the usage of structural description from the image is proposed. This structural matching strategy is to address the problem of image features that undergo occlusion and also the missing feature situation. The description of the image scene is done by the construction of a relational graph that described the relationship among image primitives. Consequently, the matching problem is to match two structural descriptions, which is represented by a relational graph. The matching between these relational graphs is determined by comparing these structures using graph theory. The best available match between these relational graphs can be determined by finding the best maximal clique in an association graph.

Download


Paper Citation


in Harvard Style

Chui Yen L., Daman D. and Shafry Mohd Rahim M. (2006). IMAGE MATCHING USING RELATIONAL GRAPH REPRESENTATION . In Proceedings of the First International Conference on Computer Graphics Theory and Applications - Volume 1: GRAPP, ISBN 972-8865-39-2, pages 400-406. DOI: 10.5220/0001351704000406

in Bibtex Style

@conference{grapp06,
author={Lai Chui Yen and Daut Daman and Mohd Shafry Mohd Rahim},
title={IMAGE MATCHING USING RELATIONAL GRAPH REPRESENTATION},
booktitle={Proceedings of the First International Conference on Computer Graphics Theory and Applications - Volume 1: GRAPP,},
year={2006},
pages={400-406},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0001351704000406},
isbn={972-8865-39-2},
}


in EndNote Style

TY - CONF
JO - Proceedings of the First International Conference on Computer Graphics Theory and Applications - Volume 1: GRAPP,
TI - IMAGE MATCHING USING RELATIONAL GRAPH REPRESENTATION
SN - 972-8865-39-2
AU - Chui Yen L.
AU - Daman D.
AU - Shafry Mohd Rahim M.
PY - 2006
SP - 400
EP - 406
DO - 10.5220/0001351704000406