Image Retrieval for Structure-from-Motion via Graph Convolutional Network

• URL: http://arxiv.org/abs/2009.08049v1
• Date: Thu, 17 Sep 2020 04:03:51 GMT
• Title: Image Retrieval for Structure-from-Motion via Graph Convolutional Network
• Authors: Shen Yan, Yang Pen, Shiming Lai, Yu Liu, Maojun Zhang
• Abstract summary: We present a novel retrieval method based on Graph Convolutional Network (GCN) to generate accurate pairwise matches without costly redundancy. By constructing a subgraph surrounding the query image as input data, we adopt a learnable GCN to exploit whether nodes in the subgraph have overlapping regions with the query photograph. Experiments demonstrate that our method performs remarkably well on the challenging dataset of highly ambiguous and duplicated scenes.
• Score: 13.040952255039702
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Conventional image retrieval techniques for Structure-from-Motion (SfM) suffer from the limit of effectively recognizing repetitive patterns and cannot guarantee to create just enough match pairs with high precision and high recall. In this paper, we present a novel retrieval method based on Graph Convolutional Network (GCN) to generate accurate pairwise matches without costly redundancy. We formulate image retrieval task as a node binary classification problem in graph data: a node is marked as positive if it shares the scene overlaps with the query image. The key idea is that we find that the local context in feature space around a query image contains rich information about the matchable relation between this image and its neighbors. By constructing a subgraph surrounding the query image as input data, we adopt a learnable GCN to exploit whether nodes in the subgraph have overlapping regions with the query photograph. Experiments demonstrate that our method performs remarkably well on the challenging dataset of highly ambiguous and duplicated scenes. Besides, compared with state-of-the-art matchable retrieval methods, the proposed approach significantly reduces useless attempted matches without sacrificing the accuracy and completeness of reconstruction.

Related papers

• PairingNet: A Learning-based Pair-searching and -matching Network for Image Fragments [6.694162736590122]
  We propose a learning-based image fragment pair-searching and -matching approach to solve the challenging restoration problem. Our proposed network achieves excellent pair-searching accuracy, reduces matching errors, and significantly reduces computational time.
  arXiv  Detail & Related papers  (2023-12-14T07:43:53Z)
• Efficient Subgraph Isomorphism using Graph Topology [10.332465264309693]
  Subgraph isomorphism or subgraph matching is generally considered as an NP-complete problem. Almost all subgraph matching methods utilize node labels to perform node-node matching. We propose a method for identifying the node correspondence between a subgraph and a full graph in the inexact case without node labels.
  arXiv  Detail & Related papers  (2022-09-15T02:45:05Z)
• Correlation Verification for Image Retrieval [15.823918683848877]
  We propose a novel image retrieval re-ranking network named Correlation Verification Networks (CVNet) CVNet compresses dense feature correlation into image similarity while learning diverse geometric matching patterns from various image pairs. Our proposed network shows state-of-the-art performance on several retrieval benchmarks with a significant margin.
  arXiv  Detail & Related papers  (2022-04-04T13:18:49Z)
• Reinforcement Learning Based Query Vertex Ordering Model for Subgraph Matching [58.39970828272366]
  Subgraph matching algorithms enumerate all is embeddings of a query graph in a data graph G. matching order plays a critical role in time efficiency of these backtracking based subgraph matching algorithms. In this paper, for the first time we apply the Reinforcement Learning (RL) and Graph Neural Networks (GNNs) techniques to generate the high-quality matching order for subgraph matching algorithms.
  arXiv  Detail & Related papers  (2022-01-25T00:10:03Z)
• Learning Hierarchical Graph Representation for Image Manipulation Detection [50.04902159383709]
  The objective of image manipulation detection is to identify and locate the manipulated regions in the images. Recent approaches mostly adopt the sophisticated Convolutional Neural Networks (CNNs) to capture the tampering artifacts left in the images. We propose a hierarchical Graph Convolutional Network (HGCN-Net), which consists of two parallel branches.
  arXiv  Detail & Related papers  (2022-01-15T01:54:25Z)
• RTIC: Residual Learning for Text and Image Composition using Graph Convolutional Network [19.017377597937617]
  We study the compositional learning of images and texts for image retrieval. We introduce a novel method that combines the graph convolutional network (GCN) with existing composition methods.
  arXiv  Detail & Related papers  (2021-04-07T09:41:52Z)
• COTR: Correspondence Transformer for Matching Across Images [31.995943755283786]
  We propose a novel framework for finding correspondences in images based on a deep neural network. By doing so, one has the option to query only the points of interest and retrieve sparse correspondences, or to query all points in an image and obtain dense mappings.
  arXiv  Detail & Related papers  (2021-03-25T22:47:02Z)
• Context-Aware Graph Convolution Network for Target Re-identification [61.34688291210318]
  The proposed method achieves state-of-the-art performance on both person and vehicle re-identification datasets. We present a novel Context-Aware Graph Convolution Network (CAGCN), where the probe-gallery relations are encoded into the graph nodes. Experiments show that the proposed method achieves state-of-the-art performance on both person and vehicle re-identification datasets.
  arXiv  Detail & Related papers  (2020-12-08T09:18:39Z)
• Sequential Graph Convolutional Network for Active Learning [53.99104862192055]
  We propose a novel pool-based Active Learning framework constructed on a sequential Graph Convolution Network (GCN) With a small number of randomly sampled images as seed labelled examples, we learn the parameters of the graph to distinguish labelled vs unlabelled nodes. We exploit these characteristics of GCN to select the unlabelled examples which are sufficiently different from labelled ones.
  arXiv  Detail & Related papers  (2020-06-18T00:55:10Z)
• High-Order Information Matters: Learning Relation and Topology for Occluded Person Re-Identification [84.43394420267794]
  We propose a novel framework by learning high-order relation and topology information for discriminative features and robust alignment. Our framework significantly outperforms state-of-the-art by6.5%mAP scores on Occluded-Duke dataset.
  arXiv  Detail & Related papers  (2020-03-18T12:18:35Z)
• Weakly-Supervised Semantic Segmentation by Iterative Affinity Learning [86.45526827323954]
  Weakly-supervised semantic segmentation is a challenging task as no pixel-wise label information is provided for training. We propose an iterative algorithm to learn such pairwise relations. We show that the proposed algorithm performs favorably against the state-of-the-art methods.
  arXiv  Detail & Related papers  (2020-02-19T10:32:03Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.