Re-ranking For Writer Identification And Writer Retrieval

Abstract

Automatic writer identification is a common problem in document analysis. State-of-the-art methods typically focus on the feature extraction step with traditional or deep-learning-based techniques. In retrieval problems, re-ranking is a commonly used technique to improve the results. Re-ranking refines an initial ranking result by using the knowledge contained in the ranked result, e. g., by exploiting nearest neighbor relations. To the best of our knowledge, re-ranking has not been used for writer identification/retrieval. A possible reason might be that publicly available benchmark datasets contain only few samples per writer which makes a re-ranking less promising. We show that a re-ranking step based on k-reciprocal nearest neighbor relationships is advantageous for writer identification, even if only a few samples per writer are available. We use these reciprocal relationships in two ways: encode them into new vectors, as originally proposed, or integrate them in terms of query-ex

Stats

• citations10
• S2 citations—
• github stars0
• HF likes0
• heat score7.81
• arxiv keyjordan2020re

Related papers

• Writer Identification And Writer Retrieval Based On Netvlad With Re-ranking (2020)8.82
• Re-ranking Person Re-identification With K-reciprocal Encoding (2017)23.09
• Writer Retrieval And Writer Identification In Greek Papyri (2022)8.60
• Refit: Relevance Feedback From A Reranker During Inference (2023)0.00
• Moving Towards Centers: Re-ranking With Attention And Memory For Re-identification (2021)8.09
• Understanding Image Retrieval Re-ranking: A Graph Neural Network Perspective (2020)0.00
• Learnable Pillar-based Re-ranking For Image-text Retrieval (2023)9.92
• Enhancing The Ranking Context Of Dense Retrieval Methods Through Reciprocal Nearest Neighbors (2023)4.52