SPARE: Symmetrized Point-to-Plane Distance for Robust Non-Rigid Registration
- URL: http://arxiv.org/abs/2405.20188v1
- Date: Thu, 30 May 2024 15:55:04 GMT
- Title: SPARE: Symmetrized Point-to-Plane Distance for Robust Non-Rigid Registration
- Authors: Yuxin Yao, Bailin Deng, Junhui Hou, Juyong Zhang,
- Abstract summary: 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.
- Score: 76.40993825836222
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: Existing optimization-based methods for non-rigid registration typically minimize an alignment error metric based on the point-to-point or point-to-plane distance between corresponding point pairs on the source surface and target surface. However, these metrics can result in slow convergence or a loss of detail. In this paper, we propose SPARE, a novel formulation that utilizes a symmetrized point-to-plane distance for robust non-rigid registration. The symmetrized point-to-plane distance relies on both the positions and normals of the corresponding points, resulting in a more accurate approximation of the underlying geometry and can achieve higher accuracy than existing methods. To solve this optimization problem efficiently, we propose an alternating minimization solver using a majorization-minimization strategy. Moreover, for effective initialization of the solver, we incorporate a deformation graph-based coarse alignment that improves registration quality and efficiency. Extensive experiments show that the proposed method greatly improves the accuracy of non-rigid registration problems and maintains relatively high solution efficiency. The code is publicly available at https://github.com/yaoyx689/spare.
Related papers
- 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) - Deep Point-to-Plane Registration by Efficient Backpropagation for Error
Minimizing Function [0.0]
Traditional algorithms of point set registration often achieve a better estimation of rigid transformation than those minimizing point-to-point distances.
Recent deep-learning-based methods minimize the point-to-point distances.
This paper proposes the first deep-learning-based approach to point-to-plane registration.
arXiv Detail & Related papers (2022-07-14T05:18:20Z) - Fast and Robust Non-Rigid Registration Using Accelerated
Majorization-Minimization [35.66014845211251]
Non-rigid registration, which deforms a source shape in a non-rigid way to align with a target shape, is a classical problem in computer vision.
Existing methods typically adopt the $ell_p$ type robust norm to measure the alignment error and regularize the smoothness of deformation.
We propose a formulation for robust non-rigid registration based on a globally smooth robust norm for alignment and regularization.
arXiv Detail & Related papers (2022-06-07T16:00:33Z) - Distributed Sketching for Randomized Optimization: Exact
Characterization, Concentration and Lower Bounds [54.51566432934556]
We consider distributed optimization methods for problems where forming the Hessian is computationally challenging.
We leverage randomized sketches for reducing the problem dimensions as well as preserving privacy and improving straggler resilience in asynchronous distributed systems.
arXiv Detail & Related papers (2022-03-18T05:49:13Z) - Outlier-Robust Sparse Estimation via Non-Convex Optimization [73.18654719887205]
We explore the connection between high-dimensional statistics and non-robust optimization in the presence of sparsity constraints.
We develop novel and simple optimization formulations for these problems.
As a corollary, we obtain that any first-order method that efficiently converges to station yields an efficient algorithm for these tasks.
arXiv Detail & Related papers (2021-09-23T17:38:24Z) - A Robust Loss for Point Cloud Registration [31.033915476145047]
The performance of surface registration relies heavily on the metric used for the alignment error between the source and target shapes.
Traditionally, such a metric is based on the point-to-point or point-to-plane distance from the points on the source surface to their closest points on the target surface.
We propose a novel metric based on the intersection points between the two shapes and a random straight line, which does not assume a specific correspondence.
arXiv Detail & Related papers (2021-08-26T09:56:47Z) - Canny-VO: Visual Odometry with RGB-D Cameras based on Geometric 3D-2D
Edge Alignment [85.32080531133799]
This paper reviews the classical problem of free-form curve registration and applies it to an efficient RGBD visual odometry system called Canny-VO.
Two replacements for the distance transformation commonly used in edge registration are proposed: Approximate Nearest Neighbour Fields and Oriented Nearest Neighbour Fields.
3D2D edge alignment benefits from these alternative formulations in terms of both efficiency and accuracy.
arXiv Detail & Related papers (2020-12-15T11:42:17Z) - Making Affine Correspondences Work in Camera Geometry Computation [62.7633180470428]
Local features provide region-to-region rather than point-to-point correspondences.
We propose guidelines for effective use of region-to-region matches in the course of a full model estimation pipeline.
Experiments show that affine solvers can achieve accuracy comparable to point-based solvers at faster run-times.
arXiv Detail & Related papers (2020-07-20T12:07:48Z) - Feature-metric Registration: A Fast Semi-supervised Approach for Robust
Point Cloud Registration without Correspondences [8.636298281155602]
We present a fast feature-metric point cloud registration framework.
It enforces the optimisation of registration by minimising a feature-metric projection error without correspondences.
We train the proposed method in a semi-supervised or unsupervised approach.
arXiv Detail & Related papers (2020-05-03T07:26:59Z) - Quasi-Newton Solver for Robust Non-Rigid Registration [35.66014845211251]
We propose a formulation for robust non-rigid registration based on a globally smooth robust estimator for data fitting and regularization.
We apply the majorization-minimization algorithm to the problem, which reduces each iteration to solving a simple least-squares problem with L-BFGS.
arXiv Detail & Related papers (2020-04-09T01:45:05Z)
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.