Rank-based Hashing for Effective and Efficient Nearest Neighbor Search for Image Retrieval

Registro completo de metadados
MetadadosDescriçãoIdioma
Autor(es): dc.contributorUniversidade Estadual Paulista (UNESP)-
Autor(es): dc.contributorUniversidade Estadual de Campinas (UNICAMP)-
Autor(es): dc.contributorTemple University-
Autor(es): dc.creatorKawai, Vinicius Sato-
Autor(es): dc.creatorValem, Lucas Pascotti-
Autor(es): dc.creatorBaldassin, Alexandro-
Autor(es): dc.creatorBorin, Edson-
Autor(es): dc.creatorDemac, Daniel Carlos Guimarães Pedronette-
Autor(es): dc.creatorLatecki, Longin J.A.N.-
Data de aceite: dc.date.accessioned2025-08-21T15:42:21Z-
Data de disponibilização: dc.date.available2025-08-21T15:42:21Z-
Data de envio: dc.date.issued2025-04-29-
Data de envio: dc.date.issued2024-09-12-
Fonte completa do material: dc.identifierhttp://dx.doi.org/10.1145/3659580-
Fonte completa do material: dc.identifierhttps://hdl.handle.net/11449/309346-
Fonte: dc.identifier.urihttp://educapes.capes.gov.br/handle/11449/309346-
Descrição: dc.descriptionThe large and growing amount of digital data creates a pressing need for approaches capable of indexing and retrieving multimedia content. A traditional and fundamental challenge consists of effectively and efficiently performing nearest-neighbor searches. After decades of research, several different methods are available, including trees, hashing, and graph-based approaches. Most of the current methods exploit learning to hash approaches based on deep learning. In spite of effective results and compact codes obtained, such methods often require a significant amount of labeled data for training. Unsupervised approaches also rely on expensive training procedures usually based on a huge amount of data. In this work, we propose an unsupervised data-independent approach for nearest neighbor searches, which can be used with different features, including deep features trained by transfer learning. The method uses a rank-based formulation and exploits a hashing approach for efficient ranked list computation at query time. A comprehensive experimental evaluation was conducted on seven public datasets, considering deep features based on CNNs and Transformers. Both effectiveness and efficiency aspects were evaluated. The proposed approach achieves remarkable results in comparison to traditional and state-of-the-art methods. Hence, it is an attractive and innovative solution, especially when costly training procedures need to be avoided.-
Descrição: dc.descriptionDepartment of Statistics Applied Math. and Computing State University of São Paulo (UNESP)-
Descrição: dc.descriptionDSC University of Campinas (UNICAMP)-
Descrição: dc.descriptionState University of São Paulo (UNESP)-
Descrição: dc.descriptionTemple University-
Descrição: dc.descriptionDepartment of Statistics Applied Math. and Computing State University of São Paulo (UNESP)-
Descrição: dc.descriptionState University of São Paulo (UNESP)-
Idioma: dc.languageen-
Relação: dc.relationACM Transactions on Multimedia Computing, Communications and Applications-
???dc.source???: dc.sourceScopus-
Título: dc.titleRank-based Hashing for Effective and Efficient Nearest Neighbor Search for Image Retrieval-
Tipo de arquivo: dc.typelivro digital-
Aparece nas coleções:Repositório Institucional - Unesp

Não existem arquivos associados a este item.