High Resolution Surface Reconstruction from Overlapping Multiple-Views

Slides:



Advertisements
Similar presentations
The fundamental matrix F
Advertisements

Efficient High-Resolution Stereo Matching using Local Plane Sweeps Sudipta N. Sinha, Daniel Scharstein, Richard CVPR 2014 Yongho Shin.
Road-Sign Detection and Recognition Based on Support Vector Machines Saturnino, Sergio et al. Yunjia Man ECG 782 Dr. Brendan.
L1 sparse reconstruction of sharp point set surfaces
For Internal Use Only. © CT T IN EM. All rights reserved. 3D Reconstruction Using Aerial Images A Dense Structure from Motion pipeline Ramakrishna Vedantam.
Surface Reconstruction From Unorganized Point Sets
www-video.eecs.berkeley.edu/research
Introduction to Image-Based Rendering Jian Huang, CS 594, Spring 2002 A part of this set of slides reference slides used at Standford by Prof. Pat Hanrahan.
December 5, 2013Computer Vision Lecture 20: Hidden Markov Models/Depth 1 Stereo Vision Due to the limited resolution of images, increasing the baseline.
Dana Cobzas-PhD thesis Image-Based Models with Applications in Robot Navigation Dana Cobzas Supervisor: Hong Zhang.
Shape from Contours and Multiple Stereo A Hierarchical, Mesh-Based Approach Hendrik Kück, Wolfgang Heidrich, Christian Vogelgsang.
Plenoptic Stitching: A Scalable Method for Reconstructing 3D Interactive Walkthroughs Daniel G. Aliaga Ingrid Carlbom
Copyright  Philipp Slusallek Cs fall IBR: Model-based Methods Philipp Slusallek.
1Ellen L. Walker Recognizing Objects in Computer Images Ellen L. Walker Mathematical Sciences Dept Hiram College Hiram, OH 44234
Multiple View Geometry : Computational Photography Alexei Efros, CMU, Fall 2005 © Martin Quinn …with a lot of slides stolen from Steve Seitz and.
Contents Description of the big picture Theoretical background on this work The Algorithm Examples.
Direct Methods for Visual Scene Reconstruction Paper by Richard Szeliski & Sing Bing Kang Presented by Kristin Branson November 7, 2002.
Tamal K. Dey The Ohio State University Delaunay Meshing of Surfaces.
Multi-view stereo Many slides adapted from S. Seitz.
Surface Reconstruction Some figures by Turk, Curless, Amenta, et al.
Introduction to Computer Vision 3D Vision Topic 9 Stereo Vision (I) CMPSCI 591A/691A CMPSCI 570/670.
Lecture 1: Images and image filtering
3D from multiple views : Rendering and Image Processing Alexei Efros …with a lot of slides stolen from Steve Seitz and Jianbo Shi.
Copyright  Philipp Slusallek IBR: View Interpolation Philipp Slusallek.
Automatic Camera Calibration for Image Sequences of a Football Match Flávio Szenberg (PUC-Rio) Paulo Cezar P. Carvalho (IMPA) Marcelo Gattass (PUC-Rio)
A Novel 2D To 3D Image Technique Based On Object- Oriented Conversion.
May 2004Stereo1 Introduction to Computer Vision CS / ECE 181B Tuesday, May 11, 2004  Multiple view geometry and stereo  Handout #6 available (check with.
CSE473/573 – Stereo Correspondence
Multiple View Geometry : Computational Photography Alexei Efros, CMU, Fall 2006 © Martin Quinn …with a lot of slides stolen from Steve Seitz and.
Accurate, Dense and Robust Multi-View Stereopsis Yasutaka Furukawa and Jean Ponce Presented by Rahul Garg and Ryan Kaminsky.
David Luebke Modeling and Rendering Architecture from Photographs A hybrid geometry- and image-based approach Debevec, Taylor, and Malik SIGGRAPH.
The Story So Far The algorithms presented so far exploit: –Sparse sets of images (some data may not be available) –User help with correspondences (time.
Lecture 1: Images and image filtering CS4670/5670: Intro to Computer Vision Kavita Bala Hybrid Images, Oliva et al.,
1 Intelligent Robotics Research Centre (IRRC) Department of Electrical and Computer Systems Engineering Monash University, Australia Visual Perception.
Gwangju Institute of Science and Technology Intelligent Design and Graphics Laboratory Multi-scale tensor voting for feature extraction from unstructured.
Dobrina Boltcheva, Mariette Yvinec, Jean-Daniel Boissonnat INRIA – Sophia Antipolis, France 1. Initialization Use the.
Last Week Recognized the fact that the 2D image is a representation of a 3D scene thus contains a consistent interpretation –Labeled edges –Labeled vertices.
Lecture 12 Stereo Reconstruction II Lecture 12 Stereo Reconstruction II Mata kuliah: T Computer Vision Tahun: 2010.
Automatic Registration of Color Images to 3D Geometry Computer Graphics International 2009 Yunzhen Li and Kok-Lim Low School of Computing National University.
Interactive Virtual Relighting and Remodelling of Real Scenes C. Loscos 1, MC. Frasson 1,2,G. Drettakis 1, B. Walter 1, X. Granier 1, P. Poulin 2 (1) iMAGIS*
Algorithms for Triangulations of a 3D Point Set Géza Kós Computer and Automation Research Institute Hungarian Academy of Sciences Budapest, Kende u
Local invariant features Cordelia Schmid INRIA, Grenoble.
Reconstructing 3D mesh from video image sequences supervisor : Mgr. Martin Samuelčik by Martin Bujňák specifications Master thesis
Point Set Processing and Surface Reconstruction (
Image-based rendering Michael F. Cohen Microsoft Research.
I 3D: Interactive Planar Reconstruction of Objects and Scenes Adarsh KowdleYao-Jen Chang Tsuhan Chen School of Electrical and Computer Engineering Cornell.
Ray Divergence-Based Bundle Adjustment Conditioning for Multi-View Stereo Mauricio Hess-Flores 1, Daniel Knoblauch 2, Mark A. Duchaineau 3, Kenneth I.
Why is computer vision difficult?
© 2005 Martin Bujňák, Martin Bujňák Supervisor : RNDr.
Vehicle Segmentation and Tracking From a Low-Angle Off-Axis Camera Neeraj K. Kanhere Committee members Dr. Stanley Birchfield Dr. Robert Schalkoff Dr.
Interactive Point-based Modeling of Complex Objects from Images Pierre Poulin (a,b) Marc Stamminger (a,c) François Duranleau (b) Marie-Claude Frasson (a)
Communication Systems Group Technische Universität Berlin S. Knorr A Geometric Segmentation Approach for the 3D Reconstruction of Dynamic Scenes in 2D.
1 Research Question  Can a vision-based mobile robot  with limited computation and memory,  and rapidly varying camera positions,  operate autonomously.
COMP322/S2000/L171 Robot Vision System Major Phases in Robot Vision Systems: A. Data (image) acquisition –Illumination, i.e. lighting consideration –Lenses,
Raquel A. Romano 1 Scientific Computing Seminar May 12, 2004 Projective Geometry for Computer Vision Projective Geometry for Computer Vision Raquel A.
112/5/ :54 Graphics II Image Based Rendering Session 11.
Segmentation of Vehicles in Traffic Video Tun-Yu Chiang Wilson Lau.
CSE 140: Computer Vision Camillo J. Taylor Assistant Professor CIS Dept, UPenn.
Presenter : Jia-Hao Syu
Yizhou Yu Texture-Mapping Real Scenes from Photographs Yizhou Yu Computer Science Division University of California at Berkeley Yizhou Yu Computer Science.
875 Dynamic Scene Reconstruction
Image-Based Rendering Geometry and light interaction may be difficult and expensive to model –Think of how hard radiosity is –Imagine the complexity of.
John Morris These slides were adapted from a set of lectures written by Mircea Nicolescu, University of Nevada at Reno Stereo Vision Iolanthe in the Bay.
Processing Images and Video for An Impressionist Effect Automatic production of “painterly” animations from video clips. Extending existing algorithms.
Correspondence and Stereopsis. Introduction Disparity – Informally: difference between two pictures – Allows us to gain a strong sense of depth Stereopsis.
Motion and Optical Flow
Reconstruction For Rendering distribution Effect
Vehicle Segmentation and Tracking in the Presence of Occlusions
Video Compass Jana Kosecka and Wei Zhang George Mason University
Lecture 1: Images and image filtering
Presentation transcript:

High Resolution Surface Reconstruction from Overlapping Multiple-Views Nader Salman nsalman@sophia.inria.fr Mariette Yvinec myvinec@sophia.inria.fr Geometrica Team-Project JGA January 29th, 2009

Motivation Urban scenes are hard to model Complex geometry and topology Severe occlusions  We target automatic surface reconstruction from stereo vision data http://cvlab.epfl.ch/~strecha/multiview/denseMVS.html

Related Work Image-based methods Model-based methods Reconstructing 3D models of objects and scenes from N-views Image-based methods Image mosaics [Szeliski et al. 97] Lightfield [Levoy et al. 96] and Lumigraph [Cohen et al. 96] Model-based methods Active sensing approach [Turk et al. 94], [Laurendeau et al. 95], [Levoy et al. 96] Passive sensing approach Silhouette based [Niem et al. 97] Structure from motion Simple planar scenes [Zisserman et al. 96, 98] Semi-automatic reconstruction [Debevec et al. 96] Automatic reconstruction [Boissonnat et al. 88], [Taylor et al. 03], [Hilton 05], [Pons et al. 07] Image based methods : no explicit 3D model of the scene, new views are synthesized by resampling directly the captured images Image mosaics : multiple overlapping images are matched and integrated into a single panoramic image Lightfield & Lumigraph : Large number of calibrated images are captured and resampled to generate new views. Model based methods : Reconstruction of 3D surface model that can subsequently be rendered to generate new views Active sensing : project structured light pattern into the scene to recover dense 3D measurements of points on the scene surface (Range images : 2D images + depth per pixel => dense data) Passive sensing : reconstruct 3D estimates of observed scene features from multiple camera views (Sparse data) Silhouette based: Use foreground/background separation to reconstruct object shape from occluded contours. Structure from motion: Reconstruct 3D estimate of the scene structure from passive video image sequences. Planar surface fitting (Simple planar scenes) : planar surfaces can be fitted to unstructured cloud of 3D points. Semi-automatic algorithm : reconstruct scene model from sparse 3D data # volumetric primitives placed according to the 3D features of the scene and constrained optimization reconstructs a best-fit model. Automatic algorithm : reconstruct automatically scene geometry from sparse 3D data set.

System Overview Image Capture 2D Constrained Triangulation 3D Triangle Soup Triangle soup Filtering Structure from Motion Input Preprocessing Reconstruction

System Overview Image Capture 2D Constrained Triangulation 3D Triangle Soup Triangle soup Filtering Structure from Motion Input Preprocessing Reconstruction 5

Image Capture and 3D recovery (1) Video sequences captured images (100-3000 images) ~10k points Matchmoving (camera calibration & point cloud generation) [MatchMover,Voodoo/VooCAT, or Boujou]

Image Capture and 3D recovery (2) High resolution localized still pictures captured images (10-50 images) Features extraction [ENPC/Certis – CSTB] ~300k points Frames of tracked video [MatchMover, Voodoo/VooCAT, or Boujou] Hardware [Gyroviz]

Image Capture and 3D recovery (2) High resolution localized still pictures captured images (10-50 images) Features extraction [ENPC/Certis – CSTB] ~300k points Frames of tracked video [MatchMover, Voodoo/VooCAT, or Boujou] Hardware [Gyroviz] 8

Image Capture and 3D recovery (2) Matchmoving [Voodoo] Output is data dependent - Movement while shooting video - Lighting conditions Sparse point clouds Outliers ~300k points ~10k points Features extraction [ENPC/Certis – CSTB] Dense point clouds (10-20x more) Requires calibrated images Many outliers Slow 9

System Overview Image Capture 2D Constrained Triangulation 3D Triangle Soup Triangle soup Filtering Structure from Motion Input Preprocessing Reconstruction 10

Input Preprocessing (1) Outliers removal wrt average K-nearest neighbors squared distance Detected outliers Detected outliers

Input Preprocessing (2) Outliers removal wrt point error (number of cameras, cameras cone angle) Detected outliers Detected outliers

Input Preprocessing (3) 3D Points merging Point cloud smoothing (jet-fitting + reprojection) [Pouget-Cazals07]

System Overview Image Capture 2D Constrained Triangulation 3D Triangle Soup Triangle soup Filtering Structure from Motion Input Preprocessing Reconstruction 14

Reconstruction Algorithm 1 Extract 3D triangles that lie on the surface of the scene. Extract a surface out of these triangles. 2

Triangle soup extraction (1) Idea: Extract 3D triangles whose corresponding 2D does not intersect the image contour N times N images Step 3 2D constrained Tessellation Backprojected into 3D space Step 4 Step 1 Filter triangle soup Contour extraction Constraints retrieval Step 2 Triangle soup

Triangle soup extraction (2) Idea: Extract 3D triangles whose corresponding 2D does not intersect the image contour Step 1: Contour extraction Grayscale Effective luminance of a pixel Filter Gaussian smoothing mask Extract contours Frei-chen convolution masks Survey www.2d3.com

Triangle soup extraction (3) Idea: Extract 3D triangles whose corresponding 2D does not intersect the image contour Step 2: Constraints retrieval Build complete graph of feature points keep edges that respect the contour The edge weight depends on number of white pixels Adapt Needleman-Wunsch [NW1970] Filter collinear and intersecting edges Give higher priority to short edges

Triangle soup extraction (4) Idea: Extract 3D triangles whose corresponding 2D does not intersect the image contour Step 3: 2D constrained tessellation and backprojection Add constraints in 2D Delaunay tessellation Backproject into 3D space using corresponding 3D points N times N images Triangle Soup

System Overview Image Capture 2D Constrained Triangulation 3D Triangle Soup Triangle soup Filtering Structure from Motion Input Preprocessing Reconstruction 20

Triangle soup filtering (1) Problem: Triangle soup contains lots of incorrect triangles Filter triangles using size heuristic Compute bounding box of triangle soup Each triangle longest edge is compared to the half diagonal of the bounding box Filter triangles using visibility constraint [Taylor03] Empty ray in space between the camera location and 3D point position.

Triangle soup filtering (1) Before size heuristic After size heuristic 22

Triangle soup filtering (2) Problem: Triangle soup contains lots of incorrect triangles Filter triangles using size heuristic Compute bounding box of triangle soup Each triangle longest edge is compared to the half diagonal of the bounding box Filter triangles using visibility constraint [Taylor03] Empty ray in space between the camera location and 3D point position. 23

Triangle soup filtering (2) Before visibility constraint After visibility constraint 24

System Overview Image Capture 2D Constrained Triangulation 3D Triangle Soup Triangle soup Filtering Structure from Motion Input Preprocessing Reconstruction 25

Reconstruction (1) Restricted Delaunay How do we extract a surface from this polygon soup? Restricted Delaunay Compute 3D Delaunay triangulation of triangle soup vertices Compute restricted Delaunay to the union of triangles

Restricted Delaunay reconstruction Show results

Reconstruction (2) OR Restricted Delaunay Extensions: How do we extract a surface from this polygon soup? Restricted Delaunay  Triangles respect empty circle condition Non watertight surface (holes) Extensions: Remesh using restricted Delaunay OR Scatter a large number of points continuously across the surface of each triangle Create an implicit surface that approximates the triangle soup

Some results LA_Aerial www.realviz.com ~8k points 29

Some results Lion www.realviz.com ~20k points 30

Results Ours [Furokawa et al. 2007] [Strecha et al. 2006] [Pons et al. 2009] Ours 31

Future work More data acquisition and testing for automatic parameter Improve and complete existing algorithms Triangles soup algorithm Step 1 : Contour extraction Segmentation techniques [Lévy06] Histogram for automatic threshold [Asano08] Step 4 : Triangle soup filtering Some “big triangles” are correct Use circumscribing circle to differentiate between detected triangles Project triangles on respective images Use cross correlation to detect incorrect triangles Sharp features detection and reconstruction

Thank you Nader Salman http://www.gyroviz.org