lecture 4 image pyramids ps1 due at midnight ps2 out due
play

Lecture 4: Image pyramids PS1 due at midnight PS2 out, due next - PowerPoint PPT Presentation

Lecture 4: Image pyramids PS1 due at midnight PS2 out, due next Tues. No Thursday office hours this week If you're on the waitlist, submit your PS1 via email to the course staff. Today Image pyramids Texture We want


  1. Lecture 4: Image pyramids

  2. •PS1 due at midnight •PS2 out, due next Tues. •No Thursday office hours this week •If you're on the waitlist, submit your PS1 via email to the course staff.

  3. Today • Image pyramids • Texture

  4. We want scale and translation invariance. Source: Torralba, Freeman, Isola

  5. Image pyramids Source: Torralba, Freeman, Isola

  6. Gaussian Pyramid 1/2 1/2 1/2 1/2 Source: Torralba, Freeman, Isola

  7. Subsampling and aliasing 1/2 1/2 Source: Torralba, Freeman, Isola

  8. Aliasing Both waves fit the same samples. We “perceive” the red wave when the actual input was the blue wave. Source: Torralba, Freeman, Isola

  9. The Gaussian pyramid For each level 1. Blur input image with a Gaussian filter [1, 4, 6, 4, 1] [1 4 [1, 4, 6, 4, 1] 6 4 1] Source: Torralba, Freeman, Isola

  10. The Gaussian pyramid For each level 1. Blur input image with a Gaussian filter 2. Downsample image Source: Torralba, Freeman, Isola

  11. The Gaussian pyramid 64 × 64 256 × 256 128 × 128 32 × 32 2 2 2 Source: Torralba, Freeman, Isola

  12. The Gaussian pyramid 256 × 256 128 × 128 64 × 64 32 × 32 512 × 512 (original image) Source: Torralba, Freeman, Isola

  13. The Gaussian pyramid g 2 [1, 4, 6, 4, 1] g 1 [1, 4, 6, 4, 1] g 0 g 1 = G 0 g 0 Source: Torralba, Freeman, Isola

  14. The Gaussian pyramid g 2 [1, 4, 6, 4, 1] g 1 [1, 4, 6, 4, 1] g 0 g 1 = G 0 g 0 Source: Torralba, Freeman, Isola

  15. The Gaussian pyramid g 2 [1, 4, 6, 4, 1] g 1 [1, 4, 6, 4, 1] g 0 g 2 = G 1 g 1 I g 1 = G 0 g 0 g 0 x = g 2 = G 1 G 0 g 0 g 1 G 0 g 2 G 1 G 0 Source: Torralba, Freeman, Isola

  16. The Gaussian pyramid For each level 1. Blur input image with a Gaussian filter 2. Downsample image Source: Torralba, Freeman, Isola

  17. The Laplacian Pyramid Compute the di ff erence between upsampled Gaussian pyramid level k+1 and Gaussian pyramid level k. Recall that this approximates the blurred Laplacian. + - Source: Torralba, Freeman, Isola

  18. The Laplacian Pyramid Gaussian pyramid Source: Torralba, Freeman, Isola

  19. The Laplacian Pyramid Gaussian pyramid Laplacian pyramid Source: Torralba, Freeman, Isola

  20. The Laplacian Pyramid Blurring and downsampling: (Downsampling by 2) (blur) Upsampling and blurring: Source: Torralba, Freeman, Isola

  21. Upsampling 128x128 128x128 64x64 Insert zeros = Source: Torralba, Freeman, Isola

  22. The Laplacian Pyramid Blurring and downsampling: (Downsampling by 2) (blur) Upsampling and blurring: (blur) (Upsampling by 2) Source: Torralba, Freeman, Isola

  23. The Laplacian Pyramid Gaussian pyramid l 0 x = l 1 Laplacian pyramid g 2 Source: Torralba, Freeman, Isola

  24. The Laplacian Pyramid Gaussian residual Can we invert the 
 Laplacian pyramid Laplacian Pyramid? Source: Torralba, Freeman, Isola

  25. The Laplacian Pyramid Gaussian pyramid Laplacian pyramid Source: Torralba, Freeman, Isola

  26. The Laplacian Pyramid Gaussian pyramid Laplacian pyramid Analysis/Encoder Synthesis/Decoder Source: Torralba, Freeman, Isola

  27. Laplacian pyramid applications • Texture synthesis • Image compression • Noise removal • Computing image features (e.g., SIFT) Source: Torralba, Freeman, Isola

  28. Image Blending Source: Torralba, Freeman, Isola

  29. Image Blending Source: Torralba, Freeman, Isola

  30. Image Blending m I I B I A I = m * I A + (1 − m ) * I B Source: Torralba, Freeman, Isola

  31. Image Blending with the Laplacian Pyramid Source: Torralba, Freeman, Isola

  32. Image Blending with the Laplacian Pyramid Source: Torralba, Freeman, Isola

  33. + = Simple blend With Laplacian pyr. Source: A. Efros

  34. Photo credit: Chris Cameron Source: A. Efros

  35. Image Blending (PS2 problem) • Build Laplacian pyramid for both images: L A , L B • Build Gaussian pyramid for mask: G • Build a combined Laplacian pyramid: • Collapse L to obtain the blended image Source: Torralba, Freeman, Isola

  36. Image pyramids Gaussian Pyr. Laplacian Pyr. And many more: steerable filters, wavelets, … convolutional networks! Source: Torralba, Freeman, Isola

  37. Orientations Source: Torralba, Freeman, Isola

  38. Steerable Pyramid Oriented gradient Source: Torralba, Freeman, Isola

  39. Linear Image Transforms Fourier transform Gaussian pyr. Laplacian pyr. Steerable pyr. Source: Torralba, Freeman, Isola

  40. Source: Torralba, Freeman, Isola

  41. Texture Stationary Stochastic Source: Torralba, Freeman, Isola

  42. Texture analysis “Same” or Analysis “different” True (infinite) texture What we’d like: are they made of the same “stuff”. Are these textures similar? Source: A. Efros

  43. How do humans analyze texture? Human vision is sensitive to the difference of some types of elements and Béla Julesz appears to be “numb” on other types of differences. Source: A. Efros

  44. Pre-attentive texture discrimination Bela Julesz, "Textons, the Elements of Texture Perception, and their Interactions". Nature 290: 91-97. March, 1981. Source: Torralba, Freeman, Isola

  45. Pre-attentive texture discrimination Bela Julesz, "Textons, the Elements of Texture Perception, and their Interactions". Nature 290: 91-97. March, 1981. Source: Torralba, Freeman, Isola

  46. Pre-attentive texture discrimination This texture pair is pre-attentively indistinguishable. Why? Bela Julesz, "Textons, the Elements of Texture Perception, and their Interactions". Nature 290: 91-97. March, 1981. Source: A. Efros

  47. Search Experiment I The subject is told to detect a target element in a number of background elements. In this example, the detection time is independent of the number of background elements. Source: A. Efros

  48. Search Experiment II Here detection time is proportional to the number of background elements, and thus suggests that the subject is doing element-by-element scrutiny. Source: A. Efros

  49. Heuristic Julesz then conjectured the following: Human vision operates in two distinct modes: 1. Preattentive vision parallel, instantaneous (~100--200ms), without scrutiny, independent of the number of patterns, covering a large visual field. 2. Attentive vision serial search by focal attention in 50ms steps limited to small aperture. Source: A. Efros

  50. Julesz Conjecture Textures cannot be spontaneously discriminated if they have the same first-order and second-order statistics and di ff er only in their third-order or higher-order statistics. (later proved wrong) Source: A. Efros

  51. 1 st order statistics di ff er 5% white 20% white Source: A. Efros

  52. 2 nd order statistics di ff er 10% white Source: A. Efros

  53. How can we represent texture in natural images? • Idea 1: Record simple statistics (e.g., mean, std.) of absolute filter responses Source: A. Efros

  54. Can you match the texture to the response? Filters A B 1 2 C 3 Mean abs. responses Source: A. Efros

  55. How can we represent texture in natural images? • Generalize this to “orientation histogram” • Idea 2: Marginal histograms of filter responses • One histogram per filter Source: A. Efros

  56. Steerable filter decomposition Filter bank Input image Source: A. Efros

  57. Filter response histograms Source: A. Efros

  58. Texture synthesis Start with a noise image as output. Main loop: • Match pixel histogram of output image to input • Decompose input/output images using a Steerable Pyramid • Match subband histograms of input and output pyramids • Reconstruct input and output images (collapse the pyramids) Heeger, Bergen, Pyramid-based texture analysis/synthesis, SIGGRAPH 1995 Source: A. Efros

  59. Source: A. Efros

  60. Source: A. Efros

  61. Source: A. Efros

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