Randomized Algorithms for Comparing and Understanding 3D Geometry Niloy J. Mitra Department of Electrical Engineering Advisor: Leonidas J. Guibas Associate.

Slides:



Advertisements
Similar presentations
Distinctive Image Features from Scale-Invariant Keypoints David Lowe.
Advertisements

Partial and Approximate Symmetry Detection for 3D Geometry Mark Pauly Niloy J. Mitra Leonidas J. Guibas.
Fourier Slice Photography
Robust Global Registration Natasha Gelfand Niloy Mitra Leonidas Guibas Helmut Pottmann.
3D Skeletons Using Graphics Hardware Jonathan Bilodeau Chris Niski.
Probabilistic Fingerprints for Shapes Niloy J. MitraLeonidas Guibas Joachim GiesenMark Pauly Stanford University MPII SaarbrückenETH Zurich.
Semi-automatic Range to Range Registration: A Feature-based Method Chao Chen & Ioannis Stamos Computer Science Department Graduate Center, Hunter College.
Reverse Engineering Niloy J. Mitra.
Optimal invariant metrics for shape retrieval
CENG 789 – Digital Geometry Processing 06- Rigid-Body Alignment Asst. Prof. Yusuf Sahillioğlu Computer Eng. Dept,, Turkey.
Example Based 3D Shape Completion Mark Pauly 1,2, Niloy J. Mitra 1, Joachim Giesen 2, Markus Gross 2, Leonidas J. Guibas 1 1 Stanford University 2 ETH,
Uncertainty and Variability in Point Cloud Surface Data Mark Pauly 1,2, Niloy J. Mitra 1, Leonidas J. Guibas 1 1 Stanford University 2 ETH, Zurich.
Iterative closest point algorithms
Pauly, Keiser, Kobbelt, Gross: Shape Modeling with Point-Sampled GeometrySIGGRAPH 2003 Shape Modeling with Point-Sampled Geometry Mark Pauly Richard Keiser.
Reflective Symmetry Detection in 3 Dimensions
A Study of Approaches for Object Recognition
Correspondence & Symmetry
3-D Object Recognition From Shape Salvador Ruiz Correa Department of Electrical Engineering.
1 Numerical geometry of non-rigid shapes Spectral Methods Tutorial. Spectral Methods Tutorial 6 © Maks Ovsjanikov tosca.cs.technion.ac.il/book Numerical.
Niloy J. Mitra1, Natasha Gelfand1, Helmut Pottmann2, Leonidas J
Matching and Recognition in 3D. Moving from 2D to 3D Some things harderSome things harder – Rigid transform has 6 degrees of freedom vs. 3 – No natural.
1 Bronstein, Bronstein, and Kimmel Joint extrinsic and intrinsic similarity of non-rigid shapes Rock, paper, and scissors Joint extrinsic and intrinsic.
Surface Light Fields for 3D Photography Daniel N. Wood University of Washington SIGGRAPH 2001 Course.
Object Recognition Using Geometric Hashing
Spectral Processing of Point-sampled Geometry
The Planar-Reflective Symmetry Transform Princeton University.
A Hierarchical Method for Aligning Warped Meshes Leslie Ikemoto 1, Natasha Gelfand 2, Marc Levoy 2 1 UC Berkeley, formerly Stanford 2 Stanford University.
Multi-Scale Surface Descriptors Gregory Cipriano, George N. Phillips Jr., and Michael Gleicher.
כמה מהתעשייה? מבנה הקורס השתנה Computer vision.
Yuping Lin and Gérard Medioni.  Introduction  Method  Register UAV streams to a global reference image ▪ Consecutive UAV image registration ▪ UAV to.
Introduction --Classification Shape ContourRegion Structural Syntactic Graph Tree Model-driven Data-driven Perimeter Compactness Eccentricity.
CSE 185 Introduction to Computer Vision
Gwangju Institute of Science and Technology Intelligent Design and Graphics Laboratory Multi-scale tensor voting for feature extraction from unstructured.
Context-based Surface Completion Andrei Sharf, Marc Alexa, Daniel Cohen-Or.
Niloy J. Mitra Leonidas J. Guibas Mark Pauly TU Vienna Stanford University ETH Zurich SIGGRAPH 2007.
Automatic Registration of Color Images to 3D Geometry Computer Graphics International 2009 Yunzhen Li and Kok-Lim Low School of Computing National University.
Shape Matching for Model Alignment 3D Scan Matching and Registration, Part I ICCV 2005 Short Course Michael Kazhdan Johns Hopkins University.
Alignment and Matching
EMANUELE RODOLÀ A Game-Theoretic Perspective on Registration and Recognition of 3D Shapes.
Coarse-to-Fine Combinatorial Matching for Dense Isometric Shape Correspondence Yusuf Sahillioğlu and Yücel Yemez Computer Eng. Dept., Koç University, Istanbul,
MESA LAB Multi-view image stitching Guimei Zhang MESA LAB MESA (Mechatronics, Embedded Systems and Automation) LAB School of Engineering, University of.
ALIGNMENT OF 3D ARTICULATE SHAPES. Articulated registration Input: Two or more 3d point clouds (possibly with connectivity information) of an articulated.
Point Set Processing and Surface Reconstruction (
Shape Analysis and Retrieval Statistical Shape Descriptors Notes courtesy of Funk et al., SIGGRAPH 2004.
A Method for Registration of 3D Surfaces ICP Algorithm
Shape Analysis and Retrieval Structural Shape Descriptors Notes courtesy of Funk et al., SIGGRAPH 2004.
Recognizing Deformable Shapes Salvador Ruiz Correa UW Ph.D. Graduate Researcher at Children’s Hospital.
INFORMATIK Laplacian Surface Editing Olga Sorkine Daniel Cohen-Or Yaron Lipman Tel Aviv University Marc Alexa TU Darmstadt Christian Rössl Hans-Peter Seidel.
Features-based Object Recognition P. Moreels, P. Perona California Institute of Technology.
Acquiring 3D Indoor Environments with Variability and Repetition Young Min Kim Stanford University Niloy J. Mitra UCL/ KAUST Dong-Ming Yan KAUST Leonidas.
IIIT HYDERABAD Image-based walkthroughs from partial and incremental scene reconstructions Kumar Srijan Syed Ahsan Ishtiaque C. V. Jawahar Center for Visual.
Temporally Coherent Completion of Dynamic Shapes AUTHORS:HAO LI,LINJIE LUO,DANIEL VLASIC PIETER PEERS,JOVAN POPOVIC,MARK PAULY,SZYMON RUSINKIEWICZ Presenter:Zoomin(Zhuming)
Geometric Hashing: A General and Efficient Model-Based Recognition Scheme Yehezkel Lamdan and Haim J. Wolfson ICCV 1988 Presented by Budi Purnomo Nov 23rd.
Reconstruction of Solid Models from Oriented Point Sets Misha Kazhdan Johns Hopkins University.
EFFICIENT VARIANTS OF THE ICP ALGORITHM
 Marc Levoy Using Plane + Parallax to Calibrate Dense Camera Arrays Vaibhav Vaish, Bennett Wilburn, Neel Joshi, Marc Levoy Computer Science Department.
CSE 185 Introduction to Computer Vision Feature Matching.
 Vaibhav Vaish Synthetic Aperture Focusing Using Dense Camera Arrays Vaibhav Vaish Computer Graphics Laboratory Stanford University.
Dynamic Geometry Registration Maks Ovsjanikov Leonidas Guibas Natasha GelfandNiloy J. Mitra Simon Flöry Helmut Pottmann Dynamic Geometry Registration.
CENG 789 – Digital Geometry Processing 08- Rigid-Body Alignment
CENG 789 – Digital Geometry Processing 10- Least-Squares Solutions
Recognizing Deformable Shapes
Geometrically Stable Sampling for the ICP Algorithm
Spectral Methods Tutorial 6 1 © Maks Ovsjanikov
Geometric Hashing: An Overview
3D Scan Alignment Using ICP
CENG 789 – Digital Geometry Processing 11- Least-Squares Solutions
CSE 185 Introduction to Computer Vision
Recognizing Deformable Shapes
Presented by Xu Miao April 20, 2005
Presentation transcript:

Randomized Algorithms for Comparing and Understanding 3D Geometry Niloy J. Mitra Department of Electrical Engineering Advisor: Leonidas J. Guibas Associate Advisor: Marc Levoy

Comparing and Understanding 3D Geometry Need for Digital 3D Models games movies architectural design medicine Google earth manufacturing

Comparing and Understanding 3D Geometry Creating Geometry: 3D Modelers

Comparing and Understanding 3D Geometry Capturing Geometry: 3D Scanners laser scanner 3D geometryentertainment

Comparing and Understanding 3D Geometry Shape Acquisition

Comparing and Understanding 3D Geometry Shape Acquisition

Comparing and Understanding 3D Geometry Shape Acquisition Partial similarity between shapes

Comparing and Understanding 3D Geometry Shape Acquisition Partial similarity between shapes

Comparing and Understanding 3D Geometry Shape Acquisition Partial similarity between shapes Efficient shape retrieval for partial queries

Comparing and Understanding 3D Geometry Geometry Processing [Funkhouser et al. `05] [Katz and Tal `04] [Gelfand et al. `05] [Sharf et al.`04]

Comparing and Understanding 3D Geometry Model Organization and Retrieval [Kazdhan et al. `04]

Comparing and Understanding 3D Geometry Partial Shape Similarity Self-similarity of an object  symmetry partial similarity

Comparing and Understanding 3D Geometry Total vs Partial Matching Total matching is easy PCA (Principal Component Analysis) Axes

Comparing and Understanding 3D Geometry Total vs Partial Matching Partial matching is difficult Which region matches which other region(s)? Space of rigid transforms  rotation + translation Brute force approach  not feasible Instead of exhaustive searching, use local geometry to guide where to search Easy to verify a transform

Comparing and Understanding 3D Geometry Contributions Algorithms to: Identify and extract similar (symmetric) patches of different size Estimate partial shape similarity between models without explicitly aligning them Properties: Scalable and parallel Theoretical error bounds Output sensitive  depends on complexity of solution and not on the complexity of model(s)

Comparing and Understanding 3D Geometry Outline Introduction Related Work Symmetry Detection Probabilistic Fingerprints Conclusion and Future Work

Comparing and Understanding 3D Geometry Related Work: Global Alignment [Huber and Hebert`01][Li and Guskov `05][Gelfand et al. `05] Feature based alignment Combinatorial search, need multiple objects together

Comparing and Understanding 3D Geometry Related Work: Desc. Based Align. [Kazhan et al. `03][Osada et al. `02] Feature based alignment Combinatorial search, need multiple objects together Descriptor based alignment Fails for partial similarity

Comparing and Understanding 3D Geometry Related Work: Geometric Hashing [Gal and Cohen-Or`05] [Wolfson and Rigoutsos`97] Feature based alignment Combinatorial search, need multiple objects together Descriptor based alignment Fails for partial similarity Geometric hashing Tradeoff memory for time

Comparing and Understanding 3D Geometry Related Work: Symmetry Detection [Podolak et al. `06] brute force : O(n 6 ) [Loy and Eklundh `06] Hough transform on feature points [Thrun and Wegbreit `05] Shape from symmetry

Comparing and Understanding 3D Geometry Outline Introduction Related Work Symmetry Detection Probabilistic Fingerprints Conclusion and Future Work

Comparing and Understanding 3D Geometry Symmetry in Nature “Symmetry is a complexity-reducing concept [...]; seek it everywhere.” - Alan J. Perlis "Females of several species, including […] humans, prefer symmetrical males." - Chris Evan

Comparing and Understanding 3D Geometry Partial Symmetry Detection ( SIGGRAPH 2006) Given Object/shape (represented as point cloud, mesh,... ) Identify and extract similar (symmetric) patches of different size across different resolutions Goal

Comparing and Understanding 3D Geometry Partial Symmetry Transform Types: Reflection Rotation + Translation Uniform Scaling

Comparing and Understanding 3D Geometry Reflective Symmetry

Comparing and Understanding 3D Geometry Reflective Symmetry : A Pair Votes

Comparing and Understanding 3D Geometry Reflective Symmetry : Voting Continues

Comparing and Understanding 3D Geometry Reflective Symmetry : Voting Continues

Comparing and Understanding 3D Geometry Reflective Symmetry : Largest Cluster Height of cluster ! size of patch Spread of cluster ! approximation level

Comparing and Understanding 3D Geometry Pipeline

Comparing and Understanding 3D Geometry Pruning: Local Signatures Local signature  invariant under transforms Signatures disagree  points don’t correspond Use (  1,  2 ) for curvature based pruning

Comparing and Understanding 3D Geometry Reflection: Normal-based Pruning

Comparing and Understanding 3D Geometry Point Pair Pruning all pairs curvature based curvature + normal based

Comparing and Understanding 3D Geometry Transformations Reflection  point-pairs Rigid transform  more information Robust estimation of principal curvature frames [Cohen-Steiner et al. `03]

Comparing and Understanding 3D Geometry Mean-Shift Clustering Kernel: Type  radially symmetric hat Radius

Comparing and Understanding 3D Geometry Verification Clustering gives a good guess Verify  build symmetric patches Locally refine solution using ICP algorithm [Besl and McKay `92]

Comparing and Understanding 3D Geometry Random Sampling Height of clusters related to symmetric region size Random samples ! larger regions likely to be detected earlier Output sensitive

Comparing and Understanding 3D Geometry Analysis Assumptions: Smooth surface  -sampled No noise Relates number(n’) of random samples to: Size of symmetric patch (p) Confidence (1-  ) Sampling spacing, kernel radius, continuity of signature Tools for Analysis: Signature continuity Chernoff bound

Comparing and Understanding 3D Geometry Compression: Chambord

Comparing and Understanding 3D Geometry Compression: Chambord

Comparing and Understanding 3D Geometry Compression: Chambord

Comparing and Understanding 3D Geometry Approximate Symmetry: Dragon correction field UNITS: fraction of bounding box diagonal detected symmetries

Comparing and Understanding 3D Geometry Limitations Cannot differentiate between small sized symmetries and comparable noise [Castro et al. `06]

Comparing and Understanding 3D Geometry Articulated Motion: Horses registration  symmetry detection between two objects

Comparing and Understanding 3D Geometry Outline Introduction Related Work Symmetry Detection Probabilistic Fingerprints Conclusion and Future Work

Comparing and Understanding 3D Geometry Partial Shape Similarity (SGP 2006) Are two shapes similar in parts? Efficient tests require compact signatures database query online setting

Comparing and Understanding 3D Geometry partial similarity Probabilistic Fingerprints probabilistic fingerprint compare compact independent

Comparing and Understanding 3D Geometry Insight Partial matching ! difficult problem Total matching ! easy problem Reduce partial matching ! many small total matching problems Results in few false positives ! quick to verify and discard

Comparing and Understanding 3D Geometry Input Shapes

Comparing and Understanding 3D Geometry Sample Points

Comparing and Understanding 3D Geometry Shingles: Overlapping Patches

Comparing and Understanding 3D Geometry Shingles: Overlapping Patches

Comparing and Understanding 3D Geometry Bag of Patches: Ordering Discarded

Comparing and Understanding 3D Geometry Pipeline

Comparing and Understanding 3D Geometry Pipeline: Uniform Sampling Uniform spacing  use [Turk`92] Sample spacing  

Comparing and Understanding 3D Geometry Pipeline: Shingle Generation Shingles: overlapping unordered patches Shingle radius: 

Comparing and Understanding 3D Geometry Pipeline: Signatures Stable signatures Invariant to rigid transforms Spin-images Shape  unordered high-dimensional point set with rigid transform factored out

Comparing and Understanding 3D Geometry Similarity/resemblance Defined wrt. signatures Compare two bag of points in high-dim space No alignment required Brute force evaluation impractical Pipeline: Resemblance

Comparing and Understanding 3D Geometry How to Compare Point Sets Compare two point sets  no need to align Don’t have red and blue points together

Comparing and Understanding 3D Geometry Reduce Sample Size Randomly sample red points Randomly sample blue points still need to solve for correspondence independently

Comparing and Understanding 3D Geometry Min-hashing [Broder`97] Each of m random ‘experts’ Has an ordering of space-boxes Selects the point that lies in lowest ordered box 23

Comparing and Understanding 3D Geometry Min-hashing [Broder`97] Each of m random ‘experts’ Has an ordering of space-box Selects the point that lies in lowest ordered box 23 11

Comparing and Understanding 3D Geometry Pipeline: Min-hashing [Broder`97] Feature selection by random experts ‘Features’ only useful for correspondence Need not have any visual importance Reduces set comparison to element-wise comparison

Comparing and Understanding 3D Geometry Applications: Adaptive Features

Comparing and Understanding 3D Geometry Applications: Adaptive Features merged scan

Comparing and Understanding 3D Geometry Applications: Shape Space Partial similarity Articulated motion

Comparing and Understanding 3D Geometry Applications: Database Retrieval

Comparing and Understanding 3D Geometry Pre-processing time in seconds: Query time → 15 msec/model Fingerprint size → 10kb model# verticesuniform sampling spin imageRabin hashmin-hash skull54k Caesar65k bunny121k horse8k Statistics

Comparing and Understanding 3D Geometry Limitations Fails if resemblance is small How to handle uniform scaling? Stability of spin-images

Comparing and Understanding 3D Geometry Outline Introduction Related Work Symmetry Detection Probabilistic Fingerprints Conclusion and Future Work

Comparing and Understanding 3D Geometry Conclusion Simple probabilistic framework Local evidence → global reasoning Geometric information for guidance Complexity of problem, not complexity of model Symmetry information → High level model understanding Possible to compare two shapes using very compact fingerprints without aligning the models Local reasoning → possible false positives → verification

Comparing and Understanding 3D Geometry Future Works Continuous scanning, assembly, hole filing Extension to deformable, time varying models Understanding of high dimensional data Online transmission, authentication, and security Data courtesy: Prof. B. Chen

Comparing and Understanding 3D Geometry Collaborators Natasha Gelfand, Stanford Joachim Giesen, MPII Saarbrücken Markus Gross, ETH Zürich Leonidas Guibas, Stanford An Nguyen, Stanford Mark Pauly, ETH Zürich Helmut Pottmann, Vienna University of Technology

Comparing and Understanding 3D Geometry Acknowledgements Gunnar Carlson Leonidas Guibas Jean-Claude Latombe Marc Levoy Mark Pauly Mike Cammarano, Billy Chen, Milton Chen, Kayvon Fatahalian, Gaurav Garg, Eran Guendelman, Daniel Horn, Mike Houston, Jeff Klingner, David Koller, Manu Kumar, Ren Ng, John Owens, Doantam Phan, Marie Ringel, Pradeep Sen, Eino-Ville Talvala, Vaibhav Vaish, Ron Yeh Emilio Antunez, Qing Fang, Natasha Gelfand, Olaf A. Hall-Holt, Kyle Heath, Rachel Kolodny, Nikola Milosavljevic, An Nguyen, Steve Oudot, Maksim Ovsjanikov, Daniel Russel, Aneesh Sharma, Jaewon Shin, Primoz Skraba, Michael Wand, Yusu Wang, Danny Yang, Afra Zomorodian Pierre Alliez, Mario Botsch, Pat Hanrahan, Michael Hoffer, Rajiv Motwani, Richard Keiser, Doo Young Kwon, Bob Sumner, Martin Wicke Manuela Cavegn, Heather Gentner, John Gerth, Ada Glucksman, Hoa Nguyen Joseph W. and Hon Mai Goodman Stanford Graduate Fellowship Cargo, Darpa, ITR, NIH, and NSF funding

Comparing and Understanding 3D Geometry Acknowledgements Stanford Cricket Club Stanford Outing Club Stanford Climbing Wall Stanford Alpine Club Kamran Ahsan, Abhishek Bapna, Akanksha Bapna, Indrahit Bhattacharya, Gaurav Chandra, Anirban Dasgupta, Anupam Datta, Amal Ekbal, Gaurav Garg, Mahesh Hardikar, Sara Kalantari, Uma Kelkar, Neha Kumar, Subhasish Mitra, Shoubhik Mukhopadhyay, Subha Nabar, Anindya Pathak, Inam Ur-Rehman, Mitul, Saha, Debasis Sahoo, Sriram Sankaranarayanan, Arjun Singh, Padma Sundaram, Vaibhav Vaish, gsb-SIE fellows, climbing buddies, cricket club folks, … many I missed

Comparing and Understanding 3D Geometry Acknowledgements Parents Brother Devasree

Comparing and Understanding 3D Geometry Acknowledgements

Comparing and Understanding 3D Geometry thank you!