Efficient ASIC and FPGA implementations of IIR filters for real time edge detection

To reduce the computation cost, Deriche (1987, 1990) extended the work from Canny (1986) on optimal edge detectors to the use of recursive filters. Nevertheless, this cost is still too high for real time implementation on FGGA circuits. Here, we optimized both the algorithmic and architectural aspects of the original Deriche filter. A new organization of the filter is proposed at the 2D and 1D levels which reduces the memory size and the computation cost by a factor of two for both software and hardware implementations. We prove that the use of only 3 bits to code the scale parameter does not reduce the quality. The result from this choice is that the first order recursive filter which is the basic block of the entire architecture can be built with only 4 adders. The architecture of a 10 Mpixels/second filter on an unique FPGA is described.

[1]  Rachid Deriche Fast Algorithms for Low-Level Vision , 1990, IEEE Trans. Pattern Anal. Mach. Intell..

[2]  Federico Garcia Lorca Filtres récursifs temps réel pour la détection de contours : optimisations algorithmiques et architecturales , 1996 .

[3]  K. Raghunath Rao,et al.  Optimal Edge Detection using Expansion Matching and Restoration , 1994, IEEE Trans. Pattern Anal. Mach. Intell..

[4]  Didier Demigny,et al.  Evaluation of edge detectors performances with a discrete expression of Canny's criteria , 1995, Proceedings., International Conference on Image Processing.

[5]  John F. Canny,et al.  A Computational Approach to Edge Detection , 1986, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[6]  Didier Demigny,et al.  An effective resolution definition or how to choose an edge detector, its scale parameter and the threshold? , 1996, Proceedings of 3rd IEEE International Conference on Image Processing.