CS201 Computer Vision Lect 08: SIFT Keypoint Detection John Magee - PowerPoint PPT Presentation

CS201 – Computer Vision Lect 08: SIFT Keypoint Detection John Magee 23 Septermber 2014 Slides courtesy of Diane H. Theriault

Question of the Day: • How do we find repeatable, stable, scale- invariant points in images?

SIFT • Find repeatable, scale-invariant points in images (today) • Compute something about them • Use the thing you computed to perform matching • “Distinctive Image Features from Scale -Invariant Keypoints ” by David Lowe • Patented!

How to find the same cat? • Imagine that we had a library of cats • How could we find another picture of the same cat in the library? • Look for the markings?

How to find the same cat? • Imagine that we had a library of cats • How could we find another picture of the same cat in the library? • Look for the markings? • Which markings?

How to find the same cat? • Imagine that we had a library of cats • How could we find another picture of the same cat in the library? • Look for the markings? • Which markings? • Which cat would be easier to uniquely identify?

Keypoints • Idea: Want to find points that are easy to localize uniquely This one Not this one

Keypoints at Different Scales • Idea: Want to find scale-invariant points that are easy to localize uniquely

Gaussian

Scale Space • Image convolved with Gaussians of different widths

Scale Space Octaves • Every time the width of your Gaussian doubles, downsample the image

Derivative of a Gaussian

Second Derivative of a Gaussian

Laplacian of a Gaussian • Sum of spatial second derivatives

Keypoints with Image Filtering Image • Perform image filtering by convolving an image with a “filter”/”mask” / “kernel” to obtain a “result” / “response” • The value of the result will be positive in regions of the image that “look like” the filter • What would a “dot” filter look like? Filter

Scale-space extrema • “ Extrema ” = local minimum or maximum • Check 8 neighbors at a particular scale • Check neighbors at scales above and below

Scale-space Extrema

Difference of Gaussians • Approximation of the Laplacian of a Gaussian

Discussion Questions: • What does it mean for an image point to be repeatable? • What are the properties of repeatable points?

Keypoints with Image Filtering • What tool have we learned about for finding places in the image that “look like” corners or dots?

CS201 Computer Vision Lect 08: SIFT Keypoint Detection John Magee - PowerPoint PPT Presentation

CS201 Computer Vision Lect 08: SIFT Keypoint Detection John Magee 23 Septermber 2014 Slides courtesy of Diane H. Theriault Question of the Day: How do we find repeatable, stable, scale- invariant points in images? SIFT Find

CS201 Lecture 02 Computer Vision: Image Formation and Basic Techniques John Magee 1 Computer

CS201: Computer Vision Lect 06: Face Detection John Magee Slides Courtesy of Diane H. Theriault

CS201: Computer Vision Lect 09: SIFT Descriptors John Magee 26 September 2014 Slides Courtesy

COMPUTER SYSTEMS PROGRAMMING CS201 Hello! Im Chris Kim . Im a software engineer at

Heather Zheng Department of Computer Science p p University of California, Santa Barbara CS201

CS262: Computer Vision (and Human-Computer Interaction) John Magee 1 Computer Vision How are

Computer Vision Neurobio 230 Bill Lotter Exciting time: Neuroscience computer vision

Question of the Day: How can we use measurements to estimate state? Kalman Filter:

Introductions Computer Vision Automatic understanding of images and video Instructor :

A Computer Vision Sampler COMPSCI 527 Today: Introduction to computer vision Course

Computer Vision Introduction Historical context Connections to other disciplines Vision and

Computer Vision Computer Vision How does vision work? What is vision for? Ela Claridge

CS4495/6495 Introduction to Computer Vision 1A-L1 Introduction Outline What is computer

Camera Calibration COMPSCI 527 Computer Vision COMPSCI 527 Computer Vision Camera

Computer Vision/Graphics -- Dr. Chandra Kambhamettu for SIGNEWGRAD 11/24/04 Computer Vision :

COMPUTER VISION FOR ROBOT NAVIGATION Sanketh Shetty Computer Vision and Robotics Laboratory

Learning Visual Semantics: Models, Massive Computation, and Innovative Applications Part II:

Boosted Cascade of Simple Features Paul Viola and Michael Jones CVPR 2001 Brendan Morris

Matching and Image Alignment Computer Vision Fall 2018 Columbia University Feature Matching

Efficient visual search of local features Cordelia Schmid Bag-of-features

Feature Point Feature-based approach: Detect and match feature Detec.on and Matching points

Scale Invariant Region Selection and SIFT Sung-Eui Yoon ( ) Course URL:

Scalable SIFT for NUMA with Actors Frank Feinbube , Lena Herscheid, Christoph Neijenhuis, Peter

Heaps and Heapsort 1 October 2020 OSU CSE 1 Heaps A heap is a binary tree of T that