Features Readings All is Vanity, by C. Allan Gilbert,

Slides:



Advertisements
Similar presentations
Feature extraction: Corners
Advertisements

Summary of Friday A homography transforms one 3d plane to another 3d plane, under perspective projections. Those planes can be camera imaging planes or.
CSE 473/573 Computer Vision and Image Processing (CVIP)
The SIFT (Scale Invariant Feature Transform) Detector and Descriptor
TP14 - Local features: detection and description Computer Vision, FCUP, 2014 Miguel Coimbra Slides by Prof. Kristen Grauman.
Object Recognition using Invariant Local Features Applications l Mobile robots, driver assistance l Cell phone location or object recognition l Panoramas,
Image alignment Image from
Object Recognition with Invariant Features n Definition: Identify objects or scenes and determine their pose and model parameters n Applications l Industrial.
Features CSE 455, Winter 2010 February 1, Neel Joshi, CSE 455, Winter Review From Last Time.
Robust and large-scale alignment Image from
Feature extraction: Corners 9300 Harris Corners Pkwy, Charlotte, NC.
Lecture 6: Feature matching CS4670: Computer Vision Noah Snavely.
1 Interest Operators Find “interesting” pieces of the image –e.g. corners, salient regions –Focus attention of algorithms –Speed up computation Many possible.
Affine Linear Transformations Prof. Graeme Bailey (notes modified from Noah Snavely, Spring 2009)
Object Recognition with Invariant Features n Definition: Identify objects or scenes and determine their pose and model parameters n Applications l Industrial.
Lecture 4: Feature matching
1 Interest Operator Lectures lecture topics –Interest points 1 (Linda) interest points, descriptors, Harris corners, correlation matching –Interest points.
Automatic Image Alignment (feature-based) : Computational Photography Alexei Efros, CMU, Fall 2005 with a lot of slides stolen from Steve Seitz and.
Feature extraction: Corners and blobs
Feature-based object recognition Prof. Noah Snavely CS1114
Detecting Patterns So far Specific patterns (eyes) Generally useful patterns (edges) Also (new) “Interesting” distinctive patterns ( No specific pattern:
Lecture 3a: Feature detection and matching CS6670: Computer Vision Noah Snavely.
Automatic Image Alignment (feature-based) : Computational Photography Alexei Efros, CMU, Fall 2006 with a lot of slides stolen from Steve Seitz and.
CS4670: Computer Vision Kavita Bala Lecture 8: Scale invariance.
Sebastian Thrun CS223B Computer Vision, Winter Stanford CS223B Computer Vision, Winter 2005 Lecture 3 Advanced Features Sebastian Thrun, Stanford.
Lecture 6: Feature matching and alignment CS4670: Computer Vision Noah Snavely.
Summary of Previous Lecture A homography transforms one 3d plane to another 3d plane, under perspective projections. Those planes can be camera imaging.
1 Interest Operators Harris Corner Detector: the first and most basic interest operator Kadir Entropy Detector and its use in object recognition SIFT interest.
Object Tracking/Recognition using Invariant Local Features Applications l Mobile robots, driver assistance l Cell phone location or object recognition.
Lecture 4: Feature matching CS4670 / 5670: Computer Vision Noah Snavely.
Example: line fitting. n=2 Model fitting Measure distances.
Feature extraction: Corners 9300 Harris Corners Pkwy, Charlotte, NC.
776 Computer Vision Jan-Michael Frahm, Enrique Dunn Spring 2013.
Lecture 7: Features Part 2 CS4670/5670: Computer Vision Noah Snavely.
Lecture 8: Feature matching CS6670: Computer Vision Noah Snavely.
Feature extraction: Corners and blobs. Why extract features? Motivation: panorama stitching We have two images – how do we combine them?
Lecture 5: Image Interpolation and Features
Local features: detection and description
Features Jan-Michael Frahm.
776 Computer Vision Jan-Michael Frahm Spring 2012.
Image matching by Diva SianDiva Sian by swashfordswashford TexPoint fonts used in EMF. Read the TexPoint manual before you delete this box.: AAAAAA.
Announcements Project 1 Out today Help session at the end of class.
Keypoint extraction: Corners 9300 Harris Corners Pkwy, Charlotte, NC.
Invariant Local Features Image content is transformed into local feature coordinates that are invariant to translation, rotation, scale, and other imaging.
Lecture 5: Feature detection and matching CS4670 / 5670: Computer Vision Noah Snavely.
776 Computer Vision Jan-Michael Frahm Spring 2012.
Presented by David Lee 3/20/2006
Image Features: Points and Regions
TP12 - Local features: detection and description
Lecture 4: Harris corner detection
Local features: detection and description May 11th, 2017
Feature description and matching
Image Stitching Slides from Rick Szeliski, Steve Seitz, Derek Hoiem, Ira Kemelmacher, Ali Farhadi.
Object recognition Prof. Graeme Bailey
CSE 455 – Guest Lectures 3 lectures Contact Interest points 1
Announcements Project 1 Project 2 (panoramas)
The SIFT (Scale Invariant Feature Transform) Detector and Descriptor
Lecture 5: Feature detection and matching
Interest Points & Descriptors 3 - SIFT
Announcement Project 1 1.
Local features and image matching
Lecture VI: Corner and Blob Detection
Computational Photography
Feature descriptors and matching
Lecture 5: Feature invariance
Lecture 5: Feature invariance
CS5760: Computer Vision Lecture 9: RANSAC Noah Snavely
Corner Detection COMP 4900C Winter 2008.
Local features and image matching May 7th, 2019
CS5760: Computer Vision Lecture 9: RANSAC Noah Snavely
Presentation transcript:

Features Readings All is Vanity, by C. Allan Gilbert, 1873-1929 M. Brown et al. Multi-Image Matching using Multi-Scale Oriented Patches, CVPR 2005

Today’s lecture Feature detection Feature matching Applications

Invariant local features Find features that are invariant to transformations geometric invariance: translation, rotation, scale photometric invariance: brightness, exposure, … Feature Descriptors

Advantages of local features Locality features are local, so robust to occlusion and clutter Distinctiveness: can differentiate a large database of objects Quantity hundreds or thousands in a single image Efficiency real-time performance achievable Generality exploit different types of features in different situations

More motivation… Feature points are used for: Image alignment (e.g., mosaics) 3D reconstruction Motion tracking Object recognition Indexing and database retrieval Robot navigation … other

What makes a good feature? gradients are different, large magnitudes large l1, large l2

Feature detection Want a “feature detection” function gives large values only for image patches that are good features How might you define f in terms of l1, l2 ?

The Harris operator Want a “feature detection” function The Algorithm: gives large values only for image patches that are good features How might you define f in terms of l1, l2 ? Called the “Harris Corner Detector” or “Harris Operator” Lots of other detectors, this is one of the most popular The Algorithm: Find points with large response (f > threshold) Take the points of local maxima of f (harmonic mean)

Input images

Compute f

Threshold (f > value)

Find local maxima of f

Harris features (in red)

Invariance Suppose you rotate the image by some angle Will you still pick up the same features? What if you translate the image instead? Change in brightness? Scale? Yes (with some caveats—image resampling errors…)

Scale invariant detection Suppose you’re looking for corners Key idea: find scale that gives local maximum of f f is a local maximum in both position and scale

? Feature descriptors We know how to detect good points Next question: How to match them? Lots of possibilities (this is a popular research area) simple: match square windows around the point state of the art (e.g.,): SIFT David Lowe, UBC http://www.cs.ubc.ca/~lowe/keypoints/ ?

Rotation invariance for feature descriptors Find dominant orientation of the image patch From the motion lecture, this is given by the eigenvector of ATA corresponding to the larger eigenvalue Rotate the patch according to this angle MOPS [Brown, Szeliski, Winder, CVPR’2005]

Detections at multiple scales

What do we do about the “bad” matches? Matching features What do we do about the “bad” matches?

RAndom SAmple Consensus Select one match, count inliers

RAndom SAmple Consensus Select one match, count inliers

Find “average” translation vector Least squares fit Find “average” translation vector

RANSAC (RANdom SAmpling Consensus) Popular approach for robust model fitting with outliers RANSAC loop: Select K feature matches (at random) Fit model (e.g., homography) based on these features Count inliers: — number of other features that fit the model to within some specified threshold The model with the largest number of inliers wins Re-fit the model based on all of these inliers More info: http://homepages.inf.ed.ac.uk/rbf/CVonline/LOCAL_COPIES/FISHER/RANSAC/

RANSAC

Lots of applications Features are used for: Image alignment (e.g., mosaics) 3D reconstruction Motion tracking Object recognition Indexing and database retrieval Robot navigation … other

Autostitch (Brown and Lowe) Fully automatic panorama generation Input: set of images Output: panorama(s) Uses SIFT (Scale-Invariant Feature Transform) to find/align images http://www.cs.ubc.ca/~mbrown/autostitch/autostitch.html Microsoft version part of the Digital Image Pro and Digital Image Suite

1. Solve for homography

1. Solve for homography

1. Solve for homography

2. Find connected sets of images

2. Find connected sets of images

2. Find connected sets of images

Object recognition (David Lowe)

Sony Aibo SIFT usage: Recognize charging station Communicate with visual cards Teach object recognition

The office of the past (Kim et al.) http://grail.cs.washington.edu/projects/office/

3D scene recovery