A Sobel-Gradient MLP Baseline for Handwritten Character Recognition
Not on the map. Why?
Abstract (arXiv)
This study examines how much handwritten-character information is retained by a deliberately simple first-order edge representation. Instead of learning spatial filters, each input image is transformed by the fixed Sobel-Feldman operator into signed horizontal and vertical derivative maps, which are independently normalized, flattened, and classified by a multilayer perceptron (MLP). The resulting model therefore separates fixed edge extraction from learned classification and provides a controlled baseline for evaluating the sufficiency of first-order image gradients. In the executed experiments, the Sobel-gradient MLP achieves 98.54 percent test accuracy on MNIST and 92.50 percent on the TensorFlow Datasets (TFDS) EMNIST Letters configuration. Macro F1 scores are 0.9853 and 0.9265, respectively. One-vs-rest ROC analysis further yields micro/macro AUC values of 0.9998/0.9998 on MNIST and 0.9987/0.9982 on EMNIST Letters. Confusion-matrix analysis shows that the remaining errors are concentrated among geometrically similar classes, especially 3/8 and 4/9 for MNIST and I/L and G/Q for EMNIST Letters. These results show that fixed first-order gradients preserve substantial class-discriminative structure, while also revealing the specific ambiguities that remain when recognition is driven by edge geometry alone.
Key facts. Cited by 3 papers in the map (data through 14 Oct 2026). Builds on 4 of its 23 references that are in the map. First posted on arXiv 16 Aug 2025.
Builds on
4 of 23 references.
References · 4
- 2013Deep Inside Convolutional Networks: Visualising Image Classification Models and Saliency Mapscited by 2,371
- 2021MLP-Mixer: An all-MLP Architecture for Visioncited by 1,446
- 2017EMNIST: an extension of MNIST to handwritten letterscited by 213
- 2025An MLP Baseline for Handwriting Recognition Using Planar Curvature and Gradient Orientationcited by 4
Built on by
Citing papers per year: 2026: 3.
3 papers.
- 2026Significance-Gain Pair Encoding for LLMs: A Statistical Alternative to Frequency-Based Subword Mergingcited by 2
- 2026StepCache: Step-Level Reuse with Lightweight Verification and Selective Patching for LLM Servingcited by 2
- 2026MDL-Calibrated Significance-Gain Pair Encoding: Replication-Aware Automatic Stopping for Subword Tokenizationcited by 0
- 2026MDL-Calibrated Significance-Gain Pair Encoding: Replication-Aware Automatic Stopping for Subword Tokenization20 Sep 2026
- 2026StepCache: Step-Level Reuse with Lightweight Verification and Selective Patching for LLM Serving24 Mar 2026
- 2026Significance-Gain Pair Encoding for LLMs: A Statistical Alternative to Frequency-Based Subword Merging26 Feb 2026