Globally optimal point set registration by joint symmetry plane fitting

• URL: http://arxiv.org/abs/2002.07988v1
• Date: Wed, 19 Feb 2020 03:40:04 GMT
• Title: Globally optimal point set registration by joint symmetry plane fitting
• Authors: Lan Hu, Haomin Shi, and Laurent Kneip
• Abstract summary: The present work proposes a solution to the challenging problem of registering two partial point sets of the same object with very limited overlap. We leverage the fact that most objects found in man-made environments contain a plane of symmetry. Our results demonstrate a great improvement over the current state-of-the-art in globally optimal point set registration for common objects.
• Score: 22.20387254039175
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: The present work proposes a solution to the challenging problem of registering two partial point sets of the same object with very limited overlap. We leverage the fact that most objects found in man-made environments contain a plane of symmetry. By reflecting the points of each set with respect to the plane of symmetry, we can largely increase the overlap between the sets and therefore boost the registration process. However, prior knowledge about the plane of symmetry is generally unavailable or at least very hard to find, especially with limited partial views, and finding this plane could strongly benefit from a prior alignment of the partial point sets. We solve this chicken-and-egg problem by jointly optimizing the relative pose and symmetry plane parameters, and notably do so under global optimality by employing the branch-and-bound (BnB) paradigm. Our results demonstrate a great improvement over the current state-of-the-art in globally optimal point set registration for common objects. We furthermore show an interesting application of our method to dense 3D reconstruction of scenes with repetitive objects.

Related papers

• COMPOSE: Hypergraph Cover Optimization for Multi-view 3D Human Pose Estimation [58.47973015036709]
  3D pose estimation from sparse multi-views is a critical task for action recognition, sports analysis, and human-robot interaction.<n>We propose COMPOSE, a novel framework that formulates multi-view pose correspondence matching as a hypergraph problem.<n> COMPOSE achieves improvements of up to 23% in average precision over previous optimization-based methods and up to 11% over self-supervised end-to-end learned methods.
  arXiv  Detail & Related papers  (2026-01-14T18:50:17Z)
• GlobalPointer: Large-Scale Plane Adjustment with Bi-Convex Relaxation [44.98626468432535]
  Plane adjustment is crucial for many 3D applications, involving simultaneous pose estimation and plane recovery. We exploit a novel optimization strategy termed textitBi-Convex Relaxation, which decouples the original problem into two simpler sub-problems. We propose two algorithmic variants for solving the plane adjustment problem, namely textitGlobalPointer and textitGlobalPointer++.
  arXiv  Detail & Related papers  (2024-07-18T14:09:03Z)
• SPARE: Symmetrized Point-to-Plane Distance for Robust Non-Rigid Registration [76.40993825836222]
  We propose SPARE, a novel formulation that utilizes a symmetrized point-to-plane distance for robust non-rigid registration. The proposed method greatly improves the accuracy of non-rigid registration problems and maintains relatively high solution efficiency.
  arXiv  Detail & Related papers  (2024-05-30T15:55:04Z)
• SIGMA: Scale-Invariant Global Sparse Shape Matching [50.385414715675076]
  We propose a novel mixed-integer programming (MIP) formulation for generating precise sparse correspondences for non-rigid shapes. We show state-of-the-art results for sparse non-rigid matching on several challenging 3D datasets.
  arXiv  Detail & Related papers  (2023-08-16T14:25:30Z)
• Object-based SLAM utilizing unambiguous pose parameters considering general symmetry types [20.579218922577244]
  symmetric objects, whose observation at different viewpoints can be identical, can deteriorate the performance of simultaneous localization and mapping. This work proposes a system for robustly optimizing the pose of cameras and objects even in the presence of symmetric objects.
  arXiv  Detail & Related papers  (2023-03-13T03:07:59Z)
• A Scalable Combinatorial Solver for Elastic Geometrically Consistent 3D Shape Matching [69.14632473279651]
  We present a scalable algorithm for globally optimizing over the space of geometrically consistent mappings between 3D shapes. We propose a novel primal coupled with a Lagrange dual problem that is several orders of magnitudes faster than previous solvers.
  arXiv  Detail & Related papers  (2022-04-27T09:47:47Z)
• Sparse Quadratic Optimisation over the Stiefel Manifold with Application to Permutation Synchronisation [71.27989298860481]
  We address the non- optimisation problem of finding a matrix on the Stiefel manifold that maximises a quadratic objective function. We propose a simple yet effective sparsity-promoting algorithm for finding the dominant eigenspace matrix.
  arXiv  Detail & Related papers  (2021-09-30T19:17:35Z)
• Robust Extrinsic Symmetry Estimation in 3D Point Clouds [4.416484585765027]
  Detecting the reflection symmetry plane of an object represented by a 3D point cloud is a fundamental problem in 3D computer vision and geometry processing. We propose a statistical estimator-based approach for the plane of reflection symmetry that is robust to outliers and missing parts.
  arXiv  Detail & Related papers  (2021-09-21T03:09:51Z)
• Recurrently Estimating Reflective Symmetry Planes from Partial Pointclouds [5.098175145801009]
  We present an alternative novel encoding that instead slices the data along the height dimension and passes it sequentially to a 2D convolutional recurrent regression scheme. We show that our approach has an accuracy comparable to state-of-the-art techniques on the task of planar reflective symmetry estimation on full synthetic objects.
  arXiv  Detail & Related papers  (2021-06-30T15:26:15Z)
• Pairwise Symmetry Reasoning for Multi-Agent Path Finding Search [43.40580211016752]
  Multi-Agent Path Finding (MAPF) is a challenging problem that asks us to plan collision-free paths for a team of cooperative agents. We show that one of the reasons why MAPF is so hard to solve is due to a phenomenon called pairwise symmetry. We propose a variety of reasoning techniques that detect the symmetries efficiently as they arise and resolve them by using specialized constraints.
  arXiv  Detail & Related papers  (2021-03-12T07:27:35Z)
• 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)
• From Planes to Corners: Multi-Purpose Primitive Detection in Unorganized 3D Point Clouds [59.98665358527686]
  We propose a new method for segmentation-free joint estimation of orthogonal planes. Such unified scene exploration allows for multitudes of applications such as semantic plane detection or local and global scan alignment. Our experiments demonstrate the validity of our approach in numerous scenarios from wall detection to 6D tracking.
  arXiv  Detail & Related papers  (2020-01-21T06:51:47Z)

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.