Efficiency issues related to probability density function comparison

Title: Efficiency issues related to probability density function comparison

Full Record
Other Related Research

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.

Authors:: Kelly, P M; Cannon, M; Barros, J E

Publication Date:: 1996-03-01

Research Org.:: Los Alamos National Lab., NM (United States)

Sponsoring Org.:: USDOE, Washington, DC (United States)

OSTI Identifier:: 211673

Report Number(s):: LA-UR-96-0062; CONF-960171-2
ON: DE96007195

DOE Contract Number:: W-7405-ENG-36

Resource Type:: Conference

Resource Relation:: Conference: IS&T/SPIE symposium on electronic imaging: science & technology, Bellingham, WA (United States), 29 Jan - 2 Feb 1996; Other Information: PBD: [1996]

Country of Publication:: United States

Language:: English

Subject:: 99 MATHEMATICS, COMPUTERS, INFORMATION SCIENCE, MANAGEMENT, LAW, MISCELLANEOUS; 42 ENGINEERING NOT INCLUDED IN OTHER CATEGORIES; IMAGE PROCESSING; ALGORITHMS; PROBABILITY; EFFICIENCY; DISTANCE; VECTORS; DISTRIBUTION FUNCTIONS

Citation Formats


                    Kelly, P M, Cannon, M, and Barros, J E. Efficiency issues related to probability density function comparison.  United States: N. p., 1996. 
        Web.

Copy to clipboard


                    Kelly, P M, Cannon, M, & Barros, J E. Efficiency issues related to probability density function comparison.  United States.

Copy to clipboard


                    Kelly, P M, Cannon, M, and Barros, J E. Fri .  
        "Efficiency issues related to probability density function comparison".  United States.  https://www.osti.gov/servlets/purl/211673.

Copy to clipboard


                    
@article{osti_211673,

  title        = {Efficiency issues related to probability density function comparison},

  author       = {Kelly, P M and Cannon, M and Barros, J E},

  abstractNote = {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.},

  doi          = {},

  url          = {https://www.osti.gov/biblio/211673},
  journal      = {},
number       = ,

  volume       = ,

  place        = {United States},

  year         = {1996},

  month        = {3}

}

Copy to clipboard

Conference:

View Conference (0.65 MB)

Other availability

Please see Document Availability for additional information on obtaining the full-text document. Library patrons may search WorldCat to identify libraries that hold this conference proceeding.

Save / Share:

Export Metadata

Save to My Library

Similar records in OSTI.GOV collections:

Query by image example: The CANDID approach

Conference Kelly, P M ; Cannon, M ; Hush, D R

CANDID (Comparison Algorithm for Navigating Digital Image Databases) was developed to enable content-based retrieval of digital imagery from large databases using a query-by-example methodology. A user provides an example image to the system, and images in the database that are similar to that example are retrieved. The development of CANDID was inspired by the N-gram approach to document fingerprinting, where a ``global signature`` is computed for every document in a database and these signatures are compared to one another to determine the similarity between any two documents. CANDID computes a global signature for every image in a database, where themore »« less
Full Text Available
Experience with CANDID: Comparison algorithm for navigating digital image databases

Conference Kelly, P ; Cannon, M

This paper presents results from the authors experience with CANDID (Comparison Algorithm for Navigating Digital Image Databases), which was designed to facilitate image retrieval by content using a query-by-example methodology. A global signature describing the texture, shape, or color content is first computed for every image stored in a database, and a normalized similarity measure between probability density functions of feature vectors is used to match signatures. This method can be used to retrieve images from a database that are similar to a user-provided example image. Results for three test applications are included.
Full Text Available
HDF5-FastQuery: Accelerating Complex Queries on HDF Datasets UsingFast Bitmap Indices

Conference Gosink, Luke ; Shalf, John ; Stockinger, Kurt ; ...

Large scale scientific data is often stored in scientific data formats such as FITS, netCDF and HDF. These storage formats are of particular interest to the scientific user community since they provide multi-dimensional storage and retrieval. However, one of the drawbacks of these storage formats is that they do not support semantic indexing which is important for interactive data analysis where scientists look for features of interests such as ''Find all supernova explosions where energy >105 and temperature >106''. In this paper we present a novel approach called HDF5-FastQuery to accelerate the data access of large HDF5 files by introducingmore »« less
Full Text Available
HDF5-FastQuery: Accelerating Complex Queries on HDF Datasets usingFast Bitmap Indices

Conference Gosink, Luke ; Shalf, John ; Stockinger, Kurt ; ...

Large scale scientific data is often stored in scientific data formats such as FITS, netCDF and HDF. These storage formats are of particular interest to the scientific user community since they provide multi-dimensional storage and retrieval. However, one of the drawbacks of these storage formats is that they do not support semantic indexing which is important for interactive data analysis where scientists look for features of interests such as ''Find all supernova explosions where energy > 10{sup 5} and temperature > 10{sup 6}''. In this paper we present a novel approach called HDF5-FastQuery to accelerate the data access of largemore »« less
Full Text Available
Challenges in Microbial Database Interoperability Interagency Microbe Project Working Group

Technical Report Critchlow, T

Currently, data of interest to microbial researchers is spread across hundreds of web-accessible data sources, each with a unique interface and data format. Researchers interact with a few of these sites when they analyze their data, but are not able to utilize the majority of them on a regular basis. There are two significant challenges that must be overcome to integrate this environment and allow researchers to efficiently perform data analysis across the entire set of relevant data, or at least a significant portion of it. The first is to provide consistent access to the large numbers of distributed, heterogeneousmore »« less
https://doi.org/10.2172/15005933

Full Text Available

Similar Records