Share Email Print
cover

Proceedings Paper

Efficiency issues related to probability density function comparison
Author(s): Patrick M. Kelly; T. Michael Cannon; Julio E. Barros
Format Member Price Non-Member Price
PDF $14.40 $18.00

Paper Abstract

The CANDID project (comparison algorithm for navigating digital image databases) employs probability density functions (PDFs) of localized feature information to represent the content of an image for search and retrieval purposes. A similarity measure between PDFs is used to identify database images that are similar to a user-provided query image. Unfortunately, signature comparison involving PDFs is a very time-consuming operation. In this paper, we look into some efficiency considerations when working with PDFs. Since PDFs can take on many forms, we look into tradeoffs between accurate representation and efficiency of manipulation for several data sets. In particular, we typically represent each PDF as a Gaussian mixture (e.g. as a weighted sum of Gaussian kernels) in the feature space. We find that by constraining all Gaussian kernels to have principal axes that are aligned to the natural axes of the feature space, computations involving these PDFs are simplified. We can also constrain the Gaussian kernels to be hyperspherical rather than hyperellipsoidal, simplifying computations even further, and yielding an order of magnitude speedup in signature comparison. This paper illustrates the tradeoffs encountered when using these constraints.

Paper Details

Date Published: 13 March 1996
PDF: 8 pages
Proc. SPIE 2670, Storage and Retrieval for Still Image and Video Databases IV, (13 March 1996); doi: 10.1117/12.234808
Show Author Affiliations
Patrick M. Kelly, Los Alamos National Lab. (United States)
T. Michael Cannon, Los Alamos National Lab. (United States)
Julio E. Barros, Los Alamos National Lab. (United States)


Published in SPIE Proceedings Vol. 2670:
Storage and Retrieval for Still Image and Video Databases IV
Ishwar K. Sethi; Ramesh C. Jain, Editor(s)

© SPIE. Terms of Use
Back to Top