Publicação: Contextual Spaces Re-Ranking: accelerating the Re-sort Ranked Lists step on heterogeneous systems
Carregando...
Data
Orientador
Coorientador
Pós-graduação
Curso de graduação
Título da Revista
ISSN da Revista
Título de Volume
Editor
Tipo
Trabalho apresentado em evento
Direito de acesso
Acesso aberto
Resumo
Re-ranking algorithms have been proposed to improve the effectiveness of content-based image retrieval systems by exploiting contextual information encoded in distance measures and ranked lists. In this paper, we show how we improved the efficiency of one of these algorithms, called Contextual Spaces Re-Ranking (CSRR). One of our approaches consists in parallelizing the algorithm with OpenCL to use the central and graphics processing units of an accelerated processing unit. The other is to modify the algorithm to a version that, when compared with the original CSRR, not only reduces the total running time of our implementations by a median of 1.6 × but also increases the accuracy score in most of our test cases. Combining both parallelization and algorithm modification results in a median speedup of 5.4 × from the original serial CSRR to the parallelized modified version. Different implementations for CSRR's Re-sort Ranked Lists step were explored as well, providing insights into graphics processing unit sorting, the performance impact of image descriptors, and the trade-offs between effectiveness and efficiency. Copyright © 2016 John Wiley & Sons, Ltd.
Descrição
Palavras-chave
CBIR, heterogeneous, OpenCL, parallelization, re-ranking, sorting algorithms
Idioma
Inglês
Como citar
Concurrency Computation, v. 29, n. 22, 2017.
