Abstract
This paper proposes employing a graph-theoretic approach to estimate the region correspondence between two images. We represent each image as an attributed undirected graph and transform the image matching problem into an inexact graph matching problem. We formulate the estimation of the soft matching matrix between two graphs as a quadratic programming problem, and apply KKT (Karush-Kuhn-Tucker) conditions and the modified simplex algorithm to solve the constrained optimization problem. With the soft matching matrix, we are capable to integrate both the region correspondence and low-level visual features into an effective matching measurement for image matching. Experiments have been conducted on image retrieval to show the effectiveness of the proposed estimation algorithm
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
