interest points
play

Interest points CSE 576 Ali Farhadi Many slides from Steve Seitz, - PowerPoint PPT Presentation

Interest points CSE 576 Ali Farhadi Many slides from Steve Seitz, Larry Zitnick How can we find corresponding points? Not always easy NASA Mars Rover images Answer below (look for tiny colored squares) NASA Mars Rover images with SIFT


  1. Interest points CSE 576 Ali Farhadi Many slides from Steve Seitz, Larry Zitnick

  2. How can we find corresponding points?

  3. Not always easy NASA Mars Rover images

  4. Answer below (look for tiny colored squares…) NASA Mars Rover images with SIFT feature matches 
 Figure by Noah Snavely

  5. Human eye movements Yarbus eye tracking

  6. Interest points original • Suppose you have to click on some point, go away and come back after I deform the image, and click on the same points again. • Which points would you choose? deformed

  7. Intuition

  8. Corners • We should easily recognize the point by looking through a small window • Shifting a window in any direction should give a large change in intensity “flat” region:
 “edge”:
 “corner”:
 no change in no change along significant all directions the edge change in all direction directions Source: A. Efros

  9. Let’s look at the gradient distributions

  10. Principle Component Analysis Principal component is the direction of highest How to compute PCA components: variance. 1. Subtract off the mean for each data point. 2. Compute the covariance matrix. Next, highest component is the direction with 3. Compute eigenvectors and eigenvalues. highest variance orthogonal to the previous 4. The components are the eigenvectors ranked components. by the eigenvalues.

  11. Corners have … Both eigenvalues are large!

  12. Second Moment Matrix " % I x I x I x I y w ( x , y ) ∑ $ ' M = I x I y I y I y $ ' x , y # & 2 x 2 matrix of image derivatives (averaged in neighborhood of a point). I I I I ∂ ∂ ∂ ∂ I x I y I I Notation: ⇔ ⇔ ⇔ x y x y x y ∂ ∂ ∂ ∂

  13. The math To compute the eigenvalues: 1. Compute the covariance matrix. Typically Gaussian weights 2. Compute eigenvalues.

  14. Corner Response Function • Computing eigenvalues are expensive • Harris corner detector uses the following alternative Reminder :

  15. Harris detector: Steps 1. Compute Gaussian derivatives at each pixel 2. Compute second moment matrix M in a Gaussian window around each pixel 3. Compute corner response function R 4. Threshold R 5. Find local maxima of response function (nonmaximum suppression) C.Harris and M.Stephens. “A Combined Corner and Edge Detector.” Proceedings of the 4th Alvey Vision Conference : pages 147—151, 1988.

  16. Harris Detector: Steps

  17. Harris Detector: Steps Compute corner response R

  18. Harris Detector: Steps Find points with large corner response: R> threshold

  19. Harris Detector: Steps Take only the points of local maxima of R

  20. Harris Detector: Steps

  21. Simpler Response Function 1 = Det ( H ) f = 1 + 1 Tr ( H ) λ 1 λ 2

  22. Properties of the Harris corner detector • Translation invariant? Yes • Rotation invariant? Yes • Scale invariant? No Corner ! All points will be classified as edges

  23. Scale Let’s look at scale first: What is the “best” scale?

  24. Scale Invariance f ( I ( x , )) f ( I ( x , )) " " σ = σ i … i i … i 1 m 1 m How can we independently select interest points in each image, such that the detections are repeatable across different scales? K. Grauman, B. Leibe

  25. Differences between Inside and Outside

  26. Scale Why Gaussian? It is invariant to scale change, i.e., and has several other nice properties. Lindeberg, 1994 In practice, the Laplacian is approximated using a Difference of Gaussian (DoG).

  27. Difference-of-Gaussian (DoG) = - K. Grauman, B. Leibe

  28. DoG example σ = 1 σ = 66

  29. Scale invariant interest points Interest points are local maxima in both position and scale. σ 5 σ 4 scale L ( ) L ( ) σ + σ σ 3 xx yy σ 2 ⇒ List of 
 (x, y, σ ) σ 1 Squared filter response maps

  30. Scale In practice the image is downsampled for larger sigmas. Lowe, 2004.

  31. Results: Difference-of-Gaussian K. Grauman, B. Leibe

  32. How can we find correspondences? Similarity transform

  33. Rotation invariance CSE 576: Computer Vision • Rotate patch according to its dominant gradient orientation • This puts the patches into a canonical orientation. Image from Matthew Brown

  34. Orientation Normalization • Compute orientation histogram [Lowe, SIFT, 1999] • Select dominant orientation • Normalize: rotate to fixed orientation 2 π 0 T. Tuytelaars, B. Leibe

Download Presentation
Download Policy: The content available on the website is offered to you 'AS IS' for your personal information and use only. It cannot be commercialized, licensed, or distributed on other websites without prior consent from the author. To download a presentation, simply click this link. If you encounter any difficulties during the download process, it's possible that the publisher has removed the file from their server.

Recommend


More recommend