An efficient implementation of an edge detection algorithm
An efficient implementation of an edge detection algorithm with reduced computational complexity is proposed. The implementation is based on the principle that the execution time of an algorithm can be reduced if there is a priori knowledge of the parameters (coefficients of the mask) in the implementation, instead of considering the parameters and data as arbitrary entities. Fast implementation is achieved by exploiting the three basic properties of the edge operators. Experimental results of implementing several edge and other operators are presented and compared with those for the standard implementation. The results show a substantial improvement in execution time.<<ETX>>