23 February 2005 Near-lossless compression algorithm for Bayer pattern color filter arrays
Author Affiliations +
Abstract
In this contribution, we propose a near lossless compression algorithm for Color Filter Arrays (CFA) images. It allows higher compression ratio than any strictly lossless algorithm for the price of some small and controllable error. In our approach a structural transformation is applied first in order to pack the pixels of the same color in a structure appropriate for the subsequent compression algorithm. The transformed data is compressed with a modified version of the JPEG-LS algorithm. A nonlinear and adaptive error quantization function is embedded in the JPEG-LS algorithm after the fixed and context adaptive predictors. It is step-like and adapts to the base signal level in such a manner that higher error values are allowed for lighter parts with no visual quality loss. These higher error values are then suppressed by gamma correction applied during the image reconstruction stage. The algorithm can be adjusted for arbitrary pixel resolution, gamma value and tolerated error range. The compression performance of the proposed algorithm has been tested for real CFA raw data. The results are presented in terms of compression ratio versus reconstruction error and the visual quality of the reconstructed images is demonstrated as well.
© (2005) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Andriy Bazhyna, Andriy Bazhyna, Atanas Gotchev, Atanas Gotchev, Karen Egiazarian, Karen Egiazarian, } "Near-lossless compression algorithm for Bayer pattern color filter arrays", Proc. SPIE 5678, Digital Photography, (23 February 2005); doi: 10.1117/12.585788; https://doi.org/10.1117/12.585788
PROCEEDINGS
12 PAGES


SHARE
RELATED CONTENT


Back to Top