Issue No. 12 - December (2007 vol. 29)
Efficient and compact representation of images is a fundamental problem in computer vision. In this paper, we propose methods that use Haar-like binary box functions to represent a single image or a set of images. A desirable property of these box functions is that their inner product operation with an image can be computed very efficiently. We propose two closely related novel subspace methods to model images: the non-orthogonal binary subspace (NBS) method and binary principal component analysis (B-PCA) algorithm. NBS is spanned directly by binary box functions and can be used for image representation, fast template matching and many other vision applications. B-PCA is a structure subspace that inherits the merits of both NBS (fast computation) and PCA (modeling data structure information). B-PCA base vectors are obtained by a novel PCA guided NBS method. We also show that BPCA base vectors are nearly orthogonal to each other. As a result, in the non-orthogonal vector decomposition process, the computationally intensive pseudo-inverse projection operator can be approximated by the direct dot product without causing significant distance distortion. Experiments on real image datasets show promising performance in image matching, reconstruction and recognition tasks with significant speed improvement.
Non-orthogonal subspace, image representations, principal component analysis, image reconstruction
Ryan Crabb, Hai Tao, Feng Tang, "Representing Images Using Nonorthogonal Haar-Like Bases", IEEE Transactions on Pattern Analysis & Machine Intelligence, vol. 29, no. , pp. 2120-2134, December 2007, doi:10.1109/TPAMI.2007.1123