All

What are you looking for?

All
Projects
Results
Organizations

Quick search

  • Projects supported by TA ČR
  • Excellent projects
  • Projects with the highest public support
  • Current projects

Smart search

  • That is how I find a specific +word
  • That is how I leave the -word out of the results
  • “That is how I can find the whole phrase”

Permutation Based Indexing for High Dimensional Data on GPU Architectures

The result's identifiers

  • Result code in IS VaVaI

    <a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216208%3A11320%2F15%3A10294742" target="_blank" >RIV/00216208:11320/15:10294742 - isvavai.cz</a>

  • Result on the web

    <a href="http://dx.doi.org/10.1109/CBMI.2015.7153619" target="_blank" >http://dx.doi.org/10.1109/CBMI.2015.7153619</a>

  • DOI - Digital Object Identifier

    <a href="http://dx.doi.org/10.1109/CBMI.2015.7153619" target="_blank" >10.1109/CBMI.2015.7153619</a>

Alternative languages

  • Result language

    angličtina

  • Original language name

    Permutation Based Indexing for High Dimensional Data on GPU Architectures

  • Original language description

    Permutation-based indexing is one of the most popular techniques for the approximate nearest-neighbor search problem in high-dimensional spaces. Due to the exponential increase of multimedia data, the time required to index this data has become a seriousconstraint of the indexing techniques. One of the possible steps towards faster index construction is utilization of massively parallel platforms such as the GPGPU architectures. In this paper, we have analyzed the computational costs of individual steps of the permutation-based index construction in a high-dimensional feature space and proposed a hybrid solution, where computational power of GPU is utilized for distance computations whilst the host CPU performs the postprocessing and sorting steps. Despite the fact that computing the distances is a naturally data-parallel task, an efficient implementation is quite challenging due to various GPU limitations and complex memory hierarchy. We have tested possible approaches to work divisi

  • Czech name

  • Czech description

Classification

  • Type

    D - Article in proceedings

  • CEP classification

    IN - Informatics

  • OECD FORD branch

Result continuities

  • Project

    <a href="/en/project/GP14-14292P" target="_blank" >GP14-14292P: Employing Modern Parallel Architectures in Specific Domains of Database Systems</a><br>

  • Continuities

    I - Institucionalni podpora na dlouhodoby koncepcni rozvoj vyzkumne organizace

Others

  • Publication year

    2015

  • Confidentiality

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

Data specific for result type

  • Article name in the collection

    13th International Workshop on Content-Based Multimedia Indexing (CBMI)

  • ISBN

    978-1-4673-6870-4

  • ISSN

    1949-3991

  • e-ISSN

  • Number of pages

    6

  • Pages from-to

    1-6

  • Publisher name

    IEEE

  • Place of publication

    neuveden

  • Event location

    Prague, Czech Republic

  • Event date

    Jun 10, 2015

  • Type of event by nationality

    WRD - Celosvětová akce

  • UT code for WoS article