Fast Construction of Covariance Matrices for Arbitrary Size Image Windows

• Published in: 2006 International Conference on Image Processing pp. 1581 - 1584
• Main Authors: Porikli, F., Tuzel, O.
• Format: Conference Proceeding
• Language: English
• Published: IEEE 01.10.2006
• Subjects: Computational complexity; covariance matrices; Covariance matrix; Distributed computing; Feature extraction; Filters; Histograms; Image segmentation; Integral equations; integral images; Laboratories
• ISBN: 9781424404803; 1424404800
• ISSN: 1522-4880; 2381-8549
• DOI: 10.1109/ICIP.2006.312610

We propose an integral image based algorithm to extract feature covariance matrices of all possible rectangular regions within a given image. Covariance is an essential indicator of how much the deviation of two or more variables match. In our case, these variables correspond to point-wise features, e.g. coordinates, color values, gradients, edge magnitude and orientation, local histograms, filter responses, etc. We significantly improve the speed of the covariance computation by taking advantage of the spatial arrangement of image points using integral images, which are intermediate representations used for calculation of region sums. Each point of the integral image corresponds to the summation of all point values inside the feature image rectangle bounded by the upper left corner and the point of interest. Using this representation, any rectangular region sum can be computed in constant time. We follow a similar idea for fast calculation of region covariance. We construct integral images for all separate features as well as integral images of the multiplication of any two feature combinations. Using these set of integral images and region corner point coordinates, we directly extract the covariance matrix coefficients. We show that the proposed method reduces the computational load to quadratic time.