Context-based Surface Completion Andrei Sharf, Marc Alexa, Daniel Cohen-Or.

Slides:



Advertisements
Similar presentations
Image Registration  Mapping of Evolution. Registration Goals Assume the correspondences are known Find such f() and g() such that the images are best.
Advertisements

Image Repairing: Robust Image Synthesis by Adaptive ND Tensor Voting IEEE Computer Society Conference on Computer Vision and Pattern Recognition Jiaya.
L1 sparse reconstruction of sharp point set surfaces
Surface Reconstruction From Unorganized Point Sets
Least-squares Meshes Olga Sorkine and Daniel Cohen-Or Tel-Aviv University SMI 2004.
Partial and Approximate Symmetry Detection for 3D Geometry Mark Pauly Niloy J. Mitra Leonidas J. Guibas.
Extended Gaussian Images
Procedural Content Tiling
Automatic Feature Extraction for Multi-view 3D Face Recognition
Computer Graphics Group Alexander Hornung Alexander Hornung and Leif Kobbelt RWTH Aachen Robust Reconstruction of Watertight 3D Models from Non-uniformly.
Atomic Volumes for Mesh Completion Joshua Podolak Szymon Rusinkiewicz Princeton University.
Robust Repair of Polygonal Models Tao Ju Rice University.
Computing 3D Geometry Directly From Range Images Sarah F. Frisken and Ronald N. Perry Mitsubishi Electric Research Laboratories.
High-Quality Simplification with Generalized Pair Contractions Pavel Borodin,* Stefan Gumhold, # Michael Guthe,* Reinhard Klein* *University of Bonn, Germany.
INFORMATIK Differential Coordinates for Interactive Mesh Editing Yaron Lipman Olga Sorkine Daniel Cohen-Or David Levin Tel-Aviv University Christian Rössl.
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,
Surface Reconstruction from 3D Volume Data. Problem Definition Construct polyhedral surfaces from regularly-sampled 3D digital volumes.
Pauly, Keiser, Kobbelt, Gross: Shape Modeling with Point-Sampled GeometrySIGGRAPH 2003 Shape Modeling with Point-Sampled Geometry Mark Pauly Richard Keiser.
Filling Arbitrary Holes in Finite Element Models 17 th International Meshing Roundtable 2008 Schilling, Bidmon, Sommer, and Ertl.
Correspondence & Symmetry
Texture Splicing Yiming Liu, Jiaping Wang, Su Xue, Xin Tong, Sing Bing Kang, Baining Guo.
A Laser Range Scanner Designed for Minimum Calibration Complexity James Davis, Xing Chen Stanford Computer Graphics Laboratory 3D Digital Imaging and Modeling.
Curve Analogies Aaron Hertzmann Nuria Oliver Brain Curless Steven M. Seitz University of Washington Microsoft Research Thirteenth Eurographics.
Niloy J. Mitra1, Natasha Gelfand1, Helmut Pottmann2, Leonidas J
Texture Reading: Chapter 9 (skip 9.4) Key issue: How do we represent texture? Topics: –Texture segmentation –Texture-based matching –Texture synthesis.
reconstruction process, RANSAC, primitive shapes, alpha-shapes
Andrew Nealen and Marc Alexa, Discrete Geometric Modeling Group, TU Darmstadt, 2003 Hybrid Texture Synthesis Andrew Nealen Marc Alexa Discrete Geometric.
Surface Light Fields for 3D Photography Daniel Wood Daniel Azuma Wyvern Aldinger Brian Curless Tom Duchamp David Salesin Werner Stuetzle.
Spectral Processing of Point-sampled Geometry
A Hierarchical Method for Aligning Warped Meshes Leslie Ikemoto 1, Natasha Gelfand 2, Marc Levoy 2 1 UC Berkeley, formerly Stanford 2 Stanford University.
Robust Moving Least-squares Fitting with Sharp Features Shachar Fleishman* Daniel Cohen-Or § Claudio T. Silva* * University of Utah § Tel-Aviv university.
Computer Graphics recipes for analyzing and enhancing shape information Endowing 3D shapes with Semantics in Virtual Worlds Michela Mortara, Chiara Catalano,
Modeling and representation 1 – comparative review and polygon mesh models 2.1 Introduction 2.2 Polygonal representation of three-dimensional objects 2.3.
Introduction --Classification Shape ContourRegion Structural Syntactic Graph Tree Model-driven Data-driven Perimeter Compactness Eccentricity.
Projective Texture Atlas for 3D Photography Jonas Sossai Júnior Luiz Velho IMPA.
CSE554Laplacian DeformationSlide 1 CSE 554 Lecture 8: Laplacian Deformation Fall 2012.
Dobrina Boltcheva, Mariette Yvinec, Jean-Daniel Boissonnat INRIA – Sophia Antipolis, France 1. Initialization Use the.
Automatic Registration of Color Images to 3D Geometry Computer Graphics International 2009 Yunzhen Li and Kok-Lim Low School of Computing National University.
Digital Image Processing Lecture 20: Representation & Description
Algorithms for Triangulations of a 3D Point Set Géza Kós Computer and Automation Research Institute Hungarian Academy of Sciences Budapest, Kende u
University of Coimbra Reconstruction of Voxels from Sensor Data Ricardo Martins Coimbra, 19 th January 2010 Doctoral Programme in Electrical Engineering.
Reporter: Zhonggui Chen
2D/3D Shape Manipulation, 3D Printing Shape Representations Slides from Olga Sorkine February 20, 2013 CS 6501.
1 Surface Applications Fitting Manifold Surfaces To 3D Point Clouds, Cindy Grimm, David Laidlaw and Joseph Crisco. Journal of Biomechanical Engineering,
Texture Optimization for Example-based Synthesis Vivek Kwatra Irfan Essa Aaron Bobick Nipun Kwatra.
INFORMATIK Laplacian Surface Editing Olga Sorkine Daniel Cohen-Or Yaron Lipman Tel Aviv University Marc Alexa TU Darmstadt Christian Rössl Hans-Peter Seidel.
Andrew Nealen / Olga Sorkine / Mark Alexa / Daniel Cohen-Or SoHyeon Jeong 2007/03/02.
Introduction --Classification Shape ContourRegion Structural Syntactic Graph Tree Model-driven Data-driven Perimeter Compactness Eccentricity.
A Computationally Efficient Framework for Modeling Soft Body Impact Sarah F. Frisken and Ronald N. Perry Mitsubishi Electric Research Laboratories.
3D Object Representations
Temporally Coherent Completion of Dynamic Shapes AUTHORS:HAO LI,LINJIE LUO,DANIEL VLASIC PIETER PEERS,JOVAN POPOVIC,MARK PAULY,SZYMON RUSINKIEWICZ Presenter:Zoomin(Zhuming)
INFORMATIK A Multi-scale Approach to 3D Scattered Data Interpolation with Compactly Supported Basis Functions Yutaka Ohtake Yutaka Ohtake Alexander Belyaev.
Mesh Quilting For Geometric Texture Synthesis Kun Zhou et al. In SIGGRAPH 2006 발표 이성호 2009 년 4 월 15 일.
2D Texture Synthesis Instructor: Yizhou Yu. Texture synthesis Goal: increase texture resolution yet keep local texture variation.
Using simplified meshes for crude registration of two partially overlapping range images Mercedes R.G.Márquez Wu Shin-Ting State University of Matogrosso.
Automatic Construction of Quad-Based Subdivision Surfaces using Fitmaps Daniele Panozzo, Enrico Puppo DISI - University of Genova, Italy Marco Tarini DICOM.
Methods for 3D Shape Matching and Retrieval
Geometry Synthesis Ares Lagae Olivier Dumont Philip Dutré Department of Computer Science Katholieke Universiteit Leuven 10 August, 2004.
Image features and properties. Image content representation The simplest representation of an image pattern is to list image pixels, one after the other.
Solid Modeling Dr. Scott Schaefer.
3D Object Representations 2009, Fall. Introduction What is CG?  Imaging : Representing 2D images  Modeling : Representing 3D objects  Rendering : Constructing.
Faculty of Sciences and Technology from University of Coimbra Generating 3D Meshes from Range Data [1] Graphic Computation and Three-dimensional Modeling.
Image Representation and Description – Representation Schemes
Digital Image Processing Lecture 20: Representation & Description
Detail Preserving Shape Deformation in Image Editing
3D Object Representations
From Point Clouds To Trimmed NURBS
CSE 185 Introduction to Computer Vision
Overview of Modeling 김성남.
Image Registration  Mapping of Evolution
Presentation transcript:

Context-based Surface Completion Andrei Sharf, Marc Alexa, Daniel Cohen-Or

IntroductionIntroduction Holes in models: Imperfect range scanned data: –Complex objects with non-visible regions. –Misalignment of multiple-views depth image scans. –Material reflections. Surface editing operations.

MotivationMotivation Smooth filling is sufficient: Small holes. Smooth surfaces. Smooth filling is insufficient : Surfaces containing fine geometric detail. Topology of hole is more complex than a disk.

Context-based Completion Complete the missing region with patches that conform with its context SmoothContext-based

MethodMethod Import patches with matching context from the surface itself : Analyze surface characteristics. Find best matching patch. Fit imported patch to boundary.

Related Work Example-based image completion: [Drori et al. 2003; Jia and tang 2003; Sun et al. 2003;] Texture synthesis: [Efros and Leung 1999; Efros and Freeman 2001;Wei and Levoy 2000; Ying et al. 2001;] Smooth surface completion: [Curless and Levoy 1996; Davis et al. 2002; Ilic and Fua 2003; Verdera et al. 2003; Liepa 2003;] Model-based surface reconstruction [Savchenko et al. 2002] Curve analogies [Hertzmann et al. 2002] Drori et al. 03 Liepa 03 Wei and Levoi 00 Hertzmann et al. 02

Moving to 3D Surfaces Images have a regular spatial structure domain. Problems in 3D: Topology and geometry of missing region. Fitting a patch to the boundary of the missing region. Definition of similarity of shapes. Definition of a surface patch.

AlgorithmAlgorithm Given an incomplete shape Create initial spatial subdivision For each cell –Compute a local shape representation. –Compute a shape signature. For each empty cell: –Find matching nonempty cell ω’. –Copy patch of ω’ into ω. Subdivide cells and repeat Until completed region matches its neighborhood.

AlgorithmAlgorithm Given an incomplete shape Create initial spatial subdivision For each cell –Compute a local shape representation. –Compute a shape signature. For each empty cell: –Find matching nonempty cell ω’. –Copy patch of ω’ into ω. Subdivide cells and repeat Until completed region matches its neighborhood.

Shape Representation Shape sampled point-set –Range scan output –Easy to merge Octree hierarchy on top of the point set Implicit surface approximation by fitting polynomials [Ohtake et al. 2003] : –General quadric: –Bivariate quadratic: –Edge or corner fitting

Shape Analysis A local signature of a cell consists: Implicit shape characteristics: –Signed distance –Normal variation Detail amount: –Depth in octree

AlgorithmAlgorithm Given an incomplete shape Create initial spatial subdivision For each cell –Compute a local shape representation. –Compute a shape signature. For each empty cell: –Find matching nonempty cell ω’. –Copy patch of ω’ into ω. Subdivide cells and repeat Until completed region matches its neighborhood.

Missing Region Automatic identification: Intersect shape approximation with cells. Empty cell that intersects surface is part of missing region. Empty cell definition can alter due to refinement of missing region.  

MatchingMatching Distance metrics: d c : Signature distance inside cells. d a : Signature distance of adjacent cells. d l : Difference in amount of detail. Find most similar non-empty cell:

Matching-Candidate Set Non-empty cells of the same size Symmetry rotations of cells (  /2, ,...) Rotation of all point-set with some angle (  /4,  /3,...)

Transferring Points ICP: Copy points into empty cell. Find closest point correspondence Align points rigidly Align points non-rigidly using polynomial form.

AlgorithmAlgorithm Given an incomplete shape Create initial spatial subdivision For each cell –Compute a local shape representation. –Compute a shape signature. For each empty cell: –Find matching nonempty cell ω’. –Copy patch of ω’ into ω. Subdivide cells and repeat Until completed region matches its neighborhood.

David’s Hair OriginalDown- sampled Smooth completion Context- based completion

Completion Process Original Initial approximation Final result

Manual Editing of Bunny Model

Manual Editing of Knot Model

Scan of “Youth” Statue (Rear View) OriginalSmoothResult

Scan of Human Bone Original Smooth Result

Limitations: Semantics

Sample Rate vs. Detail Frequency

SummarySummary A fully automatic method to complete a missing region in a surface from its context. Completed patches geometrically conform with neighborhood. Incremental scale-space framework for finer approximation of the unknown region.

Future Work Explore with other spatial hierarchies. Enlarge the search space of examples by building a class based example set. Couple method with image completion methods for texture completion. Rotation and translation invariant signature

Acknowledgments: –David Levin and Olga Sorkine –Israel science foundation; Israeli ministry of science –Digital Michelangelo project 3D model repository; Stanford 3D scanning repository; Darmstadt university of technology; Imager computer graphics laboratory of the university of British Columbia

Thank you