An Efficient Planar Bundle Adjustment Algorithm

• URL: http://arxiv.org/abs/2006.00187v2
• Date: Sun, 16 Aug 2020 07:52:42 GMT
• Title: An Efficient Planar Bundle Adjustment Algorithm
• Authors: Lipu Zhou, Daniel Koppel, Hui Ju, Frank Steinbruecker, Michael Kaess
• Abstract summary: This paper presents an efficient algorithm for the least-squares problem using the point-to-plane cost. It aims to jointly optimize depth sensor poses and plane parameters for 3D reconstruction.
• Score: 23.419382737725623
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: This paper presents an efficient algorithm for the least-squares problem using the point-to-plane cost, which aims to jointly optimize depth sensor poses and plane parameters for 3D reconstruction. We call this least-squares problem \textbf{Planar Bundle Adjustment} (PBA), due to the similarity between this problem and the original Bundle Adjustment (BA) in visual reconstruction. As planes ubiquitously exist in the man-made environment, they are generally used as landmarks in SLAM algorithms for various depth sensors. PBA is important to reduce drift and improve the quality of the map. However, directly adopting the well-established BA framework in visual reconstruction will result in a very inefficient solution for PBA. This is because a 3D point only has one observation at a camera pose. In contrast, a depth sensor can record hundreds of points in a plane at a time, which results in a very large nonlinear least-squares problem even for a small-scale space. Fortunately, we find that there exist a special structure of the PBA problem. We introduce a reduced Jacobian matrix and a reduced residual vector, and prove that they can replace the original Jacobian matrix and residual vector in the generally adopted Levenberg-Marquardt (LM) algorithm. This significantly reduces the computational cost. Besides, when planes are combined with other features for 3D reconstruction, the reduced Jacobian matrix and residual vector can also replace the corresponding parts derived from planes. Our experimental results verify that our algorithm can significantly reduce the computational time compared to the solution using the traditional BA framework. Besides, our algorithm is faster, more accuracy, and more robust to initialization errors compared to the start-of-the-art solution using the plane-to-plane cost

Related papers

• 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)
• Vanishing Point Estimation in Uncalibrated Images with Prior Gravity Direction [82.72686460985297]
  We tackle the problem of estimating a Manhattan frame. We derive two new 2-line solvers, one of which does not suffer from singularities affecting existing solvers. We also design a new non-minimal method, running on an arbitrary number of lines, to boost the performance in local optimization.
  arXiv  Detail & Related papers  (2023-08-21T13:03:25Z)
• Linearized Wasserstein dimensionality reduction with approximation guarantees [65.16758672591365]
  LOT Wassmap is a computationally feasible algorithm to uncover low-dimensional structures in the Wasserstein space. We show that LOT Wassmap attains correct embeddings and that the quality improves with increased sample size. We also show how LOT Wassmap significantly reduces the computational cost when compared to algorithms that depend on pairwise distance computations.
  arXiv  Detail & Related papers  (2023-02-14T22:12:16Z)
• Towards Accurate Ground Plane Normal Estimation from Ego-Motion [10.22470503842832]
  We introduce a novel approach for ground plane normal estimation of wheeled vehicles. In practice, the ground plane is dynamically changed due to braking and unstable road surface. Our proposed method only uses odometry as input and estimates accurate ground plane normal vectors in real time.
  arXiv  Detail & Related papers  (2022-12-08T12:06:36Z)
• Efficient Second-Order Plane Adjustment [6.510507449705342]
  This paper focuses on the problem of estimating the optimal planes and sensor poses to minimize the point-to-plane distance. We adopt the Newton's method to efficiently solve the PA problem. Empirical evaluation shows that our algorithm converges significantly faster than the widely used LM algorithm.
  arXiv  Detail & Related papers  (2022-11-21T15:06:11Z)
• Ground Plane Matters: Picking Up Ground Plane Prior in Monocular 3D Object Detection [92.75961303269548]
  The ground plane prior is a very informative geometry clue in monocular 3D object detection (M3OD) We propose a Ground Plane Enhanced Network (GPENet) which resolves both issues at one go. Our GPENet can outperform other methods and achieve state-of-the-art performance, well demonstrating the effectiveness and the superiority of the proposed approach.
  arXiv  Detail & Related papers  (2022-11-03T02:21:35Z)
• VIP-SLAM: An Efficient Tightly-Coupled RGB-D Visual Inertial Planar SLAM [25.681256050571058]
  We propose a tightly-coupled SLAM system fused with RGB, Depth, IMU and structured plane information. We use homography constraints to eliminate the parameters of numerous plane points in the optimization. The global bundle adjustment is nearly 2 times faster than the sparse points based SLAM algorithm.
  arXiv  Detail & Related papers  (2022-07-04T01:45:24Z)
• Unfolding Projection-free SDP Relaxation of Binary Graph Classifier via GDPA Linearization [59.87663954467815]
  Algorithm unfolding creates an interpretable and parsimonious neural network architecture by implementing each iteration of a model-based algorithm as a neural layer. In this paper, leveraging a recent linear algebraic theorem called Gershgorin disc perfect alignment (GDPA), we unroll a projection-free algorithm for semi-definite programming relaxation (SDR) of a binary graph. Experimental results show that our unrolled network outperformed pure model-based graph classifiers, and achieved comparable performance to pure data-driven networks but using far fewer parameters.
  arXiv  Detail & Related papers  (2021-09-10T07:01:15Z)
• Hybrid Trilinear and Bilinear Programming for Aligning Partially Overlapping Point Sets [85.71360365315128]
  In many applications, we need algorithms which can align partially overlapping point sets are invariant to the corresponding corresponding RPM algorithm. We first show that the objective is a cubic bound function. We then utilize the convex envelopes of trilinear and bilinear monomial transformations to derive its lower bound. We next develop a branch-and-bound (BnB) algorithm which only branches over the transformation variables and runs efficiently.
  arXiv  Detail & Related papers  (2021-01-19T04:24:23Z)
• GPO: Global Plane Optimization for Fast and Accurate Monocular SLAM Initialization [22.847353792031488]
  The algorithm starts by homography estimation in a sliding window. The proposed method fully exploits the plane information from multiple frames and avoids the ambiguities in homography decomposition. Experimental results show that our method outperforms the fine-tuned baselines in both accuracy and real-time.
  arXiv  Detail & Related papers  (2020-04-25T03:57:50Z)
• Plane Pair Matching for Efficient 3D View Registration [7.920114031312631]
  We present a novel method to estimate the motion matrix between overlapping pairs of 3D views in the context of indoor scenes. We use the Manhattan world assumption to introduce lightweight geometric constraints under the form of planes quadri into the problem. We validate our approach on a toy example and present quantitative experiments on a public RGB-D dataset, comparing against recent state-of-the-art methods.
  arXiv  Detail & Related papers  (2020-01-20T11:15:26Z)

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.