Project information
Complex similarity searching in very large data collections

Investor logo
Project Identification
GP201/08/P507
Project Period
1/2008 - 12/2010
Investor / Pogramme / Project type
Czech Science Foundation
MU Faculty or unit
Faculty of Informatics
Keywords
similarity search, metric space, scalability, multi-feature query, peer-to-peer network

With the increasing number of applications that base searching on similarity rather than on exact matching, also the problem of combined similarity query arises. For example, a simple similarity query allows us to search for objects with similar colour and another one returns best-matching shapes and we are interested in objects that are similar in both the colour and the shape categories. The computational complexity of the similarity retrieval and the large volumes of processed data call for the distributed processing in order to achieve scalability. The aim of this project is to study problems of distributed systems for complex similarity searching. ...

Results

Publications

Total number of publications: 18


Previous 1 2 Next

You are running an old browser version. We recommend updating your browser to its latest version.

More info