2013
DOI: 10.1007/978-3-642-41190-8_17
|View full text |Cite
|
Sign up to set email alerts
|

Improving Ancient Roman Coin Classification by Fusing Exemplar-Based Classification and Legend Recognition

Abstract: In this paper we present an image-based classification method for ancient Roman Republican coins that uses multiple sources of information. Exemplar-based classification, which estimates the coins' visual similarity by means of a dense correspondence field, and lexiconbased legend recognition are unified to a common classification approach. Classification scores from both coin sides are further integrated to an overall score determining the final classification decision. Experiments carried out on a dataset of… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1

Citation Types

0
5
0

Year Published

2014
2014
2024
2024

Publication Types

Select...
3
3
2

Relationship

2
6

Authors

Journals

citations
Cited by 9 publications
(5 citation statements)
references
References 18 publications
0
5
0
Order By: Relevance
“…For each patch R, a distance dP to patch Q is calculated where both patches share a patch position. Similar to [21], dP is transformed to a pseudo probability ρ(dP ) where the shortest distance is mapped to the highest probability and vice versa.…”
Section: ) Find Best Patch Combination Using Markov Randommentioning
confidence: 99%
“…For each patch R, a distance dP to patch Q is calculated where both patches share a patch position. Similar to [21], dP is transformed to a pseudo probability ρ(dP ) where the shortest distance is mapped to the highest probability and vice versa.…”
Section: ) Find Best Patch Combination Using Markov Randommentioning
confidence: 99%
“…A database of 180 Roman Republican coins divided into 60 classes was published by Zambanini and Kampel (2013). To our knowledge, it is the first database used to read characters on coins.…”
Section: Roman Republican Coinsmentioning
confidence: 99%
“…Arandjelovic (2012) describes the character appearance by using a HoG-like descriptor, but this step is implemented in the whole coin recognition pipeline and he neither reported individually his character recognition results nor published the database of the extracted characters. Kavelar et al (2012) and Zambanini and Kampel (2013) used a single SIFT descriptor to describe the patch that contains the character, and they reported a recognition rate of 25% to 68% on 18 classes using different training sizes per class (15-50). But, once again, the authors did not publish the databases of characters extracted from coins.…”
mentioning
confidence: 99%
“…With such a large number of categories, the ancient coins further face an additional challenge of "rarity" where the worldwide count of specimen for some classes is considerably low. Consequently, there is clear interest in automatically extracting information about an unknown coin, and several works in the past [2,3,4,5,6,7,8,9,10,11] have attempted to address this problem. As being a visual recognition task, recent state-of-the-art convolutional neural network (CNN) based models [12,13,14] have also been applied, albeit their strong dependency on comprehensive and annotated image datasets.…”
Section: Introductionmentioning
confidence: 99%