Probabilistic Spatial Distribution Prior Based Attentional Keypoints Matching Network

• URL: http://arxiv.org/abs/2111.09006v1
• Date: Wed, 17 Nov 2021 09:52:03 GMT
• Title: Probabilistic Spatial Distribution Prior Based Attentional Keypoints Matching Network
• Authors: Xiaoming Zhao, Jingmeng Liu, Xingming Wu, Weihai Chen, Fanghong Guo, and Zhengguo Li
• Abstract summary: Keypoints matching is a pivotal component for many image-relevant applications such as image stitching, visual simultaneous localization and mapping. In this paper, we demonstrate that the motion estimation from IMU integration can be used to exploit the spatial distribution prior of keypoints between images. We present a projection loss for the proposed keypoints matching network, which gives a smooth edge between matching and un-matching keypoints.
• Score: 19.708243062836104
• License: http://creativecommons.org/licenses/by-nc-sa/4.0/
• Abstract: Keypoints matching is a pivotal component for many image-relevant applications such as image stitching, visual simultaneous localization and mapping (SLAM), and so on. Both handcrafted-based and recently emerged deep learning-based keypoints matching methods merely rely on keypoints and local features, while losing sight of other available sensors such as inertial measurement unit (IMU) in the above applications. In this paper, we demonstrate that the motion estimation from IMU integration can be used to exploit the spatial distribution prior of keypoints between images. To this end, a probabilistic perspective of attention formulation is proposed to integrate the spatial distribution prior into the attentional graph neural network naturally. With the assistance of spatial distribution prior, the effort of the network for modeling the hidden features can be reduced. Furthermore, we present a projection loss for the proposed keypoints matching network, which gives a smooth edge between matching and un-matching keypoints. Image matching experiments on visual SLAM datasets indicate the effectiveness and efficiency of the presented method.

Related papers

• Utilizing Radiomic Feature Analysis For Automated MRI Keypoint Detection: Enhancing Graph Applications [2.8084568003406316]
  Graph neural networks (GNNs) present a promising alternative to CNNs and transformers in certain image processing applications. One approach involves converting images into nodes by identifying significant keypoints within them. This research sets the stage for expanding GNN applications into various applications, including but not limited to image classification, segmentation, and registration.
  arXiv  Detail & Related papers  (2023-11-30T06:37:02Z)
• Pose-Graph Attentional Graph Neural Network for Lidar Place Recognition [16.391871270609055]
  This paper proposes a pose-graph attentional graph neural network, called P-GAT. It compares keynodes between sequential and non-sequential sub-graphs for place recognition tasks. P-GAT uses the maximum spatial and temporal information between neighbour cloud descriptors.
  arXiv  Detail & Related papers  (2023-08-31T23:17:44Z)
• Learning Feature Matching via Matchable Keypoint-Assisted Graph Neural Network [52.29330138835208]
  Accurately matching local features between a pair of images is a challenging computer vision task. Previous studies typically use attention based graph neural networks (GNNs) with fully-connected graphs over keypoints within/across images. We propose MaKeGNN, a sparse attention-based GNN architecture which bypasses non-repeatable keypoints and leverages matchable ones to guide message passing.
  arXiv  Detail & Related papers  (2023-07-04T02:50:44Z)
• Focus for Free in Density-Based Counting [56.961229110268036]
  We introduce two methods that repurpose the available point annotations to enhance counting performance. The first is a counting-specific augmentation that leverages point annotations to simulate occluded objects in both input and density images. The second method, foreground distillation, generates foreground masks from the point annotations, from which we train an auxiliary network on images with blacked-out backgrounds.
  arXiv  Detail & Related papers  (2023-06-08T11:54:37Z)
• KGNv2: Separating Scale and Pose Prediction for Keypoint-based 6-DoF Grasp Synthesis on RGB-D input [16.897624250286487]
  Keypoint-based grasp detector from image input has demonstrated promising results. We devise a new grasp generation network that reduces the dependency on precise keypoint estimation.
  arXiv  Detail & Related papers  (2023-03-09T23:11:52Z)
• A Geometrically Constrained Point Matching based on View-invariant Cross-ratios, and Homography [2.050924050557755]
  A geometrically constrained algorithm is proposed to verify the correctness of initially matched SIFT keypoints based on view-invariant cross-ratios (CRs) By randomly forming pentagons from these keypoints and matching their shape and location among images with CRs, robust planar region estimation can be achieved efficiently. Experimental results show that satisfactory results can be obtained for various scenes with single as well as multiple planar regions.
  arXiv  Detail & Related papers  (2022-11-06T01:55:35Z)
• Variational Structured Attention Networks for Deep Visual Representation Learning [49.80498066480928]
  We propose a unified deep framework to jointly learn both spatial attention maps and channel attention in a principled manner. Specifically, we integrate the estimation and the interaction of the attentions within a probabilistic representation learning framework. We implement the inference rules within the neural network, thus allowing for end-to-end learning of the probabilistic and the CNN front-end parameters.
  arXiv  Detail & Related papers  (2021-03-05T07:37:24Z)
• P2-Net: Joint Description and Detection of Local Features for Pixel and Point Matching [78.18641868402901]
  This work takes the initiative to establish fine-grained correspondences between 2D images and 3D point clouds. An ultra-wide reception mechanism in combination with a novel loss function are designed to mitigate the intrinsic information variations between pixel and point local regions.
  arXiv  Detail & Related papers  (2021-03-01T14:59:40Z)
• Probabilistic Graph Attention Network with Conditional Kernels for Pixel-Wise Prediction [158.88345945211185]
  We present a novel approach that advances the state of the art on pixel-level prediction in a fundamental aspect, i.e. structured multi-scale features learning and fusion. We propose a probabilistic graph attention network structure based on a novel Attention-Gated Conditional Random Fields (AG-CRFs) model for learning and fusing multi-scale representations in a principled manner.
  arXiv  Detail & Related papers  (2021-01-08T04:14:29Z)
• Deep Semantic Matching with Foreground Detection and Cycle-Consistency [103.22976097225457]
  We address weakly supervised semantic matching based on a deep network. We explicitly estimate the foreground regions to suppress the effect of background clutter. We develop cycle-consistent losses to enforce the predicted transformations across multiple images to be geometrically plausible and consistent.
  arXiv  Detail & Related papers  (2020-03-31T22:38:09Z)

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.