Small-footprint Keyword Spotting With Graph Convolutional Network

Abstract

Despite the recent successes of deep neural networks, it remains challenging to achieve high precision keyword spotting task (KWS) on resource-constrained devices. In this study, we propose a novel context-aware and compact architecture for keyword spotting task. Based on residual connection and bottleneck structure, we design a compact and efficient network for KWS task. To leverage the long range dependencies and global context of the convolutional feature maps, the graph convolutional network is introduced to encode the non-local relations. By evaluated on the Google Speech Command Dataset, the proposed method achieves state-of-the-art performance and outperforms the prior works by a large margin with lower computational cost.

Stats

• citations24
• S2 citations—
• github stars0
• HF likes0
• heat score10.48
• arxiv keychen2019small

Related papers

• Deep Residual Learning For Small-footprint Keyword Spotting (2017)16.21
• Depthwise Separable Convolutional Resnet With Squeeze-and-excitation Blocks For Small-footprint Keyword Spotting (2020)11.29
• A Separable Temporal Convolution Neural Network With Attention For Small-footprint Keyword Spotting (2021)0.00
• Small-footprint Keyword Spotting With Multi-scale Temporal Convolution (2020)0.00
• Small-footprint Keyword Spotting Using Deep Neural Network And Connectionist Temporal Classifier (2017)0.00
• Temporal Convolution For Real-time Keyword Spotting On Mobile Devices (2019)15.67
• Separable Temporal Convolution Plus Temporally Pooled Attention For Lightweight High-performance Keyword Spotting (2021)0.00
• Small-footprint Open-vocabulary Keyword Spotting With Quantized LSTM Networks (2020)0.00