Multi-view reconstruction

Slides:



Advertisements
Similar presentations
Using Strong Shape Priors for Multiview Reconstruction Yunda SunPushmeet Kohli Mathieu BrayPhilip HS Torr Department of Computing Oxford Brookes University.
Advertisements

Primal-dual Algorithm for Convex Markov Random Fields Vladimir Kolmogorov University College London GDR (Optimisation Discrète, Graph Cuts et Analyse d'Images)
Algorithms for MAP estimation in Markov Random Fields Vladimir Kolmogorov University College London Tutorial at GDR (Optimisation Discrète, Graph Cuts.
O BJ C UT M. Pawan Kumar Philip Torr Andrew Zisserman UNIVERSITY OF OXFORD.
Multi-view Stereo via Volumetric Graph-cuts
L1 sparse reconstruction of sharp point set surfaces
MRI Brain Extraction using a Graph Cut based Active Contour Model Noha Youssry El-Zehiry Noha Youssry El-Zehiry and Adel S. Elmaghraby Computer Engineering.
Lena Gorelick Joint work with Frank Schmidt and Yuri Boykov Rochester Institute of Technology, Center of Imaging Science January 2013 TexPoint fonts used.
ICCV 2007 tutorial on Discrete Optimization Methods in Computer Vision part I Basic overview of graph cuts.
C. Olsson Higher-order and/or non-submodular optimization: Yuri Boykov jointly with Western University Canada O. Veksler Andrew Delong L. Gorelick C. NieuwenhuisE.
Pseudo-Bound Optimization for Binary Energies Presenter: Meng Tang Joint work with Ismail Ben AyedYuri Boykov 1 / 27.
Corp. Research Princeton, NJ Computing geodesics and minimal surfaces via graph cuts Yuri Boykov, Siemens Research, Princeton, NJ joint work with Vladimir.
Silhouettes in Multiview Stereo Ian Simon. Multiview Stereo Problem Input: – a collection of images of a rigid object (or scene) – camera parameters for.
Robust Higher Order Potentials For Enforcing Label Consistency
458 Interlude (Optimization and other Numerical Methods) Fish 458, Lecture 8.
The University of Ontario University of Bonn July 2008 Optimization of surface functionals using graph cut algorithms Yuri Boykov presenting joint work.
A Closed Form Solution to Natural Image Matting
The plan for today Camera matrix
Optical flow and Tracking CISC 649/849 Spring 2009 University of Delaware.
reconstruction process, RANSAC, primitive shapes, alpha-shapes
What Energy Functions Can be Minimized Using Graph Cuts? Shai Bagon Advanced Topics in Computer Vision June 2010.
Project 1 grades out Announcements. Multiview stereo Readings S. M. Seitz and C. R. Dyer, Photorealistic Scene Reconstruction by Voxel Coloring, International.
Extensions of submodularity and their application in computer vision
Stereo matching Class 10 Read Chapter 7 Tsukuba dataset.
Latent Boosting for Action Recognition Zhi Feng Huang et al. BMVC Jeany Son.
Reconstructing Relief Surfaces George Vogiatzis, Philip Torr, Steven Seitz and Roberto Cipolla BMVC 2004.
Surface Stereo with Soft Segmentation Michael Bleyer 1, Carsten Rother 2, Pushmeet Kohli 2 1 Vienna University of Technology, Austria 2 Microsoft Research.
10/5/ Geometric Approach Geometric Interpretation: Geometric Interpretation: Each node holds a statistics vector Each node holds a statistics vector.
Graph Cut Algorithms for Binocular Stereo with Occlusions
Graph Cut 韋弘 2010/2/22. Outline Background Graph cut Ford–Fulkerson algorithm Application Extended reading.
Object Stereo- Joint Stereo Matching and Object Segmentation Computer Vision and Pattern Recognition (CVPR), 2011 IEEE Conference on Michael Bleyer Vienna.
The University of Ontario How to fit a surface to a point cloud? or optimization of surface functionals in computer vision Yuri Boykov TRICS seminar Computer.
CS 4487/6587 Algorithms for Image Analysis
Algorithms for MAP estimation in Markov Random Fields Vladimir Kolmogorov University College London.
Auxiliary Cuts for General Classes of Higher-Order Functionals 1 Ismail Ben Ayed, Lena Gorelick and Yuri Boykov.
O BJ C UT M. Pawan Kumar Philip Torr Andrew Zisserman UNIVERSITY OF OXFORD.
The University of Ontario Yuri Boykov Research Interests n Computer Vision n Medical Image Analysis n Graphics Combinatorial optimization algorithms Geometric,
Pseudo-Bound Optimization for Binary Energies Meng Tang 1 Ismail Ben Ayed 2 Yuri Boykov 1 1 University of Western Ontario, Canada 2 GE Healthcare Canada.
The University of Ontario From photohulls to photoflux optimization Yuri Boykov University of Western Ontario Victor Lempitsky Moscow State University.
A global approach Finding correspondence between a pair of epipolar lines for all pixels simultaneously Local method: no guarantee we will have one to.
Photoconsistency constraint C2 q C1 p l = 2 l = 3 Depth labels If this 3D point is visible in both cameras, pixels p and q should have similar intensities.
Segmentation with non-linear constraints on appearance, complexity, and geometry Yuri Boykov Western Univesity Andrew Delong Olga Veksler Lena Gorelick.
Energy minimization Another global approach to improve quality of correspondences Assumption: disparities vary (mostly) smoothly Minimize energy function:
Optimal Control.
Graph Cuts vs. Level Sets
Geometric Approach Geometric Interpretation:
TP11 - Fitting: Deformable contours
Equation of Continuity
Root Finding Methods Fish 559; Lecture 15 a.
Motion Segmentation with Missing Data using PowerFactorization & GPCA
Advanced Appearance and Shape Models
Markov Random Fields with Efficient Approximations
Finite difference code for 3D edge modelling
From Photohulls to Photoflux Optimization
Secrets of GrabCut and Kernel K-means
Multiway Cut for Stereo and Motion with Slanted Surfaces
Efficient Graph Cut Optimization for Full CRFs with Quantized Edges
CS5321 Numerical Optimization
Applications of parametric max-flow problem in computer vision
A Faster Algorithm for Computing the Principal Sequence of Partitions
Part 4 Nonlinear Programming
Discrete Optimization Methods Basic overview of graph cuts
Delaunay Triangulation & Application
Parallel and Distributed Graph Cuts by Dual Decomposition
9.3 Linear programming and 2 x 2 games : A geometric approach

Optimization formulation
INDOOR DENSE DEPTH MAP AT DRONE HOVERING
CS5321 Numerical Optimization
Constraints.
Presentation transcript:

Multi-view reconstruction Vladimir Kolmogorov Yuri Boykov Carsten Rother University College London University of Western Ontario Ratio minimization - Q(·) assumed to be non-negative - can handle: - submodular / modular - modular / submodular (if numerator is negative for some x) - some other - including ratios of geometric functionals [B&K ICCV03, ICCV05] - generalizing to 3D previous formulations: [Cox et al’96], [Jermyn,Ishikawa’01] can be converted to a parametric max-flow problem - Minimize for different l’s. - Find l such that Related to isoperimetric problem (bias to circles) solved efficiently via Newton's (Dinkelbach’s) method Example 2: flux / length or length / area Example. 1 No shape bias ! One dominant solution is a global optimizer for ratio Theorem: other dominant configurations are optimal solutions for constrained ratio optimization problems for Example Divergence of photoconsistency gradients could be useful if unconstrained ratio minimizer is not a practically useful solution (e.g. too small) Visual-hull from photo-flux [Boykov&Lempitsky BMVC2006] Best for Applications of constrained ratio optimization (in 3D) Segmentation Surface fitting Multi-view reconstruction Optimizing ratio for increasingly larger lower bound on surface area Optimizing ratio for increasingly larger lower bound on surface area Divergence of photoconsistency gradients [Boykov&Lempitsky BMVC2006] Divergence of estimated surface normals [Lempitsky et.al. CVPR 2007]