Research
On-device research index

arXiv research

A locally-built, LLM-digested index of recent arXiv papers in quant finance, geometry/topology, and statistical ML — keyword search served straight from SQLite on this machine.

168,695 papers · 148 categories

Trend · papers per month

20406080 · Jun 202019922001200920172026
48 results for Character recognition

It is proposed a new code for contours of plane images. This code was applied for optical character recognition of printed and handwritten characters. One can apply it to recognition of any visual images.

2012-12-04abs ↗pdf ↗

Bayesian method improves neural net convergence for character recognition.

problem Improving convergence rate of neural network training algorithms.
method Customization of Kalman filter into Bayesian statistics for initialization of weights.
result Improved convergence rate for backpropagation training algorithm.

EASTER improves OCR efficiency and scalability.

problem Efficient and scalable Optical Character Recognition (OCR) for machine printed and handwritten text.
method 1-D convolutional layers without recurrence, parallel training, synthetic dataset generation.
result EASTER achieves comparable performance to complex RNN models with less data and outperforms them on benchmark datasets.

The paper approaches the task of handwritten text recognition (HTR) with attentional encoder-decoder networks trained on sequences of characters, rather than words. We experiment on lines of text from popular handwriting datasets and compare different activation functions for the attention mechanism used for aligning i…

2017-12-11abs ↗pdf ↗

ChemGrapher uses deep learning to automatically convert chemical compound images into accurate graphs.

problem Automatically converting chemical compound images into accurate graphs with correct bond multiplicity and stereochemical information.
method Developed a deep neural network model for optical compound recognition, including segmentation and classification models.
result Significant error reductions in bond multiplicity and stereochemical information compared to existing tools.

A tailored HTR system improves CER to 0.015 for medieval Latin.

problem Digitizing handwritten medieval Latin records for a low-resource language.
method End-to-end pipeline using image segmentation and transformer-based models with extensive data augmentation.
result Best-performing setup achieved CER of 0.015, superior to commercial models.

This paper presents a novel kernel-based generative classifier which is defined in a distortion subspace using polynomial series expansion, named Kernel-Distortion (KD) classifier. An iterative kernel selection algorithm is developed to steadily improve classification performance by repeatedly removing and adding kerne…

2016-06-21abs ↗pdf ↗

We develop a Chern character map for twisted equivariant non-abelian cohomology.

problem Understanding non-abelian cohomology theories and their applications.
method General construction of the Chern character map for twisted equivariant non-abelian cohomology.
result Illustrated the construction by computing the equivariant Sullivan model of Cohomotopy.

Chinese NER is a challenging task. As pictographs, Chinese characters contain latent glyph information, which is often overlooked. In this paper, we propose the FGN, Fusion Glyph Network for Chinese NER. Except for adding glyph information, this method may also add extra interactive information with the fusion mechanis…

2020-01-15abs ↗pdf ↗

Scene text magnifier aims to magnify text in natural scene images without recognition. It could help the special groups, who have myopia or dyslexia to better understand the scene. In this paper, we design the scene text magnifier through interacted four CNN-based networks: character erasing, character extraction, char…

2019-06-17abs ↗pdf ↗

Paper proposes a method to maintain ASR performance on new tasks without forgetting old ones.

problem Mitigating forgetting in ASR models when learning new tasks.
method A novel explainability-based knowledge distillation combined with response-based knowledge distillation.
result Our method outperforms existing ones in mitigating forgetting on multi-stage sequential training tasks.

We stabilize the activations of Recurrent Neural Networks (RNNs) by penalizing the squared distance between successive hidden states' norms. This penalty term is an effective regularizer for RNNs including LSTMs and IRNNs, improving performance on character-level language modeling and phoneme recognition, and outperfor…

2015-11-26abs ↗pdf ↗

Improved recurrent neural networks learn long-term dependencies through multi-scale memory.

problem Capturing long-term dependencies in recurrent neural networks.
method Incremental training of a modular RNN architecture with multi-scale hidden states.
result Incremental training and multi-scale memory enhance RNNs' ability to learn long-term dependencies.

In this paper, we address the task of Optical Character Recognition(OCR) for the Telugu script. We present an end-to-end framework that segments the text image, classifies the characters and extracts lines using a language model. The segmentation is based on mathematical morphology. The classification module, which is …

2015-09-20abs ↗pdf ↗

In this paper, we tackle the problem of online semi-supervised learning (SSL). When data arrive in a stream, the dual problems of computation and data storage arise for any SSL method. We propose a fast approximate online SSL algorithm that solves for the harmonic solution on an approximate graph. We show, both empiric…

2012-03-15abs ↗pdf ↗

We present the Latent Sequence Decompositions (LSD) framework. LSD decomposes sequences with variable lengthed output units as a function of both the input sequence and the output sequence. We present a training algorithm which samples valid extensions and an approximate decoding algorithm. We experiment with the Wall …

2016-10-10abs ↗pdf ↗

We study large-scale kernel methods for acoustic modeling in speech recognition and compare their performance to deep neural networks (DNNs). We perform experiments on four speech recognition datasets, including the TIMIT and Broadcast News benchmark tasks, and compare these two types of models on frame-level performan…

2017-01-13abs ↗pdf ↗

Study of Bowditch representations in hyperbolic spaces with implications for dynamics and recognition.

problem Characterizing and understanding representations of free groups into hyperbolic spaces.
method Generalization of Bowditch conditions, explicit constant KδK_δ for hyperbolicity, characterizations of representations.
result Linear growth of lengths for primitive elements in Bowditch representations, new characterization of primitive-stable representations.

We present here a new model and algorithm which performs an efficient Natural gradient descent for Multilayer Perceptrons. Natural gradient descent was originally proposed from a point of view of information geometry, and it performs the steepest descent updates on manifolds in a Riemannian space. In particular, we ext…

2017-04-24abs ↗pdf ↗

RoyalFlush system improves multi-speaker ASR in M2MeT challenge.

problem Improving multi-speaker automatic speech recognition in noisy environments.
method Front-end processing with WPE and beamforming, data augmentation, and fusion of two ASR models.
result 12.22% absolute CER reduction on validation set and 12.11% on test set compared to baseline.

In this article, we will formulate a mathematical framework that allows us to treat character animations as points on infinite dimensional Hilbert manifolds. Constructing geodesic paths between animations on those manifolds allows us to derive a distance function to measure similarities of different motions. This appro…

2014-05-16abs ↗pdf ↗

Grapheme-based acoustic modeling has recently been shown to outperform phoneme-based approaches in both hybrid and end-to-end automatic speech recognition (ASR), even on non-phonemic languages like English. However, graphemic ASR still has problems with rare long-tail words that do not follow the standard spelling conv…

2019-10-22abs ↗pdf ↗

We present a new dataset for form understanding in noisy scanned documents (FUNSD) that aims at extracting and structuring the textual content of forms. The dataset comprises 199 real, fully annotated, scanned forms. The documents are noisy and vary widely in appearance, making form understanding (FoUn) a challenging t…

2019-05-27abs ↗pdf ↗

We study the problem of structured prediction under test-time budget constraints. We propose a novel approach applicable to a wide range of structured prediction problems in computer vision and natural language processing. Our approach seeks to adaptively generate computationally costly features during test-time in ord…

2016-02-28abs ↗pdf ↗

Statistical learning is the process of estimating an unknown probabilistic input-output relationship of a system using a limited number of observations. A statistical learning machine (SLM) is the algorithm, function, model, or rule, that learns such a process; and machine learning (ML) is the conventional name of this…

2019-06-24abs ↗pdf ↗

Character scheme of small Seifert 3-manifolds is reduced if and only if no exceptional abelian character exists.

problem Character scheme of small Seifert 3-manifolds and its reduction condition.
method Complete description of the SL2(C)-character scheme of small Seifert 3-manifolds.
result Character scheme is reduced if and only if no exceptional abelian character exists, and exceptional abelian character has multiplicity 2.