Deep Semantic Feature Matching Using Confidential Correspondence Consistency
This work aims to establish visual correspondences between a pair of images depicting objects of the same semantic category. It encounters many challenges such as non-overlapping of scenes or objects, background clutter, and large intra-class variation. Existing methods handle this task with handcra...
Main Authors: | , , , |
---|---|
Format: | Article |
Language: | English |
Published: |
IEEE
2020-01-01
|
Series: | IEEE Access |
Subjects: | |
Online Access: | https://ieeexplore.ieee.org/document/8959084/ |
id |
doaj-993bb3890252406d8e8b2f7d6132cfbd |
---|---|
record_format |
Article |
spelling |
doaj-993bb3890252406d8e8b2f7d6132cfbd2021-03-30T03:04:07ZengIEEEIEEE Access2169-35362020-01-018128021281410.1109/ACCESS.2020.29666558959084Deep Semantic Feature Matching Using Confidential Correspondence ConsistencyWei Lyu0https://orcid.org/0000-0002-1097-1340Lang Chen1https://orcid.org/0000-0003-1210-271XZhong Zhou2https://orcid.org/0000-0002-5825-7517Wei Wu3https://orcid.org/0000-0001-6572-8471State Key Laboratory of Virtual Reality Technology and Systems, Beihang University, Beijing, ChinaState Key Laboratory of Virtual Reality Technology and Systems, Beihang University, Beijing, ChinaState Key Laboratory of Virtual Reality Technology and Systems, Beihang University, Beijing, ChinaState Key Laboratory of Virtual Reality Technology and Systems, Beihang University, Beijing, ChinaThis work aims to establish visual correspondences between a pair of images depicting objects of the same semantic category. It encounters many challenges such as non-overlapping of scenes or objects, background clutter, and large intra-class variation. Existing methods handle this task with handcrafted features, which cannot effectively fit the correlations between non-overlapping images. Besides, additional training or information may be implemented into the learned features. In this paper, we propose a novel approach for semantic correspondence, which is based on deep feature representation, geometric and semantic associations between intra-class objects, and hierarchical matching selection according to the convolutional feature pyramid. Firstly, we construct the initial correspondence by developing a sparse feature matching model on the coarsest feature level, which enforces the nearest-neighbor searching under semantic and geometric consistency constraints. Further, a narrowing strategy is proposed and employed from the coarsest to the finest feature level, which hierarchically refine and optimize the correspondence. The results illustrate that this approach achieves competitive performance on the public datasets for semantic correspondence.https://ieeexplore.ieee.org/document/8959084/Feature matchingconsistency constraintsnearest-neighbor searchinghierarchical optimizationconvolution feature pyramid |
collection |
DOAJ |
language |
English |
format |
Article |
sources |
DOAJ |
author |
Wei Lyu Lang Chen Zhong Zhou Wei Wu |
spellingShingle |
Wei Lyu Lang Chen Zhong Zhou Wei Wu Deep Semantic Feature Matching Using Confidential Correspondence Consistency IEEE Access Feature matching consistency constraints nearest-neighbor searching hierarchical optimization convolution feature pyramid |
author_facet |
Wei Lyu Lang Chen Zhong Zhou Wei Wu |
author_sort |
Wei Lyu |
title |
Deep Semantic Feature Matching Using Confidential Correspondence Consistency |
title_short |
Deep Semantic Feature Matching Using Confidential Correspondence Consistency |
title_full |
Deep Semantic Feature Matching Using Confidential Correspondence Consistency |
title_fullStr |
Deep Semantic Feature Matching Using Confidential Correspondence Consistency |
title_full_unstemmed |
Deep Semantic Feature Matching Using Confidential Correspondence Consistency |
title_sort |
deep semantic feature matching using confidential correspondence consistency |
publisher |
IEEE |
series |
IEEE Access |
issn |
2169-3536 |
publishDate |
2020-01-01 |
description |
This work aims to establish visual correspondences between a pair of images depicting objects of the same semantic category. It encounters many challenges such as non-overlapping of scenes or objects, background clutter, and large intra-class variation. Existing methods handle this task with handcrafted features, which cannot effectively fit the correlations between non-overlapping images. Besides, additional training or information may be implemented into the learned features. In this paper, we propose a novel approach for semantic correspondence, which is based on deep feature representation, geometric and semantic associations between intra-class objects, and hierarchical matching selection according to the convolutional feature pyramid. Firstly, we construct the initial correspondence by developing a sparse feature matching model on the coarsest feature level, which enforces the nearest-neighbor searching under semantic and geometric consistency constraints. Further, a narrowing strategy is proposed and employed from the coarsest to the finest feature level, which hierarchically refine and optimize the correspondence. The results illustrate that this approach achieves competitive performance on the public datasets for semantic correspondence. |
topic |
Feature matching consistency constraints nearest-neighbor searching hierarchical optimization convolution feature pyramid |
url |
https://ieeexplore.ieee.org/document/8959084/ |
work_keys_str_mv |
AT weilyu deepsemanticfeaturematchingusingconfidentialcorrespondenceconsistency AT langchen deepsemanticfeaturematchingusingconfidentialcorrespondenceconsistency AT zhongzhou deepsemanticfeaturematchingusingconfidentialcorrespondenceconsistency AT weiwu deepsemanticfeaturematchingusingconfidentialcorrespondenceconsistency |
_version_ |
1724184110620999680 |