Structure from Motion. CS4670/CS Kevin Matzen - April 15, 2016
|
|
- Dennis Randall
- 5 years ago
- Views:
Transcription
1 Structure from Motion CS4670/CS Kevin Matzen - April 15, 2016 Video credit: Agarwal, et. al. Building Rome in a Day, ICCV 2009
2 Roadmap What we ve seen so far Single view modeling (1 camera) Stereo modeling (2 cameras) Multi-view stereo (3+ cameras) How do we recover camera parameters necessary for MVS?
3 Wednesday s Lecture Assume we are always given the camera calibration. f1 T1 T2 f2 y x
4 Today s Lecture Assume we are always never given the camera calibration.???? y x
5 Calibration makes 3D reasoning possible! f1 x1 z x2 f2 1 2 b
6 Today s outline How can we calibrate our cameras? How can we calibrate a camera without photos of a calibration target? How can we automate this calibration at scale?
7 Projection Model
8 Projection Model Some 3D world-space point
9 Projection Model A 2D image-space projection Some 3D world-space point
10 Projection Model Calibration gives us these A 2D image-space projection Some 3D world-space point
11 Camera Calibration
12 Camera Calibration
13 Camera Calibration y (10, 12, 0) (0, 0, 0) x
14 DLT Method
15 DLT Method
16 DLT Method
17 DLT Method
18 Question: Is a single plane enough?
19 Question: Is a single plane enough? Assume plane is at Z = 0 (rotate and translate coordinates to make it so)
20 Question: Is a single plane enough? Columns are all 0 > Rank is at most 9 No, calibration target cannot be planar with DLT method. But we can combine many planes.
21
22 Non-Linear Method DLT method does not automatically give decomposition into extrinsics and intrinsics May wish to impose additional constraints on camera model (e.g. isotropic focal length, square pixels) Non-linearities such as radial distortion are not easily modeled with DLT
23 2 4 u i w i v i w i w i 3 5 = 2 4 f x 0 c x 0 f y c y r 11 r 12 r 13 t x r 21 r 22 r 23 t y r 31 r 32 r 33 t z x i y i z i
24 2 4 u i w i v i w i w i 3 5 = 2 4 f x 0 c x 0 f y c y r 11 r 12 r 13 t x r 21 r 22 r 23 t y r 31 r 32 r 33 t z x i y i z i D world-space point
25 2 4 u i w i v i w i w i 3 5 = 2 4 f x 0 c x 0 f y c y r 11 r 12 r 13 t x r 21 r 22 r 23 t y r 31 r 32 r 33 t z x i y i z i Rotate and translate point into camera space 3D world-space point
26 2 4 u i w i v i w i w i 3 5 = 2 4 f x 0 c x 0 f y c y r 11 r 12 r 13 t x r 21 r 22 r 23 t y r 31 r 32 r 33 t z x i y i z i Project point into image plane Rotate and translate point into camera space 3D world-space point
27 2 4 u i w i v i w i w i 3 5 = 2 4 f x 0 c x 0 f y c y r 11 r 12 r 13 t x r 21 r 22 r 23 t y r 31 r 32 r 33 t z x i y i z i Project point into image plane Rotate and translate point into camera space 3D world-space point apple ui w i w i = Let s work through a simpler 2D version apple f c 0 1 apple cos( ) sin( ) tx sin( ) cos( ) t y 2 4 x i y i 1 3 5
28 apple ui w i w i = apple f c 0 1 apple cos( ) sin( ) tx sin( ) cos( ) t y 2 4 x i y i D point 1D projection
29 apple ui w i w i = apple f c 0 1 apple cos( ) sin( ) tx sin( ) cos( ) t y 2 4 x i y i apple ui w i w i = apple f c 0 1 apple cos( )xi sin( )y i + t x sin( )x i + cos( )y i + t y
30 apple ui w i w i = apple f c 0 1 apple cos( ) sin( ) tx sin( ) cos( ) t y 2 4 x i y i apple ui w i w i = apple f c 0 1 apple cos( )xi sin( )y i + t x sin( )x i + cos( )y i + t y u i w i w i = apple f(cos( )xi sin( )y i + t x )+c(sin( )x i + cos( )y i + t y ) sin( )x i + cos( )y i + t y
31 apple ui w i w i = apple f c 0 1 apple cos( ) sin( ) tx sin( ) cos( ) t y 2 4 x i y i apple ui w i w i = apple f c 0 1 apple cos( )xi sin( )y i + t x sin( )x i + cos( )y i + t y u i w i w i = apple f(cos( )xi sin( )y i + t x )+c(sin( )x i + cos( )y i + t y ) sin( )x i + cos( )y i + t y u i = f(cos( )x i sin( )y i + t x )+c(sin( )x i + cos( )y i + t y ) sin( )x i + cos( )y i + t y
32 h(f,c,,t x,t y,x i,y i )= f(cos( )x i sin( )y i + t x )+c(sin( )x i + cos( )y i + t y ) sin( )x i + cos( )y i + t y
33 h(f,c,,t x,t y,x i,y i )= f(cos( )x i sin( )y i + t x )+c(sin( )x i + cos( )y i + t y ) sin( )x i + cos( )y i + t y L(f,c,,t x,t y )= X i (u i h(f,c,,t x,t y,x i,y i )) 2
34 h(f,c,,t x,t y,x i,y i )= f(cos( )x i sin( )y i + t x )+c(sin( )x i + cos( )y i + t y ) sin( )x i + cos( )y i + t y L(f,c,,t x,t y )= X i (u i h(f,c,,t x,t y,x i,y i )) 2 argmin L(f,c,,t x,t y ) f,c,,t x,t y
35 h(f,c,,t x,t y,x i,y i )= f(cos( )x i sin( )y i + t x )+c(sin( )x i + cos( )y i + t y ) sin( )x i + cos( )y i + t y L(f,c,,t x,t y )= X i (u i h(f,c,,t x,t y,x i,y i )) 2 argmin L(f,c,,t x,t y ) f,c,,t x,t y Apply non-linear optimization method. @t y
36 What if we don t have a target?
37 What if we don t have a target? The world is our calibration target!
38 What if we don t have a target? The world is our calibration target! But we don t know the position of all points in the world.
39 Structure from Motion Key goals of SfM: Use approximate camera calibrations to match features and triangulate approximate 3D points Use approximate 3D points to improve approximate camera calibrations Chicken-and-egg problem Can extend and use our non-linear optimization framework Requires a good initialization
40 SfM building blocks What do we need from our CV toolbox? Keypoint detection Descriptor matching F-matrix estimation Ray triangulation Camera projection Non-linear optimization Useful metadata Focal length guess (EXIF tags)
41 Given: 1 2 Images 1 and 2 Focal length guesses
42 1. Compute feature 1 2 matches and F- matrix
43 2. Use approx K s 1 to get E-matrix 2 E = K2 T FK1
44 3. Decompose E 1 into relative pose 2 E = R[t]x
45 1 4. Triangulate features 2
46 1 5. Apply non-linear optimization 2
47 h(f,c,,t x,t y,x i,y i )= f(cos( )x i sin( )y i + t x )+c(sin( )x i + cos( )y i + t y ) sin( )x i + cos( )y i + t y L(f,c,,t x,t y )= X i (u i h(f,c,,t x,t y,x i,y i )) 2 argmin L(f,c,,t x,t y ) f,c,,t x,t y
48 h(f,c,,t x,t y,x i,y i )= f(cos( )x i sin( )y i + t x )+c(sin( )x i + cos( )y i + t y ) sin( )x i + cos( )y i + t y (f,c,,t x,t y, (x 1,y 1 ),...,(x n,y n )) = X i (u i h(f,c,,t x,t y,x i,y i )) 2 argmin f,c,,t x,t y,(x 1,y 1 ),...,(x n,y n ) L(f,c,,t x,t y, (x 1,y 1 ),...,(x n,y n )) Doesn t make sense for 1 camera
49 h(f,c,,t x,t y,x i,y i )= f(cos( )x i sin( )y i + t x )+c(sin( )x i + cos( )y i + t y ) sin( )x i + cos( )y i + t y L(K 1,...,K m, (x 1,y 1 ),...,(x n,y n )) = X i X j w i,j (u i h(k j, (x i,y i ))) 2 argmin K 1,...,K m,(x 1,y 1 ),...,(x n,y n ) L(K 1,...,K m, (x 1,y 1 ),...,(x n,y n )) Called Bundle Adjustment
50 Camera sets can be incrementally built up Essential matrix
51 Camera sets can be incrementally built up Perspective n Point method
52 Camera sets can be incrementally built up Perspective n Point method
53 Camera sets can be incrementally built up Perspective n Point method
54 Dubrovnik - Incremental Bundle Adjustment
55 Dubrovnik
56 Sacré-Cœur
57 SfM Ambiguities x = PX
58 SfM Ambiguities x = PX x =(PQ)(Q 1 X)
59 SfM Ambiguities x = PX x =(PQ)(Q 1 X) x = K(TQ)(Q 1 X)
60 SfM Ambiguities x = PX x =(PQ)(Q 1 X) x = K(TQ)(Q 1 X) T is a rigid body transformation If we want TQ to be a RBT, then Q could be an RBT > If we rotate and translate all the points, everything works out if we rotate and translate all the cameras.
61 SfM Ambiguities x = PX x =(PS 1 )(SX)
62 SfM Ambiguities x = PX x =(PS 1 )(SX) x = K(TS 1 )(SX)
63 SfM Ambiguities x = PX x =(PS 1 )(SX) x = K(TS 1 )(SX) x = K(S 1 TT 0 )(SX) x =(KS 1 )(TT 0 )(SX)
64 SfM Ambiguities x = PX x =(PS 1 )(SX) x = K(TS 1 )(SX) x = K(S 1 TT 0 )(SX) x =(KS 1 )(TT 0 )(SX) x =(S 1 K)(TT 0 )(SX) Sx = K(TT 0 )(SX)
65 SfM Ambiguities Sx = Sx = K(TT 0 )(SX) suw uw 4 svw 5 = 4 vw 5 = x sw w
66 SfM Ambiguities Sx = Sx = K(TT 0 )(SX) suw uw 4 svw 5 = 4 vw 5 = x sw w > If we scale all the points, everything works out if we move the camera positions.
67
68 SfM Ambiguities x = PX x =(PQ)(Q 1 X) In this case Q is a general similarity transform. We resolve the ambiguity often by placing one camera at the origin facing some direction and a second camera at fixed offset from the first.
69 Applications
70 Internet-scale 3D
71 Snavely, et. al. Finding Paths through the World's Photos. SIGGRAPH 2008.
72
73
3D from Photographs: Camera Calibration. Dr Francesco Banterle
3D from Photographs: Camera Calibration Dr Francesco Banterle francesco.banterle@isti.cnr.it 3D from Photographs Automatic Matching of Images Camera Calibration Photographs Surface Reconstruction Dense
More informationPose estimation from point and line correspondences
Pose estimation from point and line correspondences Giorgio Panin October 17, 008 1 Problem formulation Estimate (in a LSE sense) the pose of an object from N correspondences between known object points
More informationCamera calibration Triangulation
Triangulation Perspective projection in homogenous coordinates ~x img I 0 apple R t 0 T 1 ~x w ~x img R t ~x w Matrix transformations in 2D ~x img K R t ~x w K = 2 3 1 0 t u 40 1 t v 5 0 0 1 Translation
More informationCS4495/6495 Introduction to Computer Vision. 3D-L3 Fundamental matrix
CS4495/6495 Introduction to Computer Vision 3D-L3 Fundamental matrix Weak calibration Main idea: Estimate epipolar geometry from a (redundant) set of point correspondences between two uncalibrated cameras
More informationMultiple View Geometry in Computer Vision
Multiple View Geometry in Computer Vision Prasanna Sahoo Department of Mathematics University of Louisville 1 Scene Planes & Homographies Lecture 19 March 24, 2005 2 In our last lecture, we examined various
More informationCS 231A Computer Vision (Fall 2011) Problem Set 2
CS 231A Computer Vision (Fall 2011) Problem Set 2 Solution Set Due: Oct. 28 th, 2011 (5pm) 1 Some Projective Geometry Problems (15 points) Suppose there are two parallel lines that extend to infinity in
More informationMultiview Geometry and Bundle Adjustment. CSE P576 David M. Rosen
Multiview Geometry and Bundle Adjustment CSE P576 David M. Rosen 1 Recap Previously: Image formation Feature extraction + matching Two-view (epipolar geometry) Today: Add some geometry, statistics, optimization
More informationCamera calibration by Zhang
Camera calibration by Zhang Siniša Kolarić September 2006 Abstract In this presentation, I present a way to calibrate a camera using the method by Zhang. NOTE. This
More informationAugmented Reality VU Camera Registration. Prof. Vincent Lepetit
Augmented Reality VU Camera Registration Prof. Vincent Lepetit Different Approaches to Vision-based 3D Tracking [From D. Wagner] [From Drummond PAMI02] [From Davison ICCV01] Consider natural features Consider
More informationLecture 5. Epipolar Geometry. Professor Silvio Savarese Computational Vision and Geometry Lab. 21-Jan-15. Lecture 5 - Silvio Savarese
Lecture 5 Epipolar Geometry Professor Silvio Savarese Computational Vision and Geometry Lab Silvio Savarese Lecture 5-21-Jan-15 Lecture 5 Epipolar Geometry Why is stereo useful? Epipolar constraints Essential
More informationCamera Calibration The purpose of camera calibration is to determine the intrinsic camera parameters (c 0,r 0 ), f, s x, s y, skew parameter (s =
Camera Calibration The purpose of camera calibration is to determine the intrinsic camera parameters (c 0,r 0 ), f, s x, s y, skew parameter (s = cotα), and the lens distortion (radial distortion coefficient
More informationCamera Models and Affine Multiple Views Geometry
Camera Models and Affine Multiple Views Geometry Subhashis Banerjee Dept. Computer Science and Engineering IIT Delhi email: suban@cse.iitd.ac.in May 29, 2001 1 1 Camera Models A Camera transforms a 3D
More informationVision 3D articielle Session 2: Essential and fundamental matrices, their computation, RANSAC algorithm
Vision 3D articielle Session 2: Essential and fundamental matrices, their computation, RANSAC algorithm Pascal Monasse monasse@imagine.enpc.fr IMAGINE, École des Ponts ParisTech Contents Some useful rules
More informationPose Tracking II! Gordon Wetzstein! Stanford University! EE 267 Virtual Reality! Lecture 12! stanford.edu/class/ee267/!
Pose Tracking II! Gordon Wetzstein! Stanford University! EE 267 Virtual Reality! Lecture 12! stanford.edu/class/ee267/!! WARNING! this class will be dense! will learn how to use nonlinear optimization
More informationTheory of Bouguet s MatLab Camera Calibration Toolbox
Theory of Bouguet s MatLab Camera Calibration Toolbox Yuji Oyamada 1 HVRL, University 2 Chair for Computer Aided Medical Procedure (CAMP) Technische Universität München June 26, 2012 MatLab Camera Calibration
More informationCE 59700: Digital Photogrammetric Systems
CE 59700: Digital Photogrammetric Systems Fall 2016 1 Instructor: Contact Information Office: HAMP 4108 Tel: (765) 496-0173 E-mail: ahabib@purdue.edu Lectures (HAMP 2102): Monday, Wednesday & Friday (12:30
More informationVideo and Motion Analysis Computer Vision Carnegie Mellon University (Kris Kitani)
Video and Motion Analysis 16-385 Computer Vision Carnegie Mellon University (Kris Kitani) Optical flow used for feature tracking on a drone Interpolated optical flow used for super slow-mo optical flow
More informationCamera calibration. Outline. Pinhole camera. Camera projection models. Nonlinear least square methods A camera calibration tool
Outline Camera calibration Camera projection models Camera calibration i Nonlinear least square methods A camera calibration tool Applications Digital Visual Effects Yung-Yu Chuang with slides b Richard
More informationCMPSCI 250: Introduction to Computation. Lecture #29: Proving Regular Language Identities David Mix Barrington 6 April 2012
CMPSCI 250: Introduction to Computation Lecture #29: Proving Regular Language Identities David Mix Barrington 6 April 2012 Proving Regular Language Identities Regular Language Identities The Semiring Axioms
More informationOPPA European Social Fund Prague & EU: We invest in your future.
OPPA European Social Fund Prague & EU: We invest in your future. 1D Projective Coordinates The 1-D projective coordinate of a point P : [P ] = [P P 0 P I P ] = [p p 0 p I p] = p pi p 0 p I p 0 p p p p
More informationA Practical Method for Decomposition of the Essential Matrix
Applied Mathematical Sciences, Vol. 8, 2014, no. 176, 8755-8770 HIKARI Ltd, www.m-hikari.com http://dx.doi.org/10.12988/ams.2014.410877 A Practical Method for Decomposition of the Essential Matrix Georgi
More informationM3: Multiple View Geometry
M3: Multiple View Geometry L18: Projective Structure from Motion: Iterative Algorithm based on Factorization Based on Sections 13.4 C. V. Jawahar jawahar-at-iiit.net Mar 2005: 1 Review: Reconstruction
More informationLecture 5. Gaussian Models - Part 1. Luigi Freda. ALCOR Lab DIAG University of Rome La Sapienza. November 29, 2016
Lecture 5 Gaussian Models - Part 1 Luigi Freda ALCOR Lab DIAG University of Rome La Sapienza November 29, 2016 Luigi Freda ( La Sapienza University) Lecture 5 November 29, 2016 1 / 42 Outline 1 Basics
More informationRobust Camera Location Estimation by Convex Programming
Robust Camera Location Estimation by Convex Programming Onur Özyeşil and Amit Singer INTECH Investment Management LLC 1 PACM and Department of Mathematics, Princeton University SIAM IS 2016 05/24/2016,
More informationMean-Shift Tracker Computer Vision (Kris Kitani) Carnegie Mellon University
Mean-Shift Tracker 16-385 Computer Vision (Kris Kitani) Carnegie Mellon University Mean Shift Algorithm A mode seeking algorithm Fukunaga & Hostetler (1975) Mean Shift Algorithm A mode seeking algorithm
More informationCamera Projection Model
amera Projection Model 3D Point Projection (Pixel Space) O ( u, v ) ccd ccd f Projection plane (, Y, Z ) ( u, v ) img Z img (0,0) w img ( u, v ) img img uimg f Z p Y v img f Z p x y Zu f p Z img img x
More informationStructure from Motion. Read Chapter 7 in Szeliski s book
Structure from Motion Read Chapter 7 in Szeliski s book Schedule (tentative) 2 # date topic 1 Sep.22 Introduction and geometry 2 Sep.29 Invariant features 3 Oct.6 Camera models and calibration 4 Oct.13
More informationPhotometric Stereo: Three recent contributions. Dipartimento di Matematica, La Sapienza
Photometric Stereo: Three recent contributions Dipartimento di Matematica, La Sapienza Jean-Denis DUROU IRIT, Toulouse Jean-Denis DUROU (IRIT, Toulouse) 17 December 2013 1 / 32 Outline 1 Shape-from-X techniques
More informationA Study of Kruppa s Equation for Camera Self-calibration
Proceedings of the International Conference of Machine Vision and Machine Learning Prague, Czech Republic, August 14-15, 2014 Paper No. 57 A Study of Kruppa s Equation for Camera Self-calibration Luh Prapitasari,
More informationImage enhancement. Why image enhancement? Why image enhancement? Why image enhancement? Example of artifacts caused by image encoding
13 Why image enhancement? Image enhancement Example of artifacts caused by image encoding Computer Vision, Lecture 14 Michael Felsberg Computer Vision Laboratory Department of Electrical Engineering 12
More informationCross Product Angular Momentum
Lecture 21 Chapter 12 Physics I Cross Product Angular Momentum Course website: http://faculty.uml.edu/andriy_danylov/teaching/physicsi IN THIS CHAPTER, you will continue discussing rotational dynamics
More informationCSE 554 Lecture 6: Deformation I
CSE 554 Lecture 6: Deformation I Fall 20 CSE554 Deformation I Slide Review Alignment Registering source to target by rotation and translation Methods Rigid-body transformations Aligning principle directions
More informationReverse engineering using computational algebra
Reverse engineering using computational algebra Matthew Macauley Department of Mathematical Sciences Clemson University http://www.math.clemson.edu/~macaule/ Math 4500, Spring 2015 M. Macauley (Clemson)
More informationTracking for VR and AR
Tracking for VR and AR Hakan Bilen November 17, 2017 Computer Graphics University of Edinburgh Slide credits: Gordon Wetzstein and Steven M. La Valle 1 Overview VR and AR Inertial Sensors Gyroscopes Accelerometers
More informationEE595A Submodular functions, their optimization and applications Spring 2011
EE595A Submodular functions, their optimization and applications Spring 2011 Prof. Jeff Bilmes University of Washington, Seattle Department of Electrical Engineering Spring Quarter, 2011 http://ssli.ee.washington.edu/~bilmes/ee595a_spring_2011/
More informationFinal Exam Due on Sunday 05/06
Final Exam Due on Sunday 05/06 The exam should be completed individually without collaboration. However, you are permitted to consult with the textbooks, notes, slides and even internet resources. If you
More informationVisual Object Recognition
Visual Object Recognition Lecture 2: Image Formation Per-Erik Forssén, docent Computer Vision Laboratory Department of Electrical Engineering Linköping University Lecture 2: Image Formation Pin-hole, and
More informationCSE 252B: Computer Vision II
CSE 252B: Computer Vision II Lecturer: Serge Belongie Scribe: Hamed Masnadi Shirazi, Solmaz Alipour LECTURE 5 Relationships between the Homography and the Essential Matrix 5.1. Introduction In practice,
More informationAffine and Perspective Warping (Geometric Transforms)
Affine and Perspective Warping (Geometric Transforms) Image Processing Material in this presentation is largely based on/derived from presentation(s) and book: The Digital Image by Dr. Donald House at
More informationMath 0290 Midterm Exam
ath 0290 idterm Exam JAKE IRRA University of Pittsburgh July 11, 2016 Directions 1. The purpose of this exam is to test you on your ability to analyze and solve differential equations corresponding to
More informationIntroduction to pinhole cameras
Introduction to pinhole cameras Lesson given by Sébastien Piérard in the course Introduction aux techniques audio et vidéo (ULg, Pr JJ Embrechts) INTELSIG, Montefiore Institute, University of Liège, Belgium
More informationEE Camera & Image Formation
Electric Electronic Engineering Bogazici University February 21, 2018 Introduction Introduction Camera models Goal: To understand the image acquisition process. Function of the camera Similar to that of
More informationMathematical Methods - Lecture 9
Mathematical Methods - Lecture 9 Yuliya Tarabalka Inria Sophia-Antipolis Méditerranée, Titane team, http://www-sop.inria.fr/members/yuliya.tarabalka/ Tel.: +33 (0)4 92 38 77 09 email: yuliya.tarabalka@inria.fr
More informationIntro Vectors 2D implicit curves 2D parametric curves. Graphics 2011/2012, 4th quarter. Lecture 2: vectors, curves, and surfaces
Lecture 2, curves, and surfaces Organizational remarks Tutorials: Tutorial 1 will be online later today TA sessions for questions start next week Practicals: Exams: Make sure to find a team partner very
More informationFeature detectors and descriptors. Fei-Fei Li
Feature detectors and descriptors Fei-Fei Li Feature Detection e.g. DoG detected points (~300) coordinates, neighbourhoods Feature Description e.g. SIFT local descriptors (invariant) vectors database of
More informationEPIPOLAR GEOMETRY WITH MANY DETAILS
EPIPOLAR GEOMERY WIH MANY DEAILS hank ou for the slides. he come mostl from the following source. Marc Pollefes U. of North Carolina hree questions: (i) Correspondence geometr: Given an image point in
More informationBlob Detection CSC 767
Blob Detection CSC 767 Blob detection Slides: S. Lazebnik Feature detection with scale selection We want to extract features with characteristic scale that is covariant with the image transformation Blob
More informationMulti-Frame Factorization Techniques
Multi-Frame Factorization Techniques Suppose { x j,n } J,N j=1,n=1 is a set of corresponding image coordinates, where the index n = 1,...,N refers to the n th scene point and j = 1,..., J refers to the
More informationBézier Curves and Splines
CS-C3100 Computer Graphics Bézier Curves and Splines Majority of slides from Frédo Durand vectorportal.com CS-C3100 Fall 2017 Lehtinen Before We Begin Anything on your mind concerning Assignment 1? CS-C3100
More informationPrincipal Component Analysis and Linear Discriminant Analysis
Principal Component Analysis and Linear Discriminant Analysis Ying Wu Electrical Engineering and Computer Science Northwestern University Evanston, IL 60208 http://www.eecs.northwestern.edu/~yingwu 1/29
More informationConsensus Algorithms for Camera Sensor Networks. Roberto Tron Vision, Dynamics and Learning Lab Johns Hopkins University
Consensus Algorithms for Camera Sensor Networks Roberto Tron Vision, Dynamics and Learning Lab Johns Hopkins University Camera Sensor Networks Motes Small, battery powered Embedded camera Wireless interface
More informationFeature detectors and descriptors. Fei-Fei Li
Feature detectors and descriptors Fei-Fei Li Feature Detection e.g. DoG detected points (~300) coordinates, neighbourhoods Feature Description e.g. SIFT local descriptors (invariant) vectors database of
More informationWhat s for today. Random Fields Autocovariance Stationarity, Isotropy. c Mikyoung Jun (Texas A&M) stat647 Lecture 2 August 30, / 13
What s for today Random Fields Autocovariance Stationarity, Isotropy c Mikyoung Jun (Texas A&M) stat647 Lecture 2 August 30, 2012 1 / 13 Stochastic Process and Random Fields A stochastic process is a family
More informationECE 8201: Low-dimensional Signal Models for High-dimensional Data Analysis
ECE 8201: Low-dimensional Signal Models for High-dimensional Data Analysis Lecture 7: Matrix completion Yuejie Chi The Ohio State University Page 1 Reference Guaranteed Minimum-Rank Solutions of Linear
More informationFirst Derivative Test
MA 2231 Lecture 22 - Concavity and Relative Extrema Wednesday, November 1, 2017 Objectives: Introduce the Second Derivative Test and its limitations. First Derivative Test When looking for relative extrema
More informationAffine invariant Fourier descriptors
Affine invariant Fourier descriptors Sought: a generalization of the previously introduced similarityinvariant Fourier descriptors H. Burkhardt, Institut für Informatik, Universität Freiburg ME-II, Kap.
More informationCorners, Blobs & Descriptors. With slides from S. Lazebnik & S. Seitz, D. Lowe, A. Efros
Corners, Blobs & Descriptors With slides from S. Lazebnik & S. Seitz, D. Lowe, A. Efros Motivation: Build a Panorama M. Brown and D. G. Lowe. Recognising Panoramas. ICCV 2003 How do we build panorama?
More informationGalaxies in Pennsylvania. Bernstein, Jarvis, Nakajima, & Rusin: Implementation of the BJ02 methods
Galaxies in Pennsylvania Bernstein, Jarvis, Nakajima, & Rusin: Implementation of the BJ02 methods Bases of our methods: Shapes with geometric meaning: No empirical polarizabilities; simple optimizations
More informationIntro Vectors 2D implicit curves 2D parametric curves. Graphics 2012/2013, 4th quarter. Lecture 2: vectors, curves, and surfaces
Lecture 2, curves, and surfaces Organizational remarks Tutorials: TA sessions for tutorial 1 start today Tutorial 2 will go online after lecture 3 Practicals: Make sure to find a team partner very soon
More informationFinal Examination. CS 205A: Mathematical Methods for Robotics, Vision, and Graphics (Fall 2013), Stanford University
Final Examination CS 205A: Mathematical Methods for Robotics, Vision, and Graphics (Fall 2013), Stanford University The exam runs for 3 hours. The exam contains eight problems. You must complete the first
More informationEECS150 - Digital Design Lecture 15 SIFT2 + FSM. Recap and Outline
EECS150 - Digital Design Lecture 15 SIFT2 + FSM Oct. 15, 2013 Prof. Ronald Fearing Electrical Engineering and Computer Sciences University of California, Berkeley (slides courtesy of Prof. John Wawrzynek)
More informationAffine Adaptation of Local Image Features Using the Hessian Matrix
29 Advanced Video and Signal Based Surveillance Affine Adaptation of Local Image Features Using the Hessian Matrix Ruan Lakemond, Clinton Fookes, Sridha Sridharan Image and Video Research Laboratory Queensland
More informationGradient-domain image processing
Gradient-domain image processing http://graphics.cs.cmu.edu/courses/15-463 15-463, 15-663, 15-862 Computational Photography Fall 2018, Lecture 10 Course announcements Homework 3 is out. - (Much) smaller
More informationMachine Learning Linear Models
Machine Learning Linear Models Outline II - Linear Models 1. Linear Regression (a) Linear regression: History (b) Linear regression with Least Squares (c) Matrix representation and Normal Equation Method
More informationMulticore Bundle Adjustment - Supplemental Material
Multicore Bundle Adjustment - Supplemental Material This document reports the comparison of runtime and convergence on various datasets. We selected 6 models (to cover different sizes) from each of the
More informationVisual SLAM Tutorial: Bundle Adjustment
Visual SLAM Tutorial: Bundle Adjustment Frank Dellaert June 27, 2014 1 Minimizing Re-projection Error in Two Views In a two-view setting, we are interested in finding the most likely camera poses T1 w
More informationQuality Report Generated with Pix4Dmapper Pro version
Quality Report Generated with Pix4Dmapper Pro version 3.0.13 Important: Click on the different icons for: Help to analyze the results in the Quality Report Additional information about the sections Click
More informationTransformations. Lars Vidar Magnusson. August 24,
Transformations Lars Vidar Magnusson August 24, 2012 http://www.it.hiof.no/~larsvmag/iti43309/index.html 2D Translation To translate an object is to move it in two-dimensinal space. If we have a point
More informationMaxima and Minima. (a, b) of R if
Maxima and Minima Definition Let R be any region on the xy-plane, a function f (x, y) attains its absolute or global, maximum value M on R at the point (a, b) of R if (i) f (x, y) M for all points (x,
More informationOutline. Recall... Limits. Problem Solving Sessions. MA211 Lecture 4: Limits and Derivatives Wednesday 17 September Definition (Limit)
Outline MA211 Lecture 4: Limits and Wednesday 17 September 2008 1 0.2 0.15 0.1 2 ) x) 0.05 0 0.05 0.1 3 ) t) 0.15 0.2 0.4 0.3 0.2 0.1 0 0.1 0.2 0.3 0.4 4 Extra: Binomial Expansions MA211 Lecture 4: Limits
More informationImage Processing 1 (IP1) Bildverarbeitung 1
MIN-Fakultät Fachbereich Informatik Arbeitsbereich SAV/BV (KOGS) Image Processing 1 (IP1) Bildverarbeitung 1 Lecture 18 Mo
More informationCS 188: Artificial Intelligence Spring Announcements
CS 188: Artificial Intelligence Spring 2010 Lecture 22: Nearest Neighbors, Kernels 4/18/2011 Pieter Abbeel UC Berkeley Slides adapted from Dan Klein Announcements On-going: contest (optional and FUN!)
More informationECE 6504: Advanced Topics in Machine Learning Probabilistic Graphical Models and Large-Scale Learning
ECE 6504: Advanced Topics in Machine Learning Probabilistic Graphical Models and Large-Scale Learning Topics Summary of Class Advanced Topics Dhruv Batra Virginia Tech HW1 Grades Mean: 28.5/38 ~= 74.9%
More information1 Lecture 8: Interpolating polynomials.
1 Lecture 8: Interpolating polynomials. 1.1 Horner s method Before turning to the main idea of this part of the course, we consider how to evaluate a polynomial. Recall that a polynomial is an expression
More informationLecture 7: Positive Semidefinite Matrices
Lecture 7: Positive Semidefinite Matrices Rajat Mittal IIT Kanpur The main aim of this lecture note is to prepare your background for semidefinite programming. We have already seen some linear algebra.
More informationComputer Vision Motion
Computer Vision Motion Professor Hager http://www.cs.jhu.edu/~hager 12/1/12 CS 461, Copyright G.D. Hager Outline From Stereo to Motion The motion field and optical flow (2D motion) Factorization methods
More informationMaking Minimal Problems Fast
Making Minimal Problems Fast T o m a s P a j d l a presents work of M. Bujnak, Z. Kukelova & T. Pajdla Czech Technical University Prague Center for Machine Perception M o t i v a t i o n 3 D R E C O N
More informationImage Analysis. Feature extraction: corners and blobs
Image Analysis Feature extraction: corners and blobs Christophoros Nikou cnikou@cs.uoi.gr Images taken from: Computer Vision course by Svetlana Lazebnik, University of North Carolina at Chapel Hill (http://www.cs.unc.edu/~lazebnik/spring10/).
More informationRobert Collins CSE486, Penn State. Lecture 25: Structure from Motion
Lecture 25: Structure from Motion Structure from Motion Given a set of flow fields or displacement vectors from a moving camera over time, determine: the sequence of camera poses the 3D structure of the
More informationMechanics Physics 151
Mechanics Physics 151 Lecture 4 Continuous Systems and Fields (Chapter 13) What We Did Last Time Built Lagrangian formalism for continuous system Lagrangian L Lagrange s equation = L dxdydz Derived simple
More informationVectors Coordinate frames 2D implicit curves 2D parametric curves. Graphics 2008/2009, period 1. Lecture 2: vectors, curves, and surfaces
Graphics 2008/2009, period 1 Lecture 2 Vectors, curves, and surfaces Computer graphics example: Pixar (source: http://www.pixar.com) Computer graphics example: Pixar (source: http://www.pixar.com) Computer
More informationHomogeneous Transformations
Purpose: Homogeneous Transformations The purpose of this chapter is to introduce you to the Homogeneous Transformation. This simple 4 x 4 transformation is used in the geometry engines of CAD systems and
More information5.2 Infinite Series Brian E. Veitch
5. Infinite Series Since many quantities show up that cannot be computed exactly, we need some way of representing it (or approximating it). One way is to sum an infinite series. Recall that a n is the
More informationCH.3. COMPATIBILITY EQUATIONS. Multimedia Course on Continuum Mechanics
CH.3. COMPATIBILITY EQUATIONS Multimedia Course on Continuum Mechanics Overview Introduction Lecture 1 Compatibility Conditions Lecture Compatibility Equations of a Potential Vector Field Lecture 3 Compatibility
More informationParametric Equations, Function Composition and the Chain Rule: A Worksheet
Parametric Equations, Function Composition and the Chain Rule: A Worksheet Prof.Rebecca Goldin Oct. 8, 003 1 Parametric Equations We have seen that the graph of a function f(x) of one variable consists
More informationM E 320 Professor John M. Cimbala Lecture 10
M E 320 Professor John M. Cimbala Lecture 10 Today, we will: Finish our example problem rates of motion and deformation of fluid particles Discuss the Reynolds Transport Theorem (RTT) Show how the RTT
More informationENGG5781 Matrix Analysis and Computations Lecture 8: QR Decomposition
ENGG5781 Matrix Analysis and Computations Lecture 8: QR Decomposition Wing-Kin (Ken) Ma 2017 2018 Term 2 Department of Electronic Engineering The Chinese University of Hong Kong Lecture 8: QR Decomposition
More informationLecture 16: Projection and Cameras. October 17, 2017
Lecture 6: Projection and Cameras October 7 207 3D Viewing as Virtual Camera To take a picture with a camera or to render an image with computer graphics we need to:. Position the camera/viewpoint in 3D
More informationModeling Data with Linear Combinations of Basis Functions. Read Chapter 3 in the text by Bishop
Modeling Data with Linear Combinations of Basis Functions Read Chapter 3 in the text by Bishop A Type of Supervised Learning Problem We want to model data (x 1, t 1 ),..., (x N, t N ), where x i is a vector
More informationSparse Levenberg-Marquardt algorithm.
Sparse Levenberg-Marquardt algorithm. R. I. Hartley and A. Zisserman: Multiple View Geometry in Computer Vision. Cambridge University Press, second edition, 2004. Appendix 6 was used in part. The Levenberg-Marquardt
More informationTHE EULER CHARACTERISTIC OF A LIE GROUP
THE EULER CHARACTERISTIC OF A LIE GROUP JAY TAYLOR 1 Examples of Lie Groups The following is adapted from [2] We begin with the basic definition and some core examples Definition A Lie group is a smooth
More informationProperties of surfaces II: Second moment of area
Properties of surfaces II: Second moment of area Just as we have discussing first moment of an area and its relation with problems in mechanics, we will now describe second moment and product of area of
More informationIntroduction to Machine Learning
Introduction to Machine Learning 12. Gaussian Processes Alex Smola Carnegie Mellon University http://alex.smola.org/teaching/cmu2013-10-701 10-701 The Normal Distribution http://www.gaussianprocess.org/gpml/chapters/
More informationMotion Estimation (I)
Motion Estimation (I) Ce Liu celiu@microsoft.com Microsoft Research New England We live in a moving world Perceiving, understanding and predicting motion is an important part of our daily lives Motion
More informationCamera Calibration. (Trucco, Chapter 6) -Toproduce an estimate of the extrinsic and intrinsic camera parameters.
Camera Calibration (Trucco, Chapter 6) What is the goal of camera calibration? -Toproduce an estimate of the extrinsic and intrinsic camera parameters. Procedure -Given the correspondences beteen a set
More informationMAT137 Calculus! Welcome!
MAT137 Calculus! Welcome! Beatriz Navarro-Lameda L0101 WF 1-4 MP202 office hours: Wednesday, May 17: 4-5 official website https://www.math.toronto.edu/mat137/ read course outline! remember to enrol in
More informationConvex Optimization. (EE227A: UC Berkeley) Lecture 28. Suvrit Sra. (Algebra + Optimization) 02 May, 2013
Convex Optimization (EE227A: UC Berkeley) Lecture 28 (Algebra + Optimization) 02 May, 2013 Suvrit Sra Admin Poster presentation on 10th May mandatory HW, Midterm, Quiz to be reweighted Project final report
More informationAnnouncements. CS 188: Artificial Intelligence Spring Classification. Today. Classification overview. Case-Based Reasoning
CS 188: Artificial Intelligence Spring 21 Lecture 22: Nearest Neighbors, Kernels 4/18/211 Pieter Abbeel UC Berkeley Slides adapted from Dan Klein Announcements On-going: contest (optional and FUN!) Remaining
More informationLecture 5: Moment generating functions
Lecture 5: Moment generating functions Definition 2.3.6. The moment generating function (mgf) of a random variable X is { x e tx f M X (t) = E(e tx X (x) if X has a pmf ) = etx f X (x)dx if X has a pdf
More informationMath Lecture 18 Notes
Math 1010 - Lecture 18 Notes Dylan Zwick Fall 2009 In our last lecture we talked about how we can add, subtract, and multiply polynomials, and we figured out that, basically, if you can add, subtract,
More information