1 / 36

Robust Global Registration

Robust Global Registration. Natasha Gelfand Niloy Mitra Leonidas Guibas Helmut Pottmann. Registration 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.

aldon
Download Presentation

Robust Global Registration

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript


  1. Robust Global Registration Natasha Gelfand Niloy Mitra Leonidas Guibas Helmut Pottmann

  2. Registration 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.

  3. Applications • Shape analysis • similarity, symmetry detection, rigid decomposition • Shape acquisition [Anguelov 04] [Koller 05] [Pauly 05]

  4. Approaches I [Besl 92, Chen 92] • Iterative minimization algorithms (ICP) • Properties • Dense correspondence sets • Converges if starting positions are “close” 3. Iterate 2. Align corresponding points 1. Build a set of corresponding points

  5. Approaches II [Stockman 87, Hecker 94, Barequet 97] • Voting methods • Geometric hashing, Hough transform, alignment method • Rigid transform can be specified with small number of points • Try all possible transform bases • Find the one that aligns the most points • Guaranteed to find the correct transform • But can be costly

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

  7. 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.

  8. 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

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

  10. 0.20 Integral Volume Descriptor • Relation to mean curvature

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

  12. 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

  13. Multiscale Algorithm • Features should be persistent over scale change

  14. Feature Properties • Sparse • Robust to noise • Non-canonical

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

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

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

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

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

  20. Evaluating Correspondences • Distance root mean squared distance • Depends only on internal distance matrix

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

  22. 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

  23. 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

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

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

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

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

  28. Alignment Results Input: 2 scans Our alignment Refined by ICP

  29. Alignment Results Our alignment Refined by ICP Input: 10 scans

  30. Symmetry detection Match a shape to itself Symmetry Detection

  31. Rigid Decomposition • Repeated application of partial matching

  32. Conclusions • Simple feature identification algorithm • Used integral volume descriptor • Applicable for any low-dimensional descriptor • Correspondence evaluation using dRMS error • Look at pairs of correspondences, instead of individually • Efficient branch and bound correspondence search • Finds globally best alignment

  33. Future Work • Linear features

  34. Future Work • Linear features • Fast rejection tests • More descriptors

  35. Acknowledgements • Daniel Russel • An Nguyen • Doo Young Kwon • Digital Michelangelo Project • NSF CARGO-0138456, FRG-0454543, ARO DAAD 19-03-1-033, Max Plank Fellowship, Stanford Graduate Fellowship, Austrian Science Fund P16002-N05

  36. Questions?

More Related