Unsupervised Effectiveness Estimation Measure Based on Rank Correlation for Image Retrieval
Main Author: | |
---|---|
Publication Date: | 2025 |
Other Authors: | , |
Format: | Conference object |
Language: | eng |
Source: | Repositório Institucional da UNESP |
Download full: | http://dx.doi.org/10.1007/978-3-031-77389-1_4 https://hdl.handle.net/11449/309983 |
Summary: | In recent years, the amount of image data has increased exponentially, driven by advancements in digital technologies. As the volume of data expands, the efforts required for labeling also escalate, which is costly and time-consuming. This scenario highlights the critical need for methods capable of delivering effective results in scenarios with few or no labels at all. In unsupervised retrieval, the task of Query Performance Prediction (QPP) is crucial and challenging, as it involves estimating the effectiveness of a query without labeled data. Besides promising, the QPP approaches are still largely unexplored for image retrieval. Additionally, recent approaches require training and do not exploit rank correlation to model the data. To address this gap, we propose a novel QPP measure named Accumulated JaccardMax, which considers contextual similarity information and innovates by exploiting a recent rank correlation measure to assess the effectiveness of ranked lists. It provides a robust estimation by analyzing the ranked lists in different neighborhood depths and does not require any training or labeled data. Extensive experiments were conducted across 5 datasets and over 20 different features including hand-crafted (e.g., color, shape, texture) and deep learning (e.g., Convolutional Networks and Vision Transformers) models. The results reveal that the proposed unsupervised measure exhibits a high correlation with the Mean Average Precision (MAP) in most cases, achieving results that are better or comparable to the baseline approaches in the literature. |
id |
UNSP_d0a8ee629a5b771650f3eea1ff23e2a8 |
---|---|
oai_identifier_str |
oai:repositorio.unesp.br:11449/309983 |
network_acronym_str |
UNSP |
network_name_str |
Repositório Institucional da UNESP |
repository_id_str |
2946 |
spelling |
Unsupervised Effectiveness Estimation Measure Based on Rank Correlation for Image RetrievalImage RetrievalQuery Performance PredictionIn recent years, the amount of image data has increased exponentially, driven by advancements in digital technologies. As the volume of data expands, the efforts required for labeling also escalate, which is costly and time-consuming. This scenario highlights the critical need for methods capable of delivering effective results in scenarios with few or no labels at all. In unsupervised retrieval, the task of Query Performance Prediction (QPP) is crucial and challenging, as it involves estimating the effectiveness of a query without labeled data. Besides promising, the QPP approaches are still largely unexplored for image retrieval. Additionally, recent approaches require training and do not exploit rank correlation to model the data. To address this gap, we propose a novel QPP measure named Accumulated JaccardMax, which considers contextual similarity information and innovates by exploiting a recent rank correlation measure to assess the effectiveness of ranked lists. It provides a robust estimation by analyzing the ranked lists in different neighborhood depths and does not require any training or labeled data. Extensive experiments were conducted across 5 datasets and over 20 different features including hand-crafted (e.g., color, shape, texture) and deep learning (e.g., Convolutional Networks and Vision Transformers) models. The results reveal that the proposed unsupervised measure exhibits a high correlation with the Mean Average Precision (MAP) in most cases, achieving results that are better or comparable to the baseline approaches in the literature.PetrobrasSão Paulo State University (UNESP), SPSão Paulo State University (UNESP), SPPetrobras: #2023/00095-3Universidade Estadual Paulista (UNESP)Almeida, Thiago César Castilho [UNESP]Valem, Lucas Pascotti [UNESP]Pedronette, Daniel Carlos Guimarães [UNESP]2025-04-29T20:17:24Z2025-01-01info:eu-repo/semantics/publishedVersioninfo:eu-repo/semantics/conferenceObject43-55http://dx.doi.org/10.1007/978-3-031-77389-1_4Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), v. 15047 LNCS, p. 43-55.1611-33490302-9743https://hdl.handle.net/11449/30998310.1007/978-3-031-77389-1_42-s2.0-85218450423Scopusreponame:Repositório Institucional da UNESPinstname:Universidade Estadual Paulista (UNESP)instacron:UNESPengLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)info:eu-repo/semantics/openAccess2025-04-30T14:00:26Zoai:repositorio.unesp.br:11449/309983Repositório InstitucionalPUBhttp://repositorio.unesp.br/oai/requestrepositoriounesp@unesp.bropendoar:29462025-04-30T14:00:26Repositório Institucional da UNESP - Universidade Estadual Paulista (UNESP)false |
dc.title.none.fl_str_mv |
Unsupervised Effectiveness Estimation Measure Based on Rank Correlation for Image Retrieval |
title |
Unsupervised Effectiveness Estimation Measure Based on Rank Correlation for Image Retrieval |
spellingShingle |
Unsupervised Effectiveness Estimation Measure Based on Rank Correlation for Image Retrieval Almeida, Thiago César Castilho [UNESP] Image Retrieval Query Performance Prediction |
title_short |
Unsupervised Effectiveness Estimation Measure Based on Rank Correlation for Image Retrieval |
title_full |
Unsupervised Effectiveness Estimation Measure Based on Rank Correlation for Image Retrieval |
title_fullStr |
Unsupervised Effectiveness Estimation Measure Based on Rank Correlation for Image Retrieval |
title_full_unstemmed |
Unsupervised Effectiveness Estimation Measure Based on Rank Correlation for Image Retrieval |
title_sort |
Unsupervised Effectiveness Estimation Measure Based on Rank Correlation for Image Retrieval |
author |
Almeida, Thiago César Castilho [UNESP] |
author_facet |
Almeida, Thiago César Castilho [UNESP] Valem, Lucas Pascotti [UNESP] Pedronette, Daniel Carlos Guimarães [UNESP] |
author_role |
author |
author2 |
Valem, Lucas Pascotti [UNESP] Pedronette, Daniel Carlos Guimarães [UNESP] |
author2_role |
author author |
dc.contributor.none.fl_str_mv |
Universidade Estadual Paulista (UNESP) |
dc.contributor.author.fl_str_mv |
Almeida, Thiago César Castilho [UNESP] Valem, Lucas Pascotti [UNESP] Pedronette, Daniel Carlos Guimarães [UNESP] |
dc.subject.por.fl_str_mv |
Image Retrieval Query Performance Prediction |
topic |
Image Retrieval Query Performance Prediction |
description |
In recent years, the amount of image data has increased exponentially, driven by advancements in digital technologies. As the volume of data expands, the efforts required for labeling also escalate, which is costly and time-consuming. This scenario highlights the critical need for methods capable of delivering effective results in scenarios with few or no labels at all. In unsupervised retrieval, the task of Query Performance Prediction (QPP) is crucial and challenging, as it involves estimating the effectiveness of a query without labeled data. Besides promising, the QPP approaches are still largely unexplored for image retrieval. Additionally, recent approaches require training and do not exploit rank correlation to model the data. To address this gap, we propose a novel QPP measure named Accumulated JaccardMax, which considers contextual similarity information and innovates by exploiting a recent rank correlation measure to assess the effectiveness of ranked lists. It provides a robust estimation by analyzing the ranked lists in different neighborhood depths and does not require any training or labeled data. Extensive experiments were conducted across 5 datasets and over 20 different features including hand-crafted (e.g., color, shape, texture) and deep learning (e.g., Convolutional Networks and Vision Transformers) models. The results reveal that the proposed unsupervised measure exhibits a high correlation with the Mean Average Precision (MAP) in most cases, achieving results that are better or comparable to the baseline approaches in the literature. |
publishDate |
2025 |
dc.date.none.fl_str_mv |
2025-04-29T20:17:24Z 2025-01-01 |
dc.type.status.fl_str_mv |
info:eu-repo/semantics/publishedVersion |
dc.type.driver.fl_str_mv |
info:eu-repo/semantics/conferenceObject |
format |
conferenceObject |
status_str |
publishedVersion |
dc.identifier.uri.fl_str_mv |
http://dx.doi.org/10.1007/978-3-031-77389-1_4 Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), v. 15047 LNCS, p. 43-55. 1611-3349 0302-9743 https://hdl.handle.net/11449/309983 10.1007/978-3-031-77389-1_4 2-s2.0-85218450423 |
url |
http://dx.doi.org/10.1007/978-3-031-77389-1_4 https://hdl.handle.net/11449/309983 |
identifier_str_mv |
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), v. 15047 LNCS, p. 43-55. 1611-3349 0302-9743 10.1007/978-3-031-77389-1_4 2-s2.0-85218450423 |
dc.language.iso.fl_str_mv |
eng |
language |
eng |
dc.relation.none.fl_str_mv |
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) |
dc.rights.driver.fl_str_mv |
info:eu-repo/semantics/openAccess |
eu_rights_str_mv |
openAccess |
dc.format.none.fl_str_mv |
43-55 |
dc.source.none.fl_str_mv |
Scopus 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 |
repositoriounesp@unesp.br |
_version_ |
1834482477682393088 |