Iterative closest point algorithms

Slides:



Advertisements
Similar presentations
3D Geometry for Computer Graphics
Advertisements

Principal Component Analysis Based on L1-Norm Maximization Nojun Kwak IEEE Transactions on Pattern Analysis and Machine Intelligence, 2008.
Medical Image Registration Kumar Rajamani. Registration Spatial transform that maps points from one image to corresponding points in another image.
PCA + SVD.
Robust Global Registration Natasha Gelfand Niloy Mitra Leonidas Guibas Helmut Pottmann.
Discrete Geometry Tutorial 2 1
Probabilistic Fingerprints for Shapes Niloy J. MitraLeonidas Guibas Joachim GiesenMark Pauly Stanford University MPII SaarbrückenETH Zurich.
Instructor: Mircea Nicolescu Lecture 13 CS 485 / 685 Computer Vision.
Slides by Olga Sorkine, Tel Aviv University. 2 The plan today Singular Value Decomposition  Basic intuition  Formal definition  Applications.
Optimization of ICP Using K-D Tree
Reverse Engineering Niloy J. Mitra.
Registration of two scanned range images using k-d tree accelerated ICP algorithm By Xiaodong Yan Dec
CENG 789 – Digital Geometry Processing 06- Rigid-Body Alignment Asst. Prof. Yusuf Sahillioğlu Computer Eng. Dept,, Turkey.
Motion Analysis Slides are from RPI Registration Class.
Final Class: Range Data registration CISC4/689 Credits: Tel-Aviv University.
3D Geometry for Computer Graphics
1 GEOMETRIE Geometrie in der Technik H. Pottmann TU Wien SS 2007.
Motion Analysis (contd.) Slides are from RPI Registration Class.
Correspondence & Symmetry
Uncalibrated Geometry & Stratification Sastry and Yang
1 Numerical geometry of non-rigid shapes Spectral Methods Tutorial. Spectral Methods Tutorial 6 © Maks Ovsjanikov tosca.cs.technion.ac.il/book Numerical.
CS CS 175 – Week 2 Processing Point Clouds Registration.
Niloy J. Mitra1, Natasha Gelfand1, Helmut Pottmann2, Leonidas J
1 Numerical geometry of non-rigid shapes In the Rigid Kingdom In the Rigid Kingdom Lecture 4 © Alexander & Michael Bronstein tosca.cs.technion.ac.il/book.
Recovering Articulated Object Models from 3D Range Data Dragomir Anguelov Daphne Koller Hoi-Cheung Pang Praveen Srinivasan Sebastian Thrun Computer Science.
Previously Two view geometry: epipolar geometry Stereo vision: 3D reconstruction epipolar lines Baseline O O’ epipolar plane.
3D Geometry for Computer Graphics
Matching Compare region of image to region of image. –We talked about this for stereo. –Important for motion. Epipolar constraint unknown. But motion small.
CS4670: Computer Vision Kavita Bala Lecture 7: Harris Corner Detection.
1 Numerical geometry of non-rigid shapes Non-Euclidean Embedding Non-Euclidean Embedding Lecture 6 © Alexander & Michael Bronstein tosca.cs.technion.ac.il/book.
Camera parameters Extrinisic parameters define location and orientation of camera reference frame with respect to world frame Intrinsic parameters define.
כמה מהתעשייה? מבנה הקורס השתנה Computer vision.
Point set alignment Closed-form solution of absolute orientation using unit quaternions Berthold K. P. Horn Department of Electrical Engineering, University.
CSE 185 Introduction to Computer Vision
CSC 589 Lecture 22 Image Alignment and least square methods Bei Xiao American University April 13.
CSE554AlignmentSlide 1 CSE 554 Lecture 8: Alignment Fall 2014.
CSE554Laplacian DeformationSlide 1 CSE 554 Lecture 8: Laplacian Deformation Fall 2012.
Alignment Introduction Notes courtesy of Funk et al., SIGGRAPH 2004.
Chapter 9 Superposition and Dynamic Programming 1 Chapter 9 Superposition and dynamic programming Most methods for comparing structures use some sorts.
Niloy J. Mitra Leonidas J. Guibas Mark Pauly TU Vienna Stanford University ETH Zurich SIGGRAPH 2007.
Shape Matching for Model Alignment 3D Scan Matching and Registration, Part I ICCV 2005 Short Course Michael Kazhdan Johns Hopkins University.
CSE554AlignmentSlide 1 CSE 554 Lecture 5: Alignment Fall 2011.
Course 12 Calibration. 1.Introduction In theoretic discussions, we have assumed: Camera is located at the origin of coordinate system of scene.
ALIGNMENT OF 3D ARTICULATE SHAPES. Articulated registration Input: Two or more 3d point clouds (possibly with connectivity information) of an articulated.
Shape Analysis and Retrieval Statistical Shape Descriptors Notes courtesy of Funk et al., SIGGRAPH 2004.
Axial Flip Invariance and Fast Exhaustive Searching with Wavelets Matthew Bolitho.
CSCE 643 Computer Vision: Structure from Motion
Medical Image Analysis Image Registration Figures come from the textbook: Medical Image Analysis, by Atam P. Dhawan, IEEE Press, 2003.
Parameter estimation. 2D homography Given a set of (x i,x i ’), compute H (x i ’=Hx i ) 3D to 2D camera projection Given a set of (X i,x i ), compute.
Action as Space-Time Shapes
CSE554AlignmentSlide 1 CSE 554 Lecture 8: Alignment Fall 2013.
A Flexible New Technique for Camera Calibration Zhengyou Zhang Sung Huh CSPS 643 Individual Presentation 1 February 25,
EFFICIENT VARIANTS OF THE ICP ALGORITHM
Using simplified meshes for crude registration of two partially overlapping range images Mercedes R.G.Márquez Wu Shin-Ting State University of Matogrosso.
CSE 185 Introduction to Computer Vision Feature Matching.
Methods for 3D Shape Matching and Retrieval
Affine Registration in R m 5. The matching function allows to define tentative correspondences and a RANSAC-like algorithm can be used to estimate the.
CENG 789 – Digital Geometry Processing 07- Rigid-Body Alignment Asst. Prof. Yusuf Sahillioğlu Computer Eng. Dept,, Turkey.
CSCI 631 – Foundations of Computer Vision March 15, 2016 Ashwini Imran Image Stitching.
CSE 554 Lecture 8: Alignment
Lecture 16: Image alignment
CENG 789 – Digital Geometry Processing 08- Rigid-Body Alignment
Geometrically Stable Sampling for the ICP Algorithm
Spectral Methods Tutorial 6 1 © Maks Ovsjanikov
CSE 554 Lecture 9: Laplacian Deformation
Structure from motion Input: Output: (Tomasi and Kanade)
Shape matching and object recognition using shape contexts
CENG 789 – Digital Geometry Processing 09- Rigid-Body Alignment
Shape-based Registration
Structure from motion Input: Output: (Tomasi and Kanade)
Presentation transcript:

Iterative closest point algorithms Tutorial 4 © Maks Ovsjanikov tosca.cs.technion.ac.il/book Numerical geometry of non-rigid shapes Stanford University, Winter 2009 1

Outline Closed-form solution of absolute orientation using unit quaternions. Horn, B. K. P., Journal of the Optical Society of America, Vol. 4 1987 Problem Formulation. Intuition. Some Math. Robust Global Registration Gelfand N., Mitra N., Guibas L., Pottmann H., Proceedings of SGP, 2005 Formulation. Problem and Motivation. Multi-Scale point descriptors. Global Matching – Branch and Bound. Results.

Closed-form solution of absolute orientation using unit quaternions. Horn, B. K. P., Journal of the Optical Society of America, Vol. 4 1987 Problem Formulation: Given two sets points: in . Find the rigid transform: and that minimizes:

Closed-form solution of absolute orientation using unit quaternions. Horn, B. K. P., Journal of the Optical Society of America, Vol. 4 1987 Problem Formulation: Given two sets points: in . Find the rigid transform: and that minimizes:

Closed-form solution of absolute orientation using unit quaternions. Horn, B. K. P., Journal of the Optical Society of America, Vol. 4 1987 Problem Formulation: Given two sets points: in . Find the rigid transform: and that minimizes: In practice, have many points. Perform this step many times. Want a fast way to get an exact solution. Representation is important.

Given two sets points: in . Find the rigid transform: and that minimizes: Finding the translation part . 1. Let and : the centroids of and and let and . Then . 2. where: minimized if

Given two sets points: in . Find the rigid transform: and that minimizes: Need to find the rotation . 1. Several ways to represent rotation: Orthonormal matrix, Euler angle, Gibbs vector, quaternions, etc. Which one is most useful in this case? 2. Plan of action: Want to minimize Since rotation preserves lengths. Need to maximize: Question: What unit vector maximizes if is symmetric? Answer: Eigenvector corresponding to the maximum eigenvalue of .

Given two sets points: in . Find the rigid transform: and that minimizes: Need to find the rotation . 2. Plan of action: Need to maximize: 3. If represent using orthonormal matrices, then get: Would prefer: , where is a vector and - matrices Quaternions allow us to express rotation in such form.

Quaternions (two slides intro). 1. Vectors with 4 components, 3 of which are imaginary: 2. Multiplication is defined using the rules: from which follows: In matrix form: 3. Dot product: Matrices associated with unit quaternions are orthonormal.

Quaternions (two slides intro). 4. Conjugation: . Matrix corresponding to the conjugate is the transpose of the original. 5. Regular vectors can be represented with purely imaginary quaternions: 6. Rotation can be represented with composite product by a unit quaternion : where . Conversely, every unit quaternion corresponds to a rotation.

Back to Alignment. 1. Want to maximize: 2. In quaternion form: 3. The optimal rotation quaternion is the eigenvector corresponding to the maximum eigenvalue of:

Summary Closed-form solution of absolute orientation using unit quaternions. Horn, B. K. P., Journal of the Optical Society of America, Vol. 4 1987 Efficient algorithm to find the optimal translation and rotation in the rigid alignment, provided that the correspondences are known. Uniform scaling can be found similarly: Quaternions provide a simple and efficient way to represent rotations. Other methods: SVD, Orthogonal Matrices, Dual Quaternions Estimating 3-D rigid body transformations: a comparison of four major algorithms. Eggert et al., Machine Vision and Applications, Vol. 9 1997

Outline Closed-form solution of absolute orientation using unit quaternions. Horn, B. K. P., Journal of the Optical Society of America, Vol. 4 1987 Problem Formulation. Intuition. Some Math. Robust Global Registration Gelfand N., Mitra N., Guibas L., Pottmann H., Proceedings of SGP, 2005 Formulation. Problem and Motivation. Multi-Scale point descriptors. Global Matching – Branch and Bound. Results. Images by N. Gelfand

Problem: Robust Global Registration Gelfand, Mitra, Guibas, Pottmann, Proceedings of SGP, 2005 Problem: Given: Two shapes P and Q which partially overlap. Goal: Using only rigid transforms, register Q against P by minimizing the squared distance between them. No assumptions about initial positions!

Approaches Rigid transform can be specified with small number of parameters Try all possible transform bases Find the one that aligns the most points Guaranteed to find the correct transform But can be costly

Approaches Use neighborhood geometric information Descriptors should be Invariant under transform Local Cheap Improves correspondence search or used for feature extraction [Mokh 01, Huber 03, Li 05]

We only need to align a few points correctly. Registration Problem Why it’s hard Unknown areas of overlap Have to solve the correspondence problem Why it’s easy Rigid transform is specified by small number of points Prominent features are easy to identify We only need to align a few points correctly.

Method Overview Use descriptors to identify features Integral volume descriptor Build correspondence search space Few correspondences for each feature Efficiently explore search space Distance error metric Pruning algorithms

Integral Descriptors Multiscale Inherent smoothing f(x) [Manay 04] Br(p) p

Integral Volume Descriptor Related to mean curvature. Provably robust to noise. 0.20

Descriptor Computation Approximate using a voxel grid Convolution of occupancy grid with ball

Feature Identification Pick as features points with rare descriptor values Rare in the data [ rare in the model [ few correspondences Works for any descriptor Features

Multiscale Algorithm Features should be persistent over scale change Y N

Correspondence Space Search the whole model for correspondences Range query for descriptor values Cluster and pick representatives Q P

Evaluating Correspondences Coordinate root mean squared distance Requires best aligning transform Looks at correspondences individually

Rigidity Constraint Pair-wise distances between features and correspondences should be the same Q P

Rigidity Constraint Pair-wise distances between features and correspondences should be the same Q P

Evaluating Correspondences Distance root mean squared distance Depends only on internal distances

Search Algorithm Few features, each with few potential correspondences Minimize dRMS Exhaustive search still too expensive P Q

Branch and Bound. Find global minimum of a function. Search Space:

Branch and Bound. Find global minimum of a function. Search Space: Split (Branch). Bound. Prune: If min2 > max1, can remove branch 2. min2 max2 min1 max1

Search Algorithm Branch and bound Initial bound using greedy assignment Discard partial correspondences that fail thresholding test Prune if partial correspondence exceeds bound Spaced out features make incorrect correspondences fail quickly Since we explore the entire search space, we are guaranteed to find optimal alignment Up to cluster size Rc qi pi pj qj

Search Algorithm Branch and bound Initial bound using greedy assignment Discard partial correspondences that fail thresholding test Prune if partial correspondence exceeds bound Spaced out features make incorrect correspondences fail quickly Since we explore the entire search space, we are guaranteed to find optimal alignment Up to cluster size

Greedy Initialization Good initial bound is essential Build up correspondence set hierarchically …

Greedy Initialization Good initial bound is essential Build up correspondence set hierarchically … …

Greedy Initialization Good initial bound is essential Build up correspondence set hierarchically …

Partial Alignment Allow null correspondences, while maximizing the number of matches points

Alignment Results Input: 2 scans Alignment Refined by ICP

Alignment Results Alignment Refined by ICP Input: 10 scans