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.

169,181 papers · 148 categories

Trend · papers per month

0.6%1.2%1.8%2.4% · Nov 201819922001200920182026
48 results for handwritten annotations

Paper tackles handwritten annotation recognition in historic documents using FCNN.

problem Recognizing handwritten annotations in challenging historic German documents.
method End-to-end semantic segmentation using Fully Convolutional Neural Networks (FCNN).
result Best model achieves 95.6% IoU score on test documents.

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.

Optimal ANN pre-training with SDA reduces handwritten Bengali digit recognition error to 2.34%

problem Optimizing ANN architecture for Bengali handwritten digit recognition
method Pre-training ANN with stacked denoising autoencoder (SDA)
result Minimum validation error of 2.34% on handwritten Bengali dataset

The paper uses attention networks for character-based handwritten text transcription.

problem Handwritten text recognition with improved character-level alignment.
method Attentional encoder-decoder networks trained on character sequences, comparing different activation functions.
result Softmax attention provides more precise character alignment than sigmoid attention.

The paper presents a recognition system for Pashto letters using KNN and ANN.

problem Challenging handwritten character recognition, especially for Pashto letters.
method Designed a database of 4488 images, used zoning feature extractor, KNN, and ANN classifiers.
result Achieved overall classification accuracy of 70.05% using KNN and 72% using ANN.

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.

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.

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 ↗

Improved CNN for HCCR with new loss function and ranking method.

problem Loss of inter-class information in traditional CNN models for HCCR.
method Combining cross entropy with a new similarity ranking function (Average variance similarity) as loss function.
result New loss function (SoftMax cross entropy with Average variance similarity) achieves highest accuracy in HCCR.

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.

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.

Study shows annotation instrument design affects model performance in hate speech detection.

problem Impact of annotation instrument design on model performance in hate speech detection.
method Collected annotations from five experimental conditions of an annotation instrument, fine-tuned BERT models on each dataset, evaluated performance on holdout portion.
result Significant differences in model performance and annotations across conditions.

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.

This study examines how hidden layers affect CNN performance on handwritten digit recognition.

problem Impact of hidden layers on CNN performance in handwritten digit recognition.
method Applied CNN with varying hidden layers on MNIST dataset, trained with stochastic gradient and backpropagation, tested with feedforward.
result Variations in accuracies for different hidden layers and epochs.

New method to estimate doctors' effort in annotating medical images.

problem High effort and expense in annotating medical images.
method Proposes a new criterion to evaluate effort, uses active learning and U-shape network for annotation strategy, and fine annotation platform to reduce effort.
result State-of-the-art segmentation performance achieved with only 60% annotation candidates, reducing effort by 44-47%.

Active learning selects both observations and annotation precision for Gaussian Processes.

problem Costly annotation in supervised learning.
method Proposes an active learning algorithm that selects observations and annotation precision, using a modified BALD objective.
result Empirically shows the benefits of adjusting annotation precision in active learning.

Generative model combines multi-dimensional annotations for more accurate ground truth estimation.

problem Inaccurate ground truth estimation from naive annotators' multi-dimensional annotations.
method Proposes a joint multi-dimensional model for global and time-series annotation fusion using Expectation-Maximization algorithm.
result More accurate ground truth estimates through joint modeling of multiple dimensions.

Survey on AL strategies for cost-effective annotation in classification.

problem Real-world AL challenges due to human annotators' limitations.
method Categorizes 60 real-world AL strategies considering multiple annotators, query types, and cost schemes.
result General real-world AL strategy introduced for categorization of 60 strategies.

RAD improves robustness to domain annotation noise without explicit domain annotations.

problem Robustness to domain annotation noise in training data.
method Regularized Annotation of Domains (RAD) for last layer retraining.
result RAD outperforms state-of-the-art methods even with 5% noise in training data.

The study challenges the notion that partial data annotation is inferior, suggesting it can sometimes outperform complete annotation.

problem The inefficiency and high cost of completely annotating structured data.
method Information theoretic formulation applied to three diverse structured learning tasks.
result Learning from partial structures can sometimes outperform learning from complete ones.

A new method uses triplet embeddings to improve human annotation for hidden constructs.

problem Improving human annotation for hidden constructs in machine learning.
method Proposes a novel annotation approach using triplet embeddings to lift absolute annotations to relative comparisons.
result Successfully represents synthetic hidden constructs in time under noisy sampling conditions.

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 ↗

PTBCC improves accuracy in multi-class annotation aggregation by learning from prototype confusion matrices.

problem Inaccurate and insufficient confusion matrices for annotators in multi-class classification tasks.
method PTBCC (ProtoType learning-driven Bayesian Classifier Combination) uses prototype confusion matrices to capture annotator expertise.
result PTBCC achieves up to 15% accuracy improvement and 3% higher average accuracy compared to existing methods.

Study improves app feature extraction models with new annotation guidelines and data.

problem Improving the quality and usefulness of app feature extraction models.
method Exploring the effects of annotation guidelines and annotated data on app feature extraction models.
result New annotation guidelines lead to less noisy and more informative app features.

Paper proposes an efficient method for bounding box annotation in object detection.

problem Manual annotation of bounding boxes is tedious and resource-intensive.
method Iterative training of object detector on small batches of labeled images, with human annotator correcting errors.
result Significant reduction in human annotation effort, up to 75%.

Paper proposes a weak supervision technique for CNN semantic segmentation of lung diseases using partially annotated data.

problem Creating annotated datasets for semantic segmentation of lung diseases is laborious and time-consuming.
method Proposes a weak supervision technique that utilizes partially annotated datasets to improve CNN semantic segmentation accuracy.
result Significantly improved segmentation accuracy using partially annotated datasets.

Paper proposes a method for faster object detection annotation in indoor scenes.

problem Efficiently annotate object detection datasets in indoor scenes.
method Two-stage annotation process: manual annotation of a part of the dataset, followed by automatic annotation of the rest.
result The two-stage method significantly reduces the total workload compared to manual annotation of the entire dataset.

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 ↗

This study uses partially annotated data to improve TempRel extraction.

problem Lack of fully annotated data for TempRel extraction makes the task labor-intensive and limited in coverage.
method Utilizes partially annotated data (P) for TempRel extraction, even when annotations are missing.
result Partially annotated data (P) can still be a useful supervision signal for TempRel extraction within a constrained learning framework.