A Hierarchical Method for Aligning Warped Meshes Leslie Ikemoto 1, Natasha Gelfand 2, Marc Levoy 2 1 UC Berkeley, formerly Stanford 2 Stanford University.

Slides:



Advertisements
Similar presentations
Efficient High-Resolution Stereo Matching using Local Plane Sweeps Sudipta N. Sinha, Daniel Scharstein, Richard CVPR 2014 Yongho Shin.
Advertisements

Medical Image Registration Kumar Rajamani. Registration Spatial transform that maps points from one image to corresponding points in another image.
Partial and Approximate Symmetry Detection for 3D Geometry Mark Pauly Niloy J. Mitra Leonidas J. Guibas.
Math Modeling Final Project APPLICATIONS of FRACTALS Advisor: Professor Alber Fang Qi Pu Wan Xue Rui FRACTAL LANDSCAPES FRACTAL IMAGE COMPRESSION.
CSE554Extrinsic DeformationsSlide 1 CSE 554 Lecture 9: Extrinsic Deformations Fall 2012.
CSE554Extrinsic DeformationsSlide 1 CSE 554 Lecture 10: Extrinsic Deformations Fall 2014.
Educated Spray A Geometry Thomas Furlong Prof. Caroline Genzale August 2012.
Robust Global Registration Natasha Gelfand Niloy Mitra Leonidas Guibas Helmut Pottmann.
Automatic Feature Extraction for Multi-view 3D Face Recognition
Interactive Inverse 3D Modeling James Andrews Hailin Jin Carlo Séquin.
Computer Vision Optical Flow
Reverse Engineering Niloy J. Mitra.
Registration of two scanned range images using k-d tree accelerated ICP algorithm By Xiaodong Yan Dec
Iterative closest point algorithms
Speed and Robustness in 3D Model Registration Szymon Rusinkiewicz Princeton University.
Pauly, Keiser, Kobbelt, Gross: Shape Modeling with Point-Sampled GeometrySIGGRAPH 2003 Shape Modeling with Point-Sampled Geometry Mark Pauly Richard Keiser.
© University of Minnesota Data Mining for the Discovery of Ocean Climate Indices 1 CSci 8980: Data Mining (Fall 2002) Vipin Kumar Army High Performance.
1 GEOMETRIE Geometrie in der Technik H. Pottmann TU Wien SS 2007.
Efficient Variants of the ICP Algorithm
A Laser Range Scanner Designed for Minimum Calibration Complexity James Davis, Xing Chen Stanford Computer Graphics Laboratory 3D Digital Imaging and Modeling.
CS CS 175 – Week 2 Processing Point Clouds Registration.
Niloy J. Mitra1, Natasha Gelfand1, Helmut Pottmann2, Leonidas J
Multiple View Geometry Marc Pollefeys University of North Carolina at Chapel Hill Modified by Philippos Mordohai.
OBBTree: A Hierarchical Structure for Rapid Interference Detection Gottschalk, M. C. Lin and D. ManochaM. C. LinD. Manocha Department of Computer Science,
Computer Science Department
3D full object reconstruction from kinect Yoni Choukroun Elie Semmel Advisor: Yonathan Afflalo.
3D object capture Capture N “views” (parts of the object) –get points on surface of object –create mesh (infer connectivity) Hugues Hoppe –filter data.
כמה מהתעשייה? מבנה הקורס השתנה Computer vision.
3D Global Registration. The Problem Given: n scans around an objectGiven: n scans around an object Goal: align them allGoal: align them all First attempt:
Domain decomposition in parallel computing Ashok Srinivasan Florida State University COT 5410 – Spring 2004.
CSE554AlignmentSlide 1 CSE 554 Lecture 8: Alignment Fall 2014.
CSE554Laplacian DeformationSlide 1 CSE 554 Lecture 8: Laplacian Deformation Fall 2012.
Generating panorama using translational movement model.
Introduction Tracking the corners Camera model and collision detection Keyframes Path Correction Controlling the entire path of a virtual camera In computer.
Dobrina Boltcheva, Mariette Yvinec, Jean-Daniel Boissonnat INRIA – Sophia Antipolis, France 1. Initialization Use the.
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.
CSE554AlignmentSlide 1 CSE 554 Lecture 5: Alignment Fall 2011.
Point Set Processing and Surface Reconstruction (
A Method for Registration of 3D Surfaces ICP Algorithm
A Novel Image Registration Pipeline for 3- D Reconstruction from Microscopy Images Kun Huang, PhD; Ashish Sharma, PhD; Lee Cooper, MS; Kun Huang, PhD;
Stereo Many slides adapted from Steve Seitz.
CS 4487/6587 Algorithms for Image Analysis
CSE554AlignmentSlide 1 CSE 554 Lecture 8: Alignment Fall 2013.
Medical Image Analysis Dr. Mohammad Dawood Department of Computer Science University of Münster Germany.
112/5/ :54 Graphics II Image Based Rendering Session 11.
EFFICIENT VARIANTS OF THE ICP ALGORITHM
A B C D E F A ABSTRACT A novel, efficient, robust, feature-based algorithm is presented for intramodality and multimodality medical image registration.
Mosaics part 3 CSE 455, Winter 2010 February 12, 2010.
Using simplified meshes for crude registration of two partially overlapping range images Mercedes R.G.Márquez Wu Shin-Ting State University of Matogrosso.
Course 8 Contours. Def: edge list ---- ordered set of edge point or fragments. Def: contour ---- an edge list or expression that is used to represent.
High Resolution Surface Reconstruction from Overlapping Multiple-Views
Mesh Resampling Wolfgang Knoll, Reinhard Russ, Cornelia Hasil 1 Institute of Computer Graphics and Algorithms Vienna University of Technology.
Reverse Engineering of Point Clouds to Obtain Trimmed NURBS Lavanya Sita Tekumalla Advisor: Prof. Elaine Cohen School of Computing University of Utah Masters.
David Belton and Geoff West CRC for Spatial Information Department of Spatial Sciences Curtin University 1.
Deformation Modeling for Robust 3D Face Matching Xioguang Lu and Anil K. Jain Dept. of Computer Science & Engineering Michigan State University.
A Multiphase Approach to Efficient Surface Simplification Michael Garland Eric Shaffer University of Illinois at Urbana–Champaign Michael Garland Eric.
Dynamic Geometry Registration Maks Ovsjanikov Leonidas Guibas Natasha GelfandNiloy J. Mitra Simon Flöry Helmut Pottmann Dynamic Geometry Registration.
CSE 554 Lecture 8: Alignment
Image Representation and Description – Representation Schemes
CENG 789 – Digital Geometry Processing 08- Rigid-Body Alignment
Geometrically Stable Sampling for the ICP Algorithm
3D Photography: Epipolar geometry
3D Scan Alignment Using ICP
Image Stitching Computer Vision CS 678
APPLICATIONS of FRACTALS
Spatial Data Entry via Digitizing
Presentation transcript:

A Hierarchical Method for Aligning Warped Meshes Leslie Ikemoto 1, Natasha Gelfand 2, Marc Levoy 2 1 UC Berkeley, formerly Stanford 2 Stanford University

October 9, 2003A Hierarchical Method for Aligning Warped Meshes 2 Scan Alignment Pipeline Global relaxation Scan merging Pairwise alignment

October 9, 2003A Hierarchical Method for Aligning Warped Meshes 3 Alignment Methods Pairwise alignment: Iterated Closest Point (ICP) [Variant from Chen-Medioni ‘91] pipi qiqi nini Global relaxation: Global registration Point constraints from ICP Rigid scans 1) Compute R, t minimizing distances from p i to tangent plane at q i 2) Apply transform and repeat

October 9, 2003A Hierarchical Method for Aligning Warped Meshes 4 The Digital Michelangelo Statue Scanner Large High resolution (0.25 mm) Reconfigurable Deployed in the field Calibrated motions: pitch (yellow), pan (blue), horizontal translation (orange) Uncalibrated motions: vertical translation (red), remounting the scan head, reconfiguring the scanner, moving the entire scanner

October 9, 2003A Hierarchical Method for Aligning Warped Meshes 5 Registration Errors ICPGlobal Registration Correct calibration 0.13 mm avg. err. Incorrect calibration 1.81 mm avg. err. 4 mm misalignment Correct calibration Incorrect calibration

October 9, 2003A Hierarchical Method for Aligning Warped Meshes 6 Model Generated Spacing of range samples = 0.5 mm

October 9, 2003A Hierarchical Method for Aligning Warped Meshes 7 Possible Solutions Calibrate the scanner better Learn warp by self-calibration Introduce compensating warp –fit low-order polynomial to warp –use piecewise rigid approximation to curved warp

October 9, 2003A Hierarchical Method for Aligning Warped Meshes 8 Compensating Warp Smooth warpApproximate with a piecewise rigid model of overlapping sub-meshes Create pieces hierarchically R, TR 1..8, T original scans84 sub-meshes

October 9, 2003A Hierarchical Method for Aligning Warped Meshes 9 Proposed Pipeline Pairwise alignment Global registration Find most misaligned pair of scans Global registration Dice into pieces Pairwise alignment Scan merging Loop until error below threshold Initial guess

October 9, 2003A Hierarchical Method for Aligning Warped Meshes 10 Design Criteria for Dicing a Scan Isotropic warp –Keep even aspect ratio Overlap with neighbors –Needed for alignment –Use size to control tendency to warp Sufficiently constraining features for alignment –Pre-analyze meshes for ICP stability No features Arbitrary cutting planes

October 9, 2003A Hierarchical Method for Aligning Warped Meshes 11 Determining Placement of Cutting Planes Even aspect ratio: dice along longest dimension of oriented bounding-box Overlap: determined empirically (30% of oriented bounding box) Smaller overlap Lower squared error Larger overlap Higher squared error Mesh dicing scheme Overlap size affects “hinge stiffness”

October 9, 2003A Hierarchical Method for Aligning Warped Meshes 12 Determining Whether to Dice Using Stability Analysis Sufficiently constraining features: stability analysis to determine degenerate geometries [Gelfand et al. 3DIM03] 2 translations, 1 rotation3 rotations1 rotation, 1 translation 1 rotation 1 translation

October 9, 2003A Hierarchical Method for Aligning Warped Meshes 13 Sampling Technique Sample to constrain transformations during alignment [Gelfand et al. 3DIM03] Translation in the plane Rotation in the plane Rotation out of the plane

October 9, 2003A Hierarchical Method for Aligning Warped Meshes 14 Running Times Meshes Polygons (million) Pair Matching Global Reg. # Points Selected Dicing 4 meshes313:090: scanner sweeps 3110:330:0225,8002:15 75 sub- meshes :000:0426,2002: sub- meshes :000:0563,5103: sub- meshes :000:06123,1103: sub- meshes :000:13204,268 Forma Urbis fragment, approximately 85 cm x 120 cm Hardware: Intel P4, 2.80 GHz

October 9, 2003A Hierarchical Method for Aligning Warped Meshes 15 Model Generated OriginalAfter warping Average error = 0.8 mmAverage error = 1.15 mm

October 9, 2003A Hierarchical Method for Aligning Warped Meshes 16 More Results OriginalAfter warping Avg. err. = 0.4 mm Avg. err. = 0.8 mm Blurry lines Double lines

October 9, 2003A Hierarchical Method for Aligning Warped Meshes 17 Conclusions Alignment method for smoothly warped meshes –Introduce minimal compensating warp –Does not require a specific characterization of scanner warp –Relatively simple to implement

October 9, 2003A Hierarchical Method for Aligning Warped Meshes 18 Limitations Will not converge if: scans very noisy scans do not have many features warp is not smooth

October 9, 2003A Hierarchical Method for Aligning Warped Meshes 19 Future Work Fit smooth spline –yields non-rigid warp –retrospective scanner calibration One-to-many stability analysis Improve measurement strategy

October 9, 2003A Hierarchical Method for Aligning Warped Meshes 20 Acknowledgements Our sponsors… National Science Foundation Research Grant IIS Stanford University President’s Fund Also thanks to… Digital Michelangelo team Forma Urbis team