Segmentation 04
Uploaded by
KumarPatraSegmentation 04
Uploaded by
KumarPatraEdge Linking and Boundary Detection
Edge detection typically is followed by linking algorithms designed to assemble edge pixels into meaningful edges and/or region boundaries Three approaches to edge linking Local processing: requires knowledge about edge points in a local
region
Regional processing: requires that points on the boundary of a
region be known
Global processing: works with an entire edge image
Local Processing
Analyze the characteristics of pixels in a small neighbourhood about every point (x,y) that has been declared an edge point All points that are similar according to predefined criteria are linked, forming an edge of pixels. Principal properties used for establishing similarity: the strength (magnitude) and the direction of the gradient vector.
Local Processing
Let Sxy denote the set of coordinates of a neighbourhood centered at point (x, y) in an image
An edge pixel with coordinates (s, t) in Sxy is similar in magnitude to the pixel at (x, y) if | M(s, t) M(x, y) | E, where E is a positive threshold
An edge pixel with coordinates (s, t) in Sxy has an angle similar to the pixel at (x, y) if | (s, t) - (x, y) | A, where A is a positive threshold
A pixel with coordinates (s, t) in Sxy is linked to the pixel at (x, y) if both magnitude and direction criteria are satisfied.
Local Processing: Steps
A simplification well suited for real time applications:
1.
Compute the gradient magnitude and angle arrays, M (x, y) and (x, y), of the input image, f (x, y). Form a binary image, g, whose value at any pair of coordinates (x, y) is given by: g (x, y) = 1 0 if M (x, y) > TM AND (x, y) = A TA otherwise
2.
where TM is a threshold, A is a specified angle direction, TA defines a band of acceptable directions about A
3.
Scan the rows of g and fill (set to 1) all gaps (sets of 0s) in each row that do not exceed a specified length, K.
To detect gaps in any other direction, , rotate g by this angle and apply the horizontal scanning procedure in step 3. Rotate the result back by .
4.
Global Processing Using the Hough Transform
The Hough transform is a general technique for identifying the locations and orientations of certain types of features in a digital image. Developed by Paul Hough in 1962 and patented by IBM, the transform consists of parameterizing a description of a feature at any given location in the original images space. A mesh in the space defined by these parameter is then generated, and at each mesh point a value is accumulated, indicating how well an object generated by the parameters defined at that point fits the given image. Mesh points that accumulate relatively larger values then describe features that may be projected back onto the image, fitting to some degree the features actually present in the image. http://planetmath.org/encyclopedia/HoughTransform.html
Edge-linking Based on the Hough Transform
1. 2.
Obtain a binary edge image Specify subdivisions in -plane
3.
Examine the counts of the accumulator cells for high pixel concentrations
Examine the relationship (principally for continuity) between pixels in a chosen cell Continuity is based on computing the distance between disconnected pixels corresponding to a given accumulator cell. A gap in a line associated with a given cell is bridged if the length of the gap is less than a specified threshold.
4.
