An Improved Evolutionary Algorithm for Fundamental Matrix Estimation
|
|
- Peter Heath
- 5 years ago
- Views:
Transcription
1 03 0th IEEE International Conference on Advanced Video and Signal Based Surveillance An Improved Evolutionary Algorithm for Fundamental Matrix Estimation Yi Li, Senem Velipasalar and M. Cenk Gursoy Department of Electrical Engineering and Computer Science Syracuse University, Syracuse, NY 3 yli33@syr.edu, svelipas@syr.edu, mcgursoy@syr.edu Abstract The estimation of the fundamental matrix is an important problem in epipolar geometry. Many estimation methods have been proposed before, including the eight-point algorithm, Simple Evolutionary Agent (SEA) and RANSAC. In this paper, we investigate the evolutionary agent-based algorithm for fundamental matrix estimation, and present a new algorithm that improves the existing evolutionary algorithm both accuracy- and efficiency-wise. The model focuses on selecting a best combination of input points to compute the fundamental matrix via the eight-point algorithm. To improve the existing algorithm, our new model holds competition over all agents for population control and evolutionary experience accumulation. In addition to a larger competition scope, we add the outlier elimination mechanism, which greatly accelerates the algorithm. New parameters are introduced to control the convergence more efficiently. The improved algorithm achieves lower computation load and more accurate results. A general analysis about parameter selection is also provided.. Introduction The estimation of the fundamental matrix is one of the basic problems in epipolar geometry, which is the geometry of stereo vision. Fundamental matrix relates corresponding points in images taken by two different cameras. Given a point in one image, the fundamental matrix narrows down the search for the corresponding point in the other image to a line. Many methods have been proposed in the past for fundamental matrix estimation. A detailed introduction and comparisons are provided for different types of estimation in [] and [8]. Linear methods estimate the fundamental matrix by solving a set of linear equations, and least-squares technique is used to solve over-determined linear equations. Many classical methods belong to this group, such as sixpoint solver [7], seven-point algorithm and eight-point algorithm [5]. The normalized eight-point algorithm [3], which is an improved version of the eight-point algorithm, is a frequently used method. It only requires eight pairs of corresponding points taken from two images. The output of the normalized eight-point algorithm highly depends on the quality of the selected point pairs. In reality, we cannot guarantee that the coordinates of the point pairs are accurate. After feature point detection and pairing, there exists a number of outliers, degrading the performance of the algorithm. In addition, the inlier coordinates are usually affected by noise, which influences the result as well. Robust iterative methods focus on dealing with the outliers. To obtain a reliable result, robust methods aim to eliminate the outliers before applying simple estimators. RANdom SAmple Consensus (RANSAC) [] is one of the most widely used and effective methods to select inliers. Simple Evolutionary Agent (SEA) [] is another robust and iterative algorithm. It uses the idea of random mutation, which randomly changes a small part of the samples to search for a best combination of points that minimize a certain cost function. To avoid being stuck at a sub-optimum solution, several groups search simultaneously. In this paper, we introduce the Evolutionary Agent with Gene Selection (EAGS) method, which is a novel and improved evolutionary agent algorithm. This algorithm forms a gene set consisting of all of the putative point pairs. Then, it uses evolutionary agent to filter the elements in the gene set, and reaches the best group of points, leading to the estimation of a more accurate fundamental matrix. The remainder of this paper is organized as follows. The basics of epipolar geometry, the normalized eight-point algorithm and SEA are described briefly in Section. The details of the proposed algorithm are presented in Section 3. In Section, the impact of the several parameters of the algorithm is investigated via simulation results, and the paper is concluded in Section /3/$ IEEE 6
2 . Background.. Epipolar Geometry Epipolar geometry is illustrated in Fig., wherein a 3D point is projected onto two different image planes. From these two images, we can get the homogenous coordinates of a pair of corresponding points, x = (x,y,) T, andx = (x,y,) T, corresponding to the same 3D point. The line passing through two camera centers is called the baseline. The intersection of the baseline with two image planes gives the two epipoles. The line through the epipole and an image point is the epipolar line. Figure. Epipolar Geometry. Fundamental matrix, F, is a 3 3 matrix with rank, which satisfies the following constraint: x T Fx = 0, () where x and x lie on the corresponding epipolar lines, which are represented byl = Fx, andl = F T x... Eight Point Algorithm Since the coordinates of points contain random, it is impossible to find anf matrix which can satisfy () exactly for all points. Eight point algorithm focuses on minimizing the algebraic x T Fx, which was introduced in [5]. According to the coordinates of eight pairs of points,x i and x i, the algorithm forms an 8 9 matrix as x x x y x y x y y y x y x 8 x 8 x 8 y 8 x 8 y 8 x 8 y 8 y 8 y 8 x 8 y 8. To obtain F, the algorithm just reshapes the generator of the right null space of this matrix to be a 3 3 matrix. Although this F matrix can satisfy () for these eight pairs of points, it does not satisfy the rank constraint. After setting the smallest singular value off to0, the newf matrix will have rank equal to. For the normalized eight point algorithm in [3], we just need to include a normalization process before the eight point algorithm, setting the center of these points to the origin, and the average distance to their center to be. After the algorithm, an inverse normalization is needed to get the F matrix of the original points..3. Sampson Distance To judge the accuracy of a result, we need to compare the average distance or. A lower average distance indicates a better result. Sampson distance [6] is a widely used gradient distance. Consider the fundamental matrix F = f f f 3 f f 5 f 6. f 7 f 8 f 9 The algebraic distance for each point pair isr i = x T i Fx i. Then, Sampson distance is defined as d s = r ( r = r rx +ry +r x +r y ), () where r x = f x + f y + f 7, r y = f x + f 5 y + f 8, r x = f x+f y +f 3,r y = f x+f 5 y +f 6... RANSAC RANSAC is an effective method to select inliers. Since we do not know the exact number of inliers and outliers, the algorithm calculates the fundamental matrix for different numbers of inliers. The final result is the one that minimizes the total function, which is defined as where ρ(d ) = = i ρ(d si), (3) { 0 d < T constant d T, and T is an estimated threshold to distinguish inliers and outliers..5. SEA Evolutionary agent algorithm is another method to select good inliers. Different from RANSAC, SEA finds an optimal combination of eight pairs of points that leads to a fundamental matrix which minimizes the cost function, defined as n D cost = ϕ(d si ), () where and β =.96 ϕ(d) = i= { d d < β β d β, ( ( )) median( di ) (5) n 8 7
3 is a maximum likelihood estimation of the threshold of inliers. The fundamental matrix for cost function calculation comes from the normalized eight point algorithm. Before the evolutionary process, the algorithm builds an index array corresponding to the point pairs. Each agent contains a combination of eight pairs. After initialization, the evolution process starts. In this algorithm, the data structure of agent is as follows: Agent=(index of point pair,...,index of point pair 8, alive indicator, age, cost function). During each evolution loop, each agent is going to produce several child agents. Every child agent inherits the point combination from its parent, and changes several point pairs randomly. If the offspring has better cost function than its parent, it will survive while its parent dies after the reproduction process. If none of the offsprings can do better than their parent, the parent agent will survive, and its age will increase by one. At the end of each evolution loop, the algorithm checks the age of all agents, and very old agents will be weeded out. The evolution loop stops when the agent set is empty, which means there is no alive agent. Finally, the algorithm reaches the best combination that minimizes the cost function. In this algorithm, there are three main parameters that can affect the performance significantly. Parameter mbr is the number of child agents that one parent agent produces in an evolution loop;mch is the number of point pairs that one agent will change; and the initial number of agents. Increasing these parameters can lead to a more accurate result, but it decreases the processing speed. An optimal choice could bembr =,mch =, initial number = Evolutionary Agent with Gene Selection (EAGS) 3.. The Shortcomings of SEA Although simulation results have shown performance improvements of SEA, there are still some shortcomings, which we address to improve this algorithm. First, there is no experience exchange between families, which implies that every family just performs the evolution process independently. If they can share good evolutionary experience, the evolution process would be more efficient. To improve it, we can hold competition among all agents. After competition, we can obtain much more information about the points, and we can further encourage agents to choose points from those good points. Competition is a very good method to exchange evolutionary experience. Secondly, the computational complexity is high. There is no population control in this algorithm, and therefore the population of agents can be very large, which will slow down the processing speed. Moreover, the survival condition is easy to satisfy. To survive, an agent only needs to do better than its parent. Therefore, some useless agents have a chance to survive. 3.. EAGS Algorithm In this section, we present our new algorithm of Evolutionary Agent with Gene Selection (EAGS). The main difference between SEA and EAGS is that EAGS considers the evolution of the gene set instead of the evolution of the individual agent. All point pairs form a gene set, and each pair of points is a gene unit of this set. During the evolution process, every gene unit will gain experience points according to its performance. After several loops, the algorithm will start to weed out some gene units with low experience points. Each agent selects gene units from the gene set randomly instead of inheriting gene units from its parent. This is the evolution of the gene set. In this algorithm, the data structure of the agent is Agent=(index of point pair,..., index of point pair 8, cost function), which is simpler than SEA. After the initialization, the first several evolution loops represent the growing period in which the agent set is in growing mode. During each loop, new agents are produced, which choose gene units from the gene set randomly. Then, the algorithm sorts the agents according to their cost functions. Depending on their rank, only a part of the agents can survive. The gene units in the top 30% of the survivors gain experience points and the gene units of the rest of the survivors gainexperience point while the gene units in the worst30% of the dead agents lose experience points and the gene units of the rest of the dead agents lose point. At the end of each loop, the algorithm updates the best agent. In the growing mode, the population increase is under control and agents select gene units randomly. This period is used to gain enough information about the gene set and identify which units are more likely to be good inliers. After the growing period, the rest of the evolution loops are part of the decline period in which the agent set is in decline mode. During each loop, we first perform the same steps as in the growing mode. Subsequently, we sort all the gene units according to their experience gain. The gene units with small gain in experience points are more likely to be outliers. Every two loops, we weed out 50% of the units with small gain in experience points. This process makes gene set smaller, helping to concentrate on selecting better inliers. After updating the gene set, we reduce the survival ratio in every loop to reduce the population. If the best agent information holds for more than 3 loops during the decline period, the process will come to an end. The algorithm flowchart is shown in Fig.. For this algorithm, there are several important parameters that can have 8
4 significant impact on the performance: Growing factor = Population of(i+)th loop Population ofi th, (6) loop Decline factor = Survival ratio of(i+)th loop Survival ratio ofi th, (7) loop mbr+ = Number of new agents. (8) Total population agent number. mbr works all through the process, decline factor only works in the decline period, and growing factor works only in the growing period. In Section, we investigate the impact of these parameters through simulation results Biology Interpretation In biology, the evolution of a group can be regarded as the evolution of the gene set of the group. The winners of the competition have more advantages to produce offspring, and their gene can be inherited. On the other hand, the losers do not have the right to produce offspring, and their gene may disappear after their death. This process can weed out those bad gene units from the gene set of the group, which represents the evolution of the gene set. In EAGS, the gene units are points. During evolutionary process, bad points are removed and best points will survive at the end.. Simulation Results Fig. 3 shows some examples of image pairs taken from different viewpoints. We obtain sufficient amount of corresponding point pairs with noise and outliers. Here, around 0% of them are outliers. We define the as the cost function of the final result normalized by the number of point pairs, i.e., = Cost function Number of point pairs. (9) Figure. Algorithm flowchart for EAGS. Decline time threshold (DTT) is the time when the system turns into decline mode, and initial number is the initial Figure 3. Examples of image pairs used in the experiments. 9
5 We can regard this as the upper bound of the average Sampson distance for inliers. We evaluate the performance of the algorithms through the average and average. In the following experiments, we vary one parameter and fix the rest to investigate the impact of this parameter. When we fix parameters, we always set mbr as 3, initial number as 7, growing factor as.5, decline factor as0.65 and DTT as8loops. Fig. shows the influence of parameter mbr. When we increase mbr, we can get more accurate results, but at the cost of more. Indeed, we see this fundamental tradeoff between the accuracy and the in the following simulation results as well. Therefore, the optimal choice of the parameter should consider both the accuracy of the result and the Initial number Initial number Figure 5. Initial number versus and initial number versus mbr DTT mbr Figure. mbr versus and mbr versus..5 Fig. 5 shows the influence of the parameter initial number. When we increase the initial number, we get less, but the increases. Fig. 6 shows the impact of DTT. The results show that increasing DTT leads to a more accurate number, but it costs more time. Fig. 7 shows the effect of the growing factor. The results show that increasing growing factor can improve the accuracy, but it also costs more time. Fig. 8 shows the influence of the decline factor. We again see that increasing the decline factor provides more accurate results, but it incurs more time. As the last experiment, we compare the performances of SEA, EAGS and RANSAC. In [], a very detailed comparison between SEA and other improved RANSAC algorithms is provided, and it shows that SEA provides better results with shorter time. Here, we focus on the comparison of SEA, EAGS and RANSAC. To compare them, we use the optimal parameter settings individually for all of them in order to show the best results they can provide. For SEA, DTT Figure 6. DTT versus and DTT versus. we set mbr as, mch as 3, life span as 3 loops, and initial number as 5. For EAGS, we set mbr as 3, initial number as 7, growing factor as.3, DTT as 8 loops, and decline factor as 0.7. To make their results comparable, the result of RANSAC is also based on normalized eight point algorithm. The RANSAC algorithm makes 600 random tests. The average and average are shown in Table. The results show that the improved algorithm EAGS works much better than SEA and RANSAC. The average when using EAGS is smaller than those of SEA and RANSAC, and the average for EAGS is much shorter, providing 70% savings compared to the time that SEA incurs. 30
6 Growing factor Growing factor Figure 7. Growing factor versus and growing factor versus Decline factor Decline factor Figure 8. Decline factor versus and Decline factor versus. avg. (pixels) avg. (s) EAGS SEA RANSAC Table. Average and average of SEA, EAGS and RANSAC. 5. Conclusion In this paper, we have proposed a new algorithm of Evolutionary Agent with Gene Selection (EAGS). Instead of the evolution of agents, this new algorithm is based on the evolution of the gene set, which is significantly more efficient. By holding the competition among all agents, instead of within each family, the algorithm gains more information about the points, and encourages the new agents to focus on good points. This mechanism encourages a large scale of information sharing between each agent and family, which greatly improves the efficiency of searching. Competition also helps to control the population growth, lowering the computational load. With much more efficient evolution and population control, EAGS has been shown to get more accurate results within a shorter time period. Acknowledgment This work has been funded in part by National Science Foundation under CAREER grant CNS-069. References [] X. Armangu and J. Salvi. Overall view regarding fundamental matrix estimation. Image and Vision Computing, :05 0, 003. [] M. A. Fischler and R. C. Bolles. Random sample consensus: a paradigm for model fitting with applications to image analysis and automated cartography. Commun. ACM, (6):38 395, June 98. [3] R. Hartley. In defence of the 8-point algorithm. In Computer Vision, 995. Proceedings., Fifth International Conference on, pages , 995. [] M. Hu, K. McMenemy, S. Ferguson, G. Dodds, and B. Yuan. Epipolar geometry estimation based on evolutionary agents. Pattern Recognition, ():575 59, 008. [5] H. C. Longuet-Higgins. A computer algorithm for reconstructing a scene from two projections. volume 93, pages [6] P. D. Sampson. Fitting conic sections to very scattered data: An iterative refinement of the bookstein algorithm. Computer Graphics and Image Processing, 8():97 08, 98. [7] H. Stewnius, D. Nistr, F. Kahl, and F. Schaffalitzky. A minimal solution for relative pose with unknown focal length. Image and Vision Computing, 6(7):87 877, 008. [8] P. H. S. Torr and D. W. Murray. The development and comparison of robust methods for estimating the fundamental matrix. International Journal of Computer Vision, :7 300,
A Summary of Projective Geometry
A Summary of Projective Geometry Copyright 22 Acuity Technologies Inc. In the last years a unified approach to creating D models from multiple images has been developed by Beardsley[],Hartley[4,5,9],Torr[,6]
More informationEpipolar geometry. x x
Two-view geometry Epipolar geometry X x x Baseline line connecting the two camera centers Epipolar Plane plane containing baseline (1D family) Epipoles = intersections of baseline with image planes = projections
More informationStereo and Epipolar geometry
Previously Image Primitives (feature points, lines, contours) Today: Stereo and Epipolar geometry How to match primitives between two (multiple) views) Goals: 3D reconstruction, recognition Jana Kosecka
More informationRobust Geometry Estimation from two Images
Robust Geometry Estimation from two Images Carsten Rother 09/12/2016 Computer Vision I: Image Formation Process Roadmap for next four lectures Computer Vision I: Image Formation Process 09/12/2016 2 Appearance-based
More informationVision par ordinateur
Epipolar geometry π Vision par ordinateur Underlying structure in set of matches for rigid scenes l T 1 l 2 C1 m1 l1 e1 M L2 L1 e2 Géométrie épipolaire Fundamental matrix (x rank 2 matrix) m2 C2 l2 Frédéric
More informationTwo-view geometry Computer Vision Spring 2018, Lecture 10
Two-view geometry http://www.cs.cmu.edu/~16385/ 16-385 Computer Vision Spring 2018, Lecture 10 Course announcements Homework 2 is due on February 23 rd. - Any questions about the homework? - How many of
More informationStructure from motion
Multi-view geometry Structure rom motion Camera 1 Camera 2 R 1,t 1 R 2,t 2 Camera 3 R 3,t 3 Figure credit: Noah Snavely Structure rom motion? Camera 1 Camera 2 R 1,t 1 R 2,t 2 Camera 3 R 3,t 3 Structure:
More informationMultiple View Geometry. Frank Dellaert
Multiple View Geometry Frank Dellaert Outline Intro Camera Review Stereo triangulation Geometry of 2 views Essential Matrix Fundamental Matrix Estimating E/F from point-matches Why Consider Multiple Views?
More informationEpipolar Geometry and Stereo Vision
Epipolar Geometry and Stereo Vision Computer Vision Jia-Bin Huang, Virginia Tech Many slides from S. Seitz and D. Hoiem Last class: Image Stitching Two images with rotation/zoom but no translation. X x
More informationarxiv: v1 [cs.cv] 28 Sep 2018
Camera Pose Estimation from Sequence of Calibrated Images arxiv:1809.11066v1 [cs.cv] 28 Sep 2018 Jacek Komorowski 1 and Przemyslaw Rokita 2 1 Maria Curie-Sklodowska University, Institute of Computer Science,
More informationMulti-view geometry problems
Multi-view geometry Multi-view geometry problems Structure: Given projections o the same 3D point in two or more images, compute the 3D coordinates o that point? Camera 1 Camera 2 R 1,t 1 R 2,t 2 Camera
More informationWeek 2: Two-View Geometry. Padua Summer 08 Frank Dellaert
Week 2: Two-View Geometry Padua Summer 08 Frank Dellaert Mosaicking Outline 2D Transformation Hierarchy RANSAC Triangulation of 3D Points Cameras Triangulation via SVD Automatic Correspondence Essential
More information3D Computer Vision. Structure from Motion. Prof. Didier Stricker
3D Computer Vision Structure from Motion Prof. Didier Stricker Kaiserlautern University http://ags.cs.uni-kl.de/ DFKI Deutsches Forschungszentrum für Künstliche Intelligenz http://av.dfki.de 1 Structure
More informationAnnouncements. Stereo
Announcements Stereo Homework 2 is due today, 11:59 PM Homework 3 will be assigned today Reading: Chapter 7: Stereopsis CSE 152 Lecture 8 Binocular Stereopsis: Mars Given two images of a scene where relative
More informationMAPI Computer Vision. Multiple View Geometry
MAPI Computer Vision Multiple View Geometry Geometry o Multiple Views 2- and 3- view geometry p p Kpˆ [ K R t]p Geometry o Multiple Views 2- and 3- view geometry Epipolar Geometry The epipolar geometry
More informationUndergrad HTAs / TAs. Help me make the course better! HTA deadline today (! sorry) TA deadline March 21 st, opens March 15th
Undergrad HTAs / TAs Help me make the course better! HTA deadline today (! sorry) TA deadline March 2 st, opens March 5th Project 2 Well done. Open ended parts, lots of opportunity for mistakes. Real implementation
More informationEpipolar Geometry and Stereo Vision
Epipolar Geometry and Stereo Vision Computer Vision Shiv Ram Dubey, IIIT Sri City Many slides from S. Seitz and D. Hoiem Last class: Image Stitching Two images with rotation/zoom but no translation. X
More informationHomographies and RANSAC
Homographies and RANSAC Computer vision 6.869 Bill Freeman and Antonio Torralba March 30, 2011 Homographies and RANSAC Homographies RANSAC Building panoramas Phototourism 2 Depth-based ambiguity of position
More informationAnnouncements. Stereo
Announcements Stereo Homework 1 is due today, 11:59 PM Homework 2 will be assigned on Thursday Reading: Chapter 7: Stereopsis CSE 252A Lecture 8 Binocular Stereopsis: Mars Given two images of a scene where
More informationMachine vision. Summary # 11: Stereo vision and epipolar geometry. u l = λx. v l = λy
1 Machine vision Summary # 11: Stereo vision and epipolar geometry STEREO VISION The goal of stereo vision is to use two cameras to capture 3D scenes. There are two important problems in stereo vision:
More informationCOMPARATIVE STUDY OF DIFFERENT APPROACHES FOR EFFICIENT RECTIFICATION UNDER GENERAL MOTION
COMPARATIVE STUDY OF DIFFERENT APPROACHES FOR EFFICIENT RECTIFICATION UNDER GENERAL MOTION Mr.V.SRINIVASA RAO 1 Prof.A.SATYA KALYAN 2 DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING PRASAD V POTLURI SIDDHARTHA
More informationModel Fitting, RANSAC. Jana Kosecka
Model Fitting, RANSAC Jana Kosecka Fitting: Overview If we know which points belong to the line, how do we find the optimal line parameters? Least squares What if there are outliers? Robust fitting, RANSAC
More informationEpipolar Geometry Prof. D. Stricker. With slides from A. Zisserman, S. Lazebnik, Seitz
Epipolar Geometry Prof. D. Stricker With slides from A. Zisserman, S. Lazebnik, Seitz 1 Outline 1. Short introduction: points and lines 2. Two views geometry: Epipolar geometry Relation point/line in two
More informationLecture 9: Epipolar Geometry
Lecture 9: Epipolar Geometry Professor Fei Fei Li Stanford Vision Lab 1 What we will learn today? Why is stereo useful? Epipolar constraints Essential and fundamental matrix Estimating F (Problem Set 2
More informationThe Projective Vision Toolkit
The Projective Vision Toolkit ANTHONY WHITEHEAD School of Computer Science Carleton University, Ottawa, Canada awhitehe@scs.carleton.ca Abstract: Projective vision research has recently received a lot
More informationCSE 252B: Computer Vision II
CSE 252B: Computer Vision II Lecturer: Serge Belongie Scribes: Jeremy Pollock and Neil Alldrin LECTURE 14 Robust Feature Matching 14.1. Introduction Last lecture we learned how to find interest points
More informationStereo Vision. MAN-522 Computer Vision
Stereo Vision MAN-522 Computer Vision What is the goal of stereo vision? The recovery of the 3D structure of a scene using two or more images of the 3D scene, each acquired from a different viewpoint in
More informationEpipolar Geometry and the Essential Matrix
Epipolar Geometry and the Essential Matrix Carlo Tomasi The epipolar geometry of a pair of cameras expresses the fundamental relationship between any two corresponding points in the two image planes, and
More informationCamera Geometry II. COS 429 Princeton University
Camera Geometry II COS 429 Princeton University Outline Projective geometry Vanishing points Application: camera calibration Application: single-view metrology Epipolar geometry Application: stereo correspondence
More informationEpipolar Geometry Based On Line Similarity
2016 23rd International Conference on Pattern Recognition (ICPR) Cancún Center, Cancún, México, December 4-8, 2016 Epipolar Geometry Based On Line Similarity Gil Ben-Artzi Tavi Halperin Michael Werman
More informationComputer Vision I. Announcements. Random Dot Stereograms. Stereo III. CSE252A Lecture 16
Announcements Stereo III CSE252A Lecture 16 HW1 being returned HW3 assigned and due date extended until 11/27/12 No office hours today No class on Thursday 12/6 Extra class on Tuesday 12/4 at 6:30PM in
More informationCatadioptric camera model with conic mirror
LÓPEZ-NICOLÁS, SAGÜÉS: CATADIOPTRIC CAMERA MODEL WITH CONIC MIRROR Catadioptric camera model with conic mirror G. López-Nicolás gonlopez@unizar.es C. Sagüés csagues@unizar.es Instituto de Investigación
More informationStereo CSE 576. Ali Farhadi. Several slides from Larry Zitnick and Steve Seitz
Stereo CSE 576 Ali Farhadi Several slides from Larry Zitnick and Steve Seitz Why do we perceive depth? What do humans use as depth cues? Motion Convergence When watching an object close to us, our eyes
More informationarxiv: v4 [cs.cv] 8 Jan 2017
Epipolar Geometry Based On Line Similarity Gil Ben-Artzi Tavi Halperin Michael Werman Shmuel Peleg School of Computer Science and Engineering The Hebrew University of Jerusalem, Israel arxiv:1604.04848v4
More informationFast Outlier Rejection by Using Parallax-Based Rigidity Constraint for Epipolar Geometry Estimation
Fast Outlier Rejection by Using Parallax-Based Rigidity Constraint for Epipolar Geometry Estimation Engin Tola 1 and A. Aydın Alatan 2 1 Computer Vision Laboratory, Ecóle Polytechnique Fédéral de Lausanne
More informationMulti-View Geometry Part II (Ch7 New book. Ch 10/11 old book)
Multi-View Geometry Part II (Ch7 New book. Ch 10/11 old book) Guido Gerig CS-GY 6643, Spring 2016 gerig@nyu.edu Credits: M. Shah, UCF CAP5415, lecture 23 http://www.cs.ucf.edu/courses/cap6411/cap5415/,
More informationComputer Vision I. Announcement. Stereo Vision Outline. Stereo II. CSE252A Lecture 15
Announcement Stereo II CSE252A Lecture 15 HW3 assigned No class on Thursday 12/6 Extra class on Tuesday 12/4 at 6:30PM in WLH Room 2112 Mars Exploratory Rovers: Spirit and Opportunity Stereo Vision Outline
More informationEECS 442: Final Project
EECS 442: Final Project Structure From Motion Kevin Choi Robotics Ismail El Houcheimi Robotics Yih-Jye Jeffrey Hsu Robotics Abstract In this paper, we summarize the method, and results of our projective
More informationStep-by-Step Model Buidling
Step-by-Step Model Buidling Review Feature selection Feature selection Feature correspondence Camera Calibration Euclidean Reconstruction Landing Augmented Reality Vision Based Control Sparse Structure
More informationLast lecture. Passive Stereo Spacetime Stereo
Last lecture Passive Stereo Spacetime Stereo Today Structure from Motion: Given pixel correspondences, how to compute 3D structure and camera motion? Slides stolen from Prof Yungyu Chuang Epipolar geometry
More informationComputer Vision I - Robust Geometry Estimation from two Cameras
Computer Vision I - Robust Geometry Estimation from two Cameras Carsten Rother 16/01/2015 Computer Vision I: Image Formation Process FYI Computer Vision I: Image Formation Process 16/01/2015 2 Microsoft
More informationInstance-level recognition part 2
Visual Recognition and Machine Learning Summer School Paris 2011 Instance-level recognition part 2 Josef Sivic http://www.di.ens.fr/~josef INRIA, WILLOW, ENS/INRIA/CNRS UMR 8548 Laboratoire d Informatique,
More informationCS 664 Image Matching and Robust Fitting. Daniel Huttenlocher
CS 664 Image Matching and Robust Fitting Daniel Huttenlocher Matching and Fitting Recognition and matching are closely related to fitting problems Parametric fitting can serve as more restricted domain
More informationFitting. Fitting. Slides S. Lazebnik Harris Corners Pkwy, Charlotte, NC
Fitting We ve learned how to detect edges, corners, blobs. Now what? We would like to form a higher-level, more compact representation of the features in the image by grouping multiple features according
More informationCS664 Lecture #19: Layers, RANSAC, panoramas, epipolar geometry
CS664 Lecture #19: Layers, RANSAC, panoramas, epipolar geometry Some material taken from: David Lowe, UBC Jiri Matas, CMP Prague http://cmp.felk.cvut.cz/~matas/papers/presentations/matas_beyondransac_cvprac05.ppt
More informationAn Evaluation of the Performance of RANSAC Algorithms for Stereo Camera Calibration
Tina Memo No. 2000-009 Presented at BMVC 2000 An Evaluation of the Performance of RANSAC Algorithms for Stereo Camera Calibration A. J. Lacey, N. Pinitkarn and N. A. Thacker Last updated 21 / 02 / 2002
More informationEpipolar Geometry CSE P576. Dr. Matthew Brown
Epipolar Geometry CSE P576 Dr. Matthew Brown Epipolar Geometry Epipolar Lines, Plane Constraint Fundamental Matrix, Linear solution + RANSAC Applications: Structure from Motion, Stereo [ Szeliski 11] 2
More informationFast and Reliable Two-View Translation Estimation
Fast and Reliable Two-View Translation Estimation Johan Fredriksson 1 1 Centre for Mathematical Sciences Lund University, Sweden johanf@maths.lth.se Olof Enqvist 2 Fredrik Kahl 1,2 2 Department of Signals
More informationROBUST LINE-BASED CALIBRATION OF LENS DISTORTION FROM A SINGLE VIEW
ROBUST LINE-BASED CALIBRATION OF LENS DISTORTION FROM A SINGLE VIEW Thorsten Thormählen, Hellward Broszio, Ingolf Wassermann thormae@tnt.uni-hannover.de University of Hannover, Information Technology Laboratory,
More informationMultiple View Geometry
Multiple View Geometry CS 6320, Spring 2013 Guest Lecture Marcel Prastawa adapted from Pollefeys, Shah, and Zisserman Single view computer vision Projective actions of cameras Camera callibration Photometric
More informationVisual Odometry for Non-Overlapping Views Using Second-Order Cone Programming
Visual Odometry for Non-Overlapping Views Using Second-Order Cone Programming Jae-Hak Kim 1, Richard Hartley 1, Jan-Michael Frahm 2 and Marc Pollefeys 2 1 Research School of Information Sciences and Engineering
More information3D Reconstruction from Two Views
3D Reconstruction from Two Views Huy Bui UIUC huybui1@illinois.edu Yiyi Huang UIUC huang85@illinois.edu Abstract In this project, we study a method to reconstruct a 3D scene from two views. First, we extract
More informationRANSAC and some HOUGH transform
RANSAC and some HOUGH transform Thank you for the slides. They come mostly from the following source Dan Huttenlocher Cornell U Matching and Fitting Recognition and matching are closely related to fitting
More informationStructure from Motion. Introduction to Computer Vision CSE 152 Lecture 10
Structure from Motion CSE 152 Lecture 10 Announcements Homework 3 is due May 9, 11:59 PM Reading: Chapter 8: Structure from Motion Optional: Multiple View Geometry in Computer Vision, 2nd edition, Hartley
More informationFlexible Calibration of a Portable Structured Light System through Surface Plane
Vol. 34, No. 11 ACTA AUTOMATICA SINICA November, 2008 Flexible Calibration of a Portable Structured Light System through Surface Plane GAO Wei 1 WANG Liang 1 HU Zhan-Yi 1 Abstract For a portable structured
More informationRecovering structure from a single view Pinhole perspective projection
EPIPOLAR GEOMETRY The slides are from several sources through James Hays (Brown); Silvio Savarese (U. of Michigan); Svetlana Lazebnik (U. Illinois); Bill Freeman and Antonio Torralba (MIT), including their
More informationToday. Stereo (two view) reconstruction. Multiview geometry. Today. Multiview geometry. Computational Photography
Computational Photography Matthias Zwicker University of Bern Fall 2009 Today From 2D to 3D using multiple views Introduction Geometry of two views Stereo matching Other applications Multiview geometry
More informationRANSAC: RANdom Sampling And Consensus
CS231-M RANSAC: RANdom Sampling And Consensus Roland Angst rangst@stanford.edu www.stanford.edu/~rangst CS231-M 2014-04-30 1 The Need for RANSAC Why do I need RANSAC? I know robust statistics! Robust Statistics
More informationA Rapid Automatic Image Registration Method Based on Improved SIFT
Available online at www.sciencedirect.com Procedia Environmental Sciences 11 (2011) 85 91 A Rapid Automatic Image Registration Method Based on Improved SIFT Zhu Hongbo, Xu Xuejun, Wang Jing, Chen Xuesong,
More informationCS201 Computer Vision Camera Geometry
CS201 Computer Vision Camera Geometry John Magee 25 November, 2014 Slides Courtesy of: Diane H. Theriault (deht@bu.edu) Question of the Day: How can we represent the relationships between cameras and the
More informationDr. Ulas Bagci
CAP5415-Computer Vision Lecture 17-Fundamental Matrix Dr. Ulas Bagci bagci@ucf.edu 1 Reminders PA#4 is due on 22 nd October (extended to next Monday) PA#5 is due on 5 th of November (no extension). Mini-project
More information55:148 Digital Image Processing Chapter 11 3D Vision, Geometry
55:148 Digital Image Processing Chapter 11 3D Vision, Geometry Topics: Basics of projective geometry Points and hyperplanes in projective space Homography Estimating homography from point correspondence
More informationarxiv: v1 [cs.cv] 18 Sep 2017
Direct Pose Estimation with a Monocular Camera Darius Burschka and Elmar Mair arxiv:1709.05815v1 [cs.cv] 18 Sep 2017 Department of Informatics Technische Universität München, Germany {burschka elmar.mair}@mytum.de
More informationFinal project bits and pieces
Final project bits and pieces The project is expected to take four weeks of time for up to four people. At 12 hours per week per person that comes out to: ~192 hours of work for a four person team. Capstone:
More informationRANSAC RANdom SAmple Consensus
Talk Outline importance for computer vision principle line fitting epipolar geometry estimation RANSAC RANdom SAmple Consensus Tomáš Svoboda, svoboda@cmp.felk.cvut.cz courtesy of Ondřej Chum, Jiří Matas
More informationcalibrated coordinates Linear transformation pixel coordinates
1 calibrated coordinates Linear transformation pixel coordinates 2 Calibration with a rig Uncalibrated epipolar geometry Ambiguities in image formation Stratified reconstruction Autocalibration with partial
More informationRobust line matching in image pairs of scenes with dominant planes 1
DIIS - IA Universidad de Zaragoza C/ María de Luna num. E-00 Zaragoza Spain Internal Report: 00-V Robust line matching in image pairs of scenes with dominant planes C. Sagüés, J.J. Guerrero If you want
More informationCS231A Course Notes 4: Stereo Systems and Structure from Motion
CS231A Course Notes 4: Stereo Systems and Structure from Motion Kenji Hata and Silvio Savarese 1 Introduction In the previous notes, we covered how adding additional viewpoints of a scene can greatly enhance
More informationMultiple View Geometry in Computer Vision
Multiple View Geometry in Computer Vision Prasanna Sahoo Department of Mathematics University of Louisville 1 Structure Computation Lecture 18 March 22, 2005 2 3D Reconstruction The goal of 3D reconstruction
More informationMultiple Views Geometry
Multiple Views Geometry Subhashis Banerjee Dept. Computer Science and Engineering IIT Delhi email: suban@cse.iitd.ac.in January 2, 28 Epipolar geometry Fundamental geometric relationship between two perspective
More informationA novel point matching method for stereovision measurement using RANSAC affine transformation
A novel point matching method for stereovision measurement using RANSAC affine transformation Naiguang Lu, Peng Sun, Wenyi Deng, Lianqing Zhu, Xiaoping Lou School of Optoelectronic Information & Telecommunication
More informationObservations. Basic iteration Line estimated from 2 inliers
Line estimated from 2 inliers 3 Observations We need (in this case!) a minimum of 2 points to determine a line Given such a line l, we can determine how well any other point y fits the line l For example:
More informationA System of Image Matching and 3D Reconstruction
A System of Image Matching and 3D Reconstruction CS231A Project Report 1. Introduction Xianfeng Rui Given thousands of unordered images of photos with a variety of scenes in your gallery, you will find
More informationEstimate Geometric Transformation
1 of 9 15/12/2009 11:05 Estimate Geometric Transformation Estimate geometric transformation from matching point pairs Library Geometric Transformations Description Use the Estimate Geometric Transformation
More informationImage correspondences and structure from motion
Image correspondences and structure from motion http://graphics.cs.cmu.edu/courses/15-463 15-463, 15-663, 15-862 Computational Photography Fall 2017, Lecture 20 Course announcements Homework 5 posted.
More informationComments on Consistent Depth Maps Recovery from a Video Sequence
Comments on Consistent Depth Maps Recovery from a Video Sequence N.P. van der Aa D.S. Grootendorst B.F. Böggemann R.T. Tan Technical Report UU-CS-2011-014 May 2011 Department of Information and Computing
More informationInstance-level recognition II.
Reconnaissance d objets et vision artificielle 2010 Instance-level recognition II. Josef Sivic http://www.di.ens.fr/~josef INRIA, WILLOW, ENS/INRIA/CNRS UMR 8548 Laboratoire d Informatique, Ecole Normale
More informationOctree-Based Obstacle Representation and Registration for Real-Time
Octree-Based Obstacle Representation and Registration for Real-Time Jaewoong Kim, Daesik Kim, Junghyun Seo, Sukhan Lee and Yeonchool Park* Intelligent System Research Center (ISRC) & Nano and Intelligent
More informationImage Features: Local Descriptors. Sanja Fidler CSC420: Intro to Image Understanding 1/ 58
Image Features: Local Descriptors Sanja Fidler CSC420: Intro to Image Understanding 1/ 58 [Source: K. Grauman] Sanja Fidler CSC420: Intro to Image Understanding 2/ 58 Local Features Detection: Identify
More informationCamera Model and Calibration
Camera Model and Calibration Lecture-10 Camera Calibration Determine extrinsic and intrinsic parameters of camera Extrinsic 3D location and orientation of camera Intrinsic Focal length The size of the
More informationCombining Appearance and Topology for Wide
Combining Appearance and Topology for Wide Baseline Matching Dennis Tell and Stefan Carlsson Presented by: Josh Wills Image Point Correspondences Critical foundation for many vision applications 3-D reconstruction,
More informationGeometry of Multiple views
1 Geometry of Multiple views CS 554 Computer Vision Pinar Duygulu Bilkent University 2 Multiple views Despite the wealth of information contained in a a photograph, the depth of a scene point along the
More informationMinimal Projective Reconstruction for Combinations of Points and Lines in Three Views
Minimal Projective Reconstruction for Combinations of Points and Lines in Three Views Magnus Oskarsson, Andrew Zisserman and Kalle Åström Centre for Mathematical Sciences Lund University,SE 221 00 Lund,
More informationThe end of affine cameras
The end of affine cameras Affine SFM revisited Epipolar geometry Two-view structure from motion Multi-view structure from motion Planches : http://www.di.ens.fr/~ponce/geomvis/lect3.pptx http://www.di.ens.fr/~ponce/geomvis/lect3.pdf
More informationCalculation of the fundamental matrix
D reconstruction alculation of the fundamental matrix Given a set of point correspondences x i x i we wish to reconstruct the world points X i and the cameras P, P such that x i = PX i, x i = P X i, i
More informationBut First: Multi-View Projective Geometry
View Morphing (Seitz & Dyer, SIGGRAPH 96) Virtual Camera Photograph Morphed View View interpolation (ala McMillan) but no depth no camera information Photograph But First: Multi-View Projective Geometry
More informationContents. 1 Introduction Background Organization Features... 7
Contents 1 Introduction... 1 1.1 Background.... 1 1.2 Organization... 2 1.3 Features... 7 Part I Fundamental Algorithms for Computer Vision 2 Ellipse Fitting... 11 2.1 Representation of Ellipses.... 11
More informationPreprocessing of Stream Data using Attribute Selection based on Survival of the Fittest
Preprocessing of Stream Data using Attribute Selection based on Survival of the Fittest Bhakti V. Gavali 1, Prof. Vivekanand Reddy 2 1 Department of Computer Science and Engineering, Visvesvaraya Technological
More informationComputing the relations among three views based on artificial neural network
Computing the relations among three views based on artificial neural network Ying Kin Yu Kin Hong Wong Siu Hang Or Department of Computer Science and Engineering The Chinese University of Hong Kong E-mail:
More informationFitting. Instructor: Jason Corso (jjcorso)! web.eecs.umich.edu/~jjcorso/t/598f14!! EECS Fall 2014! Foundations of Computer Vision!
Fitting EECS 598-08 Fall 2014! Foundations of Computer Vision!! Instructor: Jason Corso (jjcorso)! web.eecs.umich.edu/~jjcorso/t/598f14!! Readings: FP 10; SZ 4.3, 5.1! Date: 10/8/14!! Materials on these
More informationComputer Vision Lecture 17
Computer Vision Lecture 17 Epipolar Geometry & Stereo Basics 13.01.2015 Bastian Leibe RWTH Aachen http://www.vision.rwth-aachen.de leibe@vision.rwth-aachen.de Announcements Seminar in the summer semester
More informationThe Geometry of Dynamic Scenes On Coplanar and Convergent Linear Motions Embedded in 3D Static Scenes
EXTENDED VERSION SHORT VERSION APPEARED IN THE 13TH BMVC, CARDIFF, SEPTEMBER 2002. The Geometry of Dynamic Scenes On Coplanar and Convergent Linear Motions Embedded in 3D Static Scenes Adrien Bartoli,
More informationComputer Vision Lecture 17
Announcements Computer Vision Lecture 17 Epipolar Geometry & Stereo Basics Seminar in the summer semester Current Topics in Computer Vision and Machine Learning Block seminar, presentations in 1 st week
More informationGenetic Algorithms. Kang Zheng Karl Schober
Genetic Algorithms Kang Zheng Karl Schober Genetic algorithm What is Genetic algorithm? A genetic algorithm (or GA) is a search technique used in computing to find true or approximate solutions to optimization
More informationSummary Page Robust 6DOF Motion Estimation for Non-Overlapping, Multi-Camera Systems
Summary Page Robust 6DOF Motion Estimation for Non-Overlapping, Multi-Camera Systems Is this a system paper or a regular paper? This is a regular paper. What is the main contribution in terms of theory,
More informationCS 664 Slides #9 Multi-Camera Geometry. Prof. Dan Huttenlocher Fall 2003
CS 664 Slides #9 Multi-Camera Geometry Prof. Dan Huttenlocher Fall 2003 Pinhole Camera Geometric model of camera projection Image plane I, which rays intersect Camera center C, through which all rays pass
More informationMulti-stable Perception. Necker Cube
Multi-stable Perception Necker Cube Spinning dancer illusion, Nobuyuki Kayahara Multiple view geometry Stereo vision Epipolar geometry Lowe Hartley and Zisserman Depth map extraction Essential matrix
More informationLecture 4. Convexity Robust cost functions Optimizing non-convex functions. 3B1B Optimization Michaelmas 2017 A. Zisserman
Lecture 4 3B1B Optimization Michaelmas 2017 A. Zisserman Convexity Robust cost functions Optimizing non-convex functions grid search branch and bound simulated annealing evolutionary optimization The Optimization
More informationGENETIC ALGORITHM with Hands-On exercise
GENETIC ALGORITHM with Hands-On exercise Adopted From Lecture by Michael Negnevitsky, Electrical Engineering & Computer Science University of Tasmania 1 Objective To understand the processes ie. GAs Basic
More informationWelfare Navigation Using Genetic Algorithm
Welfare Navigation Using Genetic Algorithm David Erukhimovich and Yoel Zeldes Hebrew University of Jerusalem AI course final project Abstract Using standard navigation algorithms and applications (such
More information