Learning to Rank Words: Optimizing Ranking Metrics for Word Spotting

06/09/2021
by   Pau Riba, et al.
0

In this paper, we explore and evaluate the use of ranking-based objective functions for learning simultaneously a word string and a word image encoder. We consider retrieval frameworks in which the user expects a retrieval list ranked according to a defined relevance score. In the context of a word spotting problem, the relevance score has been set according to the string edit distance from the query string. We experimentally demonstrate the competitive performance of the proposed model on query-by-string word spotting for both, handwritten and real scene word images. We also provide the results for query-by-example word spotting, although it is not the main focus of this work.

READ FULL TEXT
research
05/04/2023

Ranking and unranking bordered and unbordered words

A border of a word w is a word that is both a non-empty proper prefix an...
research
05/28/2015

Query by String word spotting based on character bi-gram indexing

In this paper we propose a segmentation-free query by string word spotti...
research
07/10/2019

String Attractors and Combinatorics on Words

The notion of string attractor has recently been introduced in [Prezza, ...
research
08/01/2020

Theta palindromes in theta conjugates

A DNA string is a Watson-Crick (WK) palindrome when the complement of it...
research
04/26/2020

Choppy: Cut Transformer For Ranked List Truncation

Work in information retrieval has traditionally focused on ranking and r...
research
05/10/2021

A Probabilistic Approach to Personalize Type-based Facet Ranking for POI Suggestion

Faceted Search Systems (FSS) have become one of the main search interfac...
research
09/14/2018

Detection-by-Localization: Maintenance-Free Change Object Detector

Recent researches demonstrate that self-localization performance is a ve...

Please sign up or login with your details

Forgot password? Click here to reset