Recognizing Cuneiform Signs Using Graph Based Methods

02/16/2018
by   Nils M. Kriege, et al.
0

The cuneiform script constitutes one of the earliest systems of writing and is realized by wedge-shaped marks on clay tablets. A tremendous number of cuneiform tablets have already been discovered and are incrementally digitalized and made available to automated processing. As reading cuneiform script is still a manual task, we address the real-world application of recognizing cuneiform signs by two graph based methods with complementary runtime characteristics. We present a graph model for cuneiform signs together with a tailored distance measure based on the concept of the graph edit distance. We propose efficient heuristics for its computation and demonstrate its effectiveness in classification tasks experimentally. To this end, the distance measure is used to implement a nearest neighbor classifier leading to a high computational cost for the prediction phase with increasing training set size. In order to overcome this issue, we propose to use CNNs adapted to graphs as an alternative approach shifting the computational cost to the training phase. We demonstrate the practicability of both approaches in an extensive experimental comparison regarding runtime and prediction accuracy. Although currently available annotated real-world data is still limited, we obtain a high accuracy using CNNs, in particular, when the training set is enriched by augmented examples.

READ FULL TEXT
research
06/02/2023

EPIC: Graph Augmentation with Edit Path Interpolation via Learnable Cost

Graph-based models have become increasingly important in various domains...
research
08/15/2022

Training-Time Attacks against k-Nearest Neighbors

Nearest neighbor-based methods are commonly used for classification task...
research
07/27/2023

Robust graphs for graph-based methods

Graph-based two-sample tests and graph-based change-point detection that...
research
11/15/2021

EmbAssi: Embedding Assignment Costs for Similarity Search in Large Graph Databases

The graph edit distance is an intuitive measure to quantify the dissimil...
research
02/10/2018

A Continuation Method for Discrete Optimization and its Application to Nearest Neighbor Classification

The continuation method is a popular approach in non-convex optimization...
research
07/24/2019

A graphical heuristic for reduction and partitioning of large datasets for scalable supervised training

A scalable graphical method is presented for selecting, and partitioning...

Please sign up or login with your details

Forgot password? Click here to reset