Issue No. 07 - July (2004 vol. 26)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/TPAMI.2004.32
Michael D. Grossberg , IEEE
Shree K. Nayar , IEEE
<p><b>Abstract</b>—The histogram of image intensities is used extensively for recognition and for retrieval of images and video from visual databases. A single image histogram, however, suffers from the inability to encode spatial image variation. An obvious way to extend this feature is to compute the histograms of multiple resolutions of an image to form a multiresolution histogram. The multiresolution histogram shares many desirable properties with the plain histogram including that they are both fast to compute, space efficient, invariant to rigid motions, and robust to noise. In addition, the multiresolution histogram directly encodes spatial information. We describe a simple yet novel matching algorithm based on the multiresolution histogram that uses the differences between histograms of consecutive image resolutions. We evaluate it against five widely used image features. We show that with our simple feature we achieve or exceed the performance obtained with more complicated features. Further, we show our algorithm to be the most efficient and robust.</p>
Multiresolution histogram, scale-space, image sharpness, Fisher information, shape feature, texture feature, histogram matching, histogram bin width, feature parameter sensitivity, feature comparison.
M. D. Grossberg, S. K. Nayar and E. Hadjidemetriou, "Multiresolution Histograms and Their Use for Recognition," in IEEE Transactions on Pattern Analysis & Machine Intelligence, vol. 26, no. , pp. 831-847, 2004.