A unified model for accelerating unsupervised iterative re-ranking algorithms

Detalhes bibliográficos
Autor(a) principal: Pisani, Flavia
Data de Publicação: 2020
Outros Autores: Pascotti Valem, Lucas [UNESP], Guimaraes Pedronette, Daniel Carlos [UNESP], S. Torres, Ricardo da, Borin, Edson, Breternitz, Mauricio
Tipo de documento: Artigo
Idioma: eng
Título da fonte: Repositório Institucional da UNESP
Texto Completo: http://dx.doi.org/10.1002/cpe.5702
http://hdl.handle.net/11449/196639
Resumo: Despite the continuous advances in image retrieval technologies, performing effective and efficient content-based searches remains a challenging task. Unsupervised iterative re-ranking algorithms have emerged as a promising solution and have been widely used to improve the effectiveness of multimedia retrieval systems. Although substantially more efficient than related approaches based on diffusion processes, these re-ranking algorithms can still be computationally costly, demanding the specification and implementation of efficient big multimedia analysis approaches. Such demand associated with the significant potential for parallelization and highly effective results achieved by recently proposed re-ranking algorithms creates the need for exploiting efficiency vs effectiveness trade-offs. In this article, we introduce a class of unsupervised iterative re-ranking algorithms and present a model that can be used to guide their implementation and optimization for parallel architectures. We also analyze the impact of the parallelization on the performance of four algorithms that belong to the proposed class: Contextual Spaces, RL-Sim, Contextual Re-ranking, and Cartesian Product of Ranking References. The experiments show speedups that reach up to 6.0x, 16.1x, 3.3x, and 7.1x for each algorithm, respectively. These results demonstrate that the proposed parallel programming model can be successfully applied to various algorithms and used to improve the performance of multimedia retrieval systems.
id UNSP_a53dd148877e127fad78ce6abd27ead8
oai_identifier_str oai:repositorio.unesp.br:11449/196639
network_acronym_str UNSP
network_name_str Repositório Institucional da UNESP
repository_id_str 2946
spelling A unified model for accelerating unsupervised iterative re-ranking algorithmsGPGPUimage re-ranking modelmultimedia retrievalOpenCLparallel computingDespite the continuous advances in image retrieval technologies, performing effective and efficient content-based searches remains a challenging task. Unsupervised iterative re-ranking algorithms have emerged as a promising solution and have been widely used to improve the effectiveness of multimedia retrieval systems. Although substantially more efficient than related approaches based on diffusion processes, these re-ranking algorithms can still be computationally costly, demanding the specification and implementation of efficient big multimedia analysis approaches. Such demand associated with the significant potential for parallelization and highly effective results achieved by recently proposed re-ranking algorithms creates the need for exploiting efficiency vs effectiveness trade-offs. In this article, we introduce a class of unsupervised iterative re-ranking algorithms and present a model that can be used to guide their implementation and optimization for parallel architectures. We also analyze the impact of the parallelization on the performance of four algorithms that belong to the proposed class: Contextual Spaces, RL-Sim, Contextual Re-ranking, and Cartesian Product of Ranking References. The experiments show speedups that reach up to 6.0x, 16.1x, 3.3x, and 7.1x for each algorithm, respectively. These results demonstrate that the proposed parallel programming model can be successfully applied to various algorithms and used to improve the performance of multimedia retrieval systems.Advanced Micro DevicesConselho Nacional de Desenvolvimento Científico e Tecnológico (CNPq)Coordenação de Aperfeiçoamento de Pessoal de Nível Superior (CAPES)Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)Fundo de Apoio ao Ensino, a Pesquisa e Extensao, Universidade Estadual de CampinasPontifical Catholic Univ Rio de Janeiro, Dept Informat, Rio De Janeiro, RJ, BrazilUniv Estadual Campinas, Inst Comp, Av Albert Einstein 1251,Cidade Univ, Campinas, SP, BrazilSao Paulo State Univ, Dept Stat Appl Math & Comp, Rio Claro, SP, BrazilNTNU Norwegian Univ Sci & Technol, Dept ICT & Nat Sci, Alesund, NorwayISCTE IUL Lisbon Univ Inst, ISTAR IUL, Lisbon, PortugalSao Paulo State Univ, Dept Stat Appl Math & Comp, Rio Claro, SP, BrazilCNPq: 307560/2016-3CNPq: 484254/2012-0CNPq: 308194/2017-9CAPES: 88881.145912/2017-01FAPESP: 2013/50155-0FAPESP: 2013/50169-1FAPESP: 2014/50715-9FAPESP: 2013/08645-0FAPESP: 2014/12236-1FAPESP: 2015/24494-8FAPESP: 2016Wiley-BlackwellPontifical Catholic Univ Rio de JaneiroUniversidade Estadual de Campinas (UNICAMP)Universidade Estadual Paulista (Unesp)NTNU Norwegian Univ Sci & TechnolISCTE IUL Lisbon Univ InstPisani, FlaviaPascotti Valem, Lucas [UNESP]Guimaraes Pedronette, Daniel Carlos [UNESP]S. Torres, Ricardo daBorin, EdsonBreternitz, Mauricio2020-12-10T19:51:25Z2020-12-10T19:51:25Z2020-03-03info:eu-repo/semantics/publishedVersioninfo:eu-repo/semantics/article24http://dx.doi.org/10.1002/cpe.5702Concurrency And Computation-practice & Experience. Hoboken: Wiley, v. 32, n. 14, 24 p., 2020.1532-0626http://hdl.handle.net/11449/19663910.1002/cpe.5702WOS:000517769800001Web of Sciencereponame:Repositório Institucional da UNESPinstname:Universidade Estadual Paulista (UNESP)instacron:UNESPengConcurrency And Computation-practice & Experienceinfo:eu-repo/semantics/openAccess2021-10-23T08:53:43Zoai:repositorio.unesp.br:11449/196639Repositório InstitucionalPUBhttp://repositorio.unesp.br/oai/requestopendoar:29462024-08-05T17:36:00.497231Repositório Institucional da UNESP - Universidade Estadual Paulista (UNESP)false
dc.title.none.fl_str_mv A unified model for accelerating unsupervised iterative re-ranking algorithms
title A unified model for accelerating unsupervised iterative re-ranking algorithms
spellingShingle A unified model for accelerating unsupervised iterative re-ranking algorithms
Pisani, Flavia
GPGPU
image re-ranking model
multimedia retrieval
OpenCL
parallel computing
title_short A unified model for accelerating unsupervised iterative re-ranking algorithms
title_full A unified model for accelerating unsupervised iterative re-ranking algorithms
title_fullStr A unified model for accelerating unsupervised iterative re-ranking algorithms
title_full_unstemmed A unified model for accelerating unsupervised iterative re-ranking algorithms
title_sort A unified model for accelerating unsupervised iterative re-ranking algorithms
author Pisani, Flavia
author_facet Pisani, Flavia
Pascotti Valem, Lucas [UNESP]
Guimaraes Pedronette, Daniel Carlos [UNESP]
S. Torres, Ricardo da
Borin, Edson
Breternitz, Mauricio
author_role author
author2 Pascotti Valem, Lucas [UNESP]
Guimaraes Pedronette, Daniel Carlos [UNESP]
S. Torres, Ricardo da
Borin, Edson
Breternitz, Mauricio
author2_role author
author
author
author
author
dc.contributor.none.fl_str_mv Pontifical Catholic Univ Rio de Janeiro
Universidade Estadual de Campinas (UNICAMP)
Universidade Estadual Paulista (Unesp)
NTNU Norwegian Univ Sci & Technol
ISCTE IUL Lisbon Univ Inst
dc.contributor.author.fl_str_mv Pisani, Flavia
Pascotti Valem, Lucas [UNESP]
Guimaraes Pedronette, Daniel Carlos [UNESP]
S. Torres, Ricardo da
Borin, Edson
Breternitz, Mauricio
dc.subject.por.fl_str_mv GPGPU
image re-ranking model
multimedia retrieval
OpenCL
parallel computing
topic GPGPU
image re-ranking model
multimedia retrieval
OpenCL
parallel computing
description Despite the continuous advances in image retrieval technologies, performing effective and efficient content-based searches remains a challenging task. Unsupervised iterative re-ranking algorithms have emerged as a promising solution and have been widely used to improve the effectiveness of multimedia retrieval systems. Although substantially more efficient than related approaches based on diffusion processes, these re-ranking algorithms can still be computationally costly, demanding the specification and implementation of efficient big multimedia analysis approaches. Such demand associated with the significant potential for parallelization and highly effective results achieved by recently proposed re-ranking algorithms creates the need for exploiting efficiency vs effectiveness trade-offs. In this article, we introduce a class of unsupervised iterative re-ranking algorithms and present a model that can be used to guide their implementation and optimization for parallel architectures. We also analyze the impact of the parallelization on the performance of four algorithms that belong to the proposed class: Contextual Spaces, RL-Sim, Contextual Re-ranking, and Cartesian Product of Ranking References. The experiments show speedups that reach up to 6.0x, 16.1x, 3.3x, and 7.1x for each algorithm, respectively. These results demonstrate that the proposed parallel programming model can be successfully applied to various algorithms and used to improve the performance of multimedia retrieval systems.
publishDate 2020
dc.date.none.fl_str_mv 2020-12-10T19:51:25Z
2020-12-10T19:51:25Z
2020-03-03
dc.type.status.fl_str_mv info:eu-repo/semantics/publishedVersion
dc.type.driver.fl_str_mv info:eu-repo/semantics/article
format article
status_str publishedVersion
dc.identifier.uri.fl_str_mv http://dx.doi.org/10.1002/cpe.5702
Concurrency And Computation-practice & Experience. Hoboken: Wiley, v. 32, n. 14, 24 p., 2020.
1532-0626
http://hdl.handle.net/11449/196639
10.1002/cpe.5702
WOS:000517769800001
url http://dx.doi.org/10.1002/cpe.5702
http://hdl.handle.net/11449/196639
identifier_str_mv Concurrency And Computation-practice & Experience. Hoboken: Wiley, v. 32, n. 14, 24 p., 2020.
1532-0626
10.1002/cpe.5702
WOS:000517769800001
dc.language.iso.fl_str_mv eng
language eng
dc.relation.none.fl_str_mv Concurrency And Computation-practice & Experience
dc.rights.driver.fl_str_mv info:eu-repo/semantics/openAccess
eu_rights_str_mv openAccess
dc.format.none.fl_str_mv 24
dc.publisher.none.fl_str_mv Wiley-Blackwell
publisher.none.fl_str_mv Wiley-Blackwell
dc.source.none.fl_str_mv Web of Science
reponame:Repositório Institucional da UNESP
instname:Universidade Estadual Paulista (UNESP)
instacron:UNESP
instname_str Universidade Estadual Paulista (UNESP)
instacron_str UNESP
institution UNESP
reponame_str Repositório Institucional da UNESP
collection Repositório Institucional da UNESP
repository.name.fl_str_mv Repositório Institucional da UNESP - Universidade Estadual Paulista (UNESP)
repository.mail.fl_str_mv
_version_ 1808128833222606848