Color fast simplifying method

Abstract

This method does following operations: (1) calculates the distances between all pseudo color points (PCP) in the look-up table (LT) and the zero point in the RGB color space to group all PCP, (2) judges the group where the true color point (TCP) resides, (3) obtains the nearest PCP from the mentioned group, (4) uses the distance between the nearest PCP and TCP as a radius to form a pellet, (5) judges the neighbor pseudo color group covered by the pellet to obtain another nearest PCP, (6) compares and obtains the PCP to be converted by TCP, (7) repeats the above steps to covert the original image point by point into the simplified image stored under a pseudo color format. Instead of ergodicity LT, this method can save the calculating time.

Description

technical field [0001] The invention relates to a color fast simplification method, in particular to save the calculation time of traversing the look-up table by using a look-up table which has been divided into several false-color groups to convert true and false colors. Background technique [0002] In image processing, in order to save system bandwidth (bandwidth) and storage space, a pseudo-color (Pseudo Color) format is often used to store some pictures with low display quality requirements. Pseudo-color is different from true color (True Color). The color of each pixel of a pseudo-color image is not directly determined by the value of each primary color component, but the pixel value is used as a color look-up table (Color Look-up Table, referred to as CLUT) table item entry address (Entry), to find a R, G, B value used when displaying an image, so as to achieve the purpose of saving system resources. [0003] When the original true-color image is converted into a fal...

AI Technical Summary

Problems solved by technology

The disadvantage of this color simplification method is that the entire color lookup table must be traversed to find the best false color to replace the true color. For example, it is necessary to find out the distances d1, d2, d3, d4, and d5 between points 1 to 8 and point A. , d6, d7 and d8 to find the shortest distance, so, the order of the known color lookup table is not conducive to the simplification of colors

[0009] The above-mentioned known technology uses the difference between each entry address in the calculation table and the pixel to be converted to find a pseudo-color that can replace the pixel, but this method of traversing the entire look-up table is very time-consuming, not to mention that the calculation program needs to be used in The condition of the whole image

Images