Ray Divergence-Based Bundle Adjustment Conditioning for Multi-View Stereo Mauricio Hess-Flores 1, Daniel Knoblauch 2, Mark A. Duchaineau 3, Kenneth I.

Slides:



Advertisements
Similar presentations
Bayesian Belief Propagation
Advertisements

The fundamental matrix F
CSE473/573 – Stereo and Multiple View Geometry
For Internal Use Only. © CT T IN EM. All rights reserved. 3D Reconstruction Using Aerial Images A Dense Structure from Motion pipeline Ramakrishna Vedantam.
www-video.eecs.berkeley.edu/research
MASKS © 2004 Invitation to 3D vision Lecture 7 Step-by-Step Model Buidling.
Computer vision: models, learning and inference
Multiple View Reconstruction Class 24 Multiple View Geometry Comp Marc Pollefeys.
Object Recognition & Model Based Tracking © Danica Kragic Tracking system.
N-view factorization and bundle adjustment CMPUT 613.
Chapter 6 Feature-based alignment Advanced Computer Vision.
Two-view geometry.
Lecture 8: Stereo.
Instructor: Mircea Nicolescu Lecture 13 CS 485 / 685 Computer Vision.
Camera calibration and epipolar geometry
Structure from motion.
Last Time Pinhole camera model, projection
Epipolar geometry. (i)Correspondence geometry: Given an image point x in the first view, how does this constrain the position of the corresponding point.
Structure from motion. Multiple-view geometry questions Scene geometry (structure): Given 2D point matches in two or more images, where are the corresponding.
Uncalibrated Geometry & Stratification Sastry and Yang
Many slides and illustrations from J. Ponce
Lecture 11: Structure from motion CS6670: Computer Vision Noah Snavely.
3D Computer Vision and Video Computing 3D Vision Lecture 14 Stereo Vision (I) CSC 59866CD Fall 2004 Zhigang Zhu, NAC 8/203A
Multiple View Reconstruction Class 23 Multiple View Geometry Comp Marc Pollefeys.
CSCE 641 Computer Graphics: Image-based Modeling (Cont.) Jinxiang Chai.
Multi-view geometry. Multi-view geometry problems Structure: Given projections of the same 3D point in two or more images, compute the 3D coordinates.
Automatic Camera Calibration
Computer vision: models, learning and inference
Path-Based Constraints for Accurate Scene Reconstruction from Aerial Video Mauricio Hess-Flores 1, Mark A. Duchaineau 2, Kenneth I. Joy 3 Abstract - This.
Sequential Reconstruction Segment-Wise Feature Track and Structure Updating Based on Parallax Paths Mauricio Hess-Flores 1, Mark A. Duchaineau 2, Kenneth.
Final Exam Review CS485/685 Computer Vision Prof. Bebis.
Multimodal Interaction Dr. Mike Spann
Multi-view geometry.
Automatic Registration of Color Images to 3D Geometry Computer Graphics International 2009 Yunzhen Li and Kok-Lim Low School of Computing National University.
1 Preview At least two views are required to access the depth of a scene point and in turn to reconstruct scene structure Multiple views can be obtained.
A Local Adaptive Approach for Dense Stereo Matching in Architectural Scene Reconstruction C. Stentoumis 1, L. Grammatikopoulos 2, I. Kalisperakis 2, E.
Course 12 Calibration. 1.Introduction In theoretic discussions, we have assumed: Camera is located at the origin of coordinate system of scene.
Visualization of Scene Structure Uncertainty in a Multi-View Reconstruction Pipeline Shawn Recker 1, Mauricio Hess- Flores 1, Mark A. Duchaineau 2, and.
Lecture 04 22/11/2011 Shai Avidan הבהרה : החומר המחייב הוא החומר הנלמד בכיתה ולא זה המופיע / לא מופיע במצגת.
An Information Fusion Approach for Multiview Feature Tracking Esra Ataer-Cansizoglu and Margrit Betke ) Image and.
CSCE 643 Computer Vision: Structure from Motion
Multiview Geometry and Stereopsis. Inputs: two images of a scene (taken from 2 viewpoints). Output: Depth map. Inputs: multiple images of a scene. Output:
1 Formation et Analyse d’Images Session 7 Daniela Hall 25 November 2004.
© 2005 Martin Bujňák, Martin Bujňák Supervisor : RNDr.
Lecture 03 15/11/2011 Shai Avidan הבהרה : החומר המחייב הוא החומר הנלמד בכיתה ולא זה המופיע / לא מופיע במצגת.
Computer Vision Lecture #10 Hossam Abdelmunim 1 & Aly A. Farag 2 1 Computer & Systems Engineering Department, Ain Shams University, Cairo, Egypt 2 Electerical.
Communication Systems Group Technische Universität Berlin S. Knorr A Geometric Segmentation Approach for the 3D Reconstruction of Dynamic Scenes in 2D.
EECS 274 Computer Vision Geometric Camera Calibration.
Two-view geometry. Epipolar Plane – plane containing baseline (1D family) Epipoles = intersections of baseline with image planes = projections of the.
3D reconstruction from uncalibrated images
Bundle Adjustment A Modern Synthesis Bill Triggs, Philip McLauchlan, Richard Hartley and Andrew Fitzgibbon Presentation by Marios Xanthidis 5 th of No.
Visual Tracking by Cluster Analysis Arthur Pece Department of Computer Science University of Copenhagen
Stereo Vision Local Map Alignment for Robot Environment Mapping Computer Vision Center Dept. Ciències de la Computació UAB Ricardo Toledo Morales (CVC)
Geometry Reconstruction March 22, Fundamental Matrix An important problem: Determine the epipolar geometry. That is, the correspondence between.
Structure from motion Multi-view geometry Affine structure from motion Projective structure from motion Planches : –
EECS 274 Computer Vision Projective Structure from Motion.
Lec 26: Fundamental Matrix CS4670 / 5670: Computer Vision Kavita Bala.
Correspondence and Stereopsis. Introduction Disparity – Informally: difference between two pictures – Allows us to gain a strong sense of depth Stereopsis.
11/25/03 3D Model Acquisition by Tracking 2D Wireframes Presenter: Jing Han Shiau M. Brown, T. Drummond and R. Cipolla Department of Engineering University.
Multi-view geometry. Multi-view geometry problems Structure: Given projections of the same 3D point in two or more images, compute the 3D coordinates.
Approximate Models for Fast and Accurate Epipolar Geometry Estimation
Mauricio Hess-Flores1, Mark A. Duchaineau2, Kenneth I. Joy3
Epipolar geometry.
Structure from motion Input: Output: (Tomasi and Kanade)
Session: Video Analysis and Action Recognition, Friday 9 November 2012
Noah Snavely.
Two-view geometry.
Two-view geometry.
Multi-view geometry.
Structure from motion Input: Output: (Tomasi and Kanade)
Presentation transcript:

Ray Divergence-Based Bundle Adjustment Conditioning for Multi-View Stereo Mauricio Hess-Flores 1, Daniel Knoblauch 2, Mark A. Duchaineau 3, Kenneth I. Joy 4, Falko Kuester 5 Abstract - An algorithm that shows how ray divergence in multi-view stereo scene reconstruction can be used towards improving bundle adjustment weighting and conditioning is presented. Starting with a set of feature tracks, ray divergence when attempting to compute scene structure for each track is first obtained. Assuming accurate feature matching, ray divergence reveals mainly camera parameter estimation inaccuracies. Due to its smooth variation across neighboring feature tracks, from its histogram a set of weights can be computed that can be used in bundle adjustment to improve its convergence properties. It is proven that this novel weighting scheme results in lower reprojection errors and faster processing times than others such as image feature covariances, making it very suitable in general for applications involving multi-view pose and structure estimation. 1,4 Institute for Data Analysis and Visualization, University of California - Davis, Davis, CA, USA Introduction AlgorithmResults (continued) Multi-view scene reconstruction is currently a prominent research area, with many applications. Despite accurate feature matching, reconstruction accuracy relies on accurate camera calibration. In the absence of ground-truth, algorithms usually resort to bundle adjustment to reduce reprojection error, which is very expensive and needs a good starting point. Main contribution: show how simple reconstruction ray divergence is an inexpensive yet powerful tool that can aid in bundle adjustment convergence. Ray divergence: shortest distance between rays from each respective camera center C i and through each pixel position of a given feature match This work performed under the auspices of the U.S. Department of Energy by Lawrence Livermore National Laboratory under Contract DE-AC52-07NA Lawrence Livermore National Laboratory, Livermore, CA, USA For SIFT feature matches between two images, eliminate epipolar geometry outliers with RANSAC. Compute ray divergence per inlier feature match. ‘Good’ baselines are necessary, such as those obtained through frame decimation. Our weighting scheme provides the best combination of final reprojection error, processing time and computational complexity. Beder’s algorithm (UWBA and UIBA) involves matrix inversion and SVD, while the feature covariance method CBA requires multiple exponential evaluations for each covariance matrix. Input images Palmdale dataset Reconstructions with our method: original point clouds (left) and adding Furukawa’s PMVS (right): Medusa dataset (a) (b) LLNL-POST Ray divergence computation DatasetCBAUWBAUIBARDBA Stockton 43, 0.621, , 0.171, , 0.072, , 0.015, 0.78 Palmdale 23, 4.687, , 1.692, , 0.831, , 0.113, 0.37 Castle-P19 150, , , 4150, , , , , 0.62 Dinosaur 26, 2.631, , 0.286, , 0.09, , 0.162, 0.05 Megascene1 49, 12.14, , 0.179, , 0.074, , 0.124, 0.04 Coneland 150, 28052, , , , , , 81.86, ,5 University of California - San Diego, San Diego, USA Features Ray divergence ‘d’ per feature match Assuming accurate feature matching, ray divergence varies smoothly, and is a function of all camera intrinsic, extrinsic and radial distortion inaccuracies. Dense, smooth ray divergence surfaces Ray divergence correlates well with Beder et al.’s confidence measure for scene structure 1, but is cheaper to compute and includes radial distortion. Ray divergences – Palmdale image pair. Reconstruction confidence measure 1 – Palmdale image pair. Encodes errors at all stages. Ray divergence histogram Ray divergences vary smoothly – their histogram can be modeled as a Gaussian probability density function. Weighted bundle adjustment Ray divergence histogram Bundle adjustment (a) minimizes reprojection error by solving the normal equations (b) at each iteration. Gaussian pdf values for each feature match are input to weighted bundle adjustment (c) as 2x2 covariance matrices into the diagonal matrix ∑ x. High divergences correspond to lower pdf values and are ‘penalized’ as lower weights, thus improving bundle adjustment convergence. Multi-view extension In sequential multi-view reconstruction, for each feature in a new image we assign the Gaussian- based weight corresponding to the ray divergence statistics for the feature matches to the prior image. Megascene1 dataset Stockton dataset Iterations I, final total reprojection error R (pixels) and processing time t (seconds) in (I,R,t) format for the four different weighting schemes: Ray directions: Closest-distance points on each ray: (x 1,y 1 ) ( x 2,y 2 ) (x 1,y 1 ) (x 2,y 2 ) K i = intrinsics R i = absolute rotation t i = parametric distance (c) Results Processing times and reprojection errors obtained for weighted bundle adjustment using ray divergences (RDBA) was compared versus other weighting schemes: image feature covariances (CBA) and reconstruction confidence 1 with (UWBA) and without (UIBA) including image feature covariances. 1 Beder, C. and Steffen, R. Determining an initial image pair for fixing the scale of a 3d reconstruction from an image sequence. In: DAGM Symposium Berlin, Germany 2006, S Lighter colors = higher values