METHOD FOR DRAWING MAP OF COLOR INTERACTION NETWORK

摘要

Disclosed is a method of drawing a map of color interaction network. The present invention relates to a method of drawing a map of color interaction network which analyzes segmented results by applying a double segmentation algorithm. The method comprises the steps of: (a) performing horizontal division in a horizontal direction and vertical division in a vertical direction for all pixels of an HSV image to find an optimal division position; (b) continuously dividing the image to be analyzed until the image reaches a predetermined size; (c) finding and pairing adjacent pieces for each piece; and (d) finding a most frequent color between the pairs of pieces and connecting the two colors with a line.