overview
play

Overview Introduction to local features Harris interest points + - PowerPoint PPT Presentation

Overview Introduction to local features Harris interest points + SSD, ZNCC, SIFT Scale & affine invariant interest point detectors Scale & affine invariant interest point detectors Evaluation and comparison of


  1. Overview • Introduction to local features • Harris interest points + SSD, ZNCC, SIFT • Scale & affine invariant interest point detectors • Scale & affine invariant interest point detectors • Evaluation and comparison of different detectors • Region descriptors and their performance

  2. Affine invariant regions - Motivation • Scale invariance is not sufficient for large baseline changes detected scale invariant region A A projected regions, viewpoint changes can locally be approximated by an affine transformation A

  3. Affine invariant regions - Motivation

  4. Affine invariant regions - Example

  5. Harris/Hessian/Laplacian-Affine • Initialize with scale-invariant Harris/Hessian/Laplacian points • Estimation of the affine neighbourhood with the second moment matrix [Lindeberg’94] • Apply affine neighbourhood estimation to the scale- invariant interest points [Mikolajczyk & Schmid’02, Schaffalitzky & Zisserman’02] • Excellent results in a comparison [Mikolajczyk et al.’05]

  6. Affine invariant regions • Based on the second moment matrix (Lindeberg’94)   x x σ σ L L L 2 ( , ) ( , ) x = µ σ σ = σ σ ⊗ M G x D x y D 2   ( , , ) ( ) x x I D D I σ σ L L L 2   ( , ) ( , )   x y D y D • Normalization with eigenvalues/eigenvectors 1 ′ = M x 2 x

  7. Affine invariant regions = A x x R L ′ ′ 1 1 = = M M x 2 x x 2 x L R L L R R ′ ′ = R x x R L Isotropic neighborhoods related by image rotation

  8. Affine invariant regions - Estimation • Iterative estimation – initial points

  9. Affine invariant regions - Estimation • Iterative estimation – iteration #1

  10. Affine invariant regions - Estimation • Iterative estimation – iteration #2

  11. Affine invariant regions - Estimation • Iterative estimation – iteration #3, #4

  12. Harris-Affine versus Harris-Laplace Harris-Laplace Harris-Affine

  13. Harris/Hessian-Affine Harris-Affine Hessian-Affine

  14. Harris-Affine

  15. Hessian-Affine

  16. Matches 22 correct matches

  17. Matches 33 correct matches

  18. Maximally stable extremal regions (MSER) [Matas’02] • Based on the idea of region segmentation • State of the art results

  19. Maximally stable extremal regions (MSER) [Matas’02] • Extremal regions: connected components in a thresholded image (all pixels above/below a threshold) • Maximally stable: minimal change of the component (area) for a change of the threshold, i.e. region remains (area) for a change of the threshold, i.e. region remains stable for a change of threshold

  20. Maximally stable extremal regions (MSER) Examples of thresholded images high threshold low threshold

  21. MSER

  22. Overview • Introduction to local features • Harris interest points + SSD, ZNCC, SIFT • Scale & affine invariant interest point detectors • Scale & affine invariant interest point detectors • Evaluation and comparison of different detectors • Region descriptors and their performance

  23. Evaluation of interest points • Quantitative evaluation of interest point/region detectors – points / regions at the same relative location and area • Repeatability rate : percentage of corresponding points • Two points/regions are corresponding if – location error small – area intersection large • [K. Mikolajczyk, T. Tuytelaars, C. Schmid, A. Zisserman, J. Matas, F. Schaffalitzky, T. Kadir & L. Van Gool ’05]

  24. Evaluation criterion H correspond ing regions # = ⋅ repeatabil ity 100 % detected regions #

  25. Evaluation criterion H correspond ing regions # = ⋅ repeatabil ity 100 % detected regions # intersecti on = − ⋅ overlap error ( 1 ) 100 % union 2% 10% 20% 30% 40% 50% 60%

  26. Comparison of affine invariant detectors Viewpoint change - structured scene repeatability % 100 Harris−Affine 90 Hessian−Affine MSER 80 IBR EBR 70 Salient repeatability % repeatability % 60 60 50 40 30 20 10 0 15 20 25 30 35 40 45 50 55 60 65 viewpoint angle 20 40 60 reference image

  27. Comparison of affine invariant detectors Scale change – textured scene repeatability % 4 reference image

  28. Conclusion - detectors • Good performance for large viewpoint and scale changes • Results depend on transformation and scene type, no one best detector • Detectors are complementary – MSER adapted to structured scenes – Harris and Hessian adapted to textured scenes • Performance of the different scale invariant detectors is very similar (Harris-Laplace, Hessian, LoG and DOG) • Scale-invariant detector sufficient up to 40 degrees of viewpoint change

  29. Overview • Introduction to local features • Harris interest points + SSD, ZNCC, SIFT • Scale & affine invariant interest point detectors • Scale & affine invariant interest point detectors • Evaluation and comparison of different detectors • Region descriptors and their performance

  30. Region descriptors • Normalized regions are – invariant to geometric transformations except rotation – not invariant to photometric transformations

  31. Descriptors • Regions invariant to geometric transformations except rotation – rotation invariant descriptors – normalization with dominant gradient direction – normalization with dominant gradient direction • Regions not invariant to photometric transformations – invariance to affine photometric transformations – normalization with mean and standard deviation of the image patch

  32. Descriptors Eliminate rotational Compute appearance Extract affine regions Normalize regions descriptors + illumination SIFT (Lowe ’04)

  33. Descriptors • Gaussian derivative-based descriptors – Differential invariants ( Koenderink and van Doorn’87 ) – Steerable filters ( Freeman and Adelson’91 ) • SIFT ( Lowe’99) • SIFT ( Lowe’99) • Moment invariants [Van Gool et al.’96] • Shape context [Belongie et al.’02] • SIFT with PCA dimensionality reduction • Gradient PCA [Ke and Sukthankar’04] • SURF descriptor [Bay et al.’08] • DAISY descriptor [Tola et al.’08, Windler et al’09]

  34. Comparison criterion • Descriptors should be – Distinctive – Robust to changes on viewing conditions as well as to errors of the detector • Detection rate (recall) • Detection rate (recall) 1 1 – #correct matches / #correspondences • False positive rate – #false matches / #all matches • Variation of the distance threshold – distance (d1, d2) < threshold 1 [K. Mikolajczyk & C. Schmid, PAMI’05]

  35. Viewpoint change (60 degrees) sift shape context steerable filters * * esift cross correlation gradient moments gradient pca har−aff esift complex filters 1 0.9 0.8 0.7 #correct / 2101 #correct / 2101 0.6 0.6 0.5 0.4 0.3 0.2 0.1 0 0 0.1 0.2 0.3 0.4 0.5 0.6 0.7 0.8 0.9 1 1−precision

  36. Scale change (factor 2.8) sift shape context steerable filters * * esift gradient moments cross correlation gradient pca har−aff esift complex filters 1 0.9 0.8 0.7 #correct / 2086 #correct / 2086 0.6 0.6 0.5 0.4 0.3 0.2 0.1 0 0 0.1 0.2 0.3 0.4 0.5 0.6 0.7 0.8 0.9 1 1−precision

  37. Conclusion - descriptors • SIFT based descriptors perform best • Significant difference between SIFT and low dimension descriptors as well as cross-correlation • Robust region descriptors better than point-wise descriptors • Performance of the descriptor is relatively independent of the detector

  38. Available on the internet • Binaries for detectors and descriptors – Building blocks for recognition systems • Carefully designed test setup • Carefully designed test setup – Dataset with transformations – Evaluation code in matlab – Benchmark for new detectors and descriptors http://lear.inrialpes.fr/software

Recommend


More recommend