Please use this identifier to cite or link to this item: http://hdl.handle.net/20.500.11861/10466
DC FieldValueLanguage
dc.contributor.authorKhan, Sheheryaren_US
dc.contributor.authorDr. NAWAZ Mehmooden_US
dc.contributor.authorGuoxia, Xuen_US
dc.contributor.authorYan, Hongen_US
dc.date.accessioned2024-09-07T06:40:48Z-
dc.date.available2024-09-07T06:40:48Z-
dc.date.issued2019-
dc.identifier.citationIEEE Transactions on Circuits and Systems for Video Technology, 2019, vol. 30(9), pp. 3054-3067.en_US
dc.identifier.issn1051-8215-
dc.identifier.issn1558-2205-
dc.identifier.urihttp://hdl.handle.net/20.500.11861/10466-
dc.description.abstractEstablishing correspondence between pictorial descriptions of two images is an important task and can be treated as graph matching problem. However, the process of extracting a favourable graph structure from raw images for matching is influenced by cluttered backgrounds and deformations, which may result in the abundance of noisy graph structures. This paper addresses the problem of point set correspondence and presents a robust graph matching method which recovers the correspondence matches among the graph nodes in a CUR based factorization framework. The graph representation in terms of CUR, inherently preserves the actual nodes connection in sparse manner, this particularly renders the complex space-time realization of affinities among graph nodes. The reformulation of graph matching in terms of small CUR factorization matrices, allows to compute and relax the partially observed graphs, without observing the whole large-scale graph matrix. In particular, we propose two variants of this approach, first, approximating the matching matrix from small CUR observed graph structure, and second, completing the graph structure with higher order CUR form to find correspondence. The CUR based matching algorithms are realized by computing set of compatibility coefficients from pairwise matching graphs and further conducting the probability relaxation procedure to find the matching confidences among nodes. Experiments and analysis on synthetic and natural images dataset prove the effectiveness of proposed methods against state-of-the-art methods. We also explore CUR matching for non-rigid moving object in a video sequence to demonstrate the potential application of graph matching to video analysis.en_US
dc.language.isoenen_US
dc.relation.ispartofIEEE Transactions on Circuits and Systems for Video Technologyen_US
dc.titleImage correspondence with CUR decomposition-based graph completion and matchingen_US
dc.typePeer Reviewed Journal Articleen_US
dc.identifier.doi10.1109/TCSVT.2019.2935838-
item.fulltextNo Fulltext-
crisitem.author.deptDepartment of Applied Data Science-
Appears in Collections:Applied Data Science - Publication
Show simple item record

SCOPUSTM   
Citations

11
checked on Nov 17, 2024

Page view(s)

17
Last Week
0
Last month
checked on Nov 21, 2024

Google ScholarTM

Impact Indices

Altmetric

PlumX

Metrics


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