<html>
<head>
<meta http-equiv="content-type" content="text/html;
charset=ISO-8859-1">
</head>
<body bgcolor="#FFFFFF" text="#000000">
A new preprint is available in IPOL: <a
class="moz-txt-link-freetext"
href="http://www.ipol.im/pub/pre/82/">http://www.ipol.im/pub/pre/57/</a><br>
<br>
Integral Images for Block Matching<br>
by
<meta charset="utf-8">
Gabriele Facciolo, Nicolas Limare and Enric Meinhardt-Llopis<br>
<br>
Abstract<br>
The integral image representation is a remarkable idea that permits
to evaluate the sum of image values over rectangular regions of the
image with four operations, regardless of the size of the region. <br>
It was first proposed under the name of summed area table in the
computer graphics community by Crow'84, in order to efficiently
filter texture maps. It was later popularized in the computer vision
community by Viola & Jones'04 with its use in their real-time
object detection framework.<br>
In this article we describe the integral image algorithm and study
its application in the context of block matching. <br>
We investigate tradeoffs and the limits of the performance gain with
respect to exhaustive block matching.<br>
<br>
<br>
<br>
</body>
</html>