Adaptive Edge Detection Algorithm Based on Grey Entropy Theory and Textural Features

The traditional edge detection method is altogether inaccurate, nonadaptive, and particularly ineffective on noisy images. This paper proposes a novel edge detection algorithm based on gray entropy theory and local texture features. In the
$3\times 3$
neighborhood window, 28 comparison sequences are constructed according to local texture features. The reference sequence is composed of the median of all elements in the
$3\times 3$
neighborhood window. A total of 28 gray relation degrees as obtained by gray relation analysis between the 28 comparison sequences and reference sequences, as well as 28 gray relation degrees, are analyzed by gray entropy theory to initially filter the image. Gray entropy analysis is then performed on the comparison sequences composed of 28 texture features and reference sequences composed of the central pixel points of the filtered image to determine the maximum gray entropy difference. A comparative threshold adaptive acquisition method is designed to separate gray entropy difference sequence elements and identify all edge points accordingly. The simulation results show that the proposed algorithm effectively achieves adaptive edge detection and has strong anti-noise capability. The results of this study may provide a workable reference for edge information detection in the field of artificial intelligence (e.g., image recognition, pattern recognition applications).