IMP: Iterative Matching and Pose Estimation with Adaptive Pooling

• URL: http://arxiv.org/abs/2304.14837v2
• Date: Sun, 11 Jun 2023 16:31:39 GMT
• Title: IMP: Iterative Matching and Pose Estimation with Adaptive Pooling
• Authors: Fei Xue and Ignas Budvytis and Roberto Cipolla
• Abstract summary: We propose an textbfefficient IMP, called EIMP, to dynamically discard keypoints without potential matches. Experiments on YFCC100m, Scannet, and Aachen Day-Night datasets demonstrate that the proposed method outperforms previous approaches in terms of accuracy and efficiency.
• Score: 34.36397639248686
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Previous methods solve feature matching and pose estimation using a two-stage process by first finding matches and then estimating the pose. As they ignore the geometric relationships between the two tasks, they focus on either improving the quality of matches or filtering potential outliers, leading to limited efficiency or accuracy. In contrast, we propose an iterative matching and pose estimation framework (IMP) leveraging the geometric connections between the two tasks: a few good matches are enough for a roughly accurate pose estimation; a roughly accurate pose can be used to guide the matching by providing geometric constraints. To this end, we implement a geometry-aware recurrent attention-based module which jointly outputs sparse matches and camera poses. Specifically, for each iteration, we first implicitly embed geometric information into the module via a pose-consistency loss, allowing it to predict geometry-aware matches progressively. Second, we introduce an \textbf{e}fficient IMP, called EIMP, to dynamically discard keypoints without potential matches, avoiding redundant updating and significantly reducing the quadratic time complexity of attention computation in transformers. Experiments on YFCC100m, Scannet, and Aachen Day-Night datasets demonstrate that the proposed method outperforms previous approaches in terms of accuracy and efficiency.

Related papers

• Robust Two-View Geometry Estimation with Implicit Differentiation [2.048226951354646]
  We present a novel two-view geometry estimation framework. It is based on a differentiable robust loss function fitting. We evaluate our approach on the camera pose estimation task in both outdoor and indoor scenarios.
  arXiv  Detail & Related papers  (2024-10-23T15:51:33Z)
• DVMNet: Computing Relative Pose for Unseen Objects Beyond Hypotheses [59.51874686414509]
  Current approaches approximate the continuous pose representation with a large number of discrete pose hypotheses. We present a Deep Voxel Matching Network (DVMNet) that eliminates the need for pose hypotheses and computes the relative object pose in a single pass. Our method delivers more accurate relative pose estimates for novel objects at a lower computational cost compared to state-of-the-art methods.
  arXiv  Detail & Related papers  (2024-03-20T15:41:32Z)
• Q-REG: End-to-End Trainable Point Cloud Registration with Surface Curvature [81.25511385257344]
  We present a novel solution, Q-REG, which utilizes rich geometric information to estimate the rigid pose from a single correspondence. Q-REG allows to formalize the robust estimation as an exhaustive search, hence enabling end-to-end training. We demonstrate in the experiments that Q-REG is agnostic to the correspondence matching method and provides consistent improvement both when used only in inference and in end-to-end training.
  arXiv  Detail & Related papers  (2023-09-27T20:58:53Z)
• A Probabilistic Relaxation of the Two-Stage Object Pose Estimation Paradigm [0.0]
  We propose a matching-free probabilistic formulation for object pose estimation. It enables unified and concurrent optimization of both visual correspondence and geometric alignment. It can represent different plausible modes of the entire distribution of likely poses.
  arXiv  Detail & Related papers  (2023-06-01T16:50:40Z)
• PoseMatcher: One-shot 6D Object Pose Estimation by Deep Feature Matching [51.142988196855484]
  We propose PoseMatcher, an accurate model free one-shot object pose estimator. We create a new training pipeline for object to image matching based on a three-view system. To enable PoseMatcher to attend to distinct input modalities, an image and a pointcloud, we introduce IO-Layer.
  arXiv  Detail & Related papers  (2023-04-03T21:14:59Z)
• SSP-Pose: Symmetry-Aware Shape Prior Deformation for Direct Category-Level Object Pose Estimation [77.88624073105768]
  Category-level pose estimation is a challenging problem due to intra-class shape variations. We propose an end-to-end trainable network SSP-Pose for category-level pose estimation. SSP-Pose produces superior performance compared with competitors with a real-time inference speed at about 25Hz.
  arXiv  Detail & Related papers  (2022-08-13T14:37:31Z)
• End2End Multi-View Feature Matching with Differentiable Pose Optimization [2.311583680973075]
  We propose a graph attention network to predict image correspondences along with confidence weights. The resulting matches serve as weighted constraints in a differentiable pose estimation. We integrate information from multiple views by spanning the graph across multiple frames to predict the matches all at once.
  arXiv  Detail & Related papers  (2022-05-03T18:00:01Z)
• Deep Probabilistic Graph Matching [72.6690550634166]
  We propose a deep learning-based graph matching framework that works for the original QAP without compromising on the matching constraints. The proposed method is evaluated on three popularly tested benchmarks (Pascal VOC, Willow Object and SPair-71k) and it outperforms all previous state-of-the-arts on all benchmarks.
  arXiv  Detail & Related papers  (2022-01-05T13:37:27Z)
• Augmented Parallel-Pyramid Net for Attention Guided Pose-Estimation [90.28365183660438]
  This paper proposes an augmented parallel-pyramid net with attention partial module and differentiable auto-data augmentation. We define a new pose search space where the sequences of data augmentations are formulated as a trainable and operational CNN component. Notably, our method achieves the top-1 accuracy on the challenging COCO keypoint benchmark and the state-of-the-art results on the MPII datasets.
  arXiv  Detail & Related papers  (2020-03-17T03:52:17Z)

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.