Estimating Proximity of Metric Ball Regions for Multimedia Data Indexing

Result code in IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216224%3A14330%2F00%3A00002644" target="_blank" >RIV/00216224:14330/00:00002644 - isvavai.cz</a>

Result on the web

—

DOI - Digital Object Identifier

—

Result language

angličtina

Original language name

Estimating Proximity of Metric Ball Regions for Multimedia Data Indexing

Original language description

The problem of defining and computing proximity of regions constraining objects from generic metric spaces is investigated. Approximate, computationally fast, approach is developed for pairs of metric ball regions, which covers the needs of current systems for processing data through distances. The validity and precision of proposed solution is verified by extensive simulation on three substantially different data files. The precision of obtained results is very satisfactory. Besides other possibilities, the proximity measure can be applied to improve the performance of metric trees, developed for multimedia similarity search indexing. Specific system areas concern splitting and merging of regions, pruning regions during similarity retrieval, ranking regions for best case matching, and declustering regions to achieve parallelism.

Czech name

—

Czech description

—

Type

D - Article in proceedings

CEP classification

BD - Information theory

OECD FORD branch

—

Project

—

Continuities

Z - Vyzkumny zamer (s odkazem do CEZ)

Publication year

2000

Confidentiality

S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Article name in the collection

Advances in Information Systems

ISBN

3-540-4118

ISSN

—

e-ISSN

—

Number of pages

10

Pages from-to

—

Publisher name

Springer

Place of publication

Berlin

Event location

—

Event date

—

Type of event by nationality

—

UT code for WoS article

—