I-vector is widely described as a compact and effective representation of speech utterances for speaker recognition. Standard i-vector extraction could be an expensive task for applications where computing resource is limited, for instance, on handheld devices. Fast approximate inference of i-vector aims to reduce the computational cost required in i-vector extraction where run-time requirement is critical. Most fast approaches hinge on certain assumptions to approximate the i-vector inference formulae with little loss of accuracy. In this paper, we analyze the uniform assumption that we had proposed earlier. We show that the assumption generally hold for long utterances but inadequate for utterances of short duration. We then propose to compensate for the negative effects by applying a simple gain factor on the i-vectors estimated from short utterances. The assertion is confirmed through analysis and experiments conducted on NIST SRE’08 and SRE’10 datasets.
Cite as: Lee, K.A., Li, H. (2017) Gain Compensation for Fast i-Vector Extraction Over Short Duration. Proc. Interspeech 2017, 1527-1531, doi: 10.21437/Interspeech.2017-108
@inproceedings{lee17c_interspeech,
author={Kong Aik Lee and Haizhou Li},
title={{Gain Compensation for Fast i-Vector Extraction Over Short Duration}},
year=2017,
booktitle={Proc. Interspeech 2017},
pages={1527--1531},
doi={10.21437/Interspeech.2017-108}
}