Multi-view Stereo via Volumetric Graph-cuts George Vogiatzis, Philip H. S. Torr Roberto Cipolla.

Slides:



Advertisements
Similar presentations
You have been given a mission and a code. Use the code to complete the mission and you will save the world from obliteration…
Advertisements

Using Strong Shape Priors for Multiview Reconstruction Yunda SunPushmeet Kohli Mathieu BrayPhilip HS Torr Department of Computing Oxford Brookes University.
Chapter 1 The Study of Body Function Image PowerPoint
Cognitive Radio Communications and Networks: Principles and Practice By A. M. Wyglinski, M. Nekovee, Y. T. Hou (Elsevier, December 2009) 1 Chapter 12 Cross-Layer.
CHAPTER 1: COMPUTATIONAL MODELLING
Importance-Driven Focus of Attention and Meister Eduard Gröller 1 1 Vienna University of Technology, Austria 2 University of Girona, Spain 3 University.
Jeopardy Q 1 Q 6 Q 11 Q 16 Q 21 Q 2 Q 7 Q 12 Q 17 Q 22 Q 3 Q 8 Q 13
Jeopardy Q 1 Q 6 Q 11 Q 16 Q 21 Q 2 Q 7 Q 12 Q 17 Q 22 Q 3 Q 8 Q 13
FACTORING ax2 + bx + c Think “unfoil” Work down, Show all steps.
Year 6 mental test 5 second questions
Mean-Field Theory and Its Applications In Computer Vision1 1.
Mean-Field Theory and Its Applications In Computer Vision6 1.
Algorithms for MAP estimation in Markov Random Fields Vladimir Kolmogorov University College London Tutorial at GDR (Optimisation Discrète, Graph Cuts.
Mean-Field Theory and Its Applications In Computer Vision2
Visualization Techniques -
Multi-view Stereo via Volumetric Graph-cuts
Solve Multi-step Equations
Randomized Algorithms Randomized Algorithms CS648 1.
ABC Technology Project
Reconstruction from Voxels (GATE-540)
VOORBLAD.
Computer Graphics An Introduction. What’s this course all about? 05/10/2014 Lecture 1 2 We will cover… Graphics programming and algorithms Graphics data.
Understanding Generalist Practice, 5e, Kirst-Ashman/Hull
25 seconds left…...
Various Regularization Methods in Computer Vision Min-Gyu Park Computer Vision Lab. School of Information and Communications GIST.
Multiview Reconstruction. Why More Than 2 Views? BaselineBaseline – Too short – low accuracy – Too long – matching becomes hard.
Introduction to Markov Random Fields and Graph Cuts Simon Prince
Corp. Research Princeton, NJ Computing geodesics and minimal surfaces via graph cuts Yuri Boykov, Siemens Research, Princeton, NJ joint work with Vladimir.
MultiView Stereo Steve Seitz CSE590SS: Vision for Graphics.
Shape from Contours and Multiple Stereo A Hierarchical, Mesh-Based Approach Hendrik Kück, Wolfgang Heidrich, Christian Vogelgsang.
Silhouettes in Multiview Stereo Ian Simon. Multiview Stereo Problem Input: – a collection of images of a rigid object (or scene) – camera parameters for.
Last Time Pinhole camera model, projection
Background Removal of Multiview Images by Learning Shape Priors Yu-Pao Tsai, Cheng-Hung Ko, Yi-Ping Hung, and Zen-Chung Shih.
Computational Photography: Image-based Modeling Jinxiang Chai.
CSCE 641 Computer Graphics: Image-based Modeling Jinxiang Chai.
Project 2 winners Think about Project 3 Guest lecture on Monday: Aseem Announcements.
Stereo & Iterative Graph-Cuts Alex Rav-Acha Vision Course Hebrew University.
Multiview stereo. Volumetric stereo Scene Volume V Input Images (Calibrated) Goal: Determine occupancy, “color” of points in V.
Multi-view stereo Many slides adapted from S. Seitz.
MRF Labeling With Graph Cut CMPUT 615 Nilanjan Ray.
The plan for today Camera matrix
Stereo Computation using Iterative Graph-Cuts
Project 1 grades out Announcements. Multiview stereo Readings S. M. Seitz and C. R. Dyer, Photorealistic Scene Reconstruction by Voxel Coloring, International.
Lecture 25: Multi-view stereo, continued
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.
Manhattan-world Stereo Y. Furukawa, B. Curless, S. M. Seitz, and R. Szeliski 2009 IEEE Conference on Computer Vision and Pattern Recognition (CVPR), pp.
Review: Binocular stereo If necessary, rectify the two stereo images to transform epipolar lines into scanlines For each pixel x in the first image Find.
Research & Innovation 1 An Industry Perspective on VVG Research Oliver Grau BBC Research & Innovation VVG SUMMER SCHOOL '07.
Reconstructing Relief Surfaces George Vogiatzis, Philip Torr, Steven Seitz and Roberto Cipolla BMVC 2004.
Fast Approximate Energy Minimization via Graph Cuts
Lecture 12 Stereo Reconstruction II Lecture 12 Stereo Reconstruction II Mata kuliah: T Computer Vision Tahun: 2010.
Graph Cut Algorithms for Binocular Stereo with Occlusions
Graph Cut 韋弘 2010/2/22. Outline Background Graph cut Ford–Fulkerson algorithm Application Extended reading.
CS774. Markov Random Field : Theory and Application Lecture 13 Kyomin Jung KAIST Oct
Interactive Graph Cuts for Optimal Boundary & Region Segmentation of Objects in N-D Images (Fri) Young Ki Baik, Computer Vision Lab.
How to reform a terrain into a pyramid Takeshi Tokuyama (Tohoku U) Joint work with Jinhee Chun (Tohoku U) Naoki Katoh (Kyoto U) Danny Chen (U. Notre Dame)
55:148 Digital Image Processing Chapter 11 3D Vision, Geometry Topics: Basics of projective geometry Points and hyperplanes in projective space Homography.
875 Dynamic Scene Reconstruction
The University of Ontario From photohulls to photoflux optimization Yuri Boykov University of Western Ontario Victor Lempitsky Moscow State University.
Markov Random Fields in Vision
Energy minimization Another global approach to improve quality of correspondences Assumption: disparities vary (mostly) smoothly Minimize energy function:
Robot Vision SS 2011 Matthias Rüther / Matthias Straka 1 ROBOT VISION Lesson 7: Volumetric Object Reconstruction Matthias Straka.
Graph Cuts vs. Level Sets
From Photohulls to Photoflux Optimization
Announcements Midterm due now Project 2 artifacts: vote today!
Announcements Project 3 out today (help session at end of class)
Presentation transcript:

Multi-view Stereo via Volumetric Graph-cuts George Vogiatzis, Philip H. S. Torr Roberto Cipolla

Shape From Images

Dense Stereo reconstruction problem: Input Set of images of a scene I={I 1,…,I K } Camera matrices P 1,…,P K Output Surface model

Shape parametrisation Disparity-map parameterisation MRF formulation – good optimisation techniques exist (Graph-cuts, Loopy BP) MRF smoothness is viewpoint dependent Disparity is unique per pixel – only functions represented

Shape parametrisation Volumetric parameterisation – e.g. Level- sets, Space carving etc. Able to cope with non-functions Convergence properties not well understood Memory intensive For Space carving, no simple way to impose surface smoothness

Solution ? Cast volumetric methods in MRF framework Benefits: General surfaces can be represented Optimisation is tractable (MRF solvers) Occlusions can be approximately modelled Smoothness is viewpoint independent

Graph cuts

Graph cuts

Graph cuts =18 13

Volumetric Graph cuts for segmentation Volume is discretized A binary MRF is defined on the voxels Regular grid (6 or 26 neighbourhood) Voxels are labelled as OBJECT and BACKGROUND Labelling cost set by OBJECT / BACKGROUND intensity statistics Compatibility cost set by edge intensities

Volumetric Graph cuts for stereo How to define Inside and Outside labels How to deal with occlusion

Volumetric Graph cuts Source Sink Min cut

Face

Face - Visual Hull

Face - Slice

Face - Slice with graphcut

Face - Reconstruction

Protrusion problem Balooning force favouring bigger volumes L.D. Cohen and I. Cohen. Finite-element methods for active contour models and balloons for 2-d and 3-d images. PAMI, 15(11):1131–1147, November 1993.

Protrusion problem Balooning force favouring bigger volumes L.D. Cohen and I. Cohen. Finite-element methods for active contour models and balloons for 2-d and 3-d images. PAMI, 15(11):1131–1147, November 1993.

Protrusion problem

Graph

Results Model House

Results Model House – Visual Hull

Results Model House

Results Stone carving

Results Haniwa

Summary Novel formulation for multiview stereo Volumetric scene representation Computationally tractable global optimisation using Graph-cuts. Visual hull for occlusions and geometric constraint

Benefits 1.General surfaces and objects can be fully represented and computed as a single surface. 2.The representation and smoothness constraint is image and viewpoint independent. 3.Multiple views of the scene can be used with occlusions approximately modelled. 4.Optimisation is computationally tractable, using existing max-flow algorithms.