Local features and image matching May 8 th, 2018
|
|
- Abigail Harper
- 5 years ago
- Views:
Transcription
1 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 to warp one image to te oter, given H? How to detect wic features to matc? 3 1
2 Motivation for feature-based alignment: Image mosaics Image from ttp://grapics.cs.cmu.edu/courses/15-463/2010_fall/ 4 Projective Transformations x' a y' d w' g b e Projective transformations: Affine transformations, and Projective warps c x f y i w Parallel lines do not necessarily remain parallel 5 How to stitc togeter a panorama (a.k.a. mosaic)? Basic Procedure Take a sequence of images from te same position Rotate te camera about its optical center Compute transformation between second image and first Transform te second image to overlap wit te first Blend te two togeter to create a mosaic (If tere are more images, repeat) 6 Source: Steve Seitz 2
3 Mosaics... image from S. Seitz Obtain a wider angle view by combining multiple images. 7 How to stitc togeter a panorama (a.k.a. mosaic)? Basic Procedure Take a sequence of images from te same position Rotate te camera about its optical center Compute transformation between second image and first Transform te second image to overlap wit te first Blend te two togeter to create a mosaic (If tere are more images, repeat) but wait, wy sould tis work at all? Wat about te 3D geometry of te scene? Wy aren t we using it? 8 Source: Steve Seitz Image reprojection Basic question How to relate two images from te same camera center? ow to map a pixel from PP1 to PP2 Answer Cast a ray troug eac pixel in PP1 Draw te pixel were tat ray intersects PP2 Observation: Rater tan tinking of tis as a 3D reprojection, tink of it as a 2D image warp from one image to anoter. PP1 PP2 9 Source: Alyosa Efros 3
4 Image reprojection: Homograpy A projective transform is a mapping between any two PPs wit te same center of projection rectangle sould map to arbitrary quadrilateral parallel lines aren t preserved but must preserve straigt lines called Homograpy PP2 wx' * * wy' * * w * * p H * x * y * 1 p PP1 10 Source: Alyosa Efros Homograpy x1, y 1 x1, y 1 x2, y 2 x 2, y 2 x, x, n y n n y n To compute te omograpy given pairs of corresponding points in te images, we need to set up an equation were te parameters of H are te unknowns 11 Solving for omograpies Defined up to a scale factor. Constrain Frobenius norm of H to be 1. Problem to be solved: p = Hp wx' wy' w x 12 y 22 1 min A b 2 s.t. 1 were vector of unknowns = [ 00, 01, 02, 10, 11, 12, 20, 21, 22 ] T 2 Adapted from Devi Parik 12 4
5 Solving for omograpies wx i' wy i' w xi 12 yi 22 1 Tere are 9 variables 00,, 22. Are tere 9 degrees of freedom? No. We can multiply all ij by nonzero scalar k witout canging te equations: 13 Enforcing 8 DOF Impose unit vector constraint Subject to: 14 Solving for omograpies wx i' wy i' w xi 12 yi
6 Solving for omograpies A 0 2n 9 9 2n Defines a least squares problem: Since is only defined up to scale, solve for unit vector ĥ Solution: ĥ = eigenvector of A T A wit smallest eigenvalue Works wit 4 or more points ( i. e., 2 1) 16 Projective: # correspondences? T(x,y) y y x x? How many correspondences needed for projective? Source: Alyosa Efros 17 x, Homograpy y wx wy w, w x, y To apply a given omograpy H Compute p = Hp (regular matrix multiply) Convert p from omogeneous to image coordinates wx' * wy' * w * p * * x * * y * * 1 Slide credit: Kristen Grauman 18 H p 6
7 Image warping T(x,y) y y x f(x,y) x g(x,y ) Given a coordinate transform and a source image f(x,y), ow do we compute a transformed image g(x,y ) = f(t(x,y))? Slide from Alyosa Efros, CMU 19 Forward warping T(x,y) y y x f(x,y) x g(x,y ) Send eac pixel f(x,y) to its corresponding location (x,y ) = T(x,y) in te second image Q: wat if pixel lands between two pixels? Slide from Alyosa Efros, CMU 20 Forward warping T(x,y) y y x f(x,y) x g(x,y ) Send eac pixel f(x,y) to its corresponding location (x,y ) = T(x,y) in te second image Q: wat if pixel lands between two pixels? A: distribute color among neigboring pixels (x,y ) Known as splatting Slide from Alyosa Efros, CMU 21 7
8 Inverse warping y T -1 (x,y) y x f(x,y) x g(x,y ) Get eac pixel g(x,y ) from its corresponding location (x,y) =T -1 (x,y ) in te first image Q: wat if pixel comes from between two pixels? Slide from Alyosa Efros, CMU 22 Inverse warping y T -1 (x,y) y x f(x,y) x g(x,y ) Get eac pixel g(x,y ) from its corresponding location (x,y) =T -1 (x,y ) in te first image Q: wat if pixel comes from between two pixels? A: Interpolate color value from neigbors nearest neigbor, bilinear Slide from Alyosa Efros, CMU 23 Bilinear interpolation Sampling at f(x,y): Slide from Alyosa Efros, CMU 24 8
9 Image warping wit omograpies image plane in front black area were no pixel maps to image plane below 25 Source: Steve Seitz Image rectification p p 26 Analysing patterns and sapes Wat is te sape of te b/w floor pattern? Te floor (enlarged) Slide from Antonio Criminisi Automatically 27 rectified floor 9
10 Analysing patterns and sapes Automatic rectification From Martin Kemp Te Science of Art (manual reconstruction) Slide from Antonio Criminisi 28 Canging camera center Does it still work? syntetic PP PP1 PP2 29 Source: Alyosa Efros Recall: same camera center real camera syntetic camera Can generate syntetic camera view as long as it as te same center of projection. 30 Source: Alyosa Efros 10
11 Or: Planar scene (or far away) PP3 PP1 PP2 PP3 is a projection plane of bot centers of projection, so we are OK! Tis is ow big aerial potograps are made 31 Source: Alyosa Efros 32 RANSAC for estimating omograpy RANSAC loop: 1. Select four feature pairs (at random) 2. Compute omograpy H (exact) 3. Compute inliers were SSD(p i, Hp i )< ε 4. Keep largest set of inliers 5. Re-compute least-squares H estimate on all of te inliers 33 Slide credit: Steve Seitz 11
12 Robust feature-based alignment 34 Source: L. Lazebnik Robust feature-based alignment Extract features 35 Source: L. Lazebnik Robust feature-based alignment Extract features Compute putative matces 36 Source: L. Lazebnik 12
13 Robust feature-based alignment Extract features Compute putative matces Loop: Hypotesize transformation T (small group of putative matces tat are related by T) 37 Source: L. Lazebnik Robust feature-based alignment Extract features Compute putative matces Loop: Hypotesize transformation T (small group of putative matces tat are related by T) Verify transformation (searc for oter matces consistent wit T) 38 Source: L. Lazebnik Robust feature-based alignment Extract features Compute putative matces Loop: Hypotesize transformation T (small group of putative matces tat are related by T) Verify transformation (searc for oter matces consistent wit T) 39 Source: L. Lazebnik 13
14 Summary: alignment & warping Write 2d transformations as matrix-vector multiplication (including translation wen we use omogeneous coordinates) Fitting transformations: solve for unknown parameters given corresponding points from two views (affine, projective (omograpy)). Perform image warping (inverse) Mosaics: uses omograpy and image warping to merge views taken from same center of projection. 40 Creating and Exploring a Large Potorealistic Virtual Space Josef Sivic, Biliana Kaneva, Antonio Torralba, Sai Avidan and William T. Freeman, Internet Vision Worksop, CVPR ttp:// 41 Creating and Exploring a Large Potorealistic Virtual Space Current view, and desired view in green Syntesized view from new camera Induced camera motion 42 14
15 Today Mosaics recap: How to warp one image to te oter, given H? How to detect wic features to matc? 43 Detecting local invariant features Detection of interest points Harris corner detection (Scale invariant blob detection: LoG) (Next time: description of local patces) 44 Local features: main components 1) Detection: Identify te interest points 2) Description: Extract vector feature descriptor surrounding eac interest point. (1) x [ x,, x (1) 1 1 d ] 3) Matcing: Determine correspondence between descriptors in two views (2) x [ x,, x (2) 2 1 d 45 ] Kristen Grauman 15
16 Local features: desired properties Repeatability Te same feature can be found in several images despite geometric and potometric transformations Saliency Eac feature as a distinctive description Compactness and efficiency Many fewer features tan image pixels Locality A feature occupies a relatively small area of te image; robust to clutter and occlusion 46 Applications Local features ave be used for: Image alignment 3D reconstruction Motion tracking Robot navigation Indexing and database retrieval Object recognition Lana Lazebnik 47 A ard feature matcing problem NASA Mars Rover images 48 16
17 Answer below (look for tiny colored squares ) NASA Mars Rover images wit SIFT feature matces Figure by Noa Snavely 49 Goal: interest operator repeatability We want to detect (at least some of) te same points in bot images. No cance to find true matces! Yet we ave to be able to run te detection procedure independently per image. 50 Goal: descriptor distinctiveness We want to be able to reliably determine wic point goes wit wic.? Must provide some invariance to geometric and potometric differences between te two views
18 Local features: main components 1) Detection: Identify te interest points 2) Description:Extract vector feature descriptor surrounding eac interest point. 3) Matcing: Determine correspondence between descriptors in two views 52 Wat points would you coose (for repeatability, distinctiveness)? 53 Corners as distinctive interest points We sould easily recognize te point by looking troug a small window Sifting a window in any direction sould give a large cange in intensity flat region: no cange in all directions Slide credit: Alyosa Efros, Darya Frolova, Denis Simakov edge : no cange along te edge direction corner : significant cange in all directions 54 18
19 Corners as distinctive interest points M I xi x I x I y I x I y I y I y 2 x 2 matrix of image derivatives (averaged in neigborood of a point). Notation: I x I x I y I y I I x y I I x y 55 Wat does tis matrix reveal? First, consider an axis-aligned corner: 56 Wat does tis matrix reveal? First, consider an axis-aligned corner: M 2 I x I xi y I xi y 1 2 I y Tis means dominant gradient directions align wit x or y axis Look for locations were bot λ s are large. If eiter λ is close to 0, ten tis is not corner-like. Wat if we ave a corner tat is not aligned wit te 57 image axes? 19
20 Wat does tis matrix reveal? Since M is symmetric, we ave (Eigenvalue decomposition) 1 M X 0 Mx x i i i 0 X 2 T Te eigenvalues of M reveal te amount of intensity cange in te two principal ortogonal gradient directions in te window. 58 Corner response function edge : 1 >> 2 2 >> 1 corner : 1 and 2 are large, 1 ~ 2 ; flat region 1 and 2 are small; 59 Harris corner detector 1) Compute M matrix for eac image window to get teir cornerness scores. 2) Find points wose surrounding window gave large corner response (f > tresold) 3) Take te points of local maxima, i.e., perform non-maximum suppression 60 20
21 Example of Harris application 61 Kristen Grauman Example of Harris application Compute corner response at every pixel. 62 Kristen Grauman Example of Harris application 63 Kristen Grauman 21
22 Properties of te Harris corner detector Rotation invariant? Yes 64 Properties of te Harris corner detector Rotation invariant? Yes Translation invariant? Yes 65 Properties of te Harris corner detector Rotation invariant? Yes Translation invariant? Yes Scale invariant? No All points will be classified as edges Corner! 66 22
23 Summary Image warping to create mosaic, given omograpy Interest point detection Harris corner detector Next time: Laplacian of Gaussian, automatic scale selection 67 23
Image warping and stitching
Image warping and stitching May 4 th, 2017 Yong Jae Lee UC Davis Last time Interactive segmentation Feature-based alignment 2D transformations Affine fit RANSAC 2 Alignment problem In alignment, we will
More informationImage warping and stitching
Image warping and stitching May 5 th, 2015 Yong Jae Lee UC Davis PS2 due next Friday Announcements 2 Last time Interactive segmentation Feature-based alignment 2D transformations Affine fit RANSAC 3 Alignment
More informationImage warping and stitching
Image warping and stitching Thurs Oct 15 Last time Feature-based alignment 2D transformations Affine fit RANSAC 1 Robust feature-based alignment Extract features Compute putative matches Loop: Hypothesize
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 informationLocal features: detection and description. Local invariant features
Local features: detection and description Local invariant features Detection of interest points Harris corner detection Scale invariant blob detection: LoG Description of local patches SIFT : Histograms
More informationLocal features: detection and description May 12 th, 2015
Local features: detection and description May 12 th, 2015 Yong Jae Lee UC Davis Announcements PS1 grades up on SmartSite PS1 stats: Mean: 83.26 Standard Dev: 28.51 PS2 deadline extended to Saturday, 11:59
More informationLocal features and image matching. Prof. Xin Yang HUST
Local features and image matching Prof. Xin Yang HUST Last time RANSAC for robust geometric transformation estimation Translation, Affine, Homography Image warping Given a 2D transformation T and a source
More informationN-Views (1) Homographies and Projection
CS 4495 Computer Vision N-Views (1) Homographies and Projection Aaron Bobick School of Interactive Computing Administrivia PS 2: Get SDD and Normalized Correlation working for a given windows size say
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 informationMidterm Wed. Local features: detection and description. Today. Last time. Local features: main components. Goal: interest operator repeatability
Midterm Wed. Local features: detection and description Monday March 7 Prof. UT Austin Covers material up until 3/1 Solutions to practice eam handed out today Bring a 8.5 11 sheet of notes if you want Review
More informationCS5670: Computer Vision
CS5670: Computer Vision Noah Snavely Lecture 4: Harris corner detection Szeliski: 4.1 Reading Announcements Project 1 (Hybrid Images) code due next Wednesday, Feb 14, by 11:59pm Artifacts due Friday, Feb
More informationAutomatic Image Alignment (feature-based)
Automatic Image Alignment (feature-based) Mike Nese with a lot of slides stolen from Steve Seitz and Rick Szeliski 15-463: Computational Photography Alexei Efros, CMU, Fall 2006 Today s lecture Feature
More informationImage Warping and Mosacing
Image Warping and Mosacing 15-463: Rendering and Image Processing Alexei Efros with a lot of slides stolen from Steve Seitz and Rick Szeliski Today Mosacs Image Warping Homographies Programming Assignment
More informationMosaics. Today s Readings
Mosaics VR Seattle: http://www.vrseattle.com/ Full screen panoramas (cubic): http://www.panoramas.dk/ Mars: http://www.panoramas.dk/fullscreen3/f2_mars97.html Today s Readings Szeliski and Shum paper (sections
More informationCS6670: Computer Vision
CS6670: Computer Vision Noah Snavely Lecture 7: Image Alignment and Panoramas What s inside your fridge? http://www.cs.washington.edu/education/courses/cse590ss/01wi/ Projection matrix intrinsics projection
More informationImage Features. Work on project 1. All is Vanity, by C. Allan Gilbert,
Image Features Work on project 1 All is Vanity, by C. Allan Gilbert, 1873-1929 Feature extrac*on: Corners and blobs c Mo*va*on: Automa*c panoramas Credit: Ma9 Brown Why extract features? Mo*va*on: panorama
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 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 informationImage Stitching. Slides from Rick Szeliski, Steve Seitz, Derek Hoiem, Ira Kemelmacher, Ali Farhadi
Image Stitching Slides from Rick Szeliski, Steve Seitz, Derek Hoiem, Ira Kemelmacher, Ali Farhadi Combine two or more overlapping images to make one larger image Add example Slide credit: Vaibhav Vaish
More informationHarder case. Image matching. Even harder case. Harder still? by Diva Sian. by swashford
Image matching Harder case by Diva Sian by Diva Sian by scgbt by swashford Even harder case Harder still? How the Afghan Girl was Identified by Her Iris Patterns Read the story NASA Mars Rover images Answer
More informationLecture: RANSAC and feature detectors
Lecture: RANSAC and feature detectors Juan Carlos Niebles and Ranjay Krishna Stanford Vision and Learning Lab 1 What we will learn today? A model fitting method for edge detection RANSAC Local invariant
More informationEdge and corner detection
Edge and corner detection Prof. Stricker Doz. G. Bleser Computer Vision: Object and People Tracking Goals Where is the information in an image? How is an object characterized? How can I find measurements
More informationFeature Matching and RANSAC
Feature Matching and RANSAC Recognising Panoramas. [M. Brown and D. Lowe,ICCV 2003] [Brown, Szeliski, Winder, CVPR 2005] with a lot of slides stolen from Steve Seitz, Rick Szeliski, A. Efros Introduction
More informationLocal invariant features
Local invariant features Tuesday, Oct 28 Kristen Grauman UT-Austin Today Some more Pset 2 results Pset 2 returned, pick up solutions Pset 3 is posted, due 11/11 Local invariant features Detection of interest
More informationWikipedia - Mysid
Wikipedia - Mysid Erik Brynjolfsson, MIT Filtering Edges Corners Feature points Also called interest points, key points, etc. Often described as local features. Szeliski 4.1 Slides from Rick Szeliski,
More informationImage matching. Announcements. Harder case. Even harder case. Project 1 Out today Help session at the end of class. by Diva Sian.
Announcements Project 1 Out today Help session at the end of class Image matching by Diva Sian by swashford Harder case Even harder case How the Afghan Girl was Identified by Her Iris Patterns Read the
More informationAutomatic Image Alignment
Automatic Image Alignment Mike Nese with a lot of slides stolen from Steve Seitz and Rick Szeliski 15-463: Computational Photography Alexei Efros, CMU, Fall 2010 Live Homography DEMO Check out panoramio.com
More informationHarder case. Image matching. Even harder case. Harder still? by Diva Sian. by swashford
Image matching Harder case by Diva Sian by Diva Sian by scgbt by swashford Even harder case Harder still? How the Afghan Girl was Identified by Her Iris Patterns Read the story NASA Mars Rover images Answer
More information2D transformations Homogeneous coordinates. Uses of Transformations
2D transformations omogeneous coordinates Uses of Transformations Modeling: position and resize parts of a complex model; Viewing: define and position te virtual camera Animation: define ow objects move/cange
More informationAutomatic Image Alignment
Automatic Image Alignment with a lot of slides stolen from Steve Seitz and Rick Szeliski Mike Nese CS194: Image Manipulation & Computational Photography Alexei Efros, UC Berkeley, Fall 2018 Live Homography
More informationLecture 6: Finding Features (part 1/2)
Lecture 6: Finding Features (part 1/2) Dr. Juan Carlos Niebles Stanford AI Lab Professor Stanford Vision Lab 1 What we will learn today? Local invariant features MoOvaOon Requirements, invariances Keypoint
More informationCS4670: Computer Vision
CS4670: Computer Vision Noah Snavely Lecture 9: Image alignment http://www.wired.com/gadgetlab/2010/07/camera-software-lets-you-see-into-the-past/ Szeliski: Chapter 6.1 Reading All 2D Linear Transformations
More informationLocal Feature Detectors
Local Feature Detectors Selim Aksoy Department of Computer Engineering Bilkent University saksoy@cs.bilkent.edu.tr Slides adapted from Cordelia Schmid and David Lowe, CVPR 2003 Tutorial, Matthew Brown,
More informationWarping. 12 May 2015
Warping 12 May 2015 Warping, morphing, mosaic Slides from Durand and Freeman (MIT), Efros (CMU, Berkeley), Szeliski (MSR), Seitz (UW), Lowe (UBC) http://szeliski.org/book/ 2 Image Warping Image filtering:
More informationCS 1674: Intro to Computer Vision. Midterm Review. Prof. Adriana Kovashka University of Pittsburgh October 10, 2016
CS 1674: Intro to Computer Vision Midterm Review Prof. Adriana Kovashka University of Pittsburgh October 10, 2016 Reminders The midterm exam is in class on this coming Wednesday There will be no make-up
More informationFeature Based Registration - Image Alignment
Feature Based Registration - Image Alignment Image Registration Image registration is the process of estimating an optimal transformation between two or more images. Many slides from Alexei Efros http://graphics.cs.cmu.edu/courses/15-463/2007_fall/463.html
More informationBSB663 Image Processing Pinar Duygulu. Slides are adapted from Selim Aksoy
BSB663 Image Processing Pinar Duygulu Slides are adapted from Selim Aksoy Image matching Image matching is a fundamental aspect of many problems in computer vision. Object or scene recognition Solving
More informationEpipolar Geometry and Stereo Vision
CS 1699: Intro to Computer Vision Epipolar Geometry and Stereo Vision Prof. Adriana Kovashka University of Pittsburgh October 8, 2015 Today Review Projective transforms Image stitching (homography) Epipolar
More informationSIFT: SCALE INVARIANT FEATURE TRANSFORM SURF: SPEEDED UP ROBUST FEATURES BASHAR ALSADIK EOS DEPT. TOPMAP M13 3D GEOINFORMATION FROM IMAGES 2014
SIFT: SCALE INVARIANT FEATURE TRANSFORM SURF: SPEEDED UP ROBUST FEATURES BASHAR ALSADIK EOS DEPT. TOPMAP M13 3D GEOINFORMATION FROM IMAGES 2014 SIFT SIFT: Scale Invariant Feature Transform; transform image
More informationMosaics wrapup & Stereo
Mosaics wrapup & Stereo Tues Oct 20 Last time: How to stitch a panorama? Basic Procedure Take a sequence of images from the same position Rotate the camera about its optical center Compute transformation
More informationProf. Feng Liu. Spring /26/2017
Prof. Feng Liu Spring 2017 http://www.cs.pdx.edu/~fliu/courses/cs510/ 04/26/2017 Last Time Re-lighting HDR 2 Today Panorama Overview Feature detection Mid-term project presentation Not real mid-term 6
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 informationAnnouncements. Mosaics. Image Mosaics. How to do it? Basic Procedure Take a sequence of images from the same position =
Announcements Project 2 out today panorama signup help session at end of class Today mosaic recap blending Mosaics Full screen panoramas (cubic): http://www.panoramas.dk/ Mars: http://www.panoramas.dk/fullscreen3/f2_mars97.html
More informationLecture 16: Computer Vision
CS4442/9542b: Artificial Intelligence II Prof. Olga Veksler Lecture 16: Computer Vision Motion Slides are from Steve Seitz (UW), David Jacobs (UMD) Outline Motion Estimation Motion Field Optical Flow Field
More informationLocal Features: Detection, Description & Matching
Local Features: Detection, Description & Matching Lecture 08 Computer Vision Material Citations Dr George Stockman Professor Emeritus, Michigan State University Dr David Lowe Professor, University of British
More informationLecture 16: Computer Vision
CS442/542b: Artificial ntelligence Prof. Olga Veksler Lecture 16: Computer Vision Motion Slides are from Steve Seitz (UW), David Jacobs (UMD) Outline Motion Estimation Motion Field Optical Flow Field Methods
More information4.2 The Derivative. f(x + h) f(x) lim
4.2 Te Derivative Introduction In te previous section, it was sown tat if a function f as a nonvertical tangent line at a point (x, f(x)), ten its slope is given by te it f(x + ) f(x). (*) Tis is potentially
More informationCEE598 - Visual Sensing for Civil Infrastructure Eng. & Mgmt.
CEE598 - Visual Sensing for Civil Infrastructure Eng. & Mgmt. Section 10 - Detectors part II Descriptors Mani Golparvar-Fard Department of Civil and Environmental Engineering 3129D, Newmark Civil Engineering
More informationCS4670: Computer Vision
CS4670: Computer Vision Noah Snavely Lecture 6: Feature matching and alignment Szeliski: Chapter 6.1 Reading Last time: Corners and blobs Scale-space blob detector: Example Feature descriptors We know
More informationImage warping , , Computational Photography Fall 2017, Lecture 10
Image warping http://graphics.cs.cmu.edu/courses/15-463 15-463, 15-663, 15-862 Computational Photography Fall 2017, Lecture 10 Course announcements Second make-up lecture on Friday, October 6 th, noon-1:30
More information2 The Derivative. 2.0 Introduction to Derivatives. Slopes of Tangent Lines: Graphically
2 Te Derivative Te two previous capters ave laid te foundation for te study of calculus. Tey provided a review of some material you will need and started to empasize te various ways we will view and use
More informationAnnouncements. Mosaics. How to do it? Image Mosaics
Announcements Mosaics Project artifact voting Project 2 out today (help session at end of class) http://www.destination36.com/start.htm http://www.vrseattle.com/html/vrview.php?cat_id=&vrs_id=vrs38 Today
More informationStitching and Blending
Stitching and Blending Kari Pulli VP Computational Imaging Light First project Build your own (basic) programs panorama HDR (really, exposure fusion) The key components register images so their features
More informationTwo Modifications of Weight Calculation of the Non-Local Means Denoising Method
Engineering, 2013, 5, 522-526 ttp://dx.doi.org/10.4236/eng.2013.510b107 Publised Online October 2013 (ttp://www.scirp.org/journal/eng) Two Modifications of Weigt Calculation of te Non-Local Means Denoising
More informationStructure from Motion
11/18/11 Structure from Motion Computer Vision CS 143, Brown James Hays Many slides adapted from Derek Hoiem, Lana Lazebnik, Silvio Saverese, Steve Seitz, and Martial Hebert This class: structure from
More informationBias-Variance Trade-off (cont d) + Image Representations
CS 275: Machine Learning Bias-Variance Trade-off (cont d) + Image Representations Prof. Adriana Kovashka University of Pittsburgh January 2, 26 Announcement Homework now due Feb. Generalization Training
More informationMidterm Examination CS 534: Computational Photography
Midterm Examination CS 534: Computational Photography November 3, 2016 NAME: Problem Score Max Score 1 6 2 8 3 9 4 12 5 4 6 13 7 7 8 6 9 9 10 6 11 14 12 6 Total 100 1 of 8 1. [6] (a) [3] What camera setting(s)
More informationBuilding a Panorama. Matching features. Matching with Features. How do we build a panorama? Computational Photography, 6.882
Matching features Building a Panorama Computational Photography, 6.88 Prof. Bill Freeman April 11, 006 Image and shape descriptors: Harris corner detectors and SIFT features. Suggested readings: Mikolajczyk
More informationCSE 527: Introduction to Computer Vision
CSE 527: Introduction to Computer Vision Week 5 - Class 1: Matching, Stitching, Registration September 26th, 2017 ??? Recap Today Feature Matching Image Alignment Panoramas HW2! Feature Matches Feature
More informationSection 3. Imaging With A Thin Lens
Section 3 Imaging Wit A Tin Lens 3- at Ininity An object at ininity produces a set o collimated set o rays entering te optical system. Consider te rays rom a inite object located on te axis. Wen te object
More information4.1 Tangent Lines. y 2 y 1 = y 2 y 1
41 Tangent Lines Introduction Recall tat te slope of a line tells us ow fast te line rises or falls Given distinct points (x 1, y 1 ) and (x 2, y 2 ), te slope of te line troug tese two points is cange
More information12.2 Investigate Surface Area
Investigating g Geometry ACTIVITY Use before Lesson 12.2 12.2 Investigate Surface Area MATERIALS grap paper scissors tape Q U E S T I O N How can you find te surface area of a polyedron? A net is a pattern
More informationAugmented Reality VU. Computer Vision 3D Registration (2) Prof. Vincent Lepetit
Augmented Reality VU Computer Vision 3D Registration (2) Prof. Vincent Lepetit Feature Point-Based 3D Tracking Feature Points for 3D Tracking Much less ambiguous than edges; Point-to-point reprojection
More informationHomographies and Mosaics
Tri reort Homograhies and Mosaics Jeffrey Martin (jeffrey-martin.com) CS94: Image Maniulation & Comutational Photograhy with a lot of slides stolen from Alexei Efros, UC Berkeley, Fall 06 Steve Seitz and
More information3.6 Directional Derivatives and the Gradient Vector
288 CHAPTER 3. FUNCTIONS OF SEVERAL VARIABLES 3.6 Directional Derivatives and te Gradient Vector 3.6.1 Functions of two Variables Directional Derivatives Let us first quickly review, one more time, te
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 informationAgenda. Rotations. Camera models. Camera calibration. Homographies
Agenda Rotations Camera models Camera calibration Homographies D Rotations R Y = Z r r r r r r r r r Y Z Think of as change of basis where ri = r(i,:) are orthonormal basis vectors r rotated coordinate
More information13.5 DIRECTIONAL DERIVATIVES and the GRADIENT VECTOR
13.5 Directional Derivatives and te Gradient Vector Contemporary Calculus 1 13.5 DIRECTIONAL DERIVATIVES and te GRADIENT VECTOR Directional Derivatives In Section 13.3 te partial derivatives f x and f
More informationEECS150 - Digital Design Lecture 14 FIFO 2 and SIFT. Recap and Outline
EECS150 - Digital Design Lecture 14 FIFO 2 and SIFT Oct. 15, 2013 Prof. Ronald Fearing Electrical Engineering and Computer Sciences University of California, Berkeley (slides courtesy of Prof. John Wawrzynek)
More informationImage stitching. Digital Visual Effects Yung-Yu Chuang. with slides by Richard Szeliski, Steve Seitz, Matthew Brown and Vaclav Hlavac
Image stitching Digital Visual Effects Yung-Yu Chuang with slides by Richard Szeliski, Steve Seitz, Matthew Brown and Vaclav Hlavac Image stitching Stitching = alignment + blending geometrical registration
More informationThe SIFT (Scale Invariant Feature
The SIFT (Scale Invariant Feature Transform) Detector and Descriptor developed by David Lowe University of British Columbia Initial paper ICCV 1999 Newer journal paper IJCV 2004 Review: Matt Brown s Canonical
More informationComputer Vision for HCI. Topics of This Lecture
Computer Vision for HCI Interest Points Topics of This Lecture Local Invariant Features Motivation Requirements, Invariances Keypoint Localization Features from Accelerated Segment Test (FAST) Harris Shi-Tomasi
More informationCS 2770: Intro to Computer Vision. Multiple Views. Prof. Adriana Kovashka University of Pittsburgh March 14, 2017
CS 277: Intro to Computer Vision Multiple Views Prof. Adriana Kovashka Universit of Pittsburgh March 4, 27 Plan for toda Affine and projective image transformations Homographies and image mosaics Stereo
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 informationVisual Tracking (1) Tracking of Feature Points and Planar Rigid Objects
Intelligent Control Systems Visual Tracking (1) Tracking of Feature Points and Planar Rigid Objects Shingo Kagami Graduate School of Information Sciences, Tohoku University swk(at)ic.is.tohoku.ac.jp http://www.ic.is.tohoku.ac.jp/ja/swk/
More informationLinear Interpolating Splines
Jim Lambers MAT 772 Fall Semester 2010-11 Lecture 17 Notes Tese notes correspond to Sections 112, 11, and 114 in te text Linear Interpolating Splines We ave seen tat ig-degree polynomial interpolation
More informationSingle-view 3D Reconstruction
Single-view 3D Reconstruction 10/12/17 Computational Photography Derek Hoiem, University of Illinois Some slides from Alyosha Efros, Steve Seitz Notes about Project 4 (Image-based Lighting) You can work
More informationObject Recognition with Invariant Features
Object Recognition with Invariant Features Definition: Identify objects or scenes and determine their pose and model parameters Applications Industrial automation and inspection Mobile robots, toys, user
More informationChapter K. Geometric Optics. Blinn College - Physics Terry Honan
Capter K Geometric Optics Blinn College - Pysics 2426 - Terry Honan K. - Properties of Ligt Te Speed of Ligt Te speed of ligt in a vacuum is approximately c > 3.0µ0 8 mês. Because of its most fundamental
More informationFeature Detectors and Descriptors: Corners, Lines, etc.
Feature Detectors and Descriptors: Corners, Lines, etc. Edges vs. Corners Edges = maxima in intensity gradient Edges vs. Corners Corners = lots of variation in direction of gradient in a small neighborhood
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 informationAutomatic Image Registration
Kalpa Publications in Engineering Volume 1, 2017, Pages 402 411 ICRISET2017. International Conference on Researc and Innovations in Science, Engineering &Tecnology. Selected Papers in Engineering Automatic
More informationFeatures Points. Andrea Torsello DAIS Università Ca Foscari via Torino 155, Mestre (VE)
Features Points Andrea Torsello DAIS Università Ca Foscari via Torino 155, 30172 Mestre (VE) Finding Corners Edge detectors perform poorly at corners. Corners provide repeatable points for matching, so
More informationMotion Estimation and Optical Flow Tracking
Image Matching Image Retrieval Object Recognition Motion Estimation and Optical Flow Tracking Example: Mosiacing (Panorama) M. Brown and D. G. Lowe. Recognising Panoramas. ICCV 2003 Example 3D Reconstruction
More informationHaar Transform CS 430 Denbigh Starkey
Haar Transform CS Denbig Starkey. Background. Computing te transform. Restoring te original image from te transform 7. Producing te transform matrix 8 5. Using Haar for lossless compression 6. Using Haar
More informationIntroduction to Computer Vision. Week 3, Fall 2010 Instructor: Prof. Ko Nishino
Introduction to Computer Vision Week 3, Fall 2010 Instructor: Prof. Ko Nishino Last Week! Image Sensing " Our eyes: rods and cones " CCD, CMOS, Rolling Shutter " Sensing brightness and sensing color! Projective
More informationToday s lecture. Image Alignment and Stitching. Readings. Motion models
Today s lecture Image Alignment and Stitching Computer Vision CSE576, Spring 2005 Richard Szeliski Image alignment and stitching motion models cylindrical and spherical warping point-based alignment global
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 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 informationAgenda. Rotations. Camera calibration. Homography. Ransac
Agenda Rotations Camera calibration Homography Ransac Geometric Transformations y x Transformation Matrix # DoF Preserves Icon translation rigid (Euclidean) similarity affine projective h I t h R t h sr
More informationMATH 5a Spring 2018 READING ASSIGNMENTS FOR CHAPTER 2
MATH 5a Spring 2018 READING ASSIGNMENTS FOR CHAPTER 2 Note: Tere will be a very sort online reading quiz (WebWork) on eac reading assignment due one our before class on its due date. Due dates can be found
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
Structure from motion Structure from motion Given a set of corresponding points in two or more images, compute the camera parameters and the 3D point coordinates?? R 1,t 1 R 2,t 2 R 3,t 3 Camera 1 Camera
More informationSchool of Computing University of Utah
School of Computing University of Utah Presentation Outline 1 2 3 4 Main paper to be discussed David G. Lowe, Distinctive Image Features from Scale-Invariant Keypoints, IJCV, 2004. How to find useful keypoints?
More informationLocal Image Features
Local Image Features Ali Borji UWM Many slides from James Hayes, Derek Hoiem and Grauman&Leibe 2008 AAAI Tutorial Overview of Keypoint Matching 1. Find a set of distinctive key- points A 1 A 2 A 3 B 3
More informationBroad field that includes low-level operations as well as complex high-level algorithms
Image processing About Broad field that includes low-level operations as well as complex high-level algorithms Low-level image processing Computer vision Computational photography Several procedures and
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 informationScale Invariant Feature Transform
Why do we care about matching features? Scale Invariant Feature Transform Camera calibration Stereo Tracking/SFM Image moiaicing Object/activity Recognition Objection representation and recognition Automatic
More informationEE795: Computer Vision and Intelligent Systems
EE795: Computer Vision and Intelligent Systems Spring 2012 TTh 17:30-18:45 FDH 204 Lecture 12 130228 http://www.ee.unlv.edu/~b1morris/ecg795/ 2 Outline Review Panoramas, Mosaics, Stitching Two View Geometry
More informationMore Mosaic Madness. CS194: Image Manipulation & Computational Photography. Steve Seitz and Rick Szeliski. Jeffrey Martin (jeffrey-martin.
More Mosaic Madness Jeffrey Martin (jeffrey-martin.com) CS194: Image Manipulation & Computational Photography with a lot of slides stolen from Alexei Efros, UC Berkeley, Fall 2018 Steve Seitz and Rick
More information