Graph Spectral Domain Feature Learning With Application to in-Air Hand-Drawn Number and Shape Recognition

Abstract

This paper addresses the problem of recognition of dynamic shapes by representing the structure in a shape as a graph and learning the graph spectral domain features. Our proposed method includes pre-processing for converting the dynamic shapes into a fully connected graph, followed by analysis of the eigenvectors of the normalized Laplacian of the graph adjacency matrix for forming the feature vectors. The method proposes to use the eigenvector corresponding to the lowest eigenvalue for formulating the feature vectors as it captures the details of the structure of the graph. The use of the proposed graph spectral domain representation has been demonstrated in an in-air hand-drawn number and symbol recognition applications. It has achieved average accuracy rates of 99.56% and 99.44%, for numbers and symbols, respectively, outperforming the existing methods for all datasets used. It also has the added benefits of fast real-time operation and invariance to rotation and flipping, making the recognition system robust to different writing and drawing variations.

Keywords

• Graph signal processing
• graph spectral theory
• fully connected graphs
• dynamic shape recognition
• shape representation
• graph spectral feature learning