Abstract:
A particularly efficient and simple method for Bayer color filter array (CFA) compression requires practically negligible computational complexity and external memory requirement while yielding a substantially lossless performance of the compression-decompression processes. For each color channel, the process comprises the step of
gathering Bayer pattern pixel values by pairs, each pair being composed by two successive pixels belonging to the channel along the scanning direction of the pixels of the image, thus each pair of values representing a current input vector; calculating a predictor vector of the input vector in terms of the differences between the values defining the input vector and a pair of prediction values generated according to a certain criterion, for representing a prediction error; quantizing each so calculated predictor vector according to a heavier or lighter degree of quantization depending on whether the predictor vector is representative of an area of relatively uniform color of the image or of an area of relatively abrupt changes of colors of the image; generating a multibit code representative of the quantized predictor vector of the input vector according to a certain compression ratio.