Word length reduction for the integral image

The integral image is an image containing accumulated sums of pixel values taken from an input image. It is an important concept for multi-scale image processing algorithms, for it provides a very economic way to compute the sum of pixel values in any rectangular input image region. Unfortunately, the integral image requires a large binary word length to represent the accumulated sums. This is an issue for platforms having limited memory, power, and bandwidth like in mobile devices. Our paper deals with two methods for word length reduction, involving computation through the overflow and rounding with error diffusion. We show by experiment that, based on a word length reduced integral image, the Viola and Jones face detector for a VGA resolution can work on a 16-bit CPU (i.s.o. 27 bits, which becomes 32 bits on byte-oriented CPUs), enabling face detection on a wider range of platforms.

[1]  HARVEY L. GARNER Theory of Computer Addition and Overflows , 1978, IEEE Transactions on Computers.

[2]  Robert A. Ellis,et al.  Proceedings of the 11th annual conference on Computer graphics and interactive techniques , 1984, SIGGRAPH.

[3]  Luc Van Gool,et al.  SURF: Speeded Up Robust Features , 2006, ECCV.

[4]  C CrowFranklin Summed-area tables for texture mapping , 1984 .

[5]  Viet Anh Nguyen,et al.  Efficient block-matching motion estimation based on Integral frame attributes , 2006, IEEE Transactions on Circuits and Systems for Video Technology.

[6]  Robert Ulichney,et al.  Digital Halftoning , 1987 .

[7]  Franklin C. Crow,et al.  Summed-area tables for texture mapping , 1984, SIGGRAPH.

[8]  Paul A. Viola,et al.  Rapid object detection using a boosted cascade of simple features , 2001, Proceedings of the 2001 IEEE Computer Society Conference on Computer Vision and Pattern Recognition. CVPR 2001.