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,694 papers · 148 categories

Trend · papers per month

6111722 · May 201919922001200920172026
48 results for handwritten characters

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 ↗

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 ↗

Hybrid model learns novel handwritten characters better than neural or symbolic models alone.

problem Generating novel yet structured concepts.
method Neuro-symbolic model combining neural networks and probabilistic programs.
result Hybrid model outperforms alternative models in learning and generalizing novel handwritten characters.

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.

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.

Generative Neuro-Symbolic model learns from raw data with rich conceptual representations.

problem Learning rich, general-purpose conceptual representations from raw perceptual inputs.
method Generative Neuro-Symbolic (GNS) model combining symbolic and neural network approaches.
result Model learns from raw data and generalizes to 4 unique tasks.

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.

As a model for an on-line classification setting we consider a stochastic process (Xn,Yn)n(X_{-n},Y_{-n})_{n}, the present time-point being denoted by 0, with observables ,Xn,Xn+1,,X1,X0 \ldots,X_{-n},X_{-n+1},\ldots, X_{-1}, X_0 from which the pattern Y0Y_0 is to be inferred. So in this classification setting, in addition to the present…

2015-09-22abs ↗pdf ↗

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 ↗

In the last few years the systematic adoption of deep learning to visual generation has produced impressive results that, amongst others, definitely benefit from the massive exploration of convolutional architectures. In this paper, we propose a general approach to visual generation that combines learning capabilities …

2018-07-16abs ↗pdf ↗

End-to-end solution for recognizing handwritten numerals, avoiding traditional preprocessing steps.

problem Handwritten numeral string recognition with traditional preprocessing steps.
method YoLo-based model for automatic detection and recognition, avoiding heuristic-based preprocessing and segmentation.
result Proposed method reduces complexity and is a feasible end-to-end solution for numeral string recognition.

In the era of deep learning several unsupervised models have been developed to capture the key features in unlabeled handwritten data. Popular among them is the Restricted Boltzmann Machines RBM. However, due to the novelty in handwritten multidialect data, the RBM may fail to generate an efficient representation. In t…

2015-08-17abs ↗pdf ↗

Multidimensional time series are sequences of real valued vectors. They occur in different areas, for example handwritten characters, GPS tracking, and gestures of modern virtual reality motion controllers. Within these areas, a common task is to search for similar time series. Dynamic Time Warping (DTW) is a common di…

2018-04-17abs ↗pdf ↗

Paper generalizes path signature using fractional calculus for improved machine learning.

problem Improving path signature for machine learning applications.
method Introduces two new signatures inspired by fractional calculus and machine learning considerations.
result Significant accuracy improvements in handwritten digit recognition.

New algorithm for multiway spectral clustering on Grassmann manifolds.

problem Efficiently computing multiple eigenvectors of a nonlinear graph Laplacian.
method Direct multiway spectral clustering in pp-norm, reformulated as minimization on Grassmann manifold.
result Monotonic decrease of balanced graph cuts leads to optimal solutions.

The area of Handwritten Signature Verification has been broadly researched in the last decades, but remains an open research problem. The objective of signature verification systems is to discriminate if a given signature is genuine (produced by the claimed individual), or a forgery (produced by an impostor). This has …

2015-07-28abs ↗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.

In this paper, we give a quantum interpretation of the Bismut-Chern character form (the loop space lifting of the Chern character form) as well as the Chern character form associated to a complex vector bundle with connection over a smooth manifold in the framework of supersymmetric quantum field theories developed by …

2007-11-24abs ↗pdf ↗

Study shows how certain knots and tori are detected by ideal points in character varieties.

problem Detecting essential twice-punctured tori in character varieties.
method Extending Tillmann's limiting character method to new families of knots and tori.
result Explicit determination of limiting characters at ideal points for specific knots and tori.

Background elimination for noisy character images or character images from real scene is still a challenging problem, due to the bewildering backgrounds, uneven illumination, low resolution and different distortions. We propose a stroke-based character reconstruction(SCR) method that use a weighted quadratic Bezier cur…

2018-06-23abs ↗pdf ↗

Computes dimensions of representation and character varieties for 2 and 3-dimensional orbifolds.

problem Computing dimensions of representation and character varieties for orbifolds.
method Analyzes varieties of representations and characters of hyperbolic and non-hyperbolic orbifolds, provides tools for computation.
result Shows that the dimension of a specific component of characters equals half the dimension of the variety of characters of the boundary.

Paper generates personalized fonts from a few characters.

problem Creating personalized fonts from a limited set of characters.
method Designs a network framework to extract and recombine character content and style using various neural networks.
result Generated characters are structurally similar to real characters.

We study some basic properties of the variety of characters in PSL(2,C) of a finitely generated group. In particular we give an interpretation of its points as characters of representations. We construct 3-manifolds whose variety of characters has arbitrarily many components that do not lift to SL(2,C). We also study t…

2003-02-07abs ↗pdf ↗

Study of quantum decorated character stacks and their quantizations.

problem Quantization of decorated character stacks and their compatibility with cutting and gluing.
method Using stratified factorization homology, extend Fock and Goncharov's construction to include stacky points.
result Construction of categorical charts and flips on quantum decorated character stacks.

Study character varieties of hyperbolic 3-manifolds using bundle methods.

problem Character varieties of hyperbolic 3-manifolds in once-punctured torus bundles.
method Restrict characters to the fibre and analyze branched covering maps.
result Infinite family of hyperbolic once-punctured bundles with unbounded genus.