Computer Vision Lecture 12
|
|
- Kory Thornton
- 5 years ago
- Views:
Transcription
1 N pels Course Outlne Computer Vson Lecture 2 Recognton wt Local Features 5226 Bastan Lebe RWH acen ttp://wwwvsonrwt-aacende/ lebe@vsonrwt-aacende Image Processng Bascs Segmentaton & Groupng Object Recognton Object Categorzaton I Sldng Wndow based Object Detecton Local Features & Matcng Local Features Detecton and Descrpton Recognton wt Local Features Indeng & Vsual Vocabulares Object Categorzaton II 3D Reconstructon Moton and rackng 3 Recap: Local Feature Matcng Outlne Recap: utomatc Scale Selecton Fnd a set of dstnctve keponts Functon responses for ncreasng scale (scale sgnature) 2 Defne a regon around eac kepont N pels f eg color Smlart measure d( f, f ) B f B eg color 3 Etract and normalze te regon content 4 Compute a local descrptor from te normalzed regon 5 Matc local descrptors 4 f ( I (, )) f ( I (, )) m Slde credt: Krstan Mkolajczk m 5 Recap: Laplacan-of-Gaussan (LoG) Interest ponts: Local mama n scale space of Laplacan-of- Gaussan L ( ) L ( ) Recap: Harrs-Laplace [Mkolajczk ] Intalzaton: Multscale Harrs corner detecton 2 Scale selecton based on Laplacan (same procedure wt Hessan Hessan-Laplace) Harrs ponts 2 Lst of (,, σ) Slde adapted from Krstan Mkolajczk Slde adapted from Krstan Mkolajczk Harrs-Laplace ponts 7
2 Recap: SIF Feature Descrptor opcs of s Lecture Scale Invarant Feature ransform Descrptor computaton: Dvde patc nto 44 sub-patces: 6 cells Compute stogram of gradent orentatons (8 reference angles) for all pels nsde eac sub-patc Resultng descrptor: 448 = 28 dmensons Recognton wt Local Features Matcng local features Fndng consstent confguratons lgnment: lnear transformatons ffne estmaton Homograp estmaton Dealng wt Outlers RNSC Generalzed Houg ransform Davd G Lowe "Dstnctve mage features from scale-nvarant keponts IJCV 6 (2), pp 9-, 24 Slde credt: Svetlana Lazebnk 8 Indeng wt Local Features Inverted fle nde Vsual Words Vsual Vocabular constructon tf-df wegtng Recognton wt Local Features Image content s transformed nto local features tat are nvarant to translaton, rotaton, and scale Goal: Verf f te belong to a consstent confguraton Concepts: Warpng vs lgnment Warpng: Gven a source mage and a transformaton, wat does te transformed output look lke? Slde credt: Davd Lowe Local Features, eg SIF 2 lgnment: Gven two mages wt correspondng features, wat s te transformaton between tem? 3 Parametrc (Global) Warpng Wat Can be Represented b a 22 Matr? p = (,) p = (, ) 2D Scalng? s * s * s s ransformaton s a coordnate-cangng macne: p = (p) Wat does t mean tat s global? It s te same for an pont p It can be descrbed b just a few numbers (parameters) Let s represent as a matr: p = Mp, Slde credt: leej Efros M 4 2D Rotaton around (,)? cos * sn * cos sn sn * cos * sn cos 2D Searng? s * s * Slde credt: leej Efros s s 5 2
3 Wat Can be Represented b a 22 Matr? 2D Mrror about as? 2D Mrror over (,)? 2D ranslaton? t t NO! 2D Lnear ransforms Onl lnear 2D transformatons can be represented wt a 22 matr Lnear transformatons are combnatons of Scale, Rotaton, Sear, and Mrror a b c d Slde credt: leej Efros 6 Slde credt: leej Efros 7 Homogeneous Coordnates Basc 2D ransformatons Q: How can we represent translaton as a 33 matr usng omogeneous coordnates? t t Basc 2D transformatons as 33 matrces t s t s ranslaton Scalng : Usng te rgtmost column: t ranslaton t cos sn sn cos Rotaton s s Searng Slde credt: leej Efros 8 Slde credt: leej Efros 9 2D ffne ransformatons Projectve ransformatons a d w b e c f w a d w g b e c f w ffne transformatons are combnatons of Lnear transformatons, and ranslatons Projectve transformatons: ffne transformatons, and Projectve warps Parallel lnes reman parallel Parallel lnes do not necessarl reman parallel Slde credt: leej Efros 2 Slde credt: leej Efros 2 3
4 lgnment Problem We ave prevousl consdered ow to ft a model to mage evdence Eg, a lne to edge ponts In algnment, we wll ft te parameters of some transformaton accordng to a set of matcng feature pars ( correspondences ) Let s Start wt ffne ransformatons Smple fttng procedure (lnear least squares) ppromates vewpont canges for rougl planar objects and rougl ortograpc cameras Can be used to ntalze fttng for more comple models 22 Slde credt: Svetlana Lazebnk 23 Fttng an ffne ransformaton Fttng an ffne ransformaton ssumng we know te correspondences, ow do we get te transformaton? (, ) B, ) ( ffne model appromates perspectve projecton of planar objects m m3 m2 t m 4 t2 24 Image source: Davd Lowe 25 Recall: Least Squares Estmaton Set of data ponts: ( X, X),( X 2, X 2),( X3, X3) Goal: a lnear functon to predct X s from Xs: Xa b X We want to fnd a and b How man ( X, X ) pars do we need? Xa b X X a X B X 2a b X 2 X 2 b X 2 Wat f te data s nos? X X Overconstraned Soluton: problem X 2 a X 2 mn k Bk 2 = + B X 3 b X 3 Least-squares Matlab: mnmzaton = nb Slde credt: leej Efros 26 Fttng an ffne ransformaton ssumng we know te correspondences, ow do we get te transformaton? m m3 (, ) m2 t m 4 t2 B (, ) m m2 m3 m 4 t t2 27 4
5 Fttng an ffne ransformaton m m2 m3 m 4 t t2 How man matces (correspondence pars) do we need to solve for te transformaton parameters? Once we ave solved for te parameters, ow do we compute te coordnates of te correspondng pont for, new )? ( new 28 Homograp projectve transform s a mappng between an two perspectve projectons wt te same center of projecton Ie two planes n 3D along te same sgt ra Propertes Rectangle sould map to arbtrar quadrlateral PP2 Parallel lnes aren t but must preserve stragt lnes s s called a omograp w * w * w * p Slde adapted from leej Efros * * * H * * * p PP 29 Homograp Fttng a Homograp projectve transform s a mappng between an two perspectve projectons wt te same center of projecton Ie two planes n 3D along te same sgt ra Propertes Rectangle sould map to arbtrar quadrlateral Parallel lnes aren t but must preserve stragt lnes s s called a omograp w 2 3 w w 3 p H p Slde adapted from leej Efros Set scale factor to 8 parameters left Estmatng te transformaton B 2 3 B Homogenous coordnates Image coordnates Slde credt: Krstan Mkolajczk Matr notaton H 3 Fttng a Homograp Estmatng te transformaton Fttng a Homograp Estmatng te transformaton B B B 2 3 Homogenous coordnates 3 23 Slde credt: Krstan Mkolajczk Image coordnates Matr notaton H B 2 3 Homogenous coordnates B 3 3 B Slde credt: Krstan Mkolajczk Image coordnates Matr notaton H 33 5
6 Fttng a Homograp Estmatng te transformaton Fttng a Homograp Estmatng te transformaton B B B 2 3 Homogenous coordnates Image coordnates 2B 3 3 B Slde credt: Krstan Mkolajczk B 23 3 B B Matr notaton H 34 B 2 3 2B 3 Slde credt: Krstan Mkolajczk 3 B B 2 22B 23 B B B B B B 35 Fttng a Homograp Estmatng te transformaton Fttng a Homograp Estmatng te transformaton 2B 3 3 B 2 22B 23 3 B B B 2 3 B Homogenous coordnates Image coordnates 2B B 23 3 B 3 B 3 B 2 B 3 2B 3 3 B 2 22B 23 3 B Slde credt: Krstan Mkolajczk 36 B 2 3 Slde credt: Krstan Mkolajczk B B B B B B B Fttng a Homograp Fttng a Homograp Estmatng te transformaton Soluton: Null-space vector of B 2 3 SVD Slde credt: Krstan Mkolajczk d v v9 UDV? U d v v B 38 Estmatng te transformaton Soluton: Null-space vector of Corresponds to smallest sngular vector B 2 3 SVD Slde credt: Krstan Mkolajczk d v v9 UDV U d v v v9,, v v B Mnmzes least square error 39 6
7 utomatc rectfcaton Image Warpng wt Homograpes Uses: nalzng Patterns and Sapes Wat s te sape of te b/w floor pattern? p p Slde credt: Steve Setz Image plane n front Black area were no pel maps to mage plane below 4 Slde credt: ntono Crmns e floor (enlarged) 4 nalzng Patterns and Sapes opcs of s Lecture Recognton wt Local Features Matcng local features Fndng consstent confguratons lgnment: lnear transformatons ffne estmaton Homograp estmaton Dealng wt Outlers RNSC Generalzed Houg ransform From Martn Kemp e Scence of rt (manual reconstructon) Indeng wt Local Features Inverted fle nde Vsual Words Vsual Vocabular constructon tf-df wegtng Slde credt: ntono Crmns Problem: Outlers Eample: Least-Squares Lne Fttng Outlers can urt te qualt of our parameter estmates, eg, n erroneous par of matcng ponts from two mages feature pont tat s nose or doesn t belong to te transformaton we are fttng ssumng all te ponts tat belong to a partcular lne are known Source: Forst & Ponce 7
8 Outlers ffect Least-Squares Ft Outlers ffect Least-Squares Ft 46 Source: Forst & Ponce 47 Source: Forst & Ponce Strateg : RNSC [Fscler8] RNSC RNdom Smple Consensus RNSC loop: pproac: we want to avod te mpact of outlers, so let s look for nlers, and use onl tose Randoml select a seed group of ponts on wc to base transformaton estmate (eg, a group of matces) Intuton: f an outler s cosen to compute te current ft, ten te resultng lne won t ave muc support from rest of te ponts 2 Compute transformaton from seed group 3 Fnd nlers to ts transformaton 4 If te number of nlers s suffcentl large, recompute least-squares estmate of transformaton on all of te nlers Keep te transformaton wt te largest number of nlers RNSC Lne Fttng Eample ask: Estmate te best lne How man ponts do we need to estmate te lne? RNSC Lne Fttng Eample ask: Estmate te best lne Sample two ponts Slde credt: Jnang Ca 5 Slde credt: Jnang Ca 5 8
9 RNSC Lne Fttng Eample ask: Estmate te best lne RNSC Lne Fttng Eample ask: Estmate te best lne Ft a lne to tem otal number of ponts wtn a tresold of lne Slde credt: Jnang Ca 52 Slde credt: Jnang Ca 53 RNSC Lne Fttng Eample ask: Estmate te best lne RNSC Lne Fttng Eample ask: Estmate te best lne 7 nler ponts otal number of ponts wtn a tresold of lne Repeat, untl we get a good result Slde credt: Jnang Ca 54 Slde credt: Jnang Ca 55 RNSC Lne Fttng Eample RNSC: How man samples? ask: Estmate te best lne How man samples are needed? Suppose w s fracton of nlers (ponts from lne) n ponts needed to defne potess (2 for lnes) nler ponts k samples cosen Prob tat a sngle sample of n ponts s correct: n w Prob tat all k samples fal s: ( w ) n k Repeat, untl we get a good result Coose k g enoug to keep ts below desred falure rate Slde credt: Jnang Ca 56 Slde credt: Davd Lowe 57 9
10 RNSC: Computed k (p=99) fter RNSC Sample sze n Proporton of outlers 5% % 2% 25% 3% 4% 5% RNSC dvdes data nto nlers and outlers and elds estmate computed from mnmal set of nlers Improve ts ntal estmate wt estmaton over all nlers (eg wt standard least-squares mnmzaton) But ts ma cange nlers, so alternate fttng wt reclassfcaton as nler/outler Slde credt: Davd Lowe 58 Slde credt: Davd Lowe 59 Eample: Fndng Feature Matces Eample: Fndng Feature Matces Fnd best stereo matc wtn a square searc wndow (ere 3 pels 2 ) Global transformaton model: eppolar geometr Fnd best stereo matc wtn a square searc wndow (ere 3 pels 2 ) Global transformaton model: eppolar geometr before RNSC after RNSC Images from Hartle & Zsserman Images from Hartle & Zsserman Slde credt: Davd Lowe 6 Slde credt: Davd Lowe 6 Problem wt RNSC Strateg 2: Generalzed Houg ransform In man practcal stuatons, te percentage of outlers (ncorrect putatve matces) s often ver g (9% or above) lternatve strateg: Generalzed Houg ransform Suppose our features are scale- and rotaton-nvarant en a sngle feature matc provdes an algnment potess (translaton, scale, orentaton) model Slde credt: Svetlana Lazebnk 62 Slde credt: Svetlana Lazebnk 63
11 Strateg 2: Generalzed Houg ransform Pose Clusterng and Verfcaton wt SIF Suppose our features are scale- and rotaton-nvarant en a sngle feature matc provdes an algnment potess (translaton, scale, orentaton) Of course, a potess from a sngle matc s unrelable Soluton: let eac matc vote for ts potess n a Houg space wt ver coarse bns o detect nstances of objects from a model base: Inde descrptors Dstnctve features narrow down possble matces model Slde credt: Svetlana Lazebnk Image source: Davd Lowe Indeng Local Features Pose Clusterng and Verfcaton wt SIF o detect nstances of objects from a model base: Model base New mage Image source: Davd Lowe Inde descrptors Dstnctve features narrow down possble matces 2 Generalzed Houg transform to vote for poses Keponts ave record of parameters relatve to model coordnate sstem 3 ffne ft to ceck for agreement between model and mage features Ft and verf usng features from Houg bns wt 3+ votes 67 Image source: Davd Lowe Object Recognton Results Locaton Recognton ranng Background subtract for model boundares Objects recognzed Recognton n spte of occluson 68 Image source: Davd Lowe [Lowe, IJCV 4] 69 Slde credt: Davd Lowe
12 Recall: Dffcultes of Votng Summar Nose/clutter can lead to as man votes as true target Bn sze for te accumulator arra must be cosen carefull (Recall Houg ransform) Recognton b algnment: lookng for object and pose tat fts well wt mage Use good correspondences to desgnate poteses Invarant local features offer more relable matces Fnd consstent nler confguratons n clutter In practce, good dea to make broad bns and spread votes to nearb bns, snce verfcaton stage can prune bad vote peaks Generalzed Houg ransform RNSC lgnment approac to recognton can be effectve f we fnd relable features wtn clutter pplcaton: large-scale mage retreval pplcaton: recognton of specfc (mostl planar) objects 7 Move posters Books CD covers 72 References and Furter Readng detaled descrpton of local feature etracton and recognton can be found n Capters 3-5 of Grauman & Lebe (avalable on te L2P) K Grauman, Vsual Object Recognton Morgan & Clapool publsers, 2 R Hartle, Zsserman Multple Vew Geometr n Computer Vson 2nd Ed, Cambrdge Unv Press, 24 More detals on RNSC can also be found n Capter 47 of Hartle & Zsserman 2
Computer Vision Lecture 14
N pels Scrpt Computer Vson Lecture 4 Recognton wt Local Features We ve created a scrpt for te part of te lecture on object recognton & categorzaton K. Grauman, Vsual Object Recognton Morgan & Clapool publsers,
More informationComputer Vision Lecture 13
Computer Vision Lecture 3 Recognition wit Local Features 5.2.205 astian Leibe RWTH acen ttp://www.vision.rwt-aacen.de/ leibe@vision.rwt-aacen.de Course Outline Image Processing asics Segmentation & Grouping
More informationGeometric Transformations and Multiple Views
CS 2770: Computer Vson Geometrc Transformatons and Multple Vews Prof. Adrana Kovaska Unverst of Pttsburg Februar 8, 208 W multple vews? Structure and dept are nerentl ambguous from sngle vews. Multple
More informationImage Alignment CSC 767
Image Algnment CSC 767 Image algnment Image from http://graphcs.cs.cmu.edu/courses/15-463/2010_fall/ Image algnment: Applcatons Panorama sttchng Image algnment: Applcatons Recognton of object nstances
More informationImage warping and stitching May 5 th, 2015
Image warpng and sttchng Ma 5 th, 2015 Yong Jae Lee UC Davs PS2 due net Frda Announcements 2 Last tme Interactve segmentaton Feature-based algnment 2D transformatons Affne ft RANSAC 3 1 Algnment problem
More informationMulti-stable Perception. Necker Cube
Mult-stable Percepton Necker Cube Spnnng dancer lluson, Nobuuk Kaahara Fttng and Algnment Computer Vson Szelsk 6.1 James Has Acknowledgment: Man sldes from Derek Hoem, Lana Lazebnk, and Grauman&Lebe 2008
More informationLEAST SQUARES. RANSAC. HOUGH TRANSFORM.
LEAS SQUARES. RANSAC. HOUGH RANSFORM. he sldes are from several sources through James Has (Brown); Srnvasa Narasmhan (CMU); Slvo Savarese (U. of Mchgan); Bll Freeman and Antono orralba (MI), ncludng ther
More informationFitting & Matching. Lecture 4 Prof. Bregler. Slides from: S. Lazebnik, S. Seitz, M. Pollefeys, A. Effros.
Fttng & Matchng Lecture 4 Prof. Bregler Sldes from: S. Lazebnk, S. Setz, M. Pollefeys, A. Effros. How do we buld panorama? We need to match (algn) mages Matchng wth Features Detect feature ponts n both
More informationMotivation. Matching, Alignment, and Registration. Components in Matching. Image Alignment
Matcng, Algnent, and Regstraton CIS 554 Coputer Vson Habn Lng Motvaton ransforaton between two enttes are often requested n an vson tass Iage algnent Pont set atcng Surface regstraton Contour atcng Snons
More informationProf. Feng Liu. Spring /24/2017
Prof. Feng Lu Sprng 2017 ttp://www.cs.pd.edu/~flu/courses/cs510/ 05/24/2017 Last me Compostng and Mattng 2 oday Vdeo Stablzaton Vdeo stablzaton ppelne 3 Orson Welles, ouc of Evl, 1958 4 Images courtesy
More informationAlignment and Object Instance Recognition
Algnment and Object Instance Recognton Computer Vson Ja-Bn Huang, Vrgna Tech Man sldes from S. Lazebnk and D. Hoem Admnstratve Stuffs HW 2 due 11:59 PM Oct 9 Anonmous feedback Lectures Mcrophone on our
More informationFitting and Alignment
Fttng and Algnment Computer Vson Ja-Bn Huang, Vrgna Tech Many sldes from S. Lazebnk and D. Hoem Admnstratve Stuffs HW 1 Competton: Edge Detecton Submsson lnk HW 2 wll be posted tonght Due Oct 09 (Mon)
More informationStructure from Motion
Structure from Moton Structure from Moton For now, statc scene and movng camera Equvalentl, rgdl movng scene and statc camera Lmtng case of stereo wth man cameras Lmtng case of multvew camera calbraton
More informationOutline. Discriminative classifiers for image recognition. Where in the World? A nearest neighbor recognition example 4/14/2011. CS 376 Lecture 22 1
4/14/011 Outlne Dscrmnatve classfers for mage recognton Wednesday, Aprl 13 Krsten Grauman UT-Austn Last tme: wndow-based generc obect detecton basc ppelne face detecton wth boostng as case study Today:
More informationExact solution, the Direct Linear Transfo. ct solution, the Direct Linear Transform
Estmaton Basc questons We are gong to be nterested of solvng e.g. te followng estmaton problems: D omograpy. Gven a pont set n P and crespondng ponts n P, fnd te omograpy suc tat ( ) =. Camera projecton.
More informationAffine and Projective Transformations
CS 674: Intro to Computer Vision Affine and Projective Transformations Prof. Adriana Kovaska Universit of Pittsburg October 3, 26 Alignment problem We previousl discussed ow to matc features across images,
More informationCalibrating a single camera. Odilon Redon, Cyclops, 1914
Calbratng a sngle camera Odlon Redon, Cclops, 94 Our goal: Recover o 3D structure Recover o structure rom one mage s nherentl ambguous??? Sngle-vew ambgut Sngle-vew ambgut Rashad Alakbarov shadow sculptures
More informationActive Contours/Snakes
Actve Contours/Snakes Erkut Erdem Acknowledgement: The sldes are adapted from the sldes prepared by K. Grauman of Unversty of Texas at Austn Fttng: Edges vs. boundares Edges useful sgnal to ndcate occludng
More informationRange images. Range image registration. Examples of sampling patterns. Range images and range surfaces
Range mages For many structured lght scanners, the range data forms a hghly regular pattern known as a range mage. he samplng pattern s determned by the specfc scanner. Range mage regstraton 1 Examples
More information12/2/2009. Announcements. Parametric / Non-parametric. Case-Based Reasoning. Nearest-Neighbor on Images. Nearest-Neighbor Classification
Introducton to Artfcal Intellgence V22.0472-001 Fall 2009 Lecture 24: Nearest-Neghbors & Support Vector Machnes Rob Fergus Dept of Computer Scence, Courant Insttute, NYU Sldes from Danel Yeung, John DeNero
More informationFitting: Deformable contours April 26 th, 2018
4/6/08 Fttng: Deformable contours Aprl 6 th, 08 Yong Jae Lee UC Davs Recap so far: Groupng and Fttng Goal: move from array of pxel values (or flter outputs) to a collecton of regons, objects, and shapes.
More informationAIMS Computer vision. AIMS Computer Vision. Outline. Outline.
AIMS Computer Vson 1 Matchng, ndexng, and search 2 Object category detecton 3 Vsual geometry 1/2: Camera models and trangulaton 4 Vsual geometry 2/2: Reconstructon from multple vews AIMS Computer vson
More informationLecture 9 Fitting and Matching
In ths lecture, we re gong to talk about a number of problems related to fttng and matchng. We wll formulate these problems formally and our dscusson wll nvolve Least Squares methods, RANSAC and Hough
More informationWhat are the camera parameters? Where are the light sources? What is the mapping from radiance to pixel color? Want to solve for 3D geometry
Today: Calbraton What are the camera parameters? Where are the lght sources? What s the mappng from radance to pel color? Why Calbrate? Want to solve for D geometry Alternatve approach Solve for D shape
More informationComputer Animation and Visualisation. Lecture 4. Rigging / Skinning
Computer Anmaton and Vsualsaton Lecture 4. Rggng / Sknnng Taku Komura Overvew Sknnng / Rggng Background knowledge Lnear Blendng How to decde weghts? Example-based Method Anatomcal models Sknnng Assume
More informationFitting: Voting and the Hough Transform
Fttng: Votng and the Hough Transform Thurs Sept 4 Krsten Grauman UT Austn Last tme What are groupng problems n vson? Inspraton from human percepton Gestalt propertes Bottom-up segmentaton va clusterng
More informationCS 534: Computer Vision Model Fitting
CS 534: Computer Vson Model Fttng Sprng 004 Ahmed Elgammal Dept of Computer Scence CS 534 Model Fttng - 1 Outlnes Model fttng s mportant Least-squares fttng Maxmum lkelhood estmaton MAP estmaton Robust
More informationA Robust Method for Estimating the Fundamental Matrix
Proc. VIIth Dgtal Image Computng: Technques and Applcatons, Sun C., Talbot H., Ourseln S. and Adraansen T. (Eds.), 0- Dec. 003, Sydney A Robust Method for Estmatng the Fundamental Matrx C.L. Feng and Y.S.
More informationA Comparison and Evaluation of Three Different Pose Estimation Algorithms In Detecting Low Texture Manufactured Objects
Clemson Unversty TgerPrnts All Theses Theses 12-2011 A Comparson and Evaluaton of Three Dfferent Pose Estmaton Algorthms In Detectng Low Texture Manufactured Objects Robert Krener Clemson Unversty, rkrene@clemson.edu
More informationFeature Reduction and Selection
Feature Reducton and Selecton Dr. Shuang LIANG School of Software Engneerng TongJ Unversty Fall, 2012 Today s Topcs Introducton Problems of Dmensonalty Feature Reducton Statstc methods Prncpal Components
More informationSLAM Summer School 2006 Practical 2: SLAM using Monocular Vision
SLAM Summer School 2006 Practcal 2: SLAM usng Monocular Vson Javer Cvera, Unversty of Zaragoza Andrew J. Davson, Imperal College London J.M.M Montel, Unversty of Zaragoza. josemar@unzar.es, jcvera@unzar.es,
More information3D Modeling Using Multi-View Images. Jinjin Li. A Thesis Presented in Partial Fulfillment of the Requirements for the Degree Master of Science
3D Modelng Usng Mult-Vew Images by Jnjn L A Thess Presented n Partal Fulfllment of the Requrements for the Degree Master of Scence Approved August by the Graduate Supervsory Commttee: Lna J. Karam, Char
More informationMachine Learning. K-means Algorithm
Macne Learnng CS 6375 --- Sprng 2015 Gaussan Mture Model GMM pectaton Mamzaton M Acknowledgement: some sldes adopted from Crstoper Bsop Vncent Ng. 1 K-means Algortm Specal case of M Goal: represent a data
More informationDiscriminative classifiers for object classification. Last time
Dscrmnatve classfers for object classfcaton Thursday, Nov 12 Krsten Grauman UT Austn Last tme Supervsed classfcaton Loss and rsk, kbayes rule Skn color detecton example Sldng ndo detecton Classfers, boostng
More informationPriority queues and heaps Professors Clark F. Olson and Carol Zander
Prorty queues and eaps Professors Clark F. Olson and Carol Zander Prorty queues A common abstract data type (ADT) n computer scence s te prorty queue. As you mgt expect from te name, eac tem n te prorty
More information2D Raster Graphics. Integer grid Sequential (left-right, top-down) scan. Computer Graphics
2D Graphcs 2D Raster Graphcs Integer grd Sequental (left-rght, top-down scan j Lne drawng A ver mportant operaton used frequentl, block dagrams, bar charts, engneerng drawng, archtecture plans, etc. curves
More informationEcient Computation of the Most Probable Motion from Fuzzy. Moshe Ben-Ezra Shmuel Peleg Michael Werman. The Hebrew University of Jerusalem
Ecent Computaton of the Most Probable Moton from Fuzzy Correspondences Moshe Ben-Ezra Shmuel Peleg Mchael Werman Insttute of Computer Scence The Hebrew Unversty of Jerusalem 91904 Jerusalem, Israel Emal:
More information3D vector computer graphics
3D vector computer graphcs Paolo Varagnolo: freelance engneer Padova Aprl 2016 Prvate Practce ----------------------------------- 1. Introducton Vector 3D model representaton n computer graphcs requres
More informationRange Data Registration Using Photometric Features
Range Data Regstraton Usng Photometrc Features Joon Kyu Seo, Gregory C. Sharp, and Sang Wook Lee Dept. of Meda Technology, Sogang Unversty, Seoul, Korea Dept. of Radaton Oncology, Massachusetts General
More informationSubspace clustering. Clustering. Fundamental to all clustering techniques is the choice of distance measure between data points;
Subspace clusterng Clusterng Fundamental to all clusterng technques s the choce of dstance measure between data ponts; D q ( ) ( ) 2 x x = x x, j k = 1 k jk Squared Eucldean dstance Assumpton: All features
More informationAngle-Independent 3D Reconstruction. Ji Zhang Mireille Boutin Daniel Aliaga
Angle-Independent 3D Reconstructon J Zhang Mrelle Boutn Danel Alaga Goal: Structure from Moton To reconstruct the 3D geometry of a scene from a set of pctures (e.g. a move of the scene pont reconstructon
More informationCS434a/541a: Pattern Recognition Prof. Olga Veksler. Lecture 15
CS434a/541a: Pattern Recognton Prof. Olga Veksler Lecture 15 Today New Topc: Unsupervsed Learnng Supervsed vs. unsupervsed learnng Unsupervsed learnng Net Tme: parametrc unsupervsed learnng Today: nonparametrc
More informationDetection of hand grasping an object from complex background based on machine learning co-occurrence of local image feature
Detecton of hand graspng an object from complex background based on machne learnng co-occurrence of local mage feature Shnya Moroka, Yasuhro Hramoto, Nobutaka Shmada, Tadash Matsuo, Yoshak Shra Rtsumekan
More informationMachine Learning: Algorithms and Applications
14/05/1 Machne Learnng: Algorthms and Applcatons Florano Zn Free Unversty of Bozen-Bolzano Faculty of Computer Scence Academc Year 011-01 Lecture 10: 14 May 01 Unsupervsed Learnng cont Sldes courtesy of
More informationCategorizing objects: of appearance
Categorzng objects: global and part-based models of appearance UT Austn Generc categorzaton problem 1 Challenges: robustness Realstc scenes are crowded, cluttered, have overlappng objects. Generc category
More informationMAPI Computer Vision
MAPI Computer Vision Multiple View Geometry In tis module we intend to present several tecniques in te domain of te 3D vision Manuel Joao University of Mino Dep Industrial Electronics - Applications -
More informationFinding Intrinsic and Extrinsic Viewing Parameters from a Single Realist Painting
Fndng Intrnsc and Extrnsc Vewng Parameters from a Sngle Realst Pantng Tadeusz Jordan 1, Davd G. Stork,3, Wa L. Khoo 1, and Zhgang Zhu 1 1 CUNY Cty College, Department of Computer Scence, Convent Avenue
More informationA Methodology for Document Image Dewarping Techniques Performance Evaluation
2009 0 Internatonal Conference on Document Analss and Recognton A Meodolog for Document Image Dewarpng Technques Performance Evaluaton N. Stamatopoulos, B. Gatos, I. Pratkaks Computatonal Intellgence Laborator,
More informationIMAGE MATCHING WITH SIFT FEATURES A PROBABILISTIC APPROACH
IMAGE MATCHING WITH SIFT FEATURES A PROBABILISTIC APPROACH Jyot Joglekar a, *, Shrsh S. Gedam b a CSRE, IIT Bombay, Doctoral Student, Mumba, Inda jyotj@tb.ac.n b Centre of Studes n Resources Engneerng,
More informationLECTURE : MANIFOLD LEARNING
LECTURE : MANIFOLD LEARNING Rta Osadchy Some sldes are due to L.Saul, V. C. Raykar, N. Verma Topcs PCA MDS IsoMap LLE EgenMaps Done! Dmensonalty Reducton Data representaton Inputs are real-valued vectors
More informationAn efficient method to build panoramic image mosaics
An effcent method to buld panoramc mage mosacs Pattern Recognton Letters vol. 4 003 Dae-Hyun Km Yong-In Yoon Jong-Soo Cho School of Electrcal Engneerng and Computer Scence Kyungpook Natonal Unv. Abstract
More informationVanishing Hull. Jinhui Hu, Suya You, Ulrich Neumann University of Southern California {jinhuihu,suyay,
Vanshng Hull Jnhu Hu Suya You Ulrch Neumann Unversty of Southern Calforna {jnhuhusuyay uneumann}@graphcs.usc.edu Abstract Vanshng ponts are valuable n many vson tasks such as orentaton estmaton pose recovery
More informationRecognizing Faces. Outline
Recognzng Faces Drk Colbry Outlne Introducton and Motvaton Defnng a feature vector Prncpal Component Analyss Lnear Dscrmnate Analyss !"" #$""% http://www.nfotech.oulu.f/annual/2004 + &'()*) '+)* 2 ! &
More informationImproved SIFT-Features Matching for Object Recognition
Improved SIFT-Features Matchng for Obect Recognton Fara Alhwarn, Chao Wang, Danela Rstć-Durrant, Axel Gräser Insttute of Automaton, Unversty of Bremen, FB / NW Otto-Hahn-Allee D-8359 Bremen Emals: {alhwarn,wang,rstc,ag}@at.un-bremen.de
More informationRobust Computation and Parametrization of Multiple View. Relations. Oxford University, OX1 3PJ. Gaussian).
Robust Computaton and Parametrzaton of Multple Vew Relatons Phl Torr and Andrew Zsserman Robotcs Research Group, Department of Engneerng Scence Oxford Unversty, OX1 3PJ. Abstract A new method s presented
More informationTakahiro ISHIKAWA Takahiro Ishikawa Takahiro Ishikawa Takeo KANADE
Takahro ISHIKAWA Takahro Ishkawa Takahro Ishkawa Takeo KANADE Monocular gaze estmaton s usually performed by locatng the pupls, and the nner and outer eye corners n the mage of the drver s head. Of these
More informationRecognition continued: discriminative classifiers
Recognton contnued: dscrmnatve classfers Tues Nov 17 Krsten Grauman UT Austn Announcements A5 out today, due Dec 2 1 Prevously Supervsed classfcaton Wndow-based generc object detecton basc ppelne boostng
More informationThe AVL Balance Condition. CSE 326: Data Structures. AVL Trees. The AVL Tree Data Structure. Is this an AVL Tree? Height of an AVL Tree
CSE : Data Structures AL Trees Neva Cernavsy Summer Te AL Balance Condton AL balance property: Left and rgt subtrees of every node ave egts dfferng by at most Ensures small dept ll prove ts by sowng tat
More informationCorner-Based Image Alignment using Pyramid Structure with Gradient Vector Similarity
Journal of Sgnal and Informaton Processng, 013, 4, 114-119 do:10.436/jsp.013.43b00 Publshed Onlne August 013 (http://www.scrp.org/journal/jsp) Corner-Based Image Algnment usng Pyramd Structure wth Gradent
More informationSupport Vector Machines
/9/207 MIST.6060 Busness Intellgence and Data Mnng What are Support Vector Machnes? Support Vector Machnes Support Vector Machnes (SVMs) are supervsed learnng technques that analyze data and recognze patterns.
More informationKFUPM. SE301: Numerical Methods Topic 8 Ordinary Differential Equations (ODEs) Lecture (Term 101) Section 04. Read
SE3: Numercal Metods Topc 8 Ordnar Dfferental Equatons ODEs Lecture 8-36 KFUPM Term Secton 4 Read 5.-5.4 6-7- C ISE3_Topc8L Outlne of Topc 8 Lesson : Introducton to ODEs Lesson : Talor seres metods Lesson
More informationUnsupervised Learning and Clustering
Unsupervsed Learnng and Clusterng Why consder unlabeled samples?. Collectng and labelng large set of samples s costly Gettng recorded speech s free, labelng s tme consumng 2. Classfer could be desgned
More informationComputer Vision I. Xbox Kinnect: Rectification. The Fundamental matrix. Stereo III. CSE252A Lecture 16. Example: forward motion
Xbox Knnect: Stereo III Depth map http://www.youtube.com/watch?v=7qrnwoo-8a CSE5A Lecture 6 Projected pattern http://www.youtube.com/watch?v=ceep7x-z4wy The Fundamental matrx Rectfcaton The eppolar constrant
More informationLecture 4: Principal components
/3/6 Lecture 4: Prncpal components 3..6 Multvarate lnear regresson MLR s optmal for the estmaton data...but poor for handlng collnear data Covarance matrx s not nvertble (large condton number) Robustness
More informationRecovering Camera Pose from Omni-directional Images
Recoveg Camera Pose from Omn-drectonal Images Ada S.K. WAN 1 Angus M.K. SIU 1 Rynson W.H. LAU 1,2 1 Department of Computer Scence, Cty Unversty of Hong Kong, Hong Kong 2 Department of CEIT, Cty Unversty
More informationImproving Initial Estimations for Structure from Motion Methods
Improvng Intal Estmatons for Structure from Moton Methods Chrstopher Schwartz Renhard Klen Insttute for Computer Scence II, Unversty of Bonn Abstract In Computer Graphcs as well as n Computer Vson and
More informationProgramming in Fortran 90 : 2017/2018
Programmng n Fortran 90 : 2017/2018 Programmng n Fortran 90 : 2017/2018 Exercse 1 : Evaluaton of functon dependng on nput Wrte a program who evaluate the functon f (x,y) for any two user specfed values
More informationTwo Dimensional Projective Point Matching
Two Dmensonal Projectve Pont Matchng Jason Denton & J. Ross Beverdge Colorado State Unversty Computer Scence Department Ft. Collns, CO 80523 denton@cs.colostate.edu Abstract Pont matchng s the task of
More informationLocal features and image matching May 8 th, 2018
Local features and image matcing May 8 t, 2018 Yong Jae Lee UC Davis Last time RANSAC for robust fitting Lines, translation Image mosaics Fitting a 2D transformation Homograpy 2 Today Mosaics recap: How
More information3D Rigid Facial Motion Estimation from Disparity Maps
3D Rgd Facal Moton Estmaton from Dsparty Maps N. Pérez de la Blanca 1, J.M. Fuertes 2, and M. Lucena 2 1 Department of Computer Scence and Artfcal Intellgence ETSII. Unversty of Granada, 1871 Granada,
More informationRECONSTRUCTION OF 3D TUBULAR STRUCTURES FROM CONE-BEAM PROJECTIONS
RECONSTRUCTION OF 3D TUBULAR STRUCTURES FROM CONE-BEAM PROJECTIONS Ja L Dept. of Elect. and Comp. Engrg. Oakland Unversty Rochester, MI 48309, USA Laurent Cohen CEREMADE Unversty Pars - Dauphne 75775 Pars
More informationModel Fitting מבוסס על שיעור שנבנה ע"י טל הסנר
Model Fttng מבוסס על שיעור שנבנה ע"י טל הסנר מקורות מפוזר על פני ספר הלימוד... Fttng: Motvaton We ve learned how to detect edges, corners, blobs. Now what? We would lke to form a hgher-level, more compact
More informationNew dynamic zoom calibration technique for a stereo-vision based multi-view 3D modeling system
New dynamc oom calbraton technque for a stereo-vson based mult-vew 3D modelng system Tao Xan, Soon-Yong Park, Mural Subbarao Dept. of Electrcal & Computer Engneerng * State Unv. of New York at Stony Brook,
More informationFace Recognition University at Buffalo CSE666 Lecture Slides Resources:
Face Recognton Unversty at Buffalo CSE666 Lecture Sldes Resources: http://www.face-rec.org/algorthms/ Overvew of face recognton algorthms Correlaton - Pxel based correspondence between two face mages Structural
More informationDetection of an Object by using Principal Component Analysis
Detecton of an Object by usng Prncpal Component Analyss 1. G. Nagaven, 2. Dr. T. Sreenvasulu Reddy 1. M.Tech, Department of EEE, SVUCE, Trupath, Inda. 2. Assoc. Professor, Department of ECE, SVUCE, Trupath,
More informationImage Representation & Visualization Basic Imaging Algorithms Shape Representation and Analysis. outline
mage Vsualzaton mage Vsualzaton mage Representaton & Vsualzaton Basc magng Algorthms Shape Representaton and Analyss outlne mage Representaton & Vsualzaton Basc magng Algorthms Shape Representaton and
More informationMOTION PANORAMA CONSTRUCTION FROM STREAMING VIDEO FOR POWER- CONSTRAINED MOBILE MULTIMEDIA ENVIRONMENTS XUNYU PAN
MOTION PANORAMA CONSTRUCTION FROM STREAMING VIDEO FOR POWER- CONSTRAINED MOBILE MULTIMEDIA ENVIRONMENTS by XUNYU PAN (Under the Drecton of Suchendra M. Bhandarkar) ABSTRACT In modern tmes, more and more
More informationEVALUATION OF RELATIVE POSE ESTIMATION METHODS FOR MULTI-CAMERA SETUPS
EVALUAION OF RELAIVE POSE ESIMAION MEHODS FOR MULI-CAMERA SEUPS Volker Rodehorst *, Matthas Henrchs and Olaf Hellwch Computer Vson & Remote Sensng, Berln Unversty of echnology, Franklnstr. 8/9, FR 3-,
More informationGraph-based Clustering
Graphbased Clusterng Transform the data nto a graph representaton ertces are the data ponts to be clustered Edges are eghted based on smlarty beteen data ponts Graph parttonng Þ Each connected component
More informationS1 Note. Basis functions.
S1 Note. Bass functons. Contents Types of bass functons...1 The Fourer bass...2 B-splne bass...3 Power and type I error rates wth dfferent numbers of bass functons...4 Table S1. Smulaton results of type
More informationStabilization of infra-red aerial image sequences using robust estimation
Stablzaton of nfra-red aeral mage sequences usng robust estmaton Danel McRenolds, Pascal Marchand and Yunlong Sheng COP, aval Unverst, Ste-Fo, Qc, G1K 7P4, Canada éandre Sévgn Defence Research Establshment
More informationA Fast Visual Tracking Algorithm Based on Circle Pixels Matching
A Fast Vsual Trackng Algorthm Based on Crcle Pxels Matchng Zhqang Hou hou_zhq@sohu.com Chongzhao Han czhan@mal.xjtu.edu.cn Ln Zheng Abstract: A fast vsual trackng algorthm based on crcle pxels matchng
More informationComputer Vision. Exercise Session 1. Institute of Visual Computing
Computer Vson Exercse Sesson 1 Organzaton Teachng assstant Basten Jacquet CAB G81.2 basten.jacquet@nf.ethz.ch Federco Camposeco CNB D12.2 fede@nf.ethz.ch Lecture webpage http://www.cvg.ethz.ch/teachng/compvs/ndex.php
More informationAmnon Shashua Shai Avidan Michael Werman. The Hebrew University, objects.
Trajectory Trangulaton over Conc Sectons Amnon Shashua Sha Avdan Mchael Werman Insttute of Computer Scence, The Hebrew Unversty, Jerusalem 91904, Israel e-mal: fshashua,avdan,wermang@cs.huj.ac.l Abstract
More informationSVM-based Learning for Multiple Model Estimation
SVM-based Learnng for Multple Model Estmaton Vladmr Cherkassky and Yunqan Ma Department of Electrcal and Computer Engneerng Unversty of Mnnesota Mnneapols, MN 55455 {cherkass,myq}@ece.umn.edu Abstract:
More informationSequential search. Building Java Programs Chapter 13. Sequential search. Sequential search
Sequental search Buldng Java Programs Chapter 13 Searchng and Sortng sequental search: Locates a target value n an array/lst by examnng each element from start to fnsh. How many elements wll t need to
More informationA Scalable Projective Bundle Adjustment Algorithm using the L Norm
Sxth Indan Conference on Computer Vson, Graphcs & Image Processng A Scalable Projectve Bundle Adjustment Algorthm usng the Norm Kaushk Mtra and Rama Chellappa Dept. of Electrcal and Computer Engneerng
More informationA Bilinear Model for Sparse Coding
A Blnear Model for Sparse Codng Davd B. Grmes and Rajesh P. N. Rao Department of Computer Scence and Engneerng Unversty of Washngton Seattle, WA 98195-2350, U.S.A. grmes,rao @cs.washngton.edu Abstract
More informationRobust Recovery of Camera Rotation from Three Frames. B. Rousso S. Avidan A. Shashua y S. Peleg z. The Hebrew University of Jerusalem
Robust Recovery of Camera Rotaton from Three Frames B. Rousso S. Avdan A. Shashua y S. Peleg z Insttute of Computer Scence The Hebrew Unversty of Jerusalem 994 Jerusalem, Israel e-mal : roussocs.huj.ac.l
More informationFeature Extraction and Registration An Overview
Feature Extracton and Regstraton An Overvew S. Seeger, X. Laboureux Char of Optcs, Unversty of Erlangen-Nuremberg, Staudstrasse 7/B2, 91058 Erlangen, Germany Emal: sns@undne.physk.un-erlangen.de, xl@undne.physk.un-erlangen.de
More informationCorrespondence-free Synchronization and Reconstruction in a Non-rigid Scene
Correspondence-free Synchronzaton and Reconstructon n a Non-rgd Scene Lor Wolf and Assaf Zomet School of Computer Scence and Engneerng, The Hebrew Unversty, Jerusalem 91904, Israel e-mal: {lwolf,zomet}@cs.huj.ac.l
More informationAutomatic Recognition and Location of Civil Infrastructure Objects Using Mobile Mapping Technology, Neural Network and Markov Chain Monte Carlo
Automatc Recognton and Locaton of Cvl Infrastructure Objects Usng Moble Mappng Technology, Neural Network and Markov Chan Monte Carlo by Ron L Zhuowen Tu Report No. 457 Geodetc Scence and Surveyng Department
More informationUnsupervised Learning and Clustering
Unsupervsed Learnng and Clusterng Supervsed vs. Unsupervsed Learnng Up to now we consdered supervsed learnng scenaro, where we are gven 1. samples 1,, n 2. class labels for all samples 1,, n Ths s also
More informationn others; multple brghtness values n one mage may map to a sngle brghtness value n the other mage, and vce versa. In other words, the two mages are us
Robust Mult-Sensor Image Algnment Mchal Iran Dept. of Appled Math and CS The Wezmann Insttute of Scence 76100 Rehovot, Israel P. Anandan Mcrosoft Corporaton One Mcrosoft Way Redmond, WA 98052, USA Abstract
More informationBarycentric Coordinates. From: Mean Value Coordinates for Closed Triangular Meshes by Ju et al.
Barycentrc Coordnates From: Mean Value Coordnates for Closed Trangular Meshes by Ju et al. Motvaton Data nterpolaton from the vertces of a boundary polygon to ts nteror Boundary value problems Shadng Space
More informationData Mining: Model Evaluation
Data Mnng: Model Evaluaton Aprl 16, 2013 1 Issues: Evaluatng Classfcaton Methods Accurac classfer accurac: predctng class label predctor accurac: guessng value of predcted attrbutes Speed tme to construct
More informationCourse Introduction. Algorithm 8/31/2017. COSC 320 Advanced Data Structures and Algorithms. COSC 320 Advanced Data Structures and Algorithms
Course Introducton Course Topcs Exams, abs, Proects A quc loo at a few algorthms 1 Advanced Data Structures and Algorthms Descrpton: We are gong to dscuss algorthm complexty analyss, algorthm desgn technques
More informationNew Extensions of the 3-Simplex for Exterior Orientation
New Extensons of the 3-Smplex for Exteror Orentaton John M. Stenbs Tyrone L. Vncent Wllam A. Hoff Colorado School of Mnes jstenbs@gmal.com tvncent@mnes.edu whoff@mnes.edu Abstract Object pose may be determned
More informationCost-efficient deployment of distributed software services
1/30 Cost-effcent deployment of dstrbuted software servces csorba@tem.ntnu.no 2/30 Short ntroducton & contents Cost-effcent deployment of dstrbuted software servces Cost functons Bo-nspred decentralzed
More informationEECS 730 Introduction to Bioinformatics Sequence Alignment. Luke Huan Electrical Engineering and Computer Science
EECS 730 Introducton to Bonformatcs Sequence Algnment Luke Huan Electrcal Engneerng and Computer Scence http://people.eecs.ku.edu/~huan/ HMM Π s a set of states Transton Probabltes a kl Pr( l 1 k Probablty
More information