Integral Images for Block Matching
Gabriele Facciolo, Nicolas Limare, Enric Meinhardt-Llopis
→ BibTeX
    title   = {{Integral Images for Block Matching}},
    author  = {Facciolo, Gabriele and Limare, Nicolas and Meinhardt-Llopis, Enric},
    journal = {{Image Processing On Line}},
    volume  = {4},
    pages   = {344--369},
    year    = {2014},
    doi     = {10.5201/ipol.2014.57},
% if your bibliography style doesn't support doi fields:
    note    = {\url{}}
Gabriele Facciolo, Nicolas Limare, and Enric Meinhardt-Llopis, Integral Images for Block Matching, Image Processing On Line, 4 (2014), pp. 344–369.

Communicated by Andrés Almansa
Demo edited by Gabriele Facciolo


The integral image representation is a remarkable idea that permits to evaluate the sum ofimage values over rectangular regions of the image with four operations, regardless of the size ofthe region. It was first proposed under the name of summed area table in the computer graphicscommunity by Crow’84, in order to efficiently filter texture maps. It was later popularized in thecomputer vision community by Viola & Jones’04 with its use in their real-time object detectionframework. In this article we describe the integral image algorithm and study its application inthe context of block matching. We investigate tradeoffs and the limits of the performance gainwith respect to exhaustive block matching.