Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Scribd Logo
Upload

Welcome to Scribd!

  • 3 views

    Edge Linking Via Hough Transform

    Uploaded by

    sotify249

    Copyright:

    © All Rights Reserved
    Download as PPT, PDF, TXT or read online from Scribd

    Edge Linking Via Hough Transform

    Uploaded by

    sotify249
    3 views15 pages

    Original Title

    Edge linking via Hough transform

    Copyright

    © © All Rights Reserved

    Available Formats

    PPT, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Copyright:

    © All Rights Reserved
    Download as PPT, PDF, TXT or read online from Scribd
    Download as ppt, pdf, or txt
    3 views15 pages

    Edge Linking Via Hough Transform

    Uploaded by

    sotify249

    Copyright:

    © All Rights Reserved
    Download as PPT, PDF, TXT or read online from Scribd
    Download as ppt, pdf, or txt
    You are on page 1of 15

    Edge Linking &

    Boundary Detection
    • Ideal case:
    – Techniques detecting intensity discontinuities
    should yield pixels lying only on edges ( or the
    boundary between regions).

    • Real life:
    – The detected set of pixels very rarely
    describes a complete edge due to effects
    from: noise, breaks in the edge due to non-
    uniform illumination.
    Edge Linking &
    Boundary Detection
    • Solution:

    – Edge-detection techniques are followed by


    linking and other boundary detection
    procedures which assemble edge pixels into
    meaningful boundaries.
    Local Processing
    • Analyze the pixel characteristics in a
    small neighborhood (3x3, 5x5) about
    every (x,y) in an image.

    • Link similar points to form a


    edge/boundary of pixels sharing
    common properties.
    Local Processing
    • Criteria used/Properties:

    1. The strength of the response of the


    gradient operator that produced the edge
    pixel.

    2. The direction of the gradient vector.


    Local Processing
    • In other words:
    1. f mag (F ) G 2
    x G y
    2 1/ 2
    or f | Gx |  | G y |

    (x’,y’) and (x,y) are similar if:

    f ( x, y )  f ( x, y) T

    where T is a nonnegative threshold.


    Local Processing
    • In other words (cont.):
    1 Gy 
    2.  ( x, y ) tan  
     Gx 
    (x’,y’) and (x,y) are similar if:

     ( x, y )   ( x, y)  A

    where A is an angle threshold.


    Image Segmentation
    Global Processing via
    the Hough Transform
    • Points are linked by determining
    whether they lie on a curve of specified
    shape.

    • Problem:

    – Find subsets of n points that lie on straight


    lines.
    Global Processing via
    the Hough Transform
    • Solution:
    – Find all lines determined by every pair of points
    – Find all subsets of points close to particular lines

    – Involves: n(n-1)/2 ~ n2 lines


    n(n(n-1))/2 ~ n3 computations
    for comparing every point to all lines.
    Global Processing via
    the Hough Transform
    • Better solution: Hough Transform

    – Equation of line passing through point (xi,yi):

    yi = axi + b (a,b varies)

    – But: b = -xia + yi 
    equation of single line on
    ab plane
    Global Processing via
    the Hough Transform
    Global Processing via
    the Hough Transform
    • A line in the (x,y) plane passes through
    several points of interest and has a set
    of specific (a,b) values.

    • A line in parameter space [(a,b) plane]


    denotes all lines that pass through a
    certain point (xi,yi) and has an infinite
    number of (a,b) values.
    Global Processing via
    the Hough Transform
    • A specific line is represented by a point
    in the (a,b) plane.

    • Two lines in parameter space that meet


    at a certain point show points belonging
    to the same line (in x,y plane).
    Global Processing via
    the Hough Transform
    • Since a,b approach infinity as a line
    approaches the vertical, we can use the
    normal representation of a line:

    x cos  y sin   
    Global Processing via
    the Hough Transform
    • Hough transform is applicable to any
    function of the form g(v,c) = 0.
    – v: vector of coordinates, c: coefficients.

    • e.g. points lying on a circle:

    ( x  c1 ) 2  ( y  c2 ) 2 c32

    You might also like