| 摘要 |
PURPOSE:To eliminate the need to prepare samples of many colors and to select the best color by selecting a point where a maximin value is selected among points in a color space and making the color which is hardest to identify from a previously given color most distinctive. CONSTITUTION:A set P and R generation part 1 generates a set P consisting of S points which are extracted from a set (U) consisting of points corresponding to every point in the color space wherein colors are generated and not elements of a set (Q) consisting of points corresponding to (n) given colors. Further, the sum set R of those sets P and Q is generated. Then a distance DELTAE(pi, ri) calculation part 2 finds the distance DELTAE(pi, rj) between points pi and rj and a shortest distance calculation part 3 finds the smallest value among all distances DELTAE(pi, rj). Then a distance maximin value calculation part 4 finds the point where the maximin value of the distance DELTAE(pi, ri) is obtained. Then a color selection part 5 selects colors corresponding to those points. |
