gradients and edges n.
Download
Skip this Video
Loading SlideShow in 5 Seconds..
Gradients and edges PowerPoint Presentation
Download Presentation
Gradients and edges

Loading in 2 Seconds...

play fullscreen
1 / 33

Gradients and edges - PowerPoint PPT Presentation


  • 82 Views
  • Uploaded on

Points of sharp change in an image are interesting: change in reflectance change in object change in illumination noise Sometimes called edge points. General strategy determine image gradient

loader
I am the owner, or an agent authorized to act on behalf of the owner, of the copyrighted work described.
capcha
Download Presentation

Gradients and edges


An Image/Link below is provided (as is) to download presentation

Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author.While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server.


- - - - - - - - - - - - - - - - - - - - - - - - - - E N D - - - - - - - - - - - - - - - - - - - - - - - - - -
    Presentation Transcript
    1. Points of sharp change in an image are interesting: change in reflectance change in object change in illumination noise Sometimes called edge points General strategy determine image gradient now mark points where gradient magnitude is particularly large wrt neighbours (ideally, curves of such points). Gradients and edges Computer Vision - A Modern Approach Set: Linear Filters Slides by D.A. Forsyth

    2. There are three major issues: 1) The gradient magnitude at different scales is different; which should we choose? 2) The gradient magnitude is large along thick trail; how do we identify the significant points? 3) How do we link the relevant points up into curves? Computer Vision - A Modern Approach Set: Linear Filters Slides by D.A. Forsyth

    3. Smoothing and Differentiation • Issue: noise • smooth before differentiation • two convolutions to smooth, then differentiate? • actually, no - we can use a derivative of Gaussian filter • because differentiation is convolution, and convolution is associative Computer Vision - A Modern Approach Set: Linear Filters Slides by D.A. Forsyth

    4. 1 pixel 3 pixels 7 pixels The scale of the smoothing filter affects derivative estimates, and also the semantics of the edges recovered. Computer Vision - A Modern Approach Set: Linear Filters Slides by D.A. Forsyth

    5. Another way to detect an extremal first derivative is to look for a zero second derivative Appropriate 2D analogy is rotation invariant the Laplacian Bad idea to apply a Laplacian without smoothing smooth with Gaussian, apply Laplacian this is the same as filtering with a Laplacian of Gaussian filter Now mark the zero points where there is a sufficiently large derivative, and enough contrast The Laplacian of Gaussian Computer Vision - A Modern Approach Set: Linear Filters Slides by D.A. Forsyth

    6. sigma=4 contrast=1 LOG zero crossings contrast=4 sigma=2 Computer Vision - A Modern Approach Set: Linear Filters Slides by D.A. Forsyth

    7. We still have unfortunate behaviour at corners Computer Vision - A Modern Approach Set: Linear Filters Slides by D.A. Forsyth

    8. We wish to mark points along the curve where the magnitude is biggest. We can do this by looking for a maximum along a slice normal to the curve (non-maximum suppression). These points should form a curve. There are then two algorithmic issues: at which point is the maximum, and where is the next one? Computer Vision - A Modern Approach Set: Linear Filters Slides by D.A. Forsyth

    9. Non-maximum suppression At q, we have a maximum if the value is larger than those at both p and at r. Interpolate to get these values. Computer Vision - A Modern Approach Set: Linear Filters Slides by D.A. Forsyth

    10. Predicting the next edge point Assume the marked point is an edge point. Then we construct the tangent to the edge curve (which is normal to the gradient at that point) and use this to predict the next points (here either r or s). Computer Vision - A Modern Approach Set: Linear Filters Slides by D.A. Forsyth

    11. Remaining issues • Check that maximum value of gradient value is sufficiently large • drop-outs? use hysteresis • use a high threshold to start edge curves and a low threshold to continue them. Computer Vision - A Modern Approach Set: Linear Filters Slides by D.A. Forsyth

    12. Notice • Something nasty is happening at corners • Scale affects contrast • Edges aren’t bounding contours Computer Vision - A Modern Approach Set: Linear Filters Slides by D.A. Forsyth

    13. Computer Vision - A Modern Approach Set: Linear Filters Slides by D.A. Forsyth

    14. fine scale high threshold Computer Vision - A Modern Approach Set: Linear Filters Slides by D.A. Forsyth

    15. coarse scale, high threshold Computer Vision - A Modern Approach Set: Linear Filters Slides by D.A. Forsyth

    16. coarse scale low threshold Computer Vision - A Modern Approach Set: Linear Filters Slides by D.A. Forsyth

    17. The gradient magnitude is affected by illumination changes but it’s direction isn’t We can describe image patches by the swing of the gradient orientation Important types: constant window small gradient mags edge window few large gradient mags in one direction flow window many large gradient mags in one direction corner window large gradient mags that swing Orientation representations Computer Vision - A Modern Approach Set: Linear Filters Slides by D.A. Forsyth

    18. Types constant small eigenvalues Edge one medium, one small Flow one large, one small corner two large eigenvalues Representing Windows Computer Vision - A Modern Approach Set: Linear Filters Slides by D.A. Forsyth

    19. Computer Vision - A Modern Approach Set: Linear Filters Slides by D.A. Forsyth

    20. Computer Vision - A Modern Approach Set: Linear Filters Slides by D.A. Forsyth

    21. Computer Vision - A Modern Approach Set: Linear Filters Slides by D.A. Forsyth

    22. Computer Vision - A Modern Approach Set: Linear Filters Slides by D.A. Forsyth

    23. Harris Corner detector • Le regioni uniformi hanno tutti I gradienti uniformi • I bordi lineari hanno tutti i gradienti allineati • gli angoli sono I punti di congiunzione di due bordi e quindi avra` I gradienti attorno allineati lungo due direttrici fondamentali Computer Vision - A Modern Approach Set: Linear Filters Slides by D.A. Forsyth

    24. Harris Corner detector • Tutti e due gli auovalori di H sono > 0 • Rilevatore di angoli Harris: gli angoli sono massimi locali della funzione R=det(H)-kTr(H)2 l1 l2 Computer Vision - A Modern Approach Set: Linear Filters Slides by D.A. Forsyth

    25. Computer Vision - A Modern Approach Set: Linear Filters Slides by D.A. Forsyth

    26. Computer Vision - A Modern Approach Set: Linear Filters Slides by D.A. Forsyth

    27. Edge Linking Computer Vision - A Modern Approach Set: Linear Filters Slides by D.A. Forsyth

    28. Hough Transform Computer Vision - A Modern Approach Set: Linear Filters Slides by D.A. Forsyth

    29. Computer Vision - A Modern Approach Set: Linear Filters Slides by D.A. Forsyth

    30. Computer Vision - A Modern Approach Set: Linear Filters Slides by D.A. Forsyth

    31. Metodi graph-based Computer Vision - A Modern Approach Set: Linear Filters Slides by D.A. Forsyth

    32. Computer Vision - A Modern Approach Set: Linear Filters Slides by D.A. Forsyth

    33. Normalized Cut Computer Vision - A Modern Approach Set: Linear Filters Slides by D.A. Forsyth