Sparse Binarization for Fast Keyword Spotting

Jonathan Svirsky, Uri Shaham, Ofir Lindenbaum
6/9/2024
eess.AScs.LGcs.SD

Official code: jsvir/sparknet (19 stars, MIT, last commit 2025-08-26).

Abstract

With the increasing prevalence of voice-activated devices and applications, keyword spotting (KWS) models enable users to interact with technology hands-free, enhancing convenience and accessibility in various contexts. Deploying KWS models on edge devices, such as smartphones and embedded systems, offers significant benefits for real-time applications, privacy, and bandwidth efficiency. However, these devices often possess limited computational power and memory. This necessitates optimizing neural network models for efficiency without significantly compromising their accuracy. To address these challenges, we propose a novel keyword-spotting model based on sparse input representation followed by a linear classifier. The model is four times faster than the previous state-of-the-art edge device-compatible model with better accuracy. We show that our method is also more robust in noisy environments while being fast. Our code is available at: https://github.com/jsvir/sparknet.

View on arXivView PDF

Code Implementations(1)

jsvir/sparknetOfficial100%
MIT

[Tiny KWS] SparkNet: Sparse Binarization for Fast Keyword Spotting

191C++, PythonJun 8, 20241 years agoMIT
edge-computingkey-word-spottingkwssparse-representationspeech-recognition+1 more

Similar Papers

Cite this paper

@article{svirsky2024sparse,
  title  = {Sparse Binarization for Fast Keyword Spotting},
  author = {Jonathan Svirsky and Uri Shaham and Ofir Lindenbaum},
  year   = {2024},
  eprint = {2406.06634},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2406.06634v1}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2406.06634.svg)](https://codeofpaper.com/paper/2406.06634)

Discussion