Similarity relation matrix-based color edge detection

A novel edge detection algorithm for color images was described in this paper. In the proposed method, smoothness of each pixel in color image is firstly calculated by means of similarity relation matrix and is normalized to maximum gray level. In other words, color image in three-dimensional color spaces is mapped into one dimension. Accordingly the edges are performed in such a way that pixels lower than thresholds are assigned to be edge. Thus with proposed method, edge pixels in a color image are detected simultaneously without any complex calculations such as gradient, Laplace and statistical calculations.