Sparse Point Registration

This work introduces a Sparse Point Registration (SPR) method for performing robust registration given the geometric model of the object and few sparse point-measurements (<20) of the object’s surface. Such a method is of critical importance in applications such as probing-based surgical registration, manipulation, etc. Our approach for SPR is iterative and in each iteration, the current best pose estimate is perturbed to generate several poses. Among the generated poses, the best pose as evaluated by an inexpensive cost function is used to estimate the locally optimum registration. This process is repeated, until the pose converges within a tolerance bound. Two variants of the SPR are developed: deterministic (dSPR) and probabilistic (pSPR). Compared to the pSPR, the dSPR is faster in converging to the local optimum, and requires fewer parameters to be tuned. On the other hand, the pSPR provides uncertainty information in addition to the registration estimate. Both the approaches were evaluated using various standard data sets and the compared to results obtained using state-of-the-art methods. Upon comparison with other methods, both dSPR and pSPR were found to be robust to initial pose errors as well as noise in measurements. The effectiveness of the approach is also demonstrated with an application of robot-probing based registration.

[1]  Markus H. Gross,et al.  Efficient simplification of point-sampled surfaces , 2002, IEEE Visualization, 2002. VIS 2002..

[2]  Paul J. Besl,et al.  A Method for Registration of 3-D Shapes , 1992, IEEE Trans. Pattern Anal. Mach. Intell..

[3]  Søren Hauberg,et al.  Unscented Kalman Filtering on Riemannian Manifolds , 2013, Journal of Mathematical Imaging and Vision.

[4]  Leonidas J. Guibas,et al.  Robust global registration , 2005, SGP '05.

[5]  Paolo Cignoni,et al.  A comparison of mesh simplification algorithms , 1998, Comput. Graph..

[6]  Herman Bruyninckx,et al.  Markov techniques for object localisation with force-controlled robots , 2001 .

[7]  Marc Levoy,et al.  Efficient variants of the ICP algorithm , 2001, Proceedings Third International Conference on 3-D Digital Imaging and Modeling.

[8]  T Kanade,et al.  Techniques for fast and accurate intrasurgical registration. , 1995, Journal of image guided surgery.

[9]  Takeo Kanade,et al.  A Correlation-Based Approach to Robust Point Set Registration , 2004, ECCV.

[10]  Randy E. Ellis,et al.  Robust registration for computer-integrated orthopedic surgery: Laboratory validation and clinical experience , 2003, Medical Image Anal..

[11]  Berthold K. P. Horn,et al.  Closed-form solution of absolute orientation using unit quaternions , 1987 .

[12]  Xavier Pennec,et al.  A Framework for Uncertainty and Validation of 3-D Registration Methods Based on Points and Frames , 2004, International Journal of Computer Vision.

[13]  David J. Hawkes,et al.  A Stochastic Iterative Closest Point Algorithm (stochastICP) , 2001, MICCAI.

[14]  Howie Choset,et al.  Complementary model update: A method for simultaneous registration and stiffness mapping in flexible environments , 2016, 2016 IEEE International Conference on Robotics and Automation (ICRA).

[15]  Ran Liu,et al.  Outlier Robust ICP for Minimizing Fractional RMSD , 2006, Sixth International Conference on 3-D Digital Imaging and Modeling (3DIM 2007).

[16]  Russell H. Taylor,et al.  Iterative Most-Likely Point Registration (IMLP): A Robust Algorithm for Computing Optimal Shape Alignment , 2015, PloS one.

[17]  M Shoham,et al.  A surface-matching technique for robot-assisted registration. , 2001, Computer aided surgery : official journal of the International Society for Computer Aided Surgery.

[18]  Randy E. Ellis,et al.  Spatial-Stiffness Analysis of Surface-Based Registration , 2004, MICCAI.

[19]  Joel W. Burdick,et al.  The next best touch for model-based localization , 2013, 2013 IEEE International Conference on Robotics and Automation.

[20]  Siddhartha S. Srinivasa,et al.  Efficient touch based localization through submodularity , 2012, 2013 IEEE International Conference on Robotics and Automation.

[21]  Jiaolong Yang,et al.  Go-ICP: Solving 3D Registration Efficiently and Globally Optimally , 2013, 2013 IEEE International Conference on Computer Vision.

[22]  Paul J. Besl,et al.  Method for registration of 3-D shapes , 1992, Other Conferences.

[23]  Howie Choset,et al.  Estimating SE(3) elements using a dual quaternion based linear Kalman filter , 2016, Robotics: Science and Systems.

[24]  Leslie Pack Kaelbling,et al.  Task-Driven Tactile Exploration , 2010, Robotics: Science and Systems.

[25]  Howie Choset,et al.  Multiple Start Branch and Prune Filtering Algorithm for Nonconvex Optimization , 2016, WAFR.

[26]  Michael S. Branicky,et al.  Particle filtering for localization in robotic assemblies with position uncertainty , 2005, 2005 IEEE/RSJ International Conference on Intelligent Robots and Systems.

[27]  Kostas Daniilidis,et al.  Fully Automatic Registration of 3D Point Clouds , 2006, 2006 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'06).

[28]  Oussama Khatib,et al.  Global Localization of Objects via Touch , 2011, IEEE Transactions on Robotics.

[29]  Randy E. Ellis,et al.  Surface-Based Registration with a Particle Filter , 2004, MICCAI.

[30]  Howie Choset,et al.  Bingham Distribution-Based Linear Filter for Online Pose Estimation , 2017, Robotics: Science and Systems.

[31]  Purang Abolmaesumi,et al.  Point-Based Rigid-Body Registration Using an Unscented Kalman Filter , 2007, IEEE Transactions on Medical Imaging.

[32]  Reid G. Simmons,et al.  Touch based localization of parts for high precision manufacturing , 2017, 2017 IEEE International Conference on Robotics and Automation (ICRA).

[33]  Gary K. L. Tam,et al.  Registration of 3D Point Clouds and Meshes: A Survey from Rigid to Nonrigid , 2013, IEEE Transactions on Visualization and Computer Graphics.

[34]  Michael Garland,et al.  Surface simplification using quadric error metrics , 1997, SIGGRAPH.