Fast Symbolic 3D Registration Solution

05/12/2018
by   Jin Wu, et al.
0

3D registration has always been performed invoking singular value decomposition (SVD) or eigenvalue decomposition (EIG) in real engineering practices. However, numerical algorithms suffer from uncertainty of convergence in many cases. A novel fast symbolic solution is proposed in this paper by following our recent publication in this journal. The equivalence analysis shows that our previous solver can be converted to deal with the 3D registration problem. Rather, the computation procedure is studied for further simplification of computing without complex numbers support. Experimental results show that the proposed solver does not loose accuracy and robustness but improves the execution speed to a large extent by almost %50 to %80, on both personal computer and embedded processor.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
06/02/2018

Fast Rigid 3D Registration Solution: A Simple Method Free of SVD and Eigen-Decomposition

A novel solution is obtained to solve the rigid 3D registration problem,...
research
06/02/2018

Simple Fast Vectorial Solution to The Rigid 3D Registration Problem

A novel solution is obtained to solve the rigid 3D registration problem,...
research
09/01/2015

Fast Randomized Singular Value Thresholding for Low-rank Optimization

Rank minimization can be converted into tractable surrogate problems, su...
research
04/29/2021

High-Performance Partial Spectrum Computation for Symmetric eigenvalue problems and the SVD

Current dense symmetric eigenvalue (EIG) and singular value decompositio...
research
11/03/2021

Symbolic spectral decomposition of 3x3 matrices

Spectral decomposition of matrices is a recurring and important task in ...
research
05/18/2021

SANM: A Symbolic Asymptotic Numerical Solver with Applications in Mesh Deformation

Solving nonlinear systems is an important problem. Numerical continuatio...

Please sign up or login with your details

Forgot password? Click here to reset