Share Email Print

Proceedings Paper

Video and image clustering using relative entropy
Author(s): Giridharan Iyengar; Andrew B. Lippman
Format Member Price Non-Member Price
PDF $14.40 $18.00

Paper Abstract

In this paper, we present an approach to clustering video sequences and images for efficient retrieval using relative entropy as our cost criterion. In addition, our experiments indicate that relative entropy is a good similarity measure for content-based retrieval. In our clustering work, we treat images and video as probability density functions over the extracted features. This leads us to formulate a general algorithm for clustering densities. In this context, it can be seen that a euclidean distance between features and the Kullback-Liebler (KL) divergence, give equivalent clustering. In addition, the asymmetry of the KL divergence leads to another clustering. Our experiments indicate that this clustering is more robust to noise and distortions, compared with the one resulting from euclidean norm.

Paper Details

Date Published: 17 December 1998
PDF: 10 pages
Proc. SPIE 3656, Storage and Retrieval for Image and Video Databases VII, (17 December 1998); doi: 10.1117/12.333863
Show Author Affiliations
Giridharan Iyengar, MIT Media Lab. (United States)
Andrew B. Lippman, MIT Media Lab. (United States)

Published in SPIE Proceedings Vol. 3656:
Storage and Retrieval for Image and Video Databases VII
Minerva M. Yeung; Boon-Lock Yeo; Charles A. Bouman, Editor(s)

© SPIE. Terms of Use
Back to Top