A Heisenberg Lift Descriptor for Order Sensitive Online Handwriting Recognition
Not on the map. Why?
Abstract (arXiv)
Online handwriting recognition systems typically represent pen trajectories through fixed-length Euclidean shape descriptors that capture the spatial outline of each stroke, but are insensitive to the order in which that outline is produced. Two strokes that trace the same region of the plane in opposite directions are indistinguishable to any such order-blind representation, yet their traversal directions may carry decisive class information in characters where loop orientation and stroke sequencing matter. This paper introduces a Heisenberg-lift framework that addresses this gap through a compact, interpretable, order-sensitive augmentation for online pen-trajectory features. The simplest instance is the terminal signed area, a single parameter-free scalar appended to an existing Euclidean descriptor at negligible computational cost. Evaluated on two standard online handwriting benchmarks, this one-scalar addition, consistently raises classifier accuracy over the Euclidean baseline. On the hardest character pair in our study, the letters o and y, the signed area alone achieves perfect separation while the Euclidean baseline falls short. The advantage grows further under additive coordinate noise, a practically relevant degradation in pen-trajectory data. A richer fifteen-dimensional extension, derived from a noncommutative Heisenberg-group subdivision scheme, provides additional gains in noisy and loop-structured conditions. Dimension-matched statistical controls confirm that all improvements reflect geometric information rather than feature-count inflation. The resulting descriptor is lightweight, closed-form, and directly interpretable, making it a practical augmentation for online handwriting and related document-trajectory classification pipelines in which the direction of stroke execution carries discriminative information.
Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 10 of its 46 references that are in the map. First posted on arXiv 25 Jul 2026.
Builds on
10 of 46 references.
References · 10
- 2020Neural Controlled Differential Equations for Irregular Time Seriescited by 506
- 2019ROCKET: Exceptionally fast and accurate time series classification using random convolutional kernelscited by 339
- 2020Pay Attention to What You Read: Non-recurrent Handwritten Text-Line Recognitioncited by 71
- 2023Deep Learning for Time Series Classification and Extrinsic Regression: A Current Surveycited by 68
- 2018Signature moments to characterize laws of stochastic processescited by 56
- 2018The iisignature library: efficient calculation of iterated-integral signatures and log signaturescited by 40
- 2022Signature Methods in Machine Learningcited by 34
- 2019Embedding and learning with signaturescited by 29
- 2016The Great Time Series Classification Bake Off: An Experimental Evaluation of Recently Proposed Algorithms. Extended Versioncited by 19
- 2020Stroke Constrained Attention Network for Online Handwritten Mathematical Expression Recognitioncited by 3
Built on by
Not cited yet.