Pages that link to "Item:Q2508362"

The following pages link to Geometry and convergence analysis of algorithms for registration of 3D shapes (Q2508362):

Displaying 19 items.

• Model-based multiple rigid object detection and registration in unstructured range data (Q408868) (← links)
• Robust registration of surfaces using a refined iterative closest point algorithm with a trust region approach (Q513664) (← links)
• Newton methods for parametric surface registration. I: Theory (Q628079) (← links)
• On the performance of the ICP algorithm (Q934025) (← links)
• Registration of 3D points using geometric algebra and tensor voting (Q942829) (← links)
• Registration of 2D points using geometric algebra and tensor voting (Q993584) (← links)
• Iterative closest geometric objects registration (Q1591967) (← links)
• Efficient sparse ICP (Q1632310) (← links)
• Graph-based point drift: graph centrality on the registration of point-sets (Q1677064) (← links)
• Geometrical analysis of two sets of 3D correspondence data patterns for the registration of free-form shapes (Q1857656) (← links)
• Pairwise rigid registration based on Riemannian geometry and Lie structures of orientation tensors (Q2051543) (← links)
• Rotational symmetry detection in 3D using reflectional symmetry candidates and quaternion-based rotation parameterization (Q2082604) (← links)
• A regularized point cloud registration approach for orthogonal transformations (Q2149609) (← links)
• Scale-free registrations in 3D: 7 degrees of freedom with Fourier Mellin SOFT transforms (Q2200017) (← links)
• What is wrong with mesh PCA in coordinate direction normalization (Q2507097) (← links)
• Efficient 3D Shape Registration by Using Distance Maps and Stochastic Gradient Descent Method (Q5142427) (← links)
• (Q5194170) (← links)
• Global Registration of Multiple Point Clouds Using Semidefinite Programming (Q5252586) (← links)
• Reliable updates of the transformation in the iterative closest point algorithm (Q5963683) (← links)