Introduction Epipolar Geometry Calibration Methods Further Readings. Stereo Camera Calibration
|
|
|
- Clare Lewis
- 9 years ago
- Views:
Transcription
1 Stereo Camera Calibration Stereo Camera Calibration Stereo Camera Calibration Stereo Camera Calibration
2 Overview Introduction Summary /
3 Motivation Depth Perception Ambiguity of Correspondence The Epipolar Constraint Motivation 3D-Vision Problems Correspondence problem Reconstruction problem
4 Motivation Depth Perception Ambiguity of Correspondence The Epipolar Constraint Motivation 3D-Vision Problems Correspondence problem Reconstruction problem
5 Motivation Depth Perception Ambiguity of Correspondence The Epipolar Constraint How does depth perception work? High level process? Objects are matched... Low level process! Proof: Random Dot Images Problem: Matching the Dots
6 Motivation Depth Perception Ambiguity of Correspondence The Epipolar Constraint The Ambiguity of Correspondence Real Correspondence Just looking similar
7 Motivation Depth Perception Ambiguity of Correspondence The Epipolar Constraint The Epipolar Constraint World Point M corresponds to point m in Image Plane I
8 Motivation Depth Perception Ambiguity of Correspondence The Epipolar Constraint The Epipolar Constraint Ray CM has Image in I'
9 Motivation Depth Perception Ambiguity of Correspondence The Epipolar Constraint The Epipolar Constraint Corresponding Point in I' can be found...
10 Motivation Depth Perception Ambiguity of Correspondence The Epipolar Constraint The Epipolar Constraint The Points C, C' and M build a Plane. e is Image of C' and v.v.
11 Motivation Depth Perception Ambiguity of Correspondence The Epipolar Constraint The Epipolar Constraint m' has epipolar line too
12 Motivation Depth Perception Ambiguity of Correspondence The Epipolar Constraint Pencils of Epipolar Lines Different World Points can have different epipolar lines.
13 Basics The Essential Matrix The Fundamental Matrix Summary Perspective Projection Matrix There are normalized and unnormalized cameras Decomposition possible:
14 Basics The Essential Matrix The Fundamental Matrix Summary Camera Intrinsic Matrix Result of decomposition
15 Basics The Essential Matrix The Fundamental Matrix Summary Skew Symmetric Matrix Mapping from 3D-Vector to 3x3 antisymmetric Matrix
16 Basics The Essential Matrix The Fundamental Matrix Summary The Essential Matrix Mapping from Point to Line
17 Basics The Essential Matrix The Fundamental Matrix Summary Defining EG with Normalized Images Relation between camera coordinate systems Normalized Coordinates
18 Basics The Essential Matrix The Fundamental Matrix Summary Defining EG with Normalized Images
19 Basics The Essential Matrix The Fundamental Matrix Summary Defining EG with Normalized Images Coplanar
20 Basics The Essential Matrix The Fundamental Matrix Summary Defining EG with Normalized Images
21 Basics The Essential Matrix The Fundamental Matrix Summary Properties of E Determined completely by the transform between the cameras det(e)=0
22 Basics The Essential Matrix The Fundamental Matrix Summary The Fundamental Matrix Fundamental Matrix F must satisfy where A and A' are intrinsic Matrices of the two Cameras
23 Basics The Essential Matrix The Fundamental Matrix Summary Properties of F det(f)=0 because det(e)=0 F is of rank 2 F has 9 Parameters but 7DOF
24 Basics The Essential Matrix The Fundamental Matrix Summary Summary Stereo Vision is about point matching E and F map points in one image to lines in the other. F satisfies 7 DOF and has between two arbitrary images can be estimated by 7 point correspondences
25 Calibration Basics 7-Point-Algorithm >8-Point-Algorithm(s) Experiments/Tricks Calibration Basics Assumptions The full perspective projection model is used. Intrinsic and Extrinsic parameters of the Cameras are unknown. Rigid transformation between the two camera systems
26 Calibration Basics 7-Point-Algorithm >8-Point-Algorithm(s) Experiments/Tricks Equivalent Problems 2 Images by a moving camera at two different moments (static). 2 Images by a fixed camera at two different moments (single object,dynamic) 2 Images by 2 Cameras at the same time 2 Images by 2 Cameras (static)
27 Calibration Basics 7-Point-Algorithm >8-Point-Algorithm(s) Experiments/Tricks Definitions The Epipolar Equation can be written as linear homogeneous equation
28 Calibration Basics 7-Point-Algorithm >8-Point-Algorithm(s) Experiments/Tricks Definitions For n point matches
29 Calibration Basics 7-Point-Algorithm >8-Point-Algorithm(s) Experiments/Tricks Not that easy Noise Least-square methods are very sensitive to false matches Enforce rank 2 constraint or epipolar lines will "smear out" find closest rank 2 approximation of F
30 Calibration Basics 7-Point-Algorithm >8-Point-Algorithm(s) Experiments/Tricks Rank 2 Constraint
31 Calibration Basics 7-Point-Algorithm >8-Point-Algorithm(s) Experiments/Tricks Rank 2 Constraint Rank 3 Rank 2
32 Calibration Basics 7-Point-Algorithm >8-Point-Algorithm(s) Experiments/Tricks 7 Point Algorithm In this case n=7 and rank(u 7 )=7 SVD 2 last columns of Y span the right null-space of U => F1 and F2
33 Calibration Basics 7-Point-Algorithm >8-Point-Algorithm(s) Experiments/Tricks 7 Point Algorithm 1 Parameter family of matrices because F is homogenous Can have 1 or 3 Solutions!
34 Calibration Basics 7-Point-Algorithm >8-Point-Algorithm(s) Experiments/Tricks 8 Point Algorithm(s) Usually more than 7 Matches Many Methods (see [1]) Linear Methods Nonlinear Methods Robust Methods
35 Calibration Basics 7-Point-Algorithm >8-Point-Algorithm(s) Experiments/Tricks Linear Methods Minimize epipolar Equation or better There is a trivial solution:
36 Calibration Basics 7-Point-Algorithm >8-Point-Algorithm(s) Experiments/Tricks Eigen Analysis Impose a constraint on norm of Get unconstrained problem through Lagrange multipliers
37 Calibration Basics 7-Point-Algorithm >8-Point-Algorithm(s) Experiments/Tricks Eigen Analysis - Minimizing First derivative = 0 deriving...
38 Calibration Basics 7-Point-Algorithm >8-Point-Algorithm(s) Experiments/Tricks Eigen Analysis - Back substitution There are 9 eigenvalues Back substituting the solution Solution is the Eigenvector of associated to the smallest Eigenvalue (smallest Singular Vector of )
39 Calibration Basics 7-Point-Algorithm >8-Point-Algorithm(s) Experiments/Tricks Problems with most linear methods The rank 2 constraint is not satisfied Minimized Quantity has no physical meaning High instability (in the numerical sense) => normalize Input Data!
40 Calibration Basics 7-Point-Algorithm >8-Point-Algorithm(s) Experiments/Tricks Iterative Linear Method Minimize the distances between points and corresponding epipolar lines Symmetrical Distance
41 Calibration Basics 7-Point-Algorithm >8-Point-Algorithm(s) Experiments/Tricks Iterative Linear Method - Weights Represent distances as weights Problem: Weights depend on F Solution: Set all weights to 1 Compute F Calculate new weights from F Repeat 'till satisfaction
42 Calibration Basics 7-Point-Algorithm >8-Point-Algorithm(s) Experiments/Tricks Iterative Linear Method - Can't get no... Pros: Easy to implement Minimizes Physical quantity Cons: Rank-2 constraint isn't satisfied No significant improvement[1] Better: Nonlinear Minimization in Parameter Space [1]
43 Calibration Basics 7-Point-Algorithm >8-Point-Algorithm(s) Experiments/Tricks Robust Methods - RANSAC Exploit heuristics Try to remove "outliers" RANdom SAmple Consensus
44 Calibration Basics 7-Point-Algorithm >8-Point-Algorithm(s) Experiments/Tricks Robust Methods - RANSAC Step 1. Extract features Step 2. Compute a set of potential matches Step 3. do Step 3.1 select minimal sample Step 3.2 compute solution(s) for F (verify hypothesis) Step 3.3 determine inliers until Γ(#inliers,#samples) 95% Step 4. Compute F based on all inliers Step 5. Look for additional matches Step 6. Refine F based on all correct matches (generate hypothesis)
45 Calibration Basics 7-Point-Algorithm >8-Point-Algorithm(s) Experiments/Tricks Robust Methods - RANSAC Propability that at least one random sample is free of outliers
46 Calibration Basics 7-Point-Algorithm >8-Point-Algorithm(s) Experiments/Tricks Experiments / Tricks Image Rectification [2]
47 Calibration Basics 7-Point-Algorithm >8-Point-Algorithm(s) Experiments/Tricks Experiments / Tricks Image Rectification [2] Demos online
48 " in Stereo Motion and Object Recognition" Many (if not all) algorithms Gang Xu and Zhengyou Zhang You don't want to buy it... Get it from the library... [1]
49 "Three-Dimensional Computer Vision - A Geometric Viewpoint" Olivier Faugeras Good Basics, Interesting Chapter about Edge-Detection. Many Images. [2]
50 "Multiple View Geometry in Computer Vision" Richard Hartley and Andrew Zisserman [3]
51 Web (matlab functions) (demo) (matlab toolbox) [3]
52 That's it Thanks
Epipolar Geometry. Readings: See Sections 10.1 and 15.6 of Forsyth and Ponce. Right Image. Left Image. e(p ) Epipolar Lines. e(q ) q R.
Epipolar Geometry We consider two perspective images of a scene as taken from a stereo pair of cameras (or equivalently, assume the scene is rigid and imaged with a single camera from two different locations).
EXPERIMENTAL EVALUATION OF RELATIVE POSE ESTIMATION ALGORITHMS
EXPERIMENTAL EVALUATION OF RELATIVE POSE ESTIMATION ALGORITHMS Marcel Brückner, Ferid Bajramovic, Joachim Denzler Chair for Computer Vision, Friedrich-Schiller-University Jena, Ernst-Abbe-Platz, 7743 Jena,
Wii Remote Calibration Using the Sensor Bar
Wii Remote Calibration Using the Sensor Bar Alparslan Yildiz Abdullah Akay Yusuf Sinan Akgul GIT Vision Lab - http://vision.gyte.edu.tr Gebze Institute of Technology Kocaeli, Turkey {yildiz, akay, akgul}@bilmuh.gyte.edu.tr
Linear Algebra Review. Vectors
Linear Algebra Review By Tim K. Marks UCSD Borrows heavily from: Jana Kosecka [email protected] http://cs.gmu.edu/~kosecka/cs682.html Virginia de Sa Cogsci 8F Linear Algebra review UCSD Vectors The length
2-View Geometry. Mark Fiala Ryerson University [email protected]
CRV 2010 Tutorial Day 2-View Geometry Mark Fiala Ryerson University [email protected] 3-Vectors for image points and lines Mark Fiala 2010 2D Homogeneous Points Add 3 rd number to a 2D point on image
8. Linear least-squares
8. Linear least-squares EE13 (Fall 211-12) definition examples and applications solution of a least-squares problem, normal equations 8-1 Definition overdetermined linear equations if b range(a), cannot
Least-Squares Intersection of Lines
Least-Squares Intersection of Lines Johannes Traa - UIUC 2013 This write-up derives the least-squares solution for the intersection of lines. In the general case, a set of lines will not intersect at a
Projective Reconstruction from Line Correspondences
Projective Reconstruction from Line Correspondences Richard I. Hartley G.E. CRD, Schenectady, NY, 12301. Abstract The paper gives a practical rapid algorithm for doing projective reconstruction of a scene
An Efficient Solution to the Five-Point Relative Pose Problem
An Efficient Solution to the Five-Point Relative Pose Problem David Nistér Sarnoff Corporation CN5300, Princeton, NJ 08530 [email protected] Abstract An efficient algorithmic solution to the classical
3 Orthogonal Vectors and Matrices
3 Orthogonal Vectors and Matrices The linear algebra portion of this course focuses on three matrix factorizations: QR factorization, singular valued decomposition (SVD), and LU factorization The first
Optical Tracking Using Projective Invariant Marker Pattern Properties
Optical Tracking Using Projective Invariant Marker Pattern Properties Robert van Liere, Jurriaan D. Mulder Department of Information Systems Center for Mathematics and Computer Science Amsterdam, the Netherlands
Manifold Learning Examples PCA, LLE and ISOMAP
Manifold Learning Examples PCA, LLE and ISOMAP Dan Ventura October 14, 28 Abstract We try to give a helpful concrete example that demonstrates how to use PCA, LLE and Isomap, attempts to provide some intuition
Epipolar Geometry and Visual Servoing
Epipolar Geometry and Visual Servoing Domenico Prattichizzo joint with with Gian Luca Mariottini and Jacopo Piazzi www.dii.unisi.it/prattichizzo Robotics & Systems Lab University of Siena, Italy Scuoladi
A Flexible New Technique for Camera Calibration
A Flexible New Technique for Camera Calibration Zhengyou Zhang December 2, 1998 (updated on December 14, 1998) (updated on March 25, 1999) (updated on Aug. 1, 22; a typo in Appendix B) (updated on Aug.
Projective Geometry. Projective Geometry
Euclidean versus Euclidean geometry describes sapes as tey are Properties of objects tat are uncanged by rigid motions» Lengts» Angles» Parallelism Projective geometry describes objects as tey appear Lengts,
Nonlinear Iterative Partial Least Squares Method
Numerical Methods for Determining Principal Component Analysis Abstract Factors Béchu, S., Richard-Plouet, M., Fernandez, V., Walton, J., and Fairley, N. (2016) Developments in numerical treatments for
Orthogonal Diagonalization of Symmetric Matrices
MATH10212 Linear Algebra Brief lecture notes 57 Gram Schmidt Process enables us to find an orthogonal basis of a subspace. Let u 1,..., u k be a basis of a subspace V of R n. We begin the process of finding
Geometric Camera Parameters
Geometric Camera Parameters What assumptions have we made so far? -All equations we have derived for far are written in the camera reference frames. -These equations are valid only when: () all distances
Camera geometry and image alignment
Computer Vision and Machine Learning Winter School ENS Lyon 2010 Camera geometry and image alignment Josef Sivic http://www.di.ens.fr/~josef INRIA, WILLOW, ENS/INRIA/CNRS UMR 8548 Laboratoire d Informatique,
Chapter 6. Orthogonality
6.3 Orthogonal Matrices 1 Chapter 6. Orthogonality 6.3 Orthogonal Matrices Definition 6.4. An n n matrix A is orthogonal if A T A = I. Note. We will see that the columns of an orthogonal matrix must be
Support Vector Machine (SVM)
Support Vector Machine (SVM) CE-725: Statistical Pattern Recognition Sharif University of Technology Spring 2013 Soleymani Outline Margin concept Hard-Margin SVM Soft-Margin SVM Dual Problems of Hard-Margin
A QCQP Approach to Triangulation. Chris Aholt, Sameer Agarwal, and Rekha Thomas University of Washington 2 Google, Inc.
A QCQP Approach to Triangulation 1 Chris Aholt, Sameer Agarwal, and Rekha Thomas 1 University of Washington 2 Google, Inc. 2 1 The Triangulation Problem X Given: -n camera matrices P i R 3 4 -n noisy observations
Lecture 5: Singular Value Decomposition SVD (1)
EEM3L1: Numerical and Analytical Techniques Lecture 5: Singular Value Decomposition SVD (1) EE3L1, slide 1, Version 4: 25-Sep-02 Motivation for SVD (1) SVD = Singular Value Decomposition Consider the system
Similar matrices and Jordan form
Similar matrices and Jordan form We ve nearly covered the entire heart of linear algebra once we ve finished singular value decompositions we ll have seen all the most central topics. A T A is positive
P164 Tomographic Velocity Model Building Using Iterative Eigendecomposition
P164 Tomographic Velocity Model Building Using Iterative Eigendecomposition K. Osypov* (WesternGeco), D. Nichols (WesternGeco), M. Woodward (WesternGeco) & C.E. Yarman (WesternGeco) SUMMARY Tomographic
CS 534: Computer Vision 3D Model-based recognition
CS 534: Computer Vision 3D Model-based recognition Ahmed Elgammal Dept of Computer Science CS 534 3D Model-based Vision - 1 High Level Vision Object Recognition: What it means? Two main recognition tasks:!
Linear Algebraic Equations, SVD, and the Pseudo-Inverse
Linear Algebraic Equations, SVD, and the Pseudo-Inverse Philip N. Sabes October, 21 1 A Little Background 1.1 Singular values and matrix inversion For non-smmetric matrices, the eigenvalues and singular
Review Jeopardy. Blue vs. Orange. Review Jeopardy
Review Jeopardy Blue vs. Orange Review Jeopardy Jeopardy Round Lectures 0-3 Jeopardy Round $200 How could I measure how far apart (i.e. how different) two observations, y 1 and y 2, are from each other?
Relating Vanishing Points to Catadioptric Camera Calibration
Relating Vanishing Points to Catadioptric Camera Calibration Wenting Duan* a, Hui Zhang b, Nigel M. Allinson a a Laboratory of Vision Engineering, University of Lincoln, Brayford Pool, Lincoln, U.K. LN6
3D Scanner using Line Laser. 1. Introduction. 2. Theory
. Introduction 3D Scanner using Line Laser Di Lu Electrical, Computer, and Systems Engineering Rensselaer Polytechnic Institute The goal of 3D reconstruction is to recover the 3D properties of a geometric
Recall the basic property of the transpose (for any A): v A t Aw = v w, v, w R n.
ORTHOGONAL MATRICES Informally, an orthogonal n n matrix is the n-dimensional analogue of the rotation matrices R θ in R 2. When does a linear transformation of R 3 (or R n ) deserve to be called a rotation?
DESIGN & DEVELOPMENT OF AUTONOMOUS SYSTEM TO BUILD 3D MODEL FOR UNDERWATER OBJECTS USING STEREO VISION TECHNIQUE
DESIGN & DEVELOPMENT OF AUTONOMOUS SYSTEM TO BUILD 3D MODEL FOR UNDERWATER OBJECTS USING STEREO VISION TECHNIQUE N. Satish Kumar 1, B L Mukundappa 2, Ramakanth Kumar P 1 1 Dept. of Information Science,
Summary: Transformations. Lecture 14 Parameter Estimation Readings T&V Sec 5.1-5.3. Parameter Estimation: Fitting Geometric Models
Summary: Transformations Lecture 14 Parameter Estimation eadings T&V Sec 5.1-5.3 Euclidean similarity affine projective Parameter Estimation We will talk about estimating parameters of 1) Geometric models
α = u v. In other words, Orthogonal Projection
Orthogonal Projection Given any nonzero vector v, it is possible to decompose an arbitrary vector u into a component that points in the direction of v and one that points in a direction orthogonal to v
The Geometry of Polynomial Division and Elimination
The Geometry of Polynomial Division and Elimination Kim Batselier, Philippe Dreesen Bart De Moor Katholieke Universiteit Leuven Department of Electrical Engineering ESAT/SCD/SISTA/SMC May 2012 1 / 26 Outline
Subspace Analysis and Optimization for AAM Based Face Alignment
Subspace Analysis and Optimization for AAM Based Face Alignment Ming Zhao Chun Chen College of Computer Science Zhejiang University Hangzhou, 310027, P.R.China [email protected] Stan Z. Li Microsoft
Applied Linear Algebra I Review page 1
Applied Linear Algebra Review 1 I. Determinants A. Definition of a determinant 1. Using sum a. Permutations i. Sign of a permutation ii. Cycle 2. Uniqueness of the determinant function in terms of properties
Metrics on SO(3) and Inverse Kinematics
Mathematical Foundations of Computer Graphics and Vision Metrics on SO(3) and Inverse Kinematics Luca Ballan Institute of Visual Computing Optimization on Manifolds Descent approach d is a ascent direction
Introduction to Matrix Algebra
Psychology 7291: Multivariate Statistics (Carey) 8/27/98 Matrix Algebra - 1 Introduction to Matrix Algebra Definitions: A matrix is a collection of numbers ordered by rows and columns. It is customary
THE problem of visual servoing guiding a robot using
582 IEEE TRANSACTIONS ON ROBOTICS AND AUTOMATION, VOL. 13, NO. 4, AUGUST 1997 A Modular System for Robust Positioning Using Feedback from Stereo Vision Gregory D. Hager, Member, IEEE Abstract This paper
Systems of Linear Equations
Systems of Linear Equations Beifang Chen Systems of linear equations Linear systems A linear equation in variables x, x,, x n is an equation of the form a x + a x + + a n x n = b, where a, a,, a n and
Mehtap Ergüven Abstract of Ph.D. Dissertation for the degree of PhD of Engineering in Informatics
INTERNATIONAL BLACK SEA UNIVERSITY COMPUTER TECHNOLOGIES AND ENGINEERING FACULTY ELABORATION OF AN ALGORITHM OF DETECTING TESTS DIMENSIONALITY Mehtap Ergüven Abstract of Ph.D. Dissertation for the degree
How To Analyze Ball Blur On A Ball Image
Single Image 3D Reconstruction of Ball Motion and Spin From Motion Blur An Experiment in Motion from Blur Giacomo Boracchi, Vincenzo Caglioti, Alessandro Giusti Objective From a single image, reconstruct:
Numerical Methods I Solving Linear Systems: Sparse Matrices, Iterative Methods and Non-Square Systems
Numerical Methods I Solving Linear Systems: Sparse Matrices, Iterative Methods and Non-Square Systems Aleksandar Donev Courant Institute, NYU 1 [email protected] 1 Course G63.2010.001 / G22.2420-001,
Geometry: Unit 1 Vocabulary TERM DEFINITION GEOMETRIC FIGURE. Cannot be defined by using other figures.
Geometry: Unit 1 Vocabulary 1.1 Undefined terms Cannot be defined by using other figures. Point A specific location. It has no dimension and is represented by a dot. Line Plane A connected straight path.
EPnP: An Accurate O(n) Solution to the PnP Problem
DOI 10.1007/s11263-008-0152-6 EPnP: An Accurate O(n) Solution to the PnP Problem Vincent Lepetit Francesc Moreno-Noguer Pascal Fua Received: 15 April 2008 / Accepted: 25 June 2008 Springer Science+Business
Inner Product Spaces and Orthogonality
Inner Product Spaces and Orthogonality week 3-4 Fall 2006 Dot product of R n The inner product or dot product of R n is a function, defined by u, v a b + a 2 b 2 + + a n b n for u a, a 2,, a n T, v b,
Multiple View Geometry in Computer Vision
Multiple View Geometry in Computer Vision Information Meeting 15 Dec 2009 by Marianna Pronobis Content of the Meeting 1. Motivation & Objectives 2. What the course will be about (Stefan) 3. Content of
1 2 3 1 1 2 x = + x 2 + x 4 1 0 1
(d) If the vector b is the sum of the four columns of A, write down the complete solution to Ax = b. 1 2 3 1 1 2 x = + x 2 + x 4 1 0 0 1 0 1 2. (11 points) This problem finds the curve y = C + D 2 t which
Segmentation of building models from dense 3D point-clouds
Segmentation of building models from dense 3D point-clouds Joachim Bauer, Konrad Karner, Konrad Schindler, Andreas Klaus, Christopher Zach VRVis Research Center for Virtual Reality and Visualization, Institute
13 MATH FACTS 101. 2 a = 1. 7. The elements of a vector have a graphical interpretation, which is particularly easy to see in two or three dimensions.
3 MATH FACTS 0 3 MATH FACTS 3. Vectors 3.. Definition We use the overhead arrow to denote a column vector, i.e., a linear segment with a direction. For example, in three-space, we write a vector in terms
CS 5614: (Big) Data Management Systems. B. Aditya Prakash Lecture #18: Dimensionality Reduc7on
CS 5614: (Big) Data Management Systems B. Aditya Prakash Lecture #18: Dimensionality Reduc7on Dimensionality Reduc=on Assump=on: Data lies on or near a low d- dimensional subspace Axes of this subspace
Geometric Constraints
Simulation in Computer Graphics Geometric Constraints Matthias Teschner Computer Science Department University of Freiburg Outline introduction penalty method Lagrange multipliers local constraints University
LS.6 Solution Matrices
LS.6 Solution Matrices In the literature, solutions to linear systems often are expressed using square matrices rather than vectors. You need to get used to the terminology. As before, we state the definitions
160 CHAPTER 4. VECTOR SPACES
160 CHAPTER 4. VECTOR SPACES 4. Rank and Nullity In this section, we look at relationships between the row space, column space, null space of a matrix and its transpose. We will derive fundamental results
Projective Geometry: A Short Introduction. Lecture Notes Edmond Boyer
Projective Geometry: A Short Introduction Lecture Notes Edmond Boyer Contents 1 Introduction 2 11 Objective 2 12 Historical Background 3 13 Bibliography 4 2 Projective Spaces 5 21 Definitions 5 22 Properties
Time Domain and Frequency Domain Techniques For Multi Shaker Time Waveform Replication
Time Domain and Frequency Domain Techniques For Multi Shaker Time Waveform Replication Thomas Reilly Data Physics Corporation 1741 Technology Drive, Suite 260 San Jose, CA 95110 (408) 216-8440 This paper
Lectures notes on orthogonal matrices (with exercises) 92.222 - Linear Algebra II - Spring 2004 by D. Klain
Lectures notes on orthogonal matrices (with exercises) 92.222 - Linear Algebra II - Spring 2004 by D. Klain 1. Orthogonal matrices and orthonormal sets An n n real-valued matrix A is said to be an orthogonal
Geometry of Vectors. 1 Cartesian Coordinates. Carlo Tomasi
Geometry of Vectors Carlo Tomasi This note explores the geometric meaning of norm, inner product, orthogonality, and projection for vectors. For vectors in three-dimensional space, we also examine the
Object Recognition and Template Matching
Object Recognition and Template Matching Template Matching A template is a small image (sub-image) The goal is to find occurrences of this template in a larger image That is, you want to find matches of
Eigenvalues and Eigenvectors
Chapter 6 Eigenvalues and Eigenvectors 6. Introduction to Eigenvalues Linear equations Ax D b come from steady state problems. Eigenvalues have their greatest importance in dynamic problems. The solution
1 Introduction to Matrices
1 Introduction to Matrices In this section, important definitions and results from matrix algebra that are useful in regression analysis are introduced. While all statements below regarding the columns
1 Review of Least Squares Solutions to Overdetermined Systems
cs4: introduction to numerical analysis /9/0 Lecture 7: Rectangular Systems and Numerical Integration Instructor: Professor Amos Ron Scribes: Mark Cowlishaw, Nathanael Fillmore Review of Least Squares
DATA ANALYSIS II. Matrix Algorithms
DATA ANALYSIS II Matrix Algorithms Similarity Matrix Given a dataset D = {x i }, i=1,..,n consisting of n points in R d, let A denote the n n symmetric similarity matrix between the points, given as where
Terrain Traversability Analysis using Organized Point Cloud, Superpixel Surface Normals-based segmentation and PCA-based Classification
Terrain Traversability Analysis using Organized Point Cloud, Superpixel Surface Normals-based segmentation and PCA-based Classification Aras Dargazany 1 and Karsten Berns 2 Abstract In this paper, an stereo-based
Recall that two vectors in are perpendicular or orthogonal provided that their dot
Orthogonal Complements and Projections Recall that two vectors in are perpendicular or orthogonal provided that their dot product vanishes That is, if and only if Example 1 The vectors in are orthogonal
A new Optical Tracking System for Virtual and Augmented Reality Applications
IEEE Instrumentation and Measurement Technology Conference Budapest, Hungary, May 21 23, 2001 A new Optical Tracking System for Virtual and Augmented Reality Applications Miguel Ribo VRVis Competence Center
MATH 551 - APPLIED MATRIX THEORY
MATH 55 - APPLIED MATRIX THEORY FINAL TEST: SAMPLE with SOLUTIONS (25 points NAME: PROBLEM (3 points A web of 5 pages is described by a directed graph whose matrix is given by A Do the following ( points
Blind Deconvolution of Barcodes via Dictionary Analysis and Wiener Filter of Barcode Subsections
Blind Deconvolution of Barcodes via Dictionary Analysis and Wiener Filter of Barcode Subsections Maximilian Hung, Bohyun B. Kim, Xiling Zhang August 17, 2013 Abstract While current systems already provide
Going Big in Data Dimensionality:
LUDWIG- MAXIMILIANS- UNIVERSITY MUNICH DEPARTMENT INSTITUTE FOR INFORMATICS DATABASE Going Big in Data Dimensionality: Challenges and Solutions for Mining High Dimensional Data Peer Kröger Lehrstuhl für
University of Lille I PC first year list of exercises n 7. Review
University of Lille I PC first year list of exercises n 7 Review Exercise Solve the following systems in 4 different ways (by substitution, by the Gauss method, by inverting the matrix of coefficients
Solving Simultaneous Equations and Matrices
Solving Simultaneous Equations and Matrices The following represents a systematic investigation for the steps used to solve two simultaneous linear equations in two unknowns. The motivation for considering
Math 215 HW #6 Solutions
Math 5 HW #6 Solutions Problem 34 Show that x y is orthogonal to x + y if and only if x = y Proof First, suppose x y is orthogonal to x + y Then since x, y = y, x In other words, = x y, x + y = (x y) T
Notes on Orthogonal and Symmetric Matrices MENU, Winter 2013
Notes on Orthogonal and Symmetric Matrices MENU, Winter 201 These notes summarize the main properties and uses of orthogonal and symmetric matrices. We covered quite a bit of material regarding these topics,
Similarity and Diagonalization. Similar Matrices
MATH022 Linear Algebra Brief lecture notes 48 Similarity and Diagonalization Similar Matrices Let A and B be n n matrices. We say that A is similar to B if there is an invertible n n matrix P such that
5. Orthogonal matrices
L Vandenberghe EE133A (Spring 2016) 5 Orthogonal matrices matrices with orthonormal columns orthogonal matrices tall matrices with orthonormal columns complex matrices with orthonormal columns 5-1 Orthonormal
Numerical Analysis Lecture Notes
Numerical Analysis Lecture Notes Peter J. Olver 5. Inner Products and Norms The norm of a vector is a measure of its size. Besides the familiar Euclidean norm based on the dot product, there are a number
Using Many Cameras as One
Using Many Cameras as One Robert Pless Department of Computer Science and Engineering Washington University in St. Louis, Box 1045, One Brookings Ave, St. Louis, MO, 63130 [email protected] Abstract We
Computational Optical Imaging - Optique Numerique. -- Deconvolution --
Computational Optical Imaging - Optique Numerique -- Deconvolution -- Winter 2014 Ivo Ihrke Deconvolution Ivo Ihrke Outline Deconvolution Theory example 1D deconvolution Fourier method Algebraic method
Digital Image Increase
Exploiting redundancy for reliable aerial computer vision 1 Digital Image Increase 2 Images Worldwide 3 Terrestrial Image Acquisition 4 Aerial Photogrammetry 5 New Sensor Platforms Towards Fully Automatic
Singular Spectrum Analysis with Rssa
Singular Spectrum Analysis with Rssa Maurizio Sanarico Chief Data Scientist SDG Consulting Milano R June 4, 2014 Motivation Discover structural components in complex time series Working hypothesis: a signal
Linear Algebra: Determinants, Inverses, Rank
D Linear Algebra: Determinants, Inverses, Rank D 1 Appendix D: LINEAR ALGEBRA: DETERMINANTS, INVERSES, RANK TABLE OF CONTENTS Page D.1. Introduction D 3 D.2. Determinants D 3 D.2.1. Some Properties of
Linearly Independent Sets and Linearly Dependent Sets
These notes closely follow the presentation of the material given in David C. Lay s textbook Linear Algebra and its Applications (3rd edition). These notes are intended primarily for in-class presentation
Eigenvalues, Eigenvectors, Matrix Factoring, and Principal Components
Eigenvalues, Eigenvectors, Matrix Factoring, and Principal Components The eigenvalues and eigenvectors of a square matrix play a key role in some important operations in statistics. In particular, they
(Quasi-)Newton methods
(Quasi-)Newton methods 1 Introduction 1.1 Newton method Newton method is a method to find the zeros of a differentiable non-linear function g, x such that g(x) = 0, where g : R n R n. Given a starting
Background: State Estimation
State Estimation Cyber Security of the Smart Grid Dr. Deepa Kundur Background: State Estimation University of Toronto Dr. Deepa Kundur (University of Toronto) Cyber Security of the Smart Grid 1 / 81 Dr.
Vector and Matrix Norms
Chapter 1 Vector and Matrix Norms 11 Vector Spaces Let F be a field (such as the real numbers, R, or complex numbers, C) with elements called scalars A Vector Space, V, over the field F is a non-empty
Factor analysis. Angela Montanari
Factor analysis Angela Montanari 1 Introduction Factor analysis is a statistical model that allows to explain the correlations between a large number of observed correlated variables through a small number
Partial Least Squares (PLS) Regression.
Partial Least Squares (PLS) Regression. Hervé Abdi 1 The University of Texas at Dallas Introduction Pls regression is a recent technique that generalizes and combines features from principal component
Numerical Analysis Lecture Notes
Numerical Analysis Lecture Notes Peter J. Olver 6. Eigenvalues and Singular Values In this section, we collect together the basic facts about eigenvalues and eigenvectors. From a geometrical viewpoint,
4.3 Least Squares Approximations
18 Chapter. Orthogonality.3 Least Squares Approximations It often happens that Ax D b has no solution. The usual reason is: too many equations. The matrix has more rows than columns. There are more equations
Solutions to Math 51 First Exam January 29, 2015
Solutions to Math 5 First Exam January 29, 25. ( points) (a) Complete the following sentence: A set of vectors {v,..., v k } is defined to be linearly dependent if (2 points) there exist c,... c k R, not
An Efficient Solution to the Five-Point Relative Pose Problem
An Efficient Solution to the Five-Point Relative Pose Problem David Nistér Sarnoff Corporation CN5300, Princeton, NJ 08530 [email protected] Abstract An efficient algorithmic solution to the classical
