Since vector sorting algorithms in color image morphology are not mature currently

some new color vector morphological operators on graph space possessing of complete lattice are defined

which are based on the binary and grayscale morphology.The proposed operators can effectively prevent the original image texture from changing and save the topology of the color images.Moreover

combined with graph theory

a minimum spanning vector subgraph function and related theories are defined to implement the operators

and the extremum extraction algorithm suitable for color vector morphology of graph space is presented.Experimental results show that the proposed operators have better performance in preservation of color image information integrity and relevance than the existing methods

and that the operators can overcome the shortcomings of false color and human-decision dominating color components

which have a broad development trend.