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

Trend · papers per month

1345 · Feb 201919922001200920172026
48 results for Persian Handwriting

Deep transfer learning from Persian handwriting improves offline signature verification.

problem Challenges in offline signature verification, especially with skilled forgeries and limited training data.
method Transfer learning approach from Persian handwriting to multi-language OSV, using Residual CNNs for feature learning and SVMs for verification.
result Significant improvement in Equal Error Rate (EER) on UT-Sig dataset (9.80% EER), surpassing state-of-the-art methods.

This paper presents an automated supervised method for Persian wordnet construction. Using a Persian corpus and a bi-lingual dictionary, the initial links between Persian words and Princeton WordNet synsets have been generated. These links will be discriminated later as correct or incorrect by employing seven features …

2017-04-11abs ↗pdf ↗

Pars-ABSA dataset for Persian aspect-based sentiment analysis.

problem Lack of public dataset for Persian aspect-based sentiment analysis.
method Manually annotated dataset with 5,114 positive, 3,061 negative, and 1,827 neutral samples.
result State-of-the-art performance of deep learning methods on Pars-ABSA compared to similar English datasets.

Paper proposes a deep learning method to measure domain similarity in Persian texts.

problem Measuring the similarity between different domains of Persian text descriptions.
method Built a dataset of paired texts, used word embeddings and deep neural networks to score similarity, trained on GPU.
result Best model achieved an F1 score of 0.9865.

Study uses GMM-UBM and i-vectors to assess Parkinson's patients via speech, handwriting, and gait.

problem Assessing neurological state of Parkinson's disease patients using speech, handwriting, and gait signals.
method GMM-UBM and i-vectors applied to speech, handwriting, and gait signals.
result Different feature sets from each signal are crucial for assessing Parkinson's patients.

Evaluating the style of handwriting generation is a challenging problem, since it is not well defined. It is a key component in order to develop in developing systems with more personalized experiences with humans. In this paper, we propose baseline benchmarks, in order to set anchors to estimate the relative quality o…

2018-09-04abs ↗pdf ↗

This study evaluates handwriting features to diagnose Parkinson's disease.

problem Diagnosing Parkinson's disease through handwriting analysis.
method Kinematic, geometrical, and non-linear features were evaluated using K-nearest neighbors, support vector machines, and random forest classifiers.
result Up to 93.1% accuracy in classifying Parkinson's disease and healthy subjects.

We describe an online handwriting system that is able to support 102 languages using a deep neural network architecture. This new system has completely replaced our previous Segment-and-Decode-based system and reduced the error rate by 20%-40% relative for most languages. Further, we report new state-of-the-art results…

2019-02-22abs ↗pdf ↗

Improved sex and age-specific model for Parkinson's diagnosis.

problem Accurate diagnosis of Parkinson's disease for better patient care.
method Sex-specific and age-dependent handwriting classification model.
result Significantly improved accuracy (83.75% for females, 79.55% for older age group) compared to generalized model.

The paper predicts TSE stocks using social media sentiment and volume.

problem Predicting Tehran Stock Exchange (TSE) variables using social media data.
method Hybrid sentiment analysis combining lexicon-based and learning-based methods; built a sentiment lexicon for Persian language.
result Sentiment and volume of online comments are useful for predicting TSE stocks.

Historical documents present many challenges for offline handwriting recognition systems, among them, the segmentation and labeling steps. Carefully annotated textlines are needed to train an HTR system. In some scenarios, transcripts are only available at the paragraph level with no text-line information. In this work…

2018-11-10abs ↗pdf ↗

The remarkable development of deep learning in medicine and healthcare domain presents obvious privacy issues, when deep neural networks are built on users' personal and highly sensitive data, e.g., clinical records, user profiles, biomedical images, etc. However, only a few scientific studies on preserving privacy in …

2017-06-25abs ↗pdf ↗

Despite the recent progress towards efficient multiple kernel learning (MKL), the structured output case remains an open research front. Current approaches involve repeatedly solving a batch learning problem, which makes them inadequate for large scale scenarios. We propose a new family of online proximal algorithms fo…

2010-10-13abs ↗pdf ↗

Our goal is to extract meaningful transformations from raw images, such as varying the thickness of lines in handwriting or the lighting in a portrait. We propose an unsupervised approach to learn such transformations by attempting to reconstruct an image from a linear combination of transformations of its nearest neig…

2017-11-06abs ↗pdf ↗

We propose a new non-parametric framework for learning incrementally stable dynamical systems x' = f(x) from a set of sampled trajectories. We construct a rich family of smooth vector fields induced by certain classes of matrix-valued kernels, whose equilibria are placed exactly at a desired set of locations and whose …

2018-04-13abs ↗pdf ↗

A new method for training generative models with sparse supervision.

problem Training deep generative models with sparse and varying supervision.
method Caffeinated Wake-Sleep (CWS) method, combining reweighted wake-sleep and teacher-forcing.
result The CWS method is robust to variable length supervision and performs well on various datasets.

Many inference problems in structured prediction are naturally solved by augmenting a tractable dependency structure with complex, non-local auxiliary objectives. This includes the mean field family of variational inference algorithms, soft- or hard-constrained inference using Lagrangian relaxation or linear programmin…

2015-03-04abs ↗pdf ↗

The Teacher Forcing algorithm trains recurrent networks by supplying observed sequence values as inputs during training and using the network's own one-step-ahead predictions to do multi-step sampling. We introduce the Professor Forcing algorithm, which uses adversarial domain adaptation to encourage the dynamics of th…

2016-10-27abs ↗pdf ↗

Recurrent sequence generators conditioned on input data through an attention mechanism have recently shown very good performance on a range of tasks in- cluding machine translation, handwriting synthesis and image caption gen- eration. We extend the attention-mechanism with features needed for speech recognition. We sh…

2015-06-24abs ↗pdf ↗

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 ↗

Recurrent Neural Network (RNN) has been successfully applied in many sequence learning problems. Such as handwriting recognition, image description, natural language processing and video motion analysis. After years of development, researchers have improved the internal structure of the RNN and introduced many variants…

2018-10-30abs ↗pdf ↗

Proposes RN for unsupervised attention in neural networks.

problem Limited, imbalanced, and non-stationary input distributions in various tasks.
method Inspired by neuronal adaptation, RN uses MDL principle and universal code length for incremental layer-wise computation.
result Outperforms existing normalization methods across diverse tasks.

With latent variables, stochastic recurrent models have achieved state-of-the-art performance in modeling sound-wave sequence. However, opposite results are also observed in other domains, where standard recurrent networks often outperform stochastic models. To better understand this discrepancy, we re-examine the role…

2019-02-04abs ↗pdf ↗

IndyLSTMs use diagonal recurrent weights for faster, smaller LSTM models.

problem Training and evaluating large LSTM models can be computationally expensive and prone to overfitting.
method Introduce IndyLSTMs with diagonal recurrent weights, reducing parameter and computational complexity.
result IndyLSTMs achieve better accuracy per parameter and overall compared to regular LSTMs.

Structured prediction tasks pose a fundamental trade-off between the need for model complexity to increase predictive power and the limited computational resources for inference in the exponentially-sized output spaces such models require. We formulate and develop the Structured Prediction Cascade architecture: a seque…

2012-08-06abs ↗pdf ↗

New criteria ensure uniqueness of curve signatures, robust to metric variations.

problem Ensuring uniqueness of curve signatures in differential geometry.
method Introducing new methods through differential equations and higher order derivatives.
result New criteria for curve signature uniqueness in general settings.

HW2MP-GAN tackles ancient handwritten text recognition.

problem Automatic text recognition from ancient handwritten records.
method Conditional Generative Adversarial Network (HW2MP-GAN) with Sliced Wasserstein distance and U-Net architectures.
result HW2MP-GAN outperforms state-of-the-art models in image-to-image translation and handwritten recognition.