Problem Session #6. EE368/CS232 Digital Image Processing

Size: px
Start display at page:

Download "Problem Session #6. EE368/CS232 Digital Image Processing"

Transcription

1 Problem Session #6 EE368/CS232 Digital Image Processing

2 . Robustness of Harris Keypoints to Rotation and Scaling Part A: Apply a Harris corner detector and threshold the cornerness response so that about Harris corners are detected. Please submit a result showing the detected Harris corners superimposed on the original image, and report the threshold that you choose. Describe which objects or regions in the image seem to generate large numbers of Harris corners. Hint: Use the MATLAB functions cornermetric and imregionalmax.

3 !

4 Part B: Rotate the image in increments of 5 degrees, from degrees to 36 degrees. For each rotated image, compute Harris corners using the same settings that you chose in part (a). Then, compute repeatability as follows. Set number of feature matches to be. For each Harris corner at [x, y] in the original image: Predict the position [x r, y r ] where [x, y] should appear in the rotated image. Search for a nearby Harris corner in the rotated image (coordinates [x o, y o ]) satisfying x o - x r < 2 and y o - y r < 2. If such an [x o, y o ] is found, increment number of feature matches by. Compute repeatability as (number of feature matches) / (number of Harris corners in the original image). Plot repeatability against rotation angle and comment on the Harris corner detector s robustness against rotation. imgrot = imrotate(img, angle, bicubic );

5 Part B: A detected keypoint [x, y] in original image. Anti-clockwise rotation Predicted keypoint [x, y ] in the rotated image. Predicted keypoint coordinates Center of rotated image Rotation matrix Detected keypoint in the original image Center of original image

6 Robustness to Rotation: Cover-.jpg Robustness to Rotation: Cover-2.jpg Rotation Angle (degrees) Rotation Angle (degrees)

7 Part C: Conduct an experiment analogous to part (b), but, instead of rotating the image, resize the image by the scaling factors m, m, m 2,, m 8, where m =.2. Compute Harris corners for each resized image. Please perform bicubic interpolation with MATLAB function imresize. By comparing the Harris corners of the original image and the corresponding Harris corners of the resized image, compute and plot repeatability against scaling factor (log scale may be most appropriate), and comment on the Harris corner detector s robustness against scale changes. imgscale = imresize(img, scale, bicubic ); Robustness to Scaling: Cover-.jpg Robustness to Scaling: Cover-2.jpg Rescaling Factor Rescaling Factor

8 2. Robustness of SIFT Keypoints to Rotation and Scaling Part A: Apply a SIFT keypoint detector and adjust the peak and edge thresholds so that about SIFT keypoints are detected. Please submit a result showing the detected SIFT keypoints superimposed on the original image, and report the thresholds you choose. Describe which objects or regions in the image seem to generate large numbers of SIFT keypoints. % Set up MATLAB interface to VLFeat library run('/path/to/library/vlfeat-.9.7/toolbox/vl_setup.m'); % Extract SIFT keypoints on grayscale image peakthresh = 4; edgethresh = ; [fc, dc] = vl_sift(single(gray_img),... 'PeakThresh', peakthresh,... 'EdgeThresh', edgethresh);

9

10

11 Original Image: Cover-.jpg

12 Original Image: Cover-2.jpg

13 Part B: Using the procedure defined in Problem 2, plot repeatability versus rotation angle (in increments of 5 degrees, from degrees to 36 degrees). Comment on the SIFT keypoint detector s robustness against rotation and compare against the corresponding result for the Harris keypoint detector. SIFT Keypoints

14 SIFT Keypoints Robustness to Rotation: Cover-.jpg Robustness to Rotation: Cover-2.jpg.8.8 Harris Keypoints Rotation Angle (degrees) Rotation Angle (degrees)

15 Part C: Using the same procedure defined in Problem 2, plot repeatability versus scaling factor (with the scaling factors m, m, m 2,, m 8, where m =.2). Comment on the SIFT keypoint detector s robustness against scale changes and compare against the corresponding result for the Harris keypoint detector. Robustness to Scaling: Cover-.jpg Robustness to Scaling: Cover-2.jpg.8.8 SIFT Keypoints Rescaling Factor Rescaling Factor

16 Robustness to Scaling: Cover-.jpg Robustness to Scaling: Cover-2.jpg.8.8 SIFT Keypoints Rescaling Factor Rescaling Factor Robustness to Scaling: Cover-.jpg Robustness to Scaling: Cover-2.jpg.8.8 Harris Keypoints Rescaling Factor Rescaling Factor

17 3. Scale Selection for Determinant-of-Hessian Consider a continuous-space version of the determinant-of-hessian (DoH) keypoint detector. For an input image, the DoH response at scale t is defined as follows: ( ) 2 det H t ( xy, ) = f t ( xyf, ) t ( xy, ) - f t ( xy, ) xx yy xy 2 t t fxx ( x, y) = g ( x, y) * f( x, y) 2 x 2 t t fyy ( x, y) = g ( x, y) * f( x, y) 2 y 2 t t fxy ( x, y) = g ( x, y) * f( x, y) yx 2 2 æ (, ) exp x + y ö g t x y = ç - 2pt è 2t ø

18 Part A: Assume the input image is a Gaussian blob of scale t > : f (x, y) = 2πt g t (x, y). From the above definitions, derive and report an expression for the following objective functions: t H ( t ) = det H (,) A t H ( t) = tdet H (,) B H t t 2 t C () = det H (,) t t t+ t ( )* = p ( )* = p t g x, y f( x, y) 2 t g x, y g ( x, y) 2 t g ( x, y) ( ) = 2πt 2 f t xx (x, y) = 2 g t ( x, y) f (x, y) x 2 t 2 f yy (x, y) = 2πt y g t+t 2 ( x, y) f t xy (x, y) = f t 2 yx (x, y) = 2πt x y g t+t det H t (,) = f xx t t (,) f yy t (,) f xy (,) ( ) 2 x 2 g t+t ( x, y) ( x, y)

19 Part B: Derive and report the scale values t A *, t B *, and t C * that maximize H A (t), H B (t), and H C (t), respectively. Also report the maximal values. Please interpret the results. t A * =... t B * =... Are H A, H B, and H c suitable for finding the scale t? t C * =... H A t A * H B t B * H C t C * ( ) =... ( ) =... ( ) =... Do maximum values of H A, H B, and H c depend on the scale t?

Keypoint detection. (image registration, panorama stitching, motion estimation + tracking, recognition )

Keypoint detection. (image registration, panorama stitching, motion estimation + tracking, recognition ) Keypoint detection n n Many applications benefit from features localized in (x,y) (image registration, panorama stitching, motion estimation + tracking, recognition ) Edges well localized only in one direction

More information

Transformations Review

Transformations Review Transformations Review 1. Plot the original figure then graph the image of Rotate 90 counterclockwise about the origin. 2. Plot the original figure then graph the image of Translate 3 units left and 4

More information

EE368/CS232 Digital Image Processing Winter

EE368/CS232 Digital Image Processing Winter EE368/CS232 Digital Image Processing Winter 207-208 Lecture Review and Quizzes (Due: Wednesday, February 28, :30pm) Please review what you have learned in class and then complete the online quiz questions

More information

SIFT: 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: 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 information

3D Object Recognition using Multiclass SVM-KNN

3D Object Recognition using Multiclass SVM-KNN 3D Object Recognition using Multiclass SVM-KNN R. Muralidharan, C. Chandradekar April 29, 2014 Presented by: Tasadduk Chowdhury Problem We address the problem of recognizing 3D objects based on various

More information

Obtaining Feature Correspondences

Obtaining Feature Correspondences Obtaining Feature Correspondences Neill Campbell May 9, 2008 A state-of-the-art system for finding objects in images has recently been developed by David Lowe. The algorithm is termed the Scale-Invariant

More information

Colorado School of Mines. Computer Vision. Professor William Hoff Dept of Electrical Engineering &Computer Science.

Colorado School of Mines. Computer Vision. Professor William Hoff Dept of Electrical Engineering &Computer Science. Colorado School of Mines Computer Vision Professor William Hoff Dept of Electrical Engineering &Computer Science http://inside.mines.edu/~whoff/ 1 Vlfeat and SIFT Examples 2 Matlab code http://www.vlfeat.org

More information

Matlab Tutorial. Session 2. SIFT. Gonzalo Vaca-Castano

Matlab Tutorial. Session 2. SIFT. Gonzalo Vaca-Castano Matlab Tutorial. Session 2. SIFT Gonzalo Vaca-Castano Sift purpose Find and describe interest points invariants to: Scale Rotation Illumination Viewpoint Do it Yourself Constructing a scale space LoG Approximation

More information

EE368 Project Report CD Cover Recognition Using Modified SIFT Algorithm

EE368 Project Report CD Cover Recognition Using Modified SIFT Algorithm EE368 Project Report CD Cover Recognition Using Modified SIFT Algorithm Group 1: Mina A. Makar Stanford University mamakar@stanford.edu Abstract In this report, we investigate the application of the Scale-Invariant

More information

Local Image Features

Local Image Features Local Image Features Computer Vision CS 143, Brown Read Szeliski 4.1 James Hays Acknowledgment: Many slides from Derek Hoiem and Grauman&Leibe 2008 AAAI Tutorial This section: correspondence and alignment

More information

CAP 5415 Computer Vision Fall 2012

CAP 5415 Computer Vision Fall 2012 CAP 5415 Computer Vision Fall 01 Dr. Mubarak Shah Univ. of Central Florida Office 47-F HEC Lecture-5 SIFT: David Lowe, UBC SIFT - Key Point Extraction Stands for scale invariant feature transform Patented

More information

Augmented Reality VU. Computer Vision 3D Registration (2) Prof. Vincent Lepetit

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

Scott Smith Advanced Image Processing March 15, Speeded-Up Robust Features SURF

Scott Smith Advanced Image Processing March 15, Speeded-Up Robust Features SURF Scott Smith Advanced Image Processing March 15, 2011 Speeded-Up Robust Features SURF Overview Why SURF? How SURF works Feature detection Scale Space Rotational invariance Feature vectors SURF vs Sift Assumptions

More information

Computer Vision for HCI. Topics of This Lecture

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

CS 556: Computer Vision. Lecture 3

CS 556: Computer Vision. Lecture 3 CS 556: Computer Vision Lecture 3 Prof. Sinisa Todorovic sinisa@eecs.oregonstate.edu Interest Points Harris corners Hessian points SIFT Difference-of-Gaussians SURF 2 Properties of Interest Points Locality

More information

SUMMARY: DISTINCTIVE IMAGE FEATURES FROM SCALE- INVARIANT KEYPOINTS

SUMMARY: DISTINCTIVE IMAGE FEATURES FROM SCALE- INVARIANT KEYPOINTS SUMMARY: DISTINCTIVE IMAGE FEATURES FROM SCALE- INVARIANT KEYPOINTS Cognitive Robotics Original: David G. Lowe, 004 Summary: Coen van Leeuwen, s1460919 Abstract: This article presents a method to extract

More information

EE368/CS232 Digital Image Processing Winter Homework #7 Solutions

EE368/CS232 Digital Image Processing Winter Homework #7 Solutions 1. Robustness of the SIFT Descriptor EE368/CS232 Digital Image Processing Winter 2017-2018 Homework #7 Solutions Part A: Below, we show the SIFT keypoints for the original test image, before any additional

More information

Line, edge, blob and corner detection

Line, edge, blob and corner detection Line, edge, blob and corner detection Dmitri Melnikov MTAT.03.260 Pattern Recognition and Image Analysis April 5, 2011 1 / 33 Outline 1 Introduction 2 Line detection 3 Edge detection 4 Blob detection 5

More information

Scale Invariant Feature Transform

Scale Invariant Feature Transform Scale Invariant Feature Transform Why do we care about matching features? Camera calibration Stereo Tracking/SFM Image moiaicing Object/activity Recognition Objection representation and recognition Image

More information

CS 556: Computer Vision. Lecture 3

CS 556: Computer Vision. Lecture 3 CS 556: Computer Vision Lecture 3 Prof. Sinisa Todorovic sinisa@eecs.oregonstate.edu 1 Outline Matlab Image features -- Interest points Point descriptors Homework 1 2 Basic MATLAB Commands 3 Basic MATLAB

More information

Outline 7/2/201011/6/

Outline 7/2/201011/6/ Outline Pattern recognition in computer vision Background on the development of SIFT SIFT algorithm and some of its variations Computational considerations (SURF) Potential improvement Summary 01 2 Pattern

More information

Scale Invariant Feature Transform

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

Local Features: Detection, Description & Matching

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

SCALE INVARIANT FEATURE TRANSFORM (SIFT)

SCALE INVARIANT FEATURE TRANSFORM (SIFT) 1 SCALE INVARIANT FEATURE TRANSFORM (SIFT) OUTLINE SIFT Background SIFT Extraction Application in Content Based Image Search Conclusion 2 SIFT BACKGROUND Scale-invariant feature transform SIFT: to detect

More information

Image Features: Detection, Description, and Matching and their Applications

Image Features: Detection, Description, and Matching and their Applications Image Features: Detection, Description, and Matching and their Applications Image Representation: Global Versus Local Features Features/ keypoints/ interset points are interesting locations in the image.

More information

CS 558: Computer Vision 4 th Set of Notes

CS 558: Computer Vision 4 th Set of Notes 1 CS 558: Computer Vision 4 th Set of Notes Instructor: Philippos Mordohai Webpage: www.cs.stevens.edu/~mordohai E-mail: Philippos.Mordohai@stevens.edu Office: Lieb 215 Overview Keypoint matching Hessian

More information

Local Image Features

Local Image Features Local Image Features Computer Vision Read Szeliski 4.1 James Hays Acknowledgment: Many slides from Derek Hoiem and Grauman&Leibe 2008 AAAI Tutorial Flashed Face Distortion 2nd Place in the 8th Annual Best

More information

SIFT: Scale Invariant Feature Transform

SIFT: Scale Invariant Feature Transform 1 / 25 SIFT: Scale Invariant Feature Transform Ahmed Othman Systems Design Department University of Waterloo, Canada October, 23, 2012 2 / 25 1 SIFT Introduction Scale-space extrema detection Keypoint

More information

SIFT - scale-invariant feature transform Konrad Schindler

SIFT - scale-invariant feature transform Konrad Schindler SIFT - scale-invariant feature transform Konrad Schindler Institute of Geodesy and Photogrammetry Invariant interest points Goal match points between images with very different scale, orientation, projective

More information

FESID: Finite Element Scale Invariant Detector

FESID: Finite Element Scale Invariant Detector : Finite Element Scale Invariant Detector Dermot Kerr 1,SonyaColeman 1, and Bryan Scotney 2 1 School of Computing and Intelligent Systems, University of Ulster, Magee, BT48 7JL, Northern Ireland 2 School

More information

The SIFT (Scale Invariant Feature

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

Harris Corner Detector

Harris Corner Detector Point Features Harris Corner Detector Despite edges, corners provide repeatable points to be used for matching We make use of self correlation to mathematically describe this concept: If we take a patch

More information

Feature Detection. Raul Queiroz Feitosa. 3/30/2017 Feature Detection 1

Feature Detection. Raul Queiroz Feitosa. 3/30/2017 Feature Detection 1 Feature Detection Raul Queiroz Feitosa 3/30/2017 Feature Detection 1 Objetive This chapter discusses the correspondence problem and presents approaches to solve it. 3/30/2017 Feature Detection 2 Outline

More information

Local invariant features

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

Motion Estimation and Optical Flow Tracking

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

A Tutorial on VLFeat

A Tutorial on VLFeat A Tutorial on VLFeat Antonino Furnari Image Processing Lab Dipartimento di Matematica e Informatica Università degli Studi di Catania furnari@dmi.unict.it 17/04/2014 MATLAB & Computer Vision 2 MATLAB offers

More information

Introduction to Computer Graphics and Computer Vision Assignment 3: Due 7/27/2015

Introduction to Computer Graphics and Computer Vision Assignment 3: Due 7/27/2015 Introduction to Computer Graphics and Computer Vision Assignment 3: Due 7/27/2015 Nicholas Dwork For this assignment, don t submit any printouts of images. If you want to turn in some answers handwritten,

More information

Introduction. Introduction. Related Research. SIFT method. SIFT method. Distinctive Image Features from Scale-Invariant. Scale.

Introduction. Introduction. Related Research. SIFT method. SIFT method. Distinctive Image Features from Scale-Invariant. Scale. Distinctive Image Features from Scale-Invariant Keypoints David G. Lowe presented by, Sudheendra Invariance Intensity Scale Rotation Affine View point Introduction Introduction SIFT (Scale Invariant Feature

More information

[Programming Assignment] (1)

[Programming Assignment] (1) http://crcv.ucf.edu/people/faculty/bagci/ [Programming Assignment] (1) Computer Vision Dr. Ulas Bagci (Fall) 2015 University of Central Florida (UCF) Coding Standard and General Requirements Code for all

More information

3D from Photographs: Automatic Matching of Images. Dr Francesco Banterle

3D from Photographs: Automatic Matching of Images. Dr Francesco Banterle 3D from Photographs: Automatic Matching of Images Dr Francesco Banterle francesco.banterle@isti.cnr.it 3D from Photographs Automatic Matching of Images Camera Calibration Photographs Surface Reconstruction

More information

AK Computer Vision Feature Point Detectors and Descriptors

AK Computer Vision Feature Point Detectors and Descriptors AK Computer Vision Feature Point Detectors and Descriptors 1 Feature Point Detectors and Descriptors: Motivation 2 Step 1: Detect local features should be invariant to scale and rotation, or perspective

More information

22. LECTURE 22. I can define critical points. I know the difference between local and absolute minimums/maximums.

22. LECTURE 22. I can define critical points. I know the difference between local and absolute minimums/maximums. . LECTURE Objectives I can define critical points. I know the difference between local and absolute minimums/maximums. In many physical problems, we re interested in finding the values (x, y) that maximize

More information

Discovering Visual Hierarchy through Unsupervised Learning Haider Razvi

Discovering Visual Hierarchy through Unsupervised Learning Haider Razvi Discovering Visual Hierarchy through Unsupervised Learning Haider Razvi hrazvi@stanford.edu 1 Introduction: We present a method for discovering visual hierarchy in a set of images. Automatically grouping

More information

Vision and Image Processing Lab., CRV Tutorial day- May 30, 2010 Ottawa, Canada

Vision and Image Processing Lab., CRV Tutorial day- May 30, 2010 Ottawa, Canada Spatio-Temporal Salient Features Amir H. Shabani Vision and Image Processing Lab., University of Waterloo, ON CRV Tutorial day- May 30, 2010 Ottawa, Canada 1 Applications Automated surveillance for scene

More information

Problems with template matching

Problems with template matching Problems with template matching The template represents the object as we expect to find it in the image The object can indeed be scaled or rotated This technique requires a separate template for each scale

More information

Features Points. Andrea Torsello DAIS Università Ca Foscari via Torino 155, Mestre (VE)

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

Implementing the Scale Invariant Feature Transform(SIFT) Method

Implementing the Scale Invariant Feature Transform(SIFT) Method Implementing the Scale Invariant Feature Transform(SIFT) Method YU MENG and Dr. Bernard Tiddeman(supervisor) Department of Computer Science University of St. Andrews yumeng@dcs.st-and.ac.uk Abstract The

More information

Comparison of Feature Detection and Matching Approaches: SIFT and SURF

Comparison of Feature Detection and Matching Approaches: SIFT and SURF GRD Journals- Global Research and Development Journal for Engineering Volume 2 Issue 4 March 2017 ISSN: 2455-5703 Comparison of Detection and Matching Approaches: SIFT and SURF Darshana Mistry PhD student

More information

Feature Matching and Robust Fitting

Feature Matching and Robust Fitting Feature Matching and Robust Fitting Computer Vision CS 143, Brown Read Szeliski 4.1 James Hays Acknowledgment: Many slides from Derek Hoiem and Grauman&Leibe 2008 AAAI Tutorial Project 2 questions? This

More information

Building a Panorama. Matching features. Matching with Features. How do we build a panorama? Computational Photography, 6.882

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

Image Matching. AKA: Image registration, the correspondence problem, Tracking,

Image Matching. AKA: Image registration, the correspondence problem, Tracking, Image Matching AKA: Image registration, the correspondence problem, Tracking, What Corresponds to What? Daisy? Daisy From: www.amphian.com Relevant for Analysis of Image Pairs (or more) Also Relevant for

More information

521466S Machine Vision Assignment #3 Image Features

521466S Machine Vision Assignment #3 Image Features 521466S Machine Vision Assignment #3 Image Features Spring 2018 This assignment explores feature detection, extraction, and matching. We will implement the well-known Harris corner detector and use Matlab

More information

Stitching and Blending

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

Prof. Feng Liu. Spring /26/2017

Prof. 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 information

Feature descriptors and matching

Feature descriptors and matching Feature descriptors and matching Detections at multiple scales Invariance of MOPS Intensity Scale Rotation Color and Lighting Out-of-plane rotation Out-of-plane rotation Better representation than color:

More information

NOWADAYS, the computer vision is one of the top

NOWADAYS, the computer vision is one of the top Evaluation of Interest Point Detectors for Scenes with Changing Lightening Conditions Martin Zukal, Petr Cika, Radim Burget Abstract The paper is aimed at the description of different image interest point

More information

Performance Evaluation of Scale-Interpolated Hessian-Laplace and Haar Descriptors for Feature Matching

Performance Evaluation of Scale-Interpolated Hessian-Laplace and Haar Descriptors for Feature Matching Performance Evaluation of Scale-Interpolated Hessian-Laplace and Haar Descriptors for Feature Matching Akshay Bhatia, Robert Laganière School of Information Technology and Engineering University of Ottawa

More information

Soccer Video Analysis

Soccer Video Analysis Soccer Video Analysis Kevin Cheng Department of Electrical Engineering Abstract An algorithm to extract key features from a soccer video is proposed. In this algorithm, the soccer field, individual players

More information

Patch-based Object Recognition. Basic Idea

Patch-based Object Recognition. Basic Idea Patch-based Object Recognition 1! Basic Idea Determine interest points in image Determine local image properties around interest points Use local image properties for object classification Example: Interest

More information

Pictures at an Exhibition: EE368 Project

Pictures at an Exhibition: EE368 Project Pictures at an Exhibition: EE368 Project Jacob Mattingley Stanford University jacobm@stanford.edu Abstract This report presents an algorithm which matches photographs of paintings to a small database.

More information

Section 4.2 selected answers Math 131 Multivariate Calculus D Joyce, Spring 2014

Section 4.2 selected answers Math 131 Multivariate Calculus D Joyce, Spring 2014 4. Determine the nature of the critical points of Section 4. selected answers Math 11 Multivariate Calculus D Joyce, Spring 014 Exercises from section 4.: 6, 1 16.. Determine the nature of the critical

More information

Key properties of local features

Key properties of local features Key properties of local features Locality, robust against occlusions Must be highly distinctive, a good feature should allow for correct object identification with low probability of mismatch Easy to etract

More information

EECS150 - Digital Design Lecture 14 FIFO 2 and SIFT. Recap and Outline

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

Recognition of Degraded Handwritten Characters Using Local Features. Markus Diem and Robert Sablatnig

Recognition of Degraded Handwritten Characters Using Local Features. Markus Diem and Robert Sablatnig Recognition of Degraded Handwritten Characters Using Local Features Markus Diem and Robert Sablatnig Glagotica the oldest slavonic alphabet Saint Catherine's Monastery, Mount Sinai Challenges in interpretation

More information

Scale Invariant Feature Transform by David Lowe

Scale Invariant Feature Transform by David Lowe Scale Invariant Feature Transform by David Lowe Presented by: Jerry Chen Achal Dave Vaishaal Shankar Some slides from Jason Clemons Motivation Image Matching Correspondence Problem Desirable Feature Characteristics

More information

Motion illusion, rotating snakes

Motion illusion, rotating snakes Motion illusion, rotating snakes Local features: main components 1) Detection: Find a set of distinctive key points. 2) Description: Extract feature descriptor around each interest point as vector. x 1

More information

Feature Based Registration - Image Alignment

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

CS 4495 Computer Vision A. Bobick. CS 4495 Computer Vision. Features 2 SIFT descriptor. Aaron Bobick School of Interactive Computing

CS 4495 Computer Vision A. Bobick. CS 4495 Computer Vision. Features 2 SIFT descriptor. Aaron Bobick School of Interactive Computing CS 4495 Computer Vision Features 2 SIFT descriptor Aaron Bobick School of Interactive Computing Administrivia PS 3: Out due Oct 6 th. Features recap: Goal is to find corresponding locations in two images.

More information

EE795: Computer Vision and Intelligent Systems

EE795: Computer Vision and Intelligent Systems EE795: Computer Vision and Intelligent Systems Spring 2012 TTh 17:30-18:45 FDH 204 Lecture 09 130219 http://www.ee.unlv.edu/~b1morris/ecg795/ 2 Outline Review Feature Descriptors Feature Matching Feature

More information

16720: Computer Vision Homework 2 Feature Descriptors, Homographies & RANSAC

16720: Computer Vision Homework 2 Feature Descriptors, Homographies & RANSAC 16720: Computer Vision Homework 2 Feature Descriptors, Homographies & RANSAC Instructor: Deva Ramanan TAs: Achal Dave, Brian Pugh Shashank Jujjavarapu, Siddarth Malreddy See course website for deadline:

More information

Multimedia Computing: Algorithms, Systems, and Applications: Edge Detection

Multimedia Computing: Algorithms, Systems, and Applications: Edge Detection Multimedia Computing: Algorithms, Systems, and Applications: Edge Detection By Dr. Yu Cao Department of Computer Science The University of Massachusetts Lowell Lowell, MA 01854, USA Part of the slides

More information

Feature Detection and Matching

Feature Detection and Matching and Matching CS4243 Computer Vision and Pattern Recognition Leow Wee Kheng Department of Computer Science School of Computing National University of Singapore Leow Wee Kheng (CS4243) Camera Models 1 /

More information

WAVELET TRANSFORM BASED FEATURE DETECTION

WAVELET TRANSFORM BASED FEATURE DETECTION WAVELET TRANSFORM BASED FEATURE DETECTION David Bařina Doctoral Degree Programme (1), DCGM, FIT BUT E-mail: ibarina@fit.vutbr.cz Supervised by: Pavel Zemčík E-mail: zemcik@fit.vutbr.cz ABSTRACT This paper

More information

Computer Vision, Assignment 1 Elements of Projective Geometry

Computer Vision, Assignment 1 Elements of Projective Geometry Centre for Mathematical Sciences, February 05 Due study week Computer Vision, Assignment Elements of Projective Geometry Instructions In this assignment you will study the basics of projective geometry.

More information

Learning Packet. Lesson 6 Exponents and Rational Functions THIS BOX FOR INSTRUCTOR GRADING USE ONLY

Learning Packet. Lesson 6 Exponents and Rational Functions THIS BOX FOR INSTRUCTOR GRADING USE ONLY Learning Packet Student Name Due Date Class Time/Day Submission Date THIS BOX FOR INSTRUCTOR GRADING USE ONLY Mini-Lesson is complete and information presented is as found on media links (0 5 pts) Comments:

More information

Feature-based methods for image matching

Feature-based methods for image matching Feature-based methods for image matching Bag of Visual Words approach Feature descriptors SIFT descriptor SURF descriptor Geometric consistency check Vocabulary tree Digital Image Processing: Bernd Girod,

More information

Multimedia Retrieval Ch 5 Image Processing. Anne Ylinen

Multimedia Retrieval Ch 5 Image Processing. Anne Ylinen Multimedia Retrieval Ch 5 Image Processing Anne Ylinen Agenda Types of image processing Application areas Image analysis Image features Types of Image Processing Image Acquisition Camera Scanners X-ray

More information

EE795: Computer Vision and Intelligent Systems

EE795: Computer Vision and Intelligent Systems EE795: Computer Vision and Intelligent Systems Spring 2012 TTh 17:30-18:45 FDH 204 Lecture 10 130221 http://www.ee.unlv.edu/~b1morris/ecg795/ 2 Outline Review Canny Edge Detector Hough Transform Feature-Based

More information

CS143 Introduction to Computer Vision Homework assignment 1.

CS143 Introduction to Computer Vision Homework assignment 1. CS143 Introduction to Computer Vision Homework assignment 1. Due: Problem 1 & 2 September 23 before Class Assignment 1 is worth 15% of your total grade. It is graded out of a total of 100 (plus 15 possible

More information

CS5670: Computer Vision

CS5670: 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 information

Face Tracking : An implementation of the Kanade-Lucas-Tomasi Tracking algorithm

Face Tracking : An implementation of the Kanade-Lucas-Tomasi Tracking algorithm Face Tracking : An implementation of the Kanade-Lucas-Tomasi Tracking algorithm Dirk W. Wagener, Ben Herbst Department of Applied Mathematics, University of Stellenbosch, Private Bag X1, Matieland 762,

More information

IMAGE-GUIDED TOURS: FAST-APPROXIMATED SIFT WITH U-SURF FEATURES

IMAGE-GUIDED TOURS: FAST-APPROXIMATED SIFT WITH U-SURF FEATURES IMAGE-GUIDED TOURS: FAST-APPROXIMATED SIFT WITH U-SURF FEATURES Eric Chu, Erin Hsu, Sandy Yu Department of Electrical Engineering Stanford University {echu508, erinhsu, snowy}@stanford.edu Abstract In

More information

Image Mosaic with Rotated Camera and Book Searching Applications Using SURF Method

Image Mosaic with Rotated Camera and Book Searching Applications Using SURF Method Image Mosaic with Rotated Camera and Book Searching Applications Using SURF Method Jaejoon Kim School of Computer and Communication, Daegu University, 201 Daegudae-ro, Gyeongsan, Gyeongbuk, 38453, South

More information

Computer vision: models, learning and inference. Chapter 13 Image preprocessing and feature extraction

Computer vision: models, learning and inference. Chapter 13 Image preprocessing and feature extraction Computer vision: models, learning and inference Chapter 13 Image preprocessing and feature extraction Preprocessing The goal of pre-processing is to try to reduce unwanted variation in image due to lighting,

More information

CEE598 - Visual Sensing for Civil Infrastructure Eng. & Mgmt.

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

Requirements for region detection

Requirements for region detection Region detectors Requirements for region detection For region detection invariance transformations that should be considered are illumination changes, translation, rotation, scale and full affine transform

More information

Wikipedia - Mysid

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

Data Association for SLAM

Data Association for SLAM CALIFORNIA INSTITUTE OF TECHNOLOGY ME/CS 132a, Winter 2011 Lab #2 Due: Mar 10th, 2011 Part I Data Association for SLAM 1 Introduction For this part, you will experiment with a simulation of an EKF SLAM

More information

Computer Vision I. Announcement. Corners. Edges. Numerical Derivatives f(x) Edge and Corner Detection. CSE252A Lecture 11

Computer Vision I. Announcement. Corners. Edges. Numerical Derivatives f(x) Edge and Corner Detection. CSE252A Lecture 11 Announcement Edge and Corner Detection Slides are posted HW due Friday CSE5A Lecture 11 Edges Corners Edge is Where Change Occurs: 1-D Change is measured by derivative in 1D Numerical Derivatives f(x)

More information

Edge Detection (with a sidelight introduction to linear, associative operators). Images

Edge Detection (with a sidelight introduction to linear, associative operators). Images Images (we will, eventually, come back to imaging geometry. But, now that we know how images come from the world, we will examine operations on images). Edge Detection (with a sidelight introduction to

More information

Local features: detection and description. Local invariant features

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

Feature descriptors. Alain Pagani Prof. Didier Stricker. Computer Vision: Object and People Tracking

Feature descriptors. Alain Pagani Prof. Didier Stricker. Computer Vision: Object and People Tracking Feature descriptors Alain Pagani Prof. Didier Stricker Computer Vision: Object and People Tracking 1 Overview Previous lectures: Feature extraction Today: Gradiant/edge Points (Kanade-Tomasi + Harris)

More information

IMPLEMENTATION OF THE OPENSURF ALGORITHM IN FIELD PROGRAMMABLE GATE ARRAYS

IMPLEMENTATION OF THE OPENSURF ALGORITHM IN FIELD PROGRAMMABLE GATE ARRAYS Technical University of Crete Electronic and Computer Engineering Department Microprocessor & Hardware Laboratory (MHL) IMPLEMENTATION OF THE OPENSURF ALGORITHM IN FIELD PROGRAMMABLE GATE ARRAYS Diploma

More information

Image features. Image Features

Image features. Image Features Image features Image features, such as edges and interest points, provide rich information on the image content. They correspond to local regions in the image and are fundamental in many applications in

More information

Local features: detection and description May 12 th, 2015

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

Filtering Images. Contents

Filtering Images. Contents Image Processing and Data Visualization with MATLAB Filtering Images Hansrudi Noser June 8-9, 010 UZH, Multimedia and Robotics Summer School Noise Smoothing Filters Sigmoid Filters Gradient Filters Contents

More information

CSE152 Introduction to Computer Vision Assignment 3 (SP15) Instructor: Ben Ochoa Maximum Points : 85 Deadline : 11:59 p.m., Friday, 29-May-2015

CSE152 Introduction to Computer Vision Assignment 3 (SP15) Instructor: Ben Ochoa Maximum Points : 85 Deadline : 11:59 p.m., Friday, 29-May-2015 Instructions: CSE15 Introduction to Computer Vision Assignment 3 (SP15) Instructor: Ben Ochoa Maximum Points : 85 Deadline : 11:59 p.m., Friday, 9-May-015 This assignment should be solved, and written

More information

Edge and corner detection

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

A Keypoint Descriptor Inspired by Retinal Computation

A Keypoint Descriptor Inspired by Retinal Computation A Keypoint Descriptor Inspired by Retinal Computation Bongsoo Suh, Sungjoon Choi, Han Lee Stanford University {bssuh,sungjoonchoi,hanlee}@stanford.edu Abstract. The main goal of our project is to implement

More information

Faster Image Feature Extraction Hardware

Faster Image Feature Extraction Hardware IOSR Journal of Computer Engineering (IOSR-JCE) e-issn: 2278-0661,p-ISSN: 2278-8727 PP 33-38 www.iosrjournals.org Jibu J.V, Sherin Das, Mini Kumari G Assistant Professor,College of Engineering, Chengannur.Alappuzha,

More information