z-logo
open-access-imgOpen Access
PL‐VSCN: Patch‐level vision similarity compares network for image matching
Author(s) -
You Xiong,
Li Qin,
Li Ke,
Yu Anzhu,
Bu Shuhui
Publication year - 2021
Publication title -
iet computer vision
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.38
H-Index - 37
eISSN - 1751-9640
pISSN - 1751-9632
DOI - 10.1049/cvi2.12018
Subject(s) - artificial intelligence , discriminative model , pattern recognition (psychology) , matching (statistics) , similarity (geometry) , computer science , feature (linguistics) , computer vision , feature extraction , image (mathematics) , mathematics , linguistics , statistics , philosophy
Image matching plays an important role in various computer vision tasks, such as image retrieval and loop closure detection in Simultaneous Localization and Mapping. The authors propose a discriminative patch‐based image matching method that converts the problem of whole image matching to that of local patch matching. To construct the patch representation, the Patch‐Level Vision Similarity Compare Network (PL‐VSCN) is proposed to produce the patch feature. In the image matching process, local patches that potentially contain objects within images are initially detected, and the discriminative feature of each patch is extracted based on the pre‐trained PL‐VSCN. Then, the similarities between the patch pairs are calculated to construct the similarity matrix, and the corresponding patch pairs are detected based on the mutual matching mechanism on the similarity matrix. Experimental results indicate that the proposed PL‐VSCN can generate the discriminative patch feature, which can accurately match the patch pairs with the corresponding content and distinguish those with non‐corresponding content. In addition, the comparison experiments demonstrate that the proposed image matching method outperforms existing approaches on most datasets and effectively completes the image matching task.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here