Abstract
High-dimensional feature matching based on nearest neighbors search is a core part of many image-matching based problems in computer vision which are solved by local invariant features. In this paper, we propose a new indexing structure for the high-dimensional feature matching, which is based on the distance of the sub-vectors. In addition, we employ an effective image-similarity measure of two images based on the exponential distribution of the Euclidean distance between matched feature vectors. Experimental results have demonstrated the efficiency and effectiveness of the proposed methods in extensive image matching and image retrieval applications.
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 callSimilar Papers
Disclaimer: 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.
