The reviewed record of science sign in
Pith

arxiv: 1912.05124 · v1 · pith:HE7AWU2D · submitted 2019-12-11 · cs.SD · cs.CL· cs.LG· eess.AS

Small-footprint Keyword Spotting with Graph Convolutional Network

Reviewed by Pithpith:HE7AWU2Dopen to challenge →

classification cs.SD cs.CLcs.LGeess.AS
keywords convolutionalkeywordnetworkspottingtaskcompactgraphachieve
0
0 comments X
read the original 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.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.