Ordered and Binary Speaker Embedding
Lists
Only you see this
Abstract
Modern speaker recognition systems represent utterances by embedding vectors. Conventional embedding vectors are dense and non-structural. In this paper, we propose an ordered binary embedding approach that sorts the dimensions of the embedding vector via a nested dropout and converts the sorted vectors to binary codes via Bernoulli sampling. The resultant ordered binary codes offer some important merits such as hierarchical clustering, reduced memory usage, and fast retrieval. These merits were empirically verified by comprehensive experiments on a speaker identification task with the VoxCeleb and CN-Celeb datasets.
BibTeX
@misc{wang2023ordered,
author = {Jiaying Wang and Xianglong Wang and Namin Wang and Lantian Li and Dong Wang},
title = {{Ordered and Binary Speaker Embedding}},
year = {2023},
eprint = {2305.16043},
archivePrefix = {arXiv},
url = {https://arxiv.org/abs/2305.16043},
}Loading related content...