Abstract
Edges detection of digital images is used in a various fields of applications ranging from real-time video surveillance and traffic management to medical imaging applications. Most of the classical methods for edge detection are based on the first and second order derivatives of gray levels of the pixels of the original image. These processes give rise to the exponential increment of computational time. This paper shows the new algorithm based on both the Tsallis entropy and the Shannon entropy together for edge detection using split and merge technique. The objective is to find the best edge representation and minimize the computation time. A set of experiments in the domain of edge detection are presented. An edge detection performance compared to the previous classic methods, such as Canny, LOG, and Sobel. Analysis show that the effect of the proposed method is better than those methods in execution time and also is considered as easy implementation