descriptors ii
play

Descriptors II CSE 576 Ali Farhadi Many slides from Larry Zitnick, - PowerPoint PPT Presentation

Descriptors II CSE 576 Ali Farhadi Many slides from Larry Zitnick, Steve Seitz How can we find corresponding points? How can we find correspondences? SIFT descriptor Full version Divide the 16x16 window into a 4x4 grid of cells (2x2 case shown


  1. Descriptors II CSE 576 Ali Farhadi Many slides from Larry Zitnick, Steve Seitz

  2. How can we find corresponding points?

  3. How can we find correspondences?

  4. SIFT descriptor Full version Divide the 16x16 window into a 4x4 grid of cells (2x2 case shown below) • Compute an orientation histogram for each cell • 16 cells * 8 orientations = 128 dimensional descriptor • Adapted from slide by David Lowe

  5. Local Descriptors: Shape Context Count the number of points inside each bin, e.g.: Count = 4 ... Count = 10 Log-polar binning: more precision for nearby points, more flexibility for farther points. Belongie & Malik, ICCV 2001 K. Grauman, B. Leibe

  6. Texture • Texture is characterized by the repetition of basic elements or textons • For stochastic textures, it is the identity of the textons, not their spatial arrangement, that matters Julesz, 1981; Cula & Dana, 2001; Leung & Malik 2001; Mori, Belongie & Malik, 2001; Schmid 2001; Varma & Zisserman, 2002, 2003; Lazebnik, Schmid & Ponce, 2003

  7. Bag-of-words models • Orderless document representation: frequencies of words from a dictionary Salton & McGill (1983)

  8. Bag-of-words models • Orderless document representation: frequencies of words from a dictionary Salton & McGill (1983) US Presidential Speeches Tag Cloud 
 http://chir.ag/phernalia/preztags/

  9. Bag-of-words models • Orderless document representation: frequencies of words from a dictionary Salton & McGill (1983) US Presidential Speeches Tag Cloud 
 http://chir.ag/phernalia/preztags/

  10. Bag-of-words models • Orderless document representation: frequencies of words from a dictionary Salton & McGill (1983) US Presidential Speeches Tag Cloud 
 http://chir.ag/phernalia/preztags/

  11. Bags of features for image classification 1. Extract features

  12. Bags of features for image classification 1. Extract features 2. Learn “visual vocabulary”

  13. Bags of features for image classification 1. Extract features 2. Learn “visual vocabulary” 3. Quantize features using visual vocabulary

  14. Bags of features for image classification 1. Extract features 2. Learn “visual vocabulary” 3. Quantize features using visual vocabulary 4. Represent images by frequencies of 
 “visual words”

  15. Texture representation histogram Universal texton dictionary Julesz, 1981; Cula & Dana, 2001; Leung & Malik 2001; Mori, Belongie & Malik, 2001; Schmid 2001; Varma & Zisserman, 2002, 2003; Lazebnik, Schmid & Ponce, 2003

  16. 1. Feature extraction • Regular grid • Vogel & Schiele, 2003 • Fei-Fei & Perona, 2005 • Interest point detector • Csurka et al. 2004 • Fei-Fei & Perona, 2005 • Sivic et al. 2005

  17. 1. Feature extraction • Regular grid • Vogel & Schiele, 2003 • Fei-Fei & Perona, 2005 • Interest point detector • Csurka et al. 2004 • Fei-Fei & Perona, 2005 • Sivic et al. 2005 • Other methods • Random sampling (Vidal-Naquet & Ullman, 2002) • Segmentation-based patches (Barnard et al. 2003)

  18. 1. Feature extraction Compute Normalize SIFT patch descriptor [Lowe’99] Detect patches [Mikojaczyk and Schmid ’02] [Mata, Chum, Urban & Pajdla, ’02] [Sivic & Zisserman, ’03] Slide credit: Josef Sivic

  19. 1. Feature extraction …

  20. 2. Discovering the visual vocabulary …

  21. 2. Discovering the visual vocabulary … Clustering Slide credit: Josef Sivic

  22. 2. Discovering the visual vocabulary Visual vocabulary … Clustering Slide credit: Josef Sivic

  23. Clustering and vector quantization • Clustering is a common method for learning a visual vocabulary or codebook • Unsupervised learning process • Each cluster center produced by k-means becomes a codevector • Codebook can be learned on separate training set • Provided the training set is sufficiently representative, the codebook will be “universal” 
 • The codebook is used for quantizing features • A vector quantizer takes a feature vector and maps it to the index of the nearest codevector in a codebook • Codebook = visual vocabulary • Codevector = visual word 


  24. Example visual vocabulary Fei-Fei et al. 2005

  25. Example codebook … Appearance codebook Source: B. Leibe

  26. Another codebook … … … … … Appearance codebook Source: B. Leibe

  27. Visual vocabularies: Issues • How to choose vocabulary size? • Too small: visual words not representative of all patches • Too large: quantization artifacts, overfitting • Computational efficiency • Vocabulary trees 
 (Nister & Stewenius, 2006)

  28. 3. Image representation frequency ….. codewords

  29. Image classification • Given the bag-of-features representations of images from different classes, learn a classifier using machine learning

  30. Another Representation: Filter bank

  31. Image from http://www.texasexplorer.com/austincap2.jpg Kristen Grauman

  32. Showing magnitude of responses Kristen Grauman

  33. Kristen Grauman

  34. Kristen Grauman

  35. Kristen Grauman

  36. Kristen Grauman

  37. Kristen Grauman

  38. Kristen Grauman

  39. Kristen Grauman

  40. Kristen Grauman

  41. Kristen Grauman

  42. How can we represent texture? • Measure responses of various filters at different orientations and scales • Idea 1: Record simple statistics (e.g., mean, std.) of absolute filter responses

  43. Can you match the texture to the response? Filters A B 1 2 C 3 Mean abs responses

  44. Representing texture by mean abs response Filters Mean abs responses

  45. Representing texture • Idea 2: take vectors of filter responses at each pixel and cluster them, then take histograms

  46. Representing texture clustering

  47. But what about layout? All of these images have the same color histogram

  48. Spatial pyramid representation • Extension of a bag of features Locally orderless representation at several levels of resolution • level 0 Lazebnik, Schmid & Ponce (CVPR 2006)

  49. Spatial pyramid representation Extension of a bag of features • Locally orderless representation at several levels of resolution • level 1 level 0 Lazebnik, Schmid & Ponce (CVPR 2006)

  50. Spatial pyramid representation Extension of a bag of features • Locally orderless representation at several levels of resolution • level 1 level 2 level 0 Lazebnik, Schmid & Ponce (CVPR 2006)

  51. What about Scenes?

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