RNN model predicts handwritten characters from accelerometer and gyroscope data.
problem Online handwritten character recognition using sensor data.
method RNN-based neural network trained on gyroscope and accelerometer data.
result High accuracy on test data, achieving character prediction.
Research designs first model for Amharic handwritten character recognition.
problem No existing model for Amharic handwritten character recognition.
method Used a convolutional neural network and applied data augmentation and multi-task learning.
result Promising results observed from the enhanced model.
A scalable framework for continual learning that preserves skills while accelerating progress.
problem Learning new tasks sequentially without forgetting previous ones.
method Two-component network: Knowledge base for previously learned tasks and active column for current task.
result The method achieves faster learning on new tasks while retaining previously learned skills.
The study examines lower and upper bounds of Wasserstein distances for affine transformations of random vectors.
problem Understanding Wasserstein distances for affine transformations of random vectors.
method Lower and upper bounds for affine transformations of random vectors in Rn are derived using Bures metric and compositions of affine maps. result Concrete lower bounds and upper bounds for affine transformations are derived and applied to various distributions.
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.
Paper explores using hand gestures to type English letters.
problem Creating easy-to-remember, non-cumbersome gestures for typing.
method Statistical approach to handle randomness in hand movements.
result Achieved 97.33% accuracy with entire English alphabet.
Deep learning uses alphabet frequencies to accurately classify fake news.
problem Classifying fake news from trustworthy news.
method Used deep learning algorithms on alphabet frequencies of text without sequence information.
result Achieved high accuracy (85%) in classifying fake news.
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.
Study explains Zipf's law using geometric mechanisms from a finite alphabet.
problem Explains Zipf's law in language without relying on linguistic elements.
method Uses the Full Combinatorial Word Model (FCWM) to generate geometric distributions of word lengths.
result Supports predictions of power-law rank-frequency curves, matching various languages.
In this paper we consider the problem of transmitting a continuous alphabet discrete-time source over an AWGN channel. The design of good curves for this purpose relies on geometrical properties of spherical codes and projections of N-dimensional lattices. We propose a constructive scheme based on a set of curves on …
Quantum-enhanced barcode decoding and pattern recognition outperforms classical methods.
problem Improving barcode decoding and pattern recognition using quantum entanglement.
method Quantum hypothesis testing applied to barcode decoding and pattern recognition using entangled quantum sources and measurements.
result Quantum-enhanced methods outperform classical coherent-state strategies for barcode data decoding and classification.
Streaming method improves weakly submodular function approximation.
problem Optimizing weakly submodular functions with streaming algorithms.
method Streaming algorithm for RSC and RSM functions.
result Constant factor approximation for weakly submodular functions.
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
Classification Ensemble, which uses the weighed polling of outputs, is the art of combining a set of basic classifiers for generating high-performance, robust and more stable results. This study aims to improve the results of identifying the Persian handwritten letters using Error Correcting Output Coding (ECOC) ensemb…
This paper introduces a very challenging dataset of historic German documents and evaluates Fully Convolutional Neural Network (FCNN) based methods to locate handwritten annotations of any kind in these documents. The handwritten annotations can appear in form of underlines and text by using various writing instruments…
New method for decomposing vectors into independent components over finite alphabets.
problem Decomposing vectors into independent components without prior generation assumptions.
method Branch and bound search tree algorithm, linear approximations, order permutation.
result Efficiently decomposes the majority of vectors into independent components.
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.
New handwritten digits dataset for Kannada script.
problem Lack of datasets for Kannada numeral digits.
method Developed Kannada-MNIST and Dig-MNIST datasets.
result Initial CNN accuracy is lower than MNIST, indicating a challenge in generalization.
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.
New Sauer inequality improves multiclass hypothesis class bounds.
problem Bounding the size of multiclass hypothesis classes.
method Polynomial method and combinatorial parameters (DS, list-DS dimensions).
result Sharp Sauer inequality with optimal polynomial dependence on list size and alphabet size.
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…
We propose a simple kernel based nearest neighbor approach for handwritten digit classification. The "distance" here is actually a kernel defining the similarity between two images. We carefully study the effects of different number of neighbors and weight schemes and report the results. With only a few nearest neighbo…
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.
Knots and links are interpreted as homotopy classes of nanowords and nanophrases in an alphabet consisting of 4 letters. Similar results hold for curves on surfaces. We also discuss versions of the Jones link polynomial and the link quandles for nanophrases.
We study the problem of learning overcomplete HMMs---those that have many hidden states but a small output alphabet. Despite having significant practical importance, such HMMs are poorly understood with no known positive or negative results for efficient learning. In this paper, we present several new results---both po…
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…
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.
New algorithms reduce rejection sampling complexity for shape-constrained distributions.
problem Generating exact samples from shape-constrained distributions efficiently.
method Sublinear query complexity algorithms for rejection sampling.
result Sublinear complexity algorithms for sampling from shape-constrained distributions.
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.
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.
EdgeNet improves Arabic numeral classification accuracy to 99.59%.
problem Improving accuracy in Arabic numeral classification.
method Unified dataset and a novel deep model with residual connections.
result Proposed model achieves 99.59% accuracy on validation set.
Deep learning improves gender classification from handwriting.
problem Classifying gender from handwritten text.
method Convolutional Neural Network (CNN) for feature extraction and gender classification.
result Deep learning approach outperforms human examiners in gender classification accuracy.
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.
This text aims to explain general relativity to geometers who have no knowledge about physics. Using handwritten notes by Michel Vaugon, we construct the bases of the theory.
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 …
We discuss a topological approach to words introduced by the author. Words on an arbitrary alphabet are approximated by Gauss words and then studied up to natural modifications inspired by the Reidemeister moves on knot diagrams. This leads us to a notion of homotopy for words. We introduce several homotopy invariants …
The theoretical basis for a candidate variational principle for the information bottleneck (IB) method is formulated within the ambit of the generalized nonadditive statistics of Tsallis. Given a nonadditivity parameter q, the role of the \textit{additive duality} of nonadditive statistics (q∗=2−q) in relating…
Motivation: Proteins are known to undergo conformational changes in the course of their functions. The changes in conformation are often attributable to a small fraction of residues within the protein. Therefore identification of these variable regions is important for an understanding of protein function. Results: We …
Symmetry improves machine learning models by reducing overfitting and complexity.
problem Ignoring symmetry in machine learning models can lead to overfitting and increased complexity.
method Incorporating symmetry into machine learning models, specifically neural networks for classifying handwritten digits.
result Incorporating symmetry into machine learning models reduces overfitting and complexity, requiring less training data and less time to train.
New algorithm for faster feature enumeration over finite fields.
problem Learning k-juntas over finite fields for multi-labeled data.
method Exploits Fourier detection techniques to develop an O(n^0.8k)-time algorithm.
result First non-trivial algorithm for k-juntas over F_q, answering Mossel et al.'s question.
The study optimizes distribution estimation from samples with relative entropy error, adapting to sparse distributions.
problem Estimating discrete distributions with high-probability accuracy in relative entropy.
method Analysis of Laplace estimator and confidence-dependent smoothing techniques, including data-dependent smoothing.
result Optimal high-probability risk bounds for various estimators, including a new data-dependent smoothing method.
Deep learning fails in classifying handwritten historical documents, traditional methods perform better.
problem Classifying handwritten historical documents using deep learning methods.
method Traditional and deep learning methods were tested on a large collection of handwritten historical manuscripts.
result Deep learning methods performed poorly, traditional methods performed consistently well.
Improves signature verification accuracy using deep CNN features.
problem Handwritten signature verification accuracy.
method Deep CNN features combined with writer-independent SVM classifier.
result Proposed approach outperforms other WI-HSV methods.
Improves AI system's understanding of human inputs by creating better examples.
problem AI systems misinterpret human inputs, leading to inefficiencies.
method Developed a conditional convolutional autoencoder (CCAE) to generate better examples.
result Generated examples lead to lower error rates and require less effort to create.
BestChanID identifies the channel with maximal capacity using training sequences.
problem Identifying the channel with maximal capacity among several discrete memoryless channels.
method Formulated as a multi-armed bandit problem, proposed a capacity estimator, and developed gap-elimination algorithms.
result Guaranteed to output the DMC with the largest capacity with a desired confidence.
Paper proposes a fast stochastic algorithm for neural network quantization with error bounds.
problem Error analysis for quantized neural networks with non-convex loss functions and nonlinear activations.
method Greedy path-following mechanism combined with stochastic quantizer.
result Established full-network error bounds for quantized neural networks.