Operator to implement Canny edge detector which finds elongated step contours with dG. Then junctions are found by extending from end points of dangling contours.
The recipe is:
Input: Intensity image, smoothing sigma, sensor/texture noise sigma and threshold factors for detecting contour/junction edge elements.
Output: Magnitude, direction, location of step pixels, forming a connected network of contours.
Complexity: O(|pixels|) time and space for convolutions. O(|edgels|) time for iterative extension to recover junctions.
Authors
John Canny (1986) SM Thesis
Chris Connolly (1987) use directional 1st-difference
Van-Duc Nguyen (1989) add subpixel location, extension to find junctions
Arron Heller (1992) translate from CLOS to C++
Van-Duc Nguyen (1995) add noise estimation, use FloatOperators.
Joe Mundy (1997) expanded comments on some methods. Added gradient
magnitude, grad_mag, and gradient direction angle
buffer, angle, to cache between edgel detection phases.
Definition in file gevd_step.h.
#include <vcl_iosfwd.h>
Go to the source code of this file.
Classes | |
| class | gevd_step |
1.4.4