Two View Geometry Part 2 Fundamental Matrix Computation

Size: px
Start display at page:

Download "Two View Geometry Part 2 Fundamental Matrix Computation"

Transcription

1 3D Computer Visio II Two View Geometr Part Fudametal Matri Computatio Nassir Navab based o a course give at UNC b Marc Pollefes & the book Multiple View Geometr b Hartle & Zisserma November 9, 009

2 Outlie Two-View Geometr Epipolar Geometr Fudametal Matri Computatio 3D Recostructio 3D Computer Visio II - Two View Geometr

3 Remider Three Questios (i) Correspodece geometr: Give a image poit i the first image, how does this costrai the positio of the correspodig poit i the secod image? (ii) Camera geometr (motio): Give a set of correspodig image poits { i i }, i=,,, what are the cameras P ad P for the two views? (iii) Scee geometr (structure): Give correspodig image poits i i ad cameras P, P, what is the positio of (their pre-image) X i space? 3D Computer Visio II - Two View Geometr 3

4 The Fudametal Matri F Algebraic represetatio of Epipolar Geometr: l' We will see that mappig is (sigular) correlatio (i.e. projective mappig from poits to lies) represeted b the fudametal matri F. 3D Computer Visio II - Two View Geometr 4

5 Poits From Lies ad Vice-versa Itersectios of lies The itersectio of two lies l ad l' is ll' [ l] l' [ l' ] l Lie joiig two poits The lie through two poits ad ' is l ' [] ' [' ] Ati-smmetric Matri Eample [ l] 0 l 3 l 0 l l 3 l l 0 3D Computer Visio II - Two View Geometr 5

6 The Fudametal Matri F Geometric Derivatio ' H π l' e' ' e' Hπ F mappig from -D to -D famil (rak ) 3D Computer Visio II - Two View Geometr 6

7 The Fudametal Matri F Algebraic derivatio: X λ ( λ)c λp P P I l P'C P' P P Xλ F e' P' P (ote: does t work for C=C F=0) 3D Computer Visio II - Two View Geometr 7

8 The Fudametal Matri F Correspodece coditio: The fudametal matri satisfies the coditio that for a pair of correspodig poits i the two images: ' T F 0 ' T l' 0 3D Computer Visio II - Two View Geometr 8

9 The Fudametal Matri F F is the uique 33 rak matri that satisfies T F=0 for all. (i) Traspose: if F is fudametal matri for (P,P ), the F T is fudametal matri for (P,P) (ii) Epipolar lies: l =F & l=f T (iii) Epipoles: o all epipolar lies, thus e T F=0, e T F=0, similarl Fe=0 (iv) F has 7 d.o.f., i.e. 33-(homogeeous)-(rak) (v) F is a correlatio, projective mappig from a poit to a lie l =F (ot a proper correlatio, i.e. ot ivertible) 3D Computer Visio II - Two View Geometr 9

10 Epipolar Geometr l e p l T T P P l π P T l C m l M L L T l 0 e T T T P P [e] 0 e m l C

11 Epipolar Geometr Caoical represetatio: P [I 0] P' [[e' ] F e' v T λe' ]. Computable from correspodig poits. Simplifies matchig 3. Allows to detect wrog matches 4. Related to calibratio 3D Computer Visio II - Two View Geometr

12 Epipolar Geometr Basic Equatios ' T F 0 ' f ' f ' f3 ' f ' f ' f3 f3 f3 f separate kows from ukows: T ', ', ', ', ', ',,, f, f, f, f, f, f, f, f, f (data) (ukows) (liear) 3D Computer Visio II - Two View Geometr 3

13 Af 0 0 f ' ' ' ' ' ' ' ' ' ' ' ' Epipolar Geometr Basic Equatios 4 3D Computer Visio II - Two View Geometr

14 0 F e' T 0 Fe 0 detf F rak T T T T 3 V U σ V σ U V U σ V σ σ σ U F SVD from liearl computed F matri (rak 3) T T T V σ U V U σ V 0 σ σ U F' F F- F' mi Compute closest rak- approimatio The Sigularit Costrait 5 3D Computer Visio II - Two View Geometr

15 The Sigularit Costrait No sigular F Forcig sigularit usig the SVD method 3D Computer Visio II - Two View Geometr 6

16 0 f ' ' ' ' ' ' ' ' ' ' ' ' T V,0,0,...,σ σ diag A U V ] A[V...7 0, λf ) (F T i i i Oe parameter famil of solutios But F +lf ot automaticall rak The Miimum Case 7 Poit Correspodeces 7 3D Computer Visio II - Two View Geometr

17 The Miimum Case Impose Rak 3 (obtai or 3 solutios) F 7pts F F F 3 det( F λf ) a3λ aλ aλ a0 0 (cubic equatio) Oe or three solutios (ol real solutios are acceptable) 3D Computer Visio II - Two View Geometr 8

18 f f f f f f f f f The 8-Poit Algorithm 9 3D Computer Visio II - Two View Geometr

19 f f f f f f f f f ~0000 ~0000 ~0000 ~0000 ~00 ~00 ~00 ~00! Orders of magitude differece betwee colums of data matri least-squares ields poor results The Uormalized 8-Poit Algorithm 0 3D Computer Visio II - Two View Geometr

20 The Normalized 8-Poit Algorithm Trasform image to ~[-,][-,] (0,500) (700,500) (-,) (0,0) (,) (0,0) (700,0) (-,-) (,-) Least squares ields good results (Hartle, PAMI97) 3D Computer Visio II - Two View Geometr

21 Smmetric Epipolar Error i d F d T ',,F ' i i T (' F) T T ' F F F ' F i i 3D Computer Visio II - Two View Geometr 4

22 Gold Stadard Maimum Likelihood Estimatio (= least-squares for Gaussia oise) i d, ˆ d', ˆ' i i i i subject to ˆ' T Fˆ 0 Iitialize: ormalized 8-poit, (P,P ) from F, recostruct X i Parameterize: P [I 0], P' [M t], ˆ i PX, ˆ i i P' X i X i Miimize cost usig Leveberg-Marquardt (preferabl sparse LM, see book) (overparametrized) 3D Computer Visio II - Two View Geometr 5

23 Gold Stadard Alterative, miimal parametrizatio (with a=) a b a b F c d c d a' c' b' d' F 33 where F ( a b) ' ( c d) ' 33 problems: a=0 pick largest of a,b,c,d to fi (ote (,,) ad (,,) are epipoles) epipole at ifiit pick largest of,,w ad of,,w 433=36 parametrizatios! reparametrize at ever iteratio, to be sure 3D Computer Visio II - Two View Geometr 6

24 First-order Geometric Error (Sampso Error) e T JJ T e e ' T F T e e JJ T 0 e i (oe eq./poit JJ T scalar) ' T F0 0 JJ T T T ' F ' F F F T e e JJ T T T ' F ' F F F (' T F) (problem if some is located at epipole) advatage: o subsidiar variables required 3D Computer Visio II - Two View Geometr 7

25 Recommedatios Do ot use uormalized algorithms Quick ad eas to implemet: 8-poit ormalized Better: eforce rak- costrait durig miimizatio Best: Maimum Likelihood Estimatio (miimal parameterizatio, sparse implemetatio) 3D Computer Visio II - Two View Geometr 3

26 Special Case Eforce costraits for optimal results: Pure traslatio (dof): F [e' ] Plaar motio (6dof), Calibrated case (5dof) 3D Computer Visio II - Two View Geometr 33

27 The Evelope of Epipolar Lies What happes to a epipolar lie if there is oise? Mote Carlo 3D Computer Visio II - Two View Geometr =0 =5 =5 =50 34

28 Other Etities Lies give o costrait for two view geometr (but will for three ad more views) Curves ad surfaces ield some costraits related to tagec 3D Computer Visio II - Two View Geometr 35

29 Automatic Computatio of F (i) Iterest poits (ii) Putative correspodeces (iii) RANSAC (iv) No-liear re-estimatio of F (v) Guided matchig Repeat (iv) ad (v) util stable 3D Computer Visio II - Two View Geometr 36

30 Feature Poits Etract feature poits to relate images Required properties: Well-defied (i.e. eigborig poits should all be differet) Stable across views (i.e. same 3D poit should be etracted as feature for eighborig viewpoits) 3D Computer Visio II - Two View Geometr 37

31 Feature Poits (e.g. Harris & Stephes 88; Shi & Tomasi 94) Fid poits that differ as much as possible from all eighborig poits homogeeous edge corer 3D Computer Visio II - Two View Geometr 38

32 Feature Poits Select strogest features (e.g. 000/image) 3D Computer Visio II - Two View Geometr 39

33 Feature Matchig Evaluate NCC for all features with similar coordiates e.g. w w,, h h 0 0 0, 0 Keep mutual best matches Still ma wrog matches!? 3D Computer Visio II - Two View Geometr 40

34 Feature Eample Gives satisfig results for small image motios 3D Computer Visio II - Two View Geometr 4

35 Wide-baselie Matchig Requiremet to cope with larger variatios betwee images Traslatio, rotatio, scalig Foreshorteig No-diffuse reflectios Illumiatio geometric trasformatios photometric chages 3D Computer Visio II - Two View Geometr 4

36 Wide-baselie Matchig (Tutelaars ad Va Gool BMVC 000) Wide baselie matchig for two differet regio tpes 3D Computer Visio II - Two View Geometr 43

37 RANSAC Step. Etract features Step. Compute a set of potetial matches Step 3. do Step 3. select miimal sample (i.e. 7 matches) Step 3. compute solutio(s) for F Step 3.3 determie iliers util (#iliers,#samples)<95% geerate hpothesis verif hpothesis Step 4. Compute F based o all iliers Step 5. Look for additioal matches Step 6. Refie F based o all correct matches ( #iliers 7 # samples ) #matches #iliers 90% 80% 70% 60% 50% #samples D Computer Visio II - Two View Geometr 44

38 Fidig More Matches Restrict search rage to eighborhood of epipolar lie (.5 piels) Rela disparit restrictio (alog epipolar lie) 3D Computer Visio II - Two View Geometr 45

39 Degeerate Cases Degeerate cases Plaar scee Pure rotatio No uique solutio Remaiig DOF filled b oise Use simpler model (e.g. homograph) Model selectio (Torr et al., ICCV98, Kaatai, Akaike) Compare H ad F accordig to epected residual error (compesate for model compleit) 3D Computer Visio II - Two View Geometr 46

40 More Problems Absece of sufficiet features (o teture) Repeated structure ambiguit Robust matcher also fids support for wrog hpothesis Solutio: detect repetitio (Schaffalitzk ad Zisserma, BMVC 98) 3D Computer Visio II - Two View Geometr 47

41 Two-view Geometr Geometric relatios betwee two views are full described b recovered 33 matri F. 3D Computer Visio II - Two View Geometr 48

42 Image Rectificatio Simplif stereo matchig b warpig the images. Appl projective trasformatio so that epipolar lies correspod to horizotal scalies e e 0 0 He map epipole e to ifiit (,0,0) tr to miimize image distortio problem whe epipole i (or close to) the image 3D Computer Visio II - Two View Geometr 49

43 Plaar Rectificatio (stadard approach) ~ image size (calibrated) Brig two views to stadard stereo setup (moves epipole to ) (ot possible whe i/close to image) Distortio miimizatio (ucalibrated) 3D Computer Visio II - Two View Geometr 50

44 3D Computer Visio II - Two View Geometr 5

45 5

46 Disparit Map image I(,) Disparit map D(,) image I(,) (,)=(+D(,),) 3D Computer Visio II - Two View Geometr 65

47 Dowsamplig (Gaussia pramid) Disparit propagatio Hierarchical Stereo Matchig Allows faster computatio Deals with large disparit rages (Falkehage97;Va Meerberge,Vergauwe,Pollefes,VaGool IJCV 0) 3D Computer Visio II - Two View Geometr 66

48 Eample: Recostruct Image from Neighborig Images 3D Computer Visio II - Two View Geometr 67

Computing F class 13. Multiple View Geometry. Comp Marc Pollefeys

Computing F class 13. Multiple View Geometry. Comp Marc Pollefeys Computing F class 3 Multiple View Geometr Comp 90-089 Marc Pollefes Multiple View Geometr course schedule (subject to change) Jan. 7, 9 Intro & motivation Projective D Geometr Jan. 4, 6 (no class) Projective

More information

Structure from motion

Structure from motion Structure from motio Digital Visual Effects Yug-Yu Chuag with slides by Richard Szeliski, Steve Seitz, Zhegyou Zhag ad Marc Pollefyes Outlie Epipolar geometry ad fudametal matrix Structure from motio Factorizatio

More information

3D Photography: Epipolar geometry

3D Photography: Epipolar geometry 3D Photograph: Epipolar geometr Kalin Kolev, Marc Pollefes Spring 203 http://cvg.ethz.ch/teaching/203spring/3dphoto/ Schedule (tentative) Feb 8 Feb 25 Mar 4 Mar Mar 8 Mar 25 Apr Apr 8 Apr 5 Apr 22 Apr

More information

EECS 442 Computer vision. Multiple view geometry Affine structure from Motion

EECS 442 Computer vision. Multiple view geometry Affine structure from Motion EECS 442 Computer visio Multiple view geometry Affie structure from Motio - Affie structure from motio problem - Algebraic methods - Factorizatio methods Readig: [HZ] Chapters: 6,4,8 [FP] Chapter: 2 Some

More information

EECS 442 Computer vision. Multiple view geometry Affine structure from Motion

EECS 442 Computer vision. Multiple view geometry Affine structure from Motion EECS 442 Computer visio Multiple view geometry Affie structure from Motio - Affie structure from motio problem - Algebraic methods - Factorizatio methods Readig: [HZ] Chapters: 6,4,8 [FP] Chapter: 2 Some

More information

Image Segmentation EEE 508

Image Segmentation EEE 508 Image Segmetatio Objective: to determie (etract) object boudaries. It is a process of partitioig a image ito distict regios by groupig together eighborig piels based o some predefied similarity criterio.

More information

A Selected Primer on Computer Vision: Geometric and Photometric Stereo & Structured Light

A Selected Primer on Computer Vision: Geometric and Photometric Stereo & Structured Light A Seected Primer o Computer Visio: Geometric ad Photometric Stereo & Structured Light CS334 Sprig 2012 Daie G. Aiaga Departmet of Computer Sciece Purdue Uiversit Defiitios Camera geometr (=motio) Give

More information

Structure from motion

Structure from motion Strctre from motio Digital Visal Effects, Sprig 2005 Yg-Y Chag 2005/4/20 with slides by Richard Szeliski, Stee Seitz, Zhegyo Zhag ad Marc Pollefyes Aocemets Project # wiig artifacts. I hae a Cao G2 for

More information

Vision par ordinateur

Vision 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 information

Light and shading. Source: A. Efros

Light and shading. Source: A. Efros Light ad shadig Source: A. Efros Image formatio What determies the brightess of a image piel? Sesor characteristics Light source properties Eposure Surface shape ad orietatio Optics Surface reflectace

More information

Pattern Recognition Systems Lab 1 Least Mean Squares

Pattern Recognition Systems Lab 1 Least Mean Squares Patter Recogitio Systems Lab 1 Least Mea Squares 1. Objectives This laboratory work itroduces the OpeCV-based framework used throughout the course. I this assigmet a lie is fitted to a set of poits usig

More information

Position Determination of a Robot End-Effector Using a 6D-Measurement System Based on the Two-View Vision

Position Determination of a Robot End-Effector Using a 6D-Measurement System Based on the Two-View Vision Ope Joural of Applied Scieces, 203, 3, 393-403 Published Olie November 203 (http://www.scirp.org/joural/ojapps) http://d.doi.org/0.4236/ojapps.203.37049 Positio Determiatio of a Robot Ed-Effector Usig

More information

MATHEMATICAL METHODS OF ANALYSIS AND EXPERIMENTAL DATA PROCESSING (Or Methods of Curve Fitting)

MATHEMATICAL METHODS OF ANALYSIS AND EXPERIMENTAL DATA PROCESSING (Or Methods of Curve Fitting) MATHEMATICAL METHODS OF ANALYSIS AND EXPERIMENTAL DATA PROCESSING (Or Methods of Curve Fittig) I this chapter, we will eamie some methods of aalysis ad data processig; data obtaied as a result of a give

More information

Eigenimages. Digital Image Processing: Bernd Girod, 2013 Stanford University -- Eigenimages 1

Eigenimages. Digital Image Processing: Bernd Girod, 2013 Stanford University -- Eigenimages 1 Eigeimages Uitary trasforms Karhue-Loève trasform ad eigeimages Sirovich ad Kirby method Eigefaces for geder recogitio Fisher liear discrimat aalysis Fisherimages ad varyig illumiatio Fisherfaces vs. eigefaces

More information

Dynamic Programming and Curve Fitting Based Road Boundary Detection

Dynamic Programming and Curve Fitting Based Road Boundary Detection Dyamic Programmig ad Curve Fittig Based Road Boudary Detectio SHYAM PRASAD ADHIKARI, HYONGSUK KIM, Divisio of Electroics ad Iformatio Egieerig Chobuk Natioal Uiversity 664-4 Ga Deokji-Dog Jeoju-City Jeobuk

More information

Image Analysis. Segmentation by Fitting a Model

Image Analysis. Segmentation by Fitting a Model Image Aalysis Segmetatio by Fittig a Model Christophoros Nikou cikou@cs.uoi.gr Images take from: D. Forsyth ad J. Poce. Computer Visio: A Moder Approach, Pretice Hall, 2003. Computer Visio course by Svetlaa

More information

Harris Corner Detection Algorithm at Sub-pixel Level and Its Application Yuanfeng Han a, Peijiang Chen b * and Tian Meng c

Harris Corner Detection Algorithm at Sub-pixel Level and Its Application Yuanfeng Han a, Peijiang Chen b * and Tian Meng c Iteratioal Coferece o Computatioal Sciece ad Egieerig (ICCSE 015) Harris Corer Detectio Algorithm at Sub-pixel Level ad Its Applicatio Yuafeg Ha a, Peijiag Che b * ad Tia Meg c School of Automobile, Liyi

More information

The Closest Line to a Data Set in the Plane. David Gurney Southeastern Louisiana University Hammond, Louisiana

The Closest Line to a Data Set in the Plane. David Gurney Southeastern Louisiana University Hammond, Louisiana The Closest Lie to a Data Set i the Plae David Gurey Southeaster Louisiaa Uiversity Hammod, Louisiaa ABSTRACT This paper looks at three differet measures of distace betwee a lie ad a data set i the plae:

More information

FINITE DIFFERENCE TIME DOMAIN METHOD (FDTD)

FINITE DIFFERENCE TIME DOMAIN METHOD (FDTD) FINIT DIFFRNC TIM DOMAIN MTOD (FDTD) The FDTD method, proposed b Yee, 1966, is aother umerical method, used widel for the solutio of M problems. It is used to solve ope-regio scatterig, radiatio, diffusio,

More information

Automated Relative Orientation of UAV-Based Imagery in the Presence of Prior Information for the Flight Trajectory

Automated Relative Orientation of UAV-Based Imagery in the Presence of Prior Information for the Flight Trajectory Automated Relative Orietatio of UAV-Based Imagery i the Presece of Prior Iformatio for the Flight rajectory Fagig He ad Ayma Habib Abstract UAV-based 3D recostructio has bee used i various applicatios.

More information

A Note on Least-norm Solution of Global WireWarping

A Note on Least-norm Solution of Global WireWarping A Note o Least-orm Solutio of Global WireWarpig Charlie C. L. Wag Departmet of Mechaical ad Automatio Egieerig The Chiese Uiversity of Hog Kog Shati, N.T., Hog Kog E-mail: cwag@mae.cuhk.edu.hk Abstract

More information

Implementation of Panoramic Image Mosaicing using Complex Wavelet Packets

Implementation of Panoramic Image Mosaicing using Complex Wavelet Packets Available olie www.eaet.com Europea Joural of Advaces i Egieerig ad Techology, 2015, 2(12): 25-31 Research Article ISSN: 2394-658X Implemetatio of Paoramic Image Mosaicig usig Complex Wavelet Packets 1

More information

Bezier curves. Figure 2 shows cubic Bezier curves for various control points. In a Bezier curve, only

Bezier curves. Figure 2 shows cubic Bezier curves for various control points. In a Bezier curve, only Edited: Yeh-Liag Hsu (998--; recommeded: Yeh-Liag Hsu (--9; last updated: Yeh-Liag Hsu (9--7. Note: This is the course material for ME55 Geometric modelig ad computer graphics, Yua Ze Uiversity. art of

More information

A camcorder for 3D underwater reconstruction of archeological objects

A camcorder for 3D underwater reconstruction of archeological objects A camcorder for 3D uderwater recostructio of archeological objects A. Melie 1, J. riboulet 1,2, ad B. Jouvecel 1 1 LIRMM, Uiversité de Motpellier 2 - CNRS UMR 556 161 rue Ada, 3495 Motpellier Cedex 5,

More information

Texture Mapping. Jian Huang. This set of slides references the ones used at Ohio State for instruction.

Texture Mapping. Jian Huang. This set of slides references the ones used at Ohio State for instruction. Texture Mappig Jia Huag This set of slides refereces the oes used at Ohio State for istructio. Ca you do this What Dreams May Come Texture Mappig Of course, oe ca model the exact micro-geometry + material

More information

A New Morphological 3D Shape Decomposition: Grayscale Interframe Interpolation Method

A New Morphological 3D Shape Decomposition: Grayscale Interframe Interpolation Method A ew Morphological 3D Shape Decompositio: Grayscale Iterframe Iterpolatio Method D.. Vizireau Politehica Uiversity Bucharest, Romaia ae@comm.pub.ro R. M. Udrea Politehica Uiversity Bucharest, Romaia mihea@comm.pub.ro

More information

Learning to Shoot a Goal Lecture 8: Learning Models and Skills

Learning to Shoot a Goal Lecture 8: Learning Models and Skills Learig to Shoot a Goal Lecture 8: Learig Models ad Skills How do we acquire skill at shootig goals? CS 344R/393R: Robotics Bejami Kuipers Learig to Shoot a Goal The robot eeds to shoot the ball i the goal.

More information

Ones Assignment Method for Solving Traveling Salesman Problem

Ones Assignment Method for Solving Traveling Salesman Problem Joural of mathematics ad computer sciece 0 (0), 58-65 Oes Assigmet Method for Solvig Travelig Salesma Problem Hadi Basirzadeh Departmet of Mathematics, Shahid Chamra Uiversity, Ahvaz, Ira Article history:

More information

INS Assisted Monocular Visual Odometry for Aerial Vehicles

INS Assisted Monocular Visual Odometry for Aerial Vehicles INS Assisted Moocular Visual Odometry for Aerial Vehicles Ji Zhag ad Sajiv Sigh Abstract The requiremet to operate aircrafts i GPS deied eviromets ca be met by use of visual odometry. We study the case

More information

Accuracy Improvement in Camera Calibration

Accuracy Improvement in Camera Calibration Accuracy Improvemet i Camera Calibratio FaJie L Qi Zag ad Reihard Klette CITR, Computer Sciece Departmet The Uiversity of Aucklad Tamaki Campus, Aucklad, New Zealad fli006, qza001@ec.aucklad.ac.z r.klette@aucklad.ac.z

More information

Improving Template Based Spike Detection

Improving Template Based Spike Detection Improvig Template Based Spike Detectio Kirk Smith, Member - IEEE Portlad State Uiversity petra@ee.pdx.edu Abstract Template matchig algorithms like SSE, Covolutio ad Maximum Likelihood are well kow for

More information

Copyright 2016 Ramez Elmasri and Shamkant B. Navathe

Copyright 2016 Ramez Elmasri and Shamkant B. Navathe Copyright 2016 Ramez Elmasri ad Shamkat B. Navathe CHAPTER 19 Query Optimizatio Copyright 2016 Ramez Elmasri ad Shamkat B. Navathe Itroductio Query optimizatio Coducted by a query optimizer i a DBMS Goal:

More information

Consider the following population data for the state of California. Year Population

Consider the following population data for the state of California. Year Population Assigmets for Bradie Fall 2016 for Chapter 5 Assigmet sheet for Sectios 5.1, 5.3, 5.5, 5.6, 5.7, 5.8 Read Pages 341-349 Exercises for Sectio 5.1 Lagrage Iterpolatio #1, #4, #7, #13, #14 For #1 use MATLAB

More information

An Efficient Image Rectification Method for Parallel Multi-Camera Arrangement

An Efficient Image Rectification Method for Parallel Multi-Camera Arrangement Y.-S. Kag ad Y.-S. Ho: A Efficiet Image Rectificatio Method for Parallel Multi-Camera Arragemet 141 A Efficiet Image Rectificatio Method for Parallel Multi-Camera Arragemet Yu-Suk Kag ad Yo-Sug Ho, Seior

More information

Omnidirectional Visual Homing Using the 1D Trifocal Tensor

Omnidirectional Visual Homing Using the 1D Trifocal Tensor 1 IEEE Iteratioal Coferece o Robotics ad utomatio chorage Covetio District May 3-8, 1, chorage, laska, US Omidirectioal Visual Homig Usig the 1D Trifocal Tesor M. rada, G. López-Nicolás ad C. Sagüés DIIS

More information

Closed-Form Solutions to Multiple-View Homography Estimation

Closed-Form Solutions to Multiple-View Homography Estimation Closed-Form Solutios to Multiple-View Homography Estimatio Pierre Schroeder 1 schroedp@i.tum.de Adrie Bartoli adrie.bartoli@gmail.com Pierre Georgel 3 pierre.georgel@gmail.com Nassir Navab 1 avab@i.tum.de

More information

Diego Nehab. n A Transformation For Extracting New Descriptors of Shape. n Locus of points equidistant from contour

Diego Nehab. n A Transformation For Extracting New Descriptors of Shape. n Locus of points equidistant from contour Diego Nehab A Trasformatio For Extractig New Descriptors of Shape Locus of poits equidistat from cotour Medial Axis Symmetric Axis Skeleto Shock Graph Shaked 96 1 Shape matchig Aimatio Dimesio reductio

More information

Text Line Segmentation Based on Morphology and Histogram Projection

Text Line Segmentation Based on Morphology and Histogram Projection 2009 10th Iteratioal Coferece o Documet Aalsis ad Recogitio Tet Lie Segmetatio Based o Morpholog ad Histogram Projectio Rodolfo P. dos Satos, Gabriela S. Clemete, Tsag Ig Re ad George D.C. Calvalcati Ceter

More information

OCR Statistics 1. Working with data. Section 3: Measures of spread

OCR Statistics 1. Working with data. Section 3: Measures of spread Notes ad Eamples OCR Statistics 1 Workig with data Sectio 3: Measures of spread Just as there are several differet measures of cetral tedec (averages), there are a variet of statistical measures of spread.

More information

Alpha Individual Solutions MAΘ National Convention 2013

Alpha Individual Solutions MAΘ National Convention 2013 Alpha Idividual Solutios MAΘ Natioal Covetio 0 Aswers:. D. A. C 4. D 5. C 6. B 7. A 8. C 9. D 0. B. B. A. D 4. C 5. A 6. C 7. B 8. A 9. A 0. C. E. B. D 4. C 5. A 6. D 7. B 8. C 9. D 0. B TB. 570 TB. 5

More information

Two-Dimensional Motion Estimation (Part II: Basic Techniques) Yao Wang Polytechnic University, Brooklyn, NY11201

Two-Dimensional Motion Estimation (Part II: Basic Techniques) Yao Wang Polytechnic University, Brooklyn, NY11201 Two-Dimesioal Motio Estimatio Part II: Basic Techiques Yao Wag Polytechic Uiversity, Brookly, NY0 yao@visio.poly.eu Yao Wag, 00 -D Motio Estimatio Outlie Piel-base motio estimatio Multipoit eighborhoo

More information

Dimension Reduction and Manifold Learning. Xin Zhang

Dimension Reduction and Manifold Learning. Xin Zhang Dimesio Reductio ad Maifold Learig Xi Zhag eeizhag@scut.edu.c Cotet Motivatio of maifold learig Pricipal compoet aalysis ad its etesio Maifold learig Global oliear maifold learig (IsoMap) Local oliear

More information

Introduction. Nature-Inspired Computing. Terminology. Problem Types. Constraint Satisfaction Problems - CSP. Free Optimization Problem - FOP

Introduction. Nature-Inspired Computing. Terminology. Problem Types. Constraint Satisfaction Problems - CSP. Free Optimization Problem - FOP Nature-Ispired Computig Hadlig Costraits Dr. Şima Uyar September 2006 Itroductio may practical problems are costraied ot all combiatios of variable values represet valid solutios feasible solutios ifeasible

More information

Nonlinear Mean Shift for Clustering over Analytic Manifolds

Nonlinear Mean Shift for Clustering over Analytic Manifolds Noliear Mea Shift for Clusterig over Aalytic Maifolds Raghav Subbarao ad Peter Meer Departmet of Electrical ad Computer Egieerig Rutgers Uiversity, Piscataway NJ 08854, USA rsubbara,meer@caip.rutgers.edu

More information

PPKE-ITK. Lecture 3. September 26, 2017 Basic Image Processing Algorithms

PPKE-ITK. Lecture 3. September 26, 2017 Basic Image Processing Algorithms PPKE-ITK Lecture 3. September 6 07 Basic Image Processig Algorithms A eample of Cay edge detector where straight lies are ot detected perfectly. The objective of the Hough trasformatio is to fid the lies

More information

Auto-recognition Method for Pointer-type Meter Based on Binocular Vision

Auto-recognition Method for Pointer-type Meter Based on Binocular Vision JOURNAL OF COMPUTERS, VOL. 9, NO. 4, APRIL 204 787 Auto-recogitio Method for Poiter-type Meter Based o Biocular Visio Biao Yag School of Istrumet Sciece ad Egieerig, Southeast Uiversity, Najig 20096, Chia

More information

9 x and g(x) = 4. x. Find (x) 3.6. I. Combining Functions. A. From Equations. Example: Let f(x) = and its domain. Example: Let f(x) = and g(x) = x x 4

9 x and g(x) = 4. x. Find (x) 3.6. I. Combining Functions. A. From Equations. Example: Let f(x) = and its domain. Example: Let f(x) = and g(x) = x x 4 1 3.6 I. Combiig Fuctios A. From Equatios Example: Let f(x) = 9 x ad g(x) = 4 f x. Fid (x) g ad its domai. 4 Example: Let f(x) = ad g(x) = x x 4. Fid (f-g)(x) B. From Graphs: Graphical Additio. Example:

More information

Basic principles - Geometry. Marc Pollefeys

Basic principles - Geometry. Marc Pollefeys Basic principles - Geometr Marc Pollees Basic principles - Geometr Projective geometr Projective, Aine, Homograph Pinhole camera model and triangulation Epipolar geometr Essential and Fundamental Matri

More information

Linear Time-Invariant Systems

Linear Time-Invariant Systems 9/9/00 LIEAR TIE-IVARIAT SYSTES Uit, d Part Liear Time-Ivariat Sstems A importat class of discrete-time sstem cosists of those that are Liear Priciple of superpositio Time-ivariat dela of the iput sequece

More information

Math 10C Long Range Plans

Math 10C Long Range Plans Math 10C Log Rage Plas Uits: Evaluatio: Homework, projects ad assigmets 10% Uit Tests. 70% Fial Examiatio.. 20% Ay Uit Test may be rewritte for a higher mark. If the retest mark is higher, that mark will

More information

EigenFairing: 3D Model Fairing using Image Coherence

EigenFairing: 3D Model Fairing using Image Coherence EigeFairig: 3D Model Fairig usig Image Coherece Pragyaa Mishra, Omead Amidi, ad Takeo Kaade Robotics Istitute, Caregie Mello Uiversity Pittsburgh, Pesylvaia 15213, USA Abstract A surface is ofte modeled

More information

Eigenimages. Digital Image Processing: Bernd Girod, Stanford University -- Eigenimages 1

Eigenimages. Digital Image Processing: Bernd Girod, Stanford University -- Eigenimages 1 Eigeimages Uitary trasforms Karhue-Loève trasform ad eigeimages Sirovich ad Kirby method Eigefaces for geder recogitio Fisher liear discrimat aalysis Fisherimages ad varyig illumiatio Fisherfaces vs. eigefaces

More information

Single-view Metrology and Camera Calibration

Single-view Metrology and Camera Calibration Sigle-iew Metrology ad Caera Calibratio Coputer Visio Jia-Bi Huag, Virgiia Tech May slides fro S. Seitz ad D. Hoie Adiistratie stuffs HW 2 due :59 PM o Oct 9 th Ask/discuss questios o Piazza Office hour

More information

Parabolic Path to a Best Best-Fit Line:

Parabolic Path to a Best Best-Fit Line: Studet Activity : Fidig the Least Squares Regressio Lie By Explorig the Relatioship betwee Slope ad Residuals Objective: How does oe determie a best best-fit lie for a set of data? Eyeballig it may be

More information

Fast Image Registration Using Pyramid Edge Images

Fast Image Registration Using Pyramid Edge Images Fast Image Registratio Usig Pyramid Edge Images Kee-Baek Kim, Jog-Su Kim, Sagkeu Lee, ad Jog-Soo Choi* The Graduate School of Advaced Imagig Sciece, Multimedia ad Film, Chug-Ag Uiversity, Seoul, Korea(R.O.K

More information

Designing a learning system

Designing a learning system CS 75 Itro to Machie Learig Lecture Desigig a learig system Milos Hauskrecht milos@pitt.edu 539 Seott Square, -5 people.cs.pitt.edu/~milos/courses/cs75/ Admiistrivia No homework assigmet this week Please

More information

A Novel Feature Extraction Algorithm for Haar Local Binary Pattern Texture Based on Human Vision System

A Novel Feature Extraction Algorithm for Haar Local Binary Pattern Texture Based on Human Vision System A Novel Feature Extractio Algorithm for Haar Local Biary Patter Texture Based o Huma Visio System Liu Tao 1,* 1 Departmet of Electroic Egieerig Shaaxi Eergy Istitute Xiayag, Shaaxi, Chia Abstract The locality

More information

Numerical Methods Lecture 6 - Curve Fitting Techniques

Numerical Methods Lecture 6 - Curve Fitting Techniques Numerical Methods Lecture 6 - Curve Fittig Techiques Topics motivatio iterpolatio liear regressio higher order polyomial form expoetial form Curve fittig - motivatio For root fidig, we used a give fuctio

More information

CALIBRATING THE ULTRACAM AERIAL CAMERA SYSTEMS, AN UPDATE

CALIBRATING THE ULTRACAM AERIAL CAMERA SYSTEMS, AN UPDATE CALIBRATING THE ULTRACAM AERIAL CAMERA SYSTEMS, AN UPDATE R. Ladstädter a, H. Tschemmeregg, M. Gruber Microsoft Photogrammetry, Azegrubergasse 8, 8010 Graz, Austria a richard.ladstaedter@microsoft.com

More information

Epipolar Constraint. Epipolar Lines. Epipolar Geometry. Another look (with math).

Epipolar Constraint. Epipolar Lines. Epipolar Geometry. Another look (with math). Epipolar Constraint Epipolar Lines Potential 3d points Red point - fied => Blue point lies on a line There are 3 degrees of freedom in the position of a point in space; there are four DOF for image points

More information

ON THE QUALITY OF AUTOMATIC RELATIVE ORIENTATION PROCEDURES

ON THE QUALITY OF AUTOMATIC RELATIVE ORIENTATION PROCEDURES ON THE QUALITY OF AUTOMATIC RELATIVE ORIENTATION PROCEDURES Thomas Läbe, Timo Dickscheid ad Wolfgag Förster Istitute of Geodesy ad Geoiformatio, Departmet of Photogrammetry, Uiversity of Bo laebe@ipb.ui-bo.de,

More information

( n+1 2 ) , position=(7+1)/2 =4,(median is observation #4) Median=10lb

( n+1 2 ) , position=(7+1)/2 =4,(median is observation #4) Median=10lb Chapter 3 Descriptive Measures Measures of Ceter (Cetral Tedecy) These measures will tell us where is the ceter of our data or where most typical value of a data set lies Mode the value that occurs most

More information

Estimating the Motion of an Underwater Robot from a Monocular Image Sequence

Estimating the Motion of an Underwater Robot from a Monocular Image Sequence Estimatig the Motio of a Uderwater Robot from a Moocular Image Sequece Rafael Garcia, Xevi Cufi ad Marc Carreras Computer Visio ad Robotics Group Istitute of Iformatics ad Applicatios Uiversit of Giroa,

More information

CS 683: Advanced Design and Analysis of Algorithms

CS 683: Advanced Design and Analysis of Algorithms CS 683: Advaced Desig ad Aalysis of Algorithms Lecture 6, February 1, 2008 Lecturer: Joh Hopcroft Scribes: Shaomei Wu, Etha Feldma February 7, 2008 1 Threshold for k CNF Satisfiability I the previous lecture,

More information

Derivation of perspective stereo projection matrices with depth, shape and magnification consideration

Derivation of perspective stereo projection matrices with depth, shape and magnification consideration Derivatio of perspective stereo projectio matrices with depth, shape ad magificatio cosideratio Patrick Oberthür Jauary 2014 This essay will show how to costruct a pair of stereoscopic perspective projectio

More information

A Feature Based Generic Model for Georeferencing of High Resolution Satellite Imagery

A Feature Based Generic Model for Georeferencing of High Resolution Satellite Imagery roceedigs of the 2d WSEAS Iteratioal Coferece o Remote Sesig, Teerife, Caary Islads, Spai, December 16-18, 26 12 A Feature Based Geeric Model for Georeferecig of High Resolutio Satellite Imagery FARHAD

More information

South Slave Divisional Education Council. Math 10C

South Slave Divisional Education Council. Math 10C South Slave Divisioal Educatio Coucil Math 10C Curriculum Package February 2012 12 Strad: Measuremet Geeral Outcome: Develop spatial sese ad proportioal reasoig It is expected that studets will: 1. Solve

More information

Section 7.2: Direction Fields and Euler s Methods

Section 7.2: Direction Fields and Euler s Methods Sectio 7.: Directio ields ad Euler s Methods Practice HW from Stewart Tetbook ot to had i p. 5 # -3 9-3 odd or a give differetial equatio we wat to look at was to fid its solutio. I this chapter we will

More information

Designing a learning system

Designing a learning system CS 75 Machie Learig Lecture Desigig a learig system Milos Hauskrecht milos@cs.pitt.edu 539 Seott Square, x-5 people.cs.pitt.edu/~milos/courses/cs75/ Admiistrivia No homework assigmet this week Please try

More information

A Very Simple Approach for 3-D to 2-D Mapping

A Very Simple Approach for 3-D to 2-D Mapping A Very Simple Approach for -D to -D appig Sadipa Dey (1 Ajith Abraham ( Sugata Sayal ( Sadipa Dey (1 Ashi Software Private Limited INFINITY Tower II 10 th Floor Plot No. - 4. Block GP Salt Lake Electroics

More information

Force Network Analysis using Complementary Energy

Force Network Analysis using Complementary Energy orce Network Aalysis usig Complemetary Eergy Adrew BORGART Assistat Professor Delft Uiversity of Techology Delft, The Netherlads A.Borgart@tudelft.l Yaick LIEM Studet Delft Uiversity of Techology Delft,

More information

Single-view Metrology and Camera Calibration

Single-view Metrology and Camera Calibration Sigle-iew Metrology ad Caera Calibratio Coputer Visio Jia-Bi Huag, Virgiia Tech May slides fro S. Seitz ad D. Hoie Adiistratie stuffs HW 2 due :59 PM o Oct 3 rd HW 2 copetitio o shape aliget Subit your

More information

BOOLEAN MATHEMATICS: GENERAL THEORY

BOOLEAN MATHEMATICS: GENERAL THEORY CHAPTER 3 BOOLEAN MATHEMATICS: GENERAL THEORY 3.1 ISOMORPHIC PROPERTIES The ame Boolea Arithmetic was chose because it was discovered that literal Boolea Algebra could have a isomorphic umerical aspect.

More information

Transform into 3D world coordinate system. Illuminate according to lighting and reflectance. Transform into 3D camera coordinate system

Transform into 3D world coordinate system. Illuminate according to lighting and reflectance. Transform into 3D camera coordinate system Projetios Trasformatios! 3D Geometri Primities Modelig Trasformatio Trasform ito 3D world oordiate sstem Lightig Illumiate aordig to lightig ad refletae Viewig Trasformatio Trasform ito 3D amera oordiate

More information

Civil Engineering Computation

Civil Engineering Computation Civil Egieerig Computatio Fidig Roots of No-Liear Equatios March 14, 1945 World War II The R.A.F. first operatioal use of the Grad Slam bomb, Bielefeld, Germay. Cotets 2 Root basics Excel solver Newto-Raphso

More information

EM375 STATISTICS AND MEASUREMENT UNCERTAINTY LEAST SQUARES LINEAR REGRESSION ANALYSIS

EM375 STATISTICS AND MEASUREMENT UNCERTAINTY LEAST SQUARES LINEAR REGRESSION ANALYSIS EM375 STATISTICS AND MEASUREMENT UNCERTAINTY LEAST SQUARES LINEAR REGRESSION ANALYSIS I this uit of the course we ivestigate fittig a straight lie to measured (x, y) data pairs. The equatio we wat to fit

More information

Lenses and imaging. MIT 2.71/ /10/01 wk2-a-1

Lenses and imaging. MIT 2.71/ /10/01 wk2-a-1 Leses ad imagig Huyges priciple ad why we eed imagig istrumets A simple imagig istrumet: the pihole camera Priciple of image formatio usig leses Quatifyig leses: paraial approimatio & matri approach Focusig

More information

RECONSTRUCTION OF 3D LINEAR PRIMITIVES FROM MULTIPLE VIEWS FOR URBAN AREAS MODELISATION

RECONSTRUCTION OF 3D LINEAR PRIMITIVES FROM MULTIPLE VIEWS FOR URBAN AREAS MODELISATION RECNSTRUCTIN F 3D LINEAR PRIMITIVES FRM MULTIPLE VIEWS FR URBAN AREAS MDELISATIN Frack Tailladier a Rachid Deriche b a Istitut Géographique Natioal/MATIS 2-4 aveue Pasteur 9465 Sait-Madé - fracktailladier@igfr

More information

Computational Geometry

Computational Geometry Computatioal Geometry Chapter 4 Liear programmig Duality Smallest eclosig disk O the Ageda Liear Programmig Slides courtesy of Craig Gotsma 4. 4. Liear Programmig - Example Defie: (amout amout cosumed

More information

Math Section 2.2 Polynomial Functions

Math Section 2.2 Polynomial Functions Math 1330 - Sectio. Polyomial Fuctios Our objectives i workig with polyomial fuctios will be, first, to gather iformatio about the graph of the fuctio ad, secod, to use that iformatio to geerate a reasoably

More information

Parametric curves. Reading. Parametric polynomial curves. Mathematical curve representation. Brian Curless CSE 457 Spring 2015

Parametric curves. Reading. Parametric polynomial curves. Mathematical curve representation. Brian Curless CSE 457 Spring 2015 Readig Required: Agel 0.-0.3, 0.5., 0.6-0.7, 0.9 Parametric curves Bria Curless CSE 457 Sprig 05 Optioal Bartels, Beatty, ad Barsy. A Itroductio to Splies for use i Computer Graphics ad Geometric Modelig,

More information

Lip Contour Extraction based on Active Shape Model and Snakes

Lip Contour Extraction based on Active Shape Model and Snakes 48 IJCSNS Iteratioal Joural of Computer Sciece ad Network Security, VOL.7 No.0, October 007 Lip Cotour xtractio based o Active Shape Model ad Sakes Kyug Shik Jag Departmet of Multimedia gieerig, Dog-ui

More information

Improvement of the Orthogonal Code Convolution Capabilities Using FPGA Implementation

Improvement of the Orthogonal Code Convolution Capabilities Using FPGA Implementation Improvemet of the Orthogoal Code Covolutio Capabilities Usig FPGA Implemetatio Naima Kaabouch, Member, IEEE, Apara Dhirde, Member, IEEE, Saleh Faruque, Member, IEEE Departmet of Electrical Egieerig, Uiversity

More information

The golden search method: Question 1

The golden search method: Question 1 1. Golde Sectio Search for the Mode of a Fuctio The golde search method: Questio 1 Suppose the last pair of poits at which we have a fuctio evaluatio is x(), y(). The accordig to the method, If f(x())

More information

RADIAL BASIS FUNCTION USE FOR THE RESTORATION OF DAMAGED IMAGES

RADIAL BASIS FUNCTION USE FOR THE RESTORATION OF DAMAGED IMAGES RADIAL BASIS FUNCION USE FOR HE RESORAION OF DAMAGED IMAGES Karel Uhlir, Vaclav Skala Uiversity of West Bohemia, Uiverziti 8, 3064 Plze, Czech Republic Abstract: Key words: Radial Basis Fuctio (RBF) ca

More information

Higher-order iterative methods free from second derivative for solving nonlinear equations

Higher-order iterative methods free from second derivative for solving nonlinear equations Iteratioal Joural of the Phsical Scieces Vol 6(8, pp 887-89, 8 April, Available olie at http://wwwacademicjouralsorg/ijps DOI: 5897/IJPS45 ISSN 99-95 Academic Jourals Full Legth Research Paper Higher-order

More information

The isoperimetric problem on the hypercube

The isoperimetric problem on the hypercube The isoperimetric problem o the hypercube Prepared by: Steve Butler November 2, 2005 1 The isoperimetric problem We will cosider the -dimesioal hypercube Q Recall that the hypercube Q is a graph whose

More information

Administrative UNSUPERVISED LEARNING. Unsupervised learning. Supervised learning 11/25/13. Final project. No office hours today

Administrative UNSUPERVISED LEARNING. Unsupervised learning. Supervised learning 11/25/13. Final project. No office hours today Admiistrative Fial project No office hours today UNSUPERVISED LEARNING David Kauchak CS 451 Fall 2013 Supervised learig Usupervised learig label label 1 label 3 model/ predictor label 4 label 5 Supervised

More information

Assignment 5; Due Friday, February 10

Assignment 5; Due Friday, February 10 Assigmet 5; Due Friday, February 10 17.9b The set X is just two circles joied at a poit, ad the set X is a grid i the plae, without the iteriors of the small squares. The picture below shows that the iteriors

More information

Carnegie Mellon University

Carnegie Mellon University Caregie Mello Uiversity CARNEGIE INSTITUTE OF TECHNOLOGY THESIS SUBMITTED IN PARTIAL FULFILLMENT OF THE REQUIREMENTS FOR THE DEGREE OF Doctor of Philosophy TITLE Pose Robust Video-Based Face Recogitio

More information

A Trinocular Stereo System for Highway Obstacle Detection

A Trinocular Stereo System for Highway Obstacle Detection A Triocular Stereo System for Highway Obstacle Detectio Todd Williamso ad Charles Thorpe Robotics Istitute Caregie Mello Uiversity Pittsburgh, PA 15213 {Todd.Williamso,Charles.Thorpe}@ri.cmu.edu Abstract

More information

XIV. Congress of the International Society for Photogrammetry Hamburg 1980

XIV. Congress of the International Society for Photogrammetry Hamburg 1980 XIV. Cogress of the Iteratioal Society for Photogrammetry Hamburg 980 Commissio V Preseted Paper ALTAN, M. O. Techical Uiversity of Istabul Chair of Photograrretry ad Adjustmet A COMPARISON BETWEEN -PARAMETER

More information

Chapter 3 Classification of FFT Processor Algorithms

Chapter 3 Classification of FFT Processor Algorithms Chapter Classificatio of FFT Processor Algorithms The computatioal complexity of the Discrete Fourier trasform (DFT) is very high. It requires () 2 complex multiplicatios ad () complex additios [5]. As

More information

Mobile terminal 3D image reconstruction program development based on Android Lin Qinhua

Mobile terminal 3D image reconstruction program development based on Android Lin Qinhua Iteratioal Coferece o Automatio, Mechaical Cotrol ad Computatioal Egieerig (AMCCE 05) Mobile termial 3D image recostructio program developmet based o Adroid Li Qihua Sichua Iformatio Techology College

More information

SD vs. SD + One of the most important uses of sample statistics is to estimate the corresponding population parameters.

SD vs. SD + One of the most important uses of sample statistics is to estimate the corresponding population parameters. SD vs. SD + Oe of the most importat uses of sample statistics is to estimate the correspodig populatio parameters. The mea of a represetative sample is a good estimate of the mea of the populatio that

More information

High-Accuracy Sub-pixel Motion Estimation from Noisy Images in Fourier Domain

High-Accuracy Sub-pixel Motion Estimation from Noisy Images in Fourier Domain >TIP-04885-009.R, J. Re, etc.: High-Accurac Sub-piel Motio Estimatio from Nois Images i Fourier Domai < 1 High-Accurac Sub-piel Motio Estimatio from Nois Images i Fourier Domai Jichag Re, Jiami Jiag ad

More information

Figure 1: The gure shows two frotal views ad a side view of a pair of bas-relief sculptures. Notice how the frotal views appear to have full 3-D depth

Figure 1: The gure shows two frotal views ad a side view of a pair of bas-relief sculptures. Notice how the frotal views appear to have full 3-D depth The Bas-Relief Ambiguity Peter N. Belhumeur David J. Kriegma y Ala L. Yuille Ceter for Computatioal Visio ad Cotrol Smith-Kettlewell Eye Research Istitute Yale Uiversity Sa Fracisco, CA 94115 New Have,

More information

UNIT 4 Section 8 Estimating Population Parameters using Confidence Intervals

UNIT 4 Section 8 Estimating Population Parameters using Confidence Intervals UNIT 4 Sectio 8 Estimatig Populatio Parameters usig Cofidece Itervals To make ifereces about a populatio that caot be surveyed etirely, sample statistics ca be take from a SRS of the populatio ad used

More information

AN OPTIMIZATION NETWORK FOR MATRIX INVERSION

AN OPTIMIZATION NETWORK FOR MATRIX INVERSION 397 AN OPTIMIZATION NETWORK FOR MATRIX INVERSION Ju-Seog Jag, S~ Youg Lee, ad Sag-Yug Shi Korea Advaced Istitute of Sciece ad Techology, P.O. Box 150, Cheogryag, Seoul, Korea ABSTRACT Iverse matrix calculatio

More information

Handwriting Stroke Extraction Using a New XYTC Transform

Handwriting Stroke Extraction Using a New XYTC Transform Hadwritig Stroke Etractio Usig a New XYTC Trasform Gilles F. Houle 1, Kateria Bliova 1 ad M. Shridhar 1 Computer Scieces Corporatio Uiversity Michiga-Dearbor Abstract: The fudametal represetatio of hadwritig

More information