Efficient transform using canonical signed digit in reversible color transforms

Color transforms are important methods in the analysis and processing of images. Image color transform and its inverse transform should be reversible for lossless image processing applications. However, color conversions are not reversible due to finite precision of the conversion coefficients. To overcome this limitation, reversible color transforms have been developed. Color integer transform requires multiplications of coefficients, which are implemented with shift and add operations in most cases. We propose to use canonical signed digit (CSD) representation of reversible color transform coefficients and exploitation of their common subexpressions to reduce the complexity of the hardware implementation significantly. We demonstrate roughly 50% reduction in computation with the proposed method.

[1]  R. M. Hewlitt,et al.  Canonical signed digit representation for FIR digital filters , 2000, 2000 IEEE Workshop on SiGNAL PROCESSING SYSTEMS. SiPS 2000. Design and Implementation (Cat. No.00TH8528).

[2]  George W. Reitwiesner,et al.  Binary Arithmetic , 1960, Adv. Comput..

[3]  Soo-Chang Pei,et al.  Reversible integer color transform with bit-constraint , 2005, IEEE International Conference on Image Processing 2005.

[4]  Pengwei Hao,et al.  Comparative study of color transforms for image coding and derivation of integer reversible color transform , 2000, Proceedings 15th International Conference on Pattern Recognition. ICPR-2000.

[5]  Nobuo Fujii,et al.  Fast FIR Digital Filter Structures Using Minimal Number of Adders and Its Application to Filter Design (Special Section on Digital Signal Processing) , 1996 .

[6]  Alan N. Willson,et al.  A trellis search algorithm for the design of FIR filters with signed-powers-of-two coefficients , 1996, Proceedings of the 39th Midwest Symposium on Circuits and Systems.

[7]  A. Dempster,et al.  Use of minimum-adder multiplier blocks in FIR digital filters , 1995 .

[8]  Chip-Hong Chang,et al.  Hamming weight pyramid - A new insight into canonical signed digit representation and its applications , 2007, Comput. Electr. Eng..

[9]  Chein-Wei Jen,et al.  Hardware-efficient implementations for discrete function transforms using LUT-based FPGAs , 1999 .

[10]  L. Wanhammar,et al.  Design of high-speed multiplierless filters using a nonrecursive signed common subexpression algorithm , 2002 .

[11]  Miodrag Potkonjak,et al.  Multiple constant multiplications: efficient and versatile framework and algorithms for exploring common subexpression elimination , 1996, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[12]  Chip-Hong Chang,et al.  HWP: a new insight into canonical signed digit , 2004, 2004 IEEE International Symposium on Circuits and Systems (IEEE Cat. No.04CH37512).

[13]  R. Hartley Subexpression sharing in filters using canonic signed digit multipliers , 1996 .

[14]  Soo-Chang Pei,et al.  Reversible Integer Color Transform , 2007, IEEE Transactions on Image Processing.