efficient edge estimation
play

Efficient Edge Estimation Instructor - Simon Lucey 16-623 - - PowerPoint PPT Presentation

Efficient Edge Estimation Instructor - Simon Lucey 16-623 - Designing Computer Vision Apps Today Motivation. What is an Edge? Oriented Filters. Learning Efficient Edges. Persistent versus Occluding Edges Texture and


  1. Efficient Edge Estimation Instructor - Simon Lucey 16-623 - Designing Computer Vision Apps

  2. Today • Motivation. • What is an Edge? • Oriented Filters. • Learning Efficient Edges.

  3. Persistent versus Occluding Edges • Texture and geometric edges are “persistent” across viewpoints. • Occluding edges are “unique” to viewpoint, but potentially provide rich information about a 3D object. Taken from Ham, Singh and Lucey “Occlusions are Fleeting - Texture is Forever: Moving Past Brightness Constancy”

  4. Persistent versus Occluding Edges (a) Rendered Glass (b) Non-persistent Edges (c) Persistent + 3D Poly Edges Taken from Ham, Singh and Lucey “Occlusions are Fleeting - Texture is Forever: Moving Past Brightness Constancy”

  5. Taken from Ham, Singh and Lucey “Occlusions are Fleeting - Texture is Forever: Moving Past Brightness Constancy”

  6. Today • Motivation. • What is an Edge? • Oriented Filters. • Learning Efficient Edges.

  7. 1968 Canny edge detector original image human annotator Taken from Isola et al. “Crisp Boundary Detection Using Pointwise Mutual Information”

  8. Edges are Semantic • No mathematical definition of an edge, contour of boundary. • Classic problem in computer vision. • By definition they are semantic. • Early work focussed on oriented filters. • e.g. Canny edge detectors. • Developed by John F. Canny in 1986. “John Canny”

  9. D.H. Hubel & T.N. Wiesel. Receptive fields, binocular interaction and functional architecture in the cat’s visual cortex. The Journal of Physiology, 160(1):106, 1962.

  10. D.H. Hubel & T.N. Wiesel. Receptive fields, binocular interaction and functional architecture in the cat’s visual cortex. The Journal of Physiology, 160(1):106, 1962.

  11. D.H. Hubel & T.N. Wiesel. Receptive fields, binocular interaction and functional architecture in the cat’s visual cortex. The Journal of Physiology, 160(1):106, 1962.

  12. D.H. Hubel & T.N. Wiesel. Receptive fields, binocular interaction and functional architecture in the cat’s visual cortex. The Journal of Physiology, 160(1):106, 1962.

  13. Olshausen & Field 1996

  14.   . . . M × N . . . . . . X =   . . . . x 1 x 2 x N − 1 x N . .

  15. 0.25 0.8 0.7 0.2 0.6 p ( x ) 0.5 0.15 0.4 0.1 0.3 0.2 0.05 0.1 0 0 -6 -6 -4 -4 -2 -2 0 0 2 2 4 4 6 6 x n X 3.19 bits 1.41 bits H ( x ) = − p ( x n ) · log[ p ( x n )] = n =1 Olshausen & Field 1996

  16. �� �� �� �� c) + = × ✏ X D Z Olshausen & Field 1996 Not Always Zero Always Zero H. Lee, A. Ng, et al. 2007

  17. Visualizing CNNs

  18. Today • Motivation. • What is an Edge? • Oriented Filters. • Learning Efficient Edges.

  19. 1D Filter ∗

  20. 1D Filter ∗

  21. 1D Filter ∗

  22. 2D Filter     1 , 0 , − 1 1 , 0 , − 1 1 , 0 , − 1 2 , 0 , − 2     ∗ 1 , 0 , − 1 1 , 0 , − 1 (Prewitt) (Sobel)

  23. 2D Filter + =

  24. �� �� �� �� 2D Filter c)

  25. 99.6% sparse per patch

  26. �� �� �� �� �� �� �� �� + . . . + ∗ + ∗ = c) d 1 d K ✏ z 1 z K x Not Always Zero Always Zero M. Zeiler, et al. 2010

  27. Edges Adapted from: Elder “Are Edges Incomplete?” IJCV 1999.

  28. �� �� Naive Approach? �� �� c) ∗ How do we recover edges?

  29. Canny Edge Detector Adapted from: Computer vision: models, learning and inference. Simon J.D. Prince

  30. Canny Edge Detector Compute horizontal and vertical gradient images h and v Adapted from: Computer vision: models, learning and inference. Simon J.D. Prince

  31. Oriented Filters • Seems inefficient to have to search all possible orientations, + = • Instead one can express all orientations as a linear combination of x- and y- gradient filters.

  32. Canny Edge Detector Quantize to 4 directions Adapted from: Computer vision: models, learning and inference. Simon J.D. Prince

  33. Canny Edge Detector Non-maximal suppression Adapted from: Computer vision: models, learning and inference. Simon J.D. Prince

  34. Non-Max Suppression • Interesting, view of non-max suppression in terms of sparse coding. = × X D Z • Non-max suppression attempts to enforce that Z is sparse.

  35. Canny Edge Detector Hysteresis Thresholding

  36. Classic Edge Detector - Problems Texture Edge Filtering Response Simple Step Edge Filtering Response Appearance Edges Found Original Color Image by Linear Filtering (a) (b) Taken from: “Occlusion Boundaries: Low-Level Detection to High-Level Reasoning” - A. Stein (Ph.D. Thesis)

  37. Today • Motivation. • What is an Edge? • Oriented Filters. • Learning Efficient Edges.

  38. What defines an edge? • Color. • Brightness. • Texture • Continuity • Symmetry

  39. Edge Estimation as a Learning Problem Taken from Martin et al. “Learning to Detect Natural Image Boundaries Using Local Brightness, Color, and Texture Cues“

  40. Current State of the Art Sobel & Feldman Arbeláez et al. 1968 2011 (gPb) Isola et al. ez et al. Dollár & Zitnick Our method Human labelers 2013 (SE) 2014 Taken from Isola et al. “Crisp Boundary Detection Using Pointwise Mutual Information”

  41. Current State of the Art - Speed ODS OIS AP R50 FPS Human .80 .80 - - - Canny .60 .63 .58 .75 15 Felz-Hutt [16] .61 .64 .56 .78 10 Normalized Cuts [10] .64 .68 .45 .81 - Mean Shift [9] .64 .68 .56 .79 - .62 † Hidayat-Green [23] - - - 20 .66 † BEL [13] - - - 1/10 Gb [30] .69 .72 .72 .85 1/6 .70 † 1/2 ‡ gPb + GPU [8] - - - “Requires GPU!!!” 1/30 ‡ ISCRA [42] .72 .75 .46 .89 gPb-owt-ucm [1] .73 .76 .73 .89 1/240 Sketch Tokens [31] .73 .75 .78 .91 1 1/5 ‡ DeepNet [27] .74 .76 .76 - SCG [41] .74 .76 .77 .91 1/280 SE+multi-ucm [2] .75 .78 .76 .91 1/15 SE .73 .75 .77 .90 30 SE+SH .74 .76 .79 .93 12.5 Dollar & Zitnick SE+MS .74 .76 .78 .90 6 SE+MS+SH .75 .77 .80 .93 2.5 Taken from Dollar & Zitnick “Fast Edge Detection Using Structured Forests”

  42. Edge Detection as Classification { 0, 1 } Hard! positives Taken from Dollar & Zitnick “Fast Edge Detection Using Structured Forests”

  43. Edges have Structure Taken from Dollar & Zitnick “Fast Edge Detection Using Structured Forests”

  44. Structured Random Forests Taken from Dollar & Zitnick “Fast Edge Detection Using Structured Forests”

  45. Structured Prediction Taken from Kontschieder “Structured Class-Labels in Random Forests for Semantic Image Labelling”

  46. Structured versus Pixel Prediction pixel output ☹ structured output ☺ Taken from Dollar & Zitnick “Fast Edge Detection Using Structured Forests”

  47. Multiscale Detection Taken from Dollar & Zitnick “Fast Edge Detection Using Structured Forests”

  48. Taken from Dollar & Zitnick “Fast Edge Detection Using Structured Forests”

  49. Taken from Dollar & Zitnick “Fast Edge Detection Using Structured Forests”

  50. Taken from Dollar & Zitnick “Fast Edge Detection Using Structured Forests”

  51. Things to try in iOS - GPUImage

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