Further results on the DRF method for edge detection

The magnitude-distance and maximum-value-distance filters are analyzed, and fast realizations are proposed to implement a DRF cascade for edge detection. It is shown that the maximum-value-distance filter is well adapted to parallel processing and works two times as fast as the magnitude-distance filter. It is shown also that the adaptive gradient is an optimal estimate for edge-pixel verification after zero-crossing detection. The efficiency of the proposed algorithms is confirmed by experimental results.<>