Basic Edge Detection by Using First-Order Derivative
Basic Edge Detection by Using First-Order Derivative
Basic Edge Detection by Using First-Order Derivative
Gradient (f): for finding edge strength and direction at location (x, y) of an image f
gx, gy, M(x, y) are images of same size as the original, when x, y are allowed to vary over all pixel locations in f The gradient vector is called edge normal When the vector is normalized to unit length by dividing it by its magnitude, the resulting vector is the edge unit normal
In vector calculus, the gradient of a scalar field is a vector field that points in the direction of the greatest rate of increase of the scalar field, and whose magnitude is that rate of increase. In simple terms, the variation in space of any quantity can be represented (e.g. graphically) by a slope. The gradient represents the steepness and direction of that slope.
Gradient Operators
..10.2-12
.10.2-13
Prewitt operators are based on digital approximations to the partial derivatives using masks of size 3 X 3 given by
Sobel operators are based on digital approximations to the partial derivatives using masks of size 3 X 3 given by
The Prewitt masks are simpler to implement than the Sobel masks, but Sobel masks have better noise-suppression (smoothing) characteristics
For reducing the contribution of image detail (such as wall bricks) to edges, image-averaging is needed before computing gradient
Several reasons that Laplacian generally is not used in its original form for edge detection:
The Laplacian is unacceptably sensitive to noise; The magnitude of the Laplacian produces double edges, an undesirable effect because it complicates segmentation; unable to detect edge direction
In the role of first category, the Laplacian is combined with smoothing as a precursor to finding edges via zero-crossing.