Skip to content
DraconiticResearch
Search Sources API
203,234 studies31 sourcesUpdated 3 min ago
Peer-reviewedCC BY 4.0Mathematics

Re-Ranking Methods for Instance-Level Image Retrieval: A Review

  1. 1School of Electrical Engineering, Kookmin University, Seoul 02707, Republic of Korea

Abstract

Image retrieval re-ranking improves an initial retrieval result by incorporating local image features, neighborhood relationships, or learned similarity functions. This selective narrative review examines re-ranking methods for instance and landmark image retrieval, covering geometric verification, query expansion, neighborhood encoding, graph diffusion, and learned pairwise and listwise models. Methods are classified by their inference evidence, contextual access, and ability to modify the candidate set. Mathematical formulations and their assumptions clarify the relationships among query refinement, reciprocal encoding, graph propagation, and attention. Deterministic numerical examples illustrate query drift and propagation through an erroneous graph edge. Published benchmark results are synthesized through within-study comparisons, with explicit controls for first-stage representations, local evidence, candidate depth, and evaluation protocols. Reported computation and storage are related to the corresponding performance gains. The selected evidence indicates that contextual refinement benefits from reliable neighborhoods, while local verification supplies complementary information under clutter and domain shift. The review concludes with deployment trade-offs and research directions in adaptive computation, uncertainty-aware contextual modeling, compressed local representations, dynamic galleries, and multimodal re-ranking.

Related

  1. Can We Trust This Evaluation? Instance-Level Reliability of LLM-as-a-Judge
    Yang Ba, Michelle V. Mancenido, Rong Pan
    arXivPreprintCC BY 4.0Full textStatisticsarXiv
  2. Integration of resolving topological indices and ADMET analysis with MCDM methods (TOPSIS and SAW) for ranking breast cancer therapeutics.
    E Pandeeswari, J Ravi Sankar
    Frontiers in bioinformaticsPeer-reviewedCC BYFull textGeometry & topologyEurope PMCPMC
  3. From intersection names to street rankings in Kyoto: Comparing ranking methods for incomplete pairwise data
    Takashi Teramoto
    PLOS OnePeer-reviewedCC BY 4.0Full textAlgebra & number theoryProbabilityPLOS
  4. Accelerated Prox-Level Methods for Unknown Piecewise-Smooth Optimization II: Function-constrained Optimization
    Zhenwei Lin, Zhe Zhang
    arXivPreprintarXiv licenceFull textOptimisation & controlarXiv
  5. Newton-Based Methods for Bilevel Optimization Beyond Lower-Level Strong Convexity
    Youran Dong, Junfeng Yang, Wei Yao +1
    arXivPreprintarXiv licenceFull textOptimisation & controlarXiv
BibTeX
@article{lee2026reranking,
  title = {{Re-Ranking Methods for Instance-Level Image Retrieval: A Review}},
  author = {Seongwon Lee},
  journal = {Mathematics},
  year = {2026},
  month = nov,
  doi = {10.3390/math14214054},
  url = {https://www.mdpi.com/2227-7390/14/21/4054},
  note = {CC BY 4.0},
}
RIS
TY  - JOUR
TI  - Re-Ranking Methods for Instance-Level Image Retrieval: A Review
AU  - Seongwon Lee
PY  - 2026
DA  - 2026/11/05
JO  - Mathematics
DO  - 10.3390/math14214054
UR  - https://www.mdpi.com/2227-7390/14/21/4054
AB  - Image retrieval re-ranking improves an initial retrieval result by incorporating local image features, neighborhood relationships, or learned similarity functions. This selective narrative review examines re-ranking methods for instance and landmark image retrieval, covering geometric verification, query expansion, neighborhood encoding, graph diffusion, and learned pairwise and listwise models. Methods are classified by their inference evidence, contextual access, and ability to modify the candidate set. Mathematical formulations and their assumptions clarify the relationships among query refinement, reciprocal encoding, graph propagation, and attention. Deterministic numerical examples illustrate query drift and propagation through an erroneous graph edge. Published benchmark results are synthesized through within-study comparisons, with explicit controls for first-stage representations, local evidence, candidate depth, and evaluation protocols. Reported computation and storage are related to the corresponding performance gains. The selected evidence indicates that contextual refinement benefits from reliable neighborhoods, while local verification supplies complementary information under clutter and domain shift. The review concludes with deployment trade-offs and research directions in adaptive computation, uncertainty-aware contextual modeling, compressed local representations, dynamic galleries, and multimodal re-ranking.
SN  - 2227-7390
ER  -