The performance of a perceptual hashing system, which is often measured by discrimination and robustness, is directly related to the features that the system extracts. In this letter, a new speech hashing scheme based on short-time stability is presented. The characteristic of natural speech that the principal components of linear prediction coefficients among neighboring frames tend to be very similar is utilized to generate the hash sequence. Experimental results demonstrate the effectiveness of the proposed scheme in terms of discrimination and robustness. © 2009 Springer Berlin Heidelberg.
CITATION STYLE
Chen, N., & Wan, W. G. (2009). Speech hashing algorithm based on short-time stability. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5769 LNCS, pp. 426–434). https://doi.org/10.1007/978-3-642-04277-5_43
Mendeley helps you to discover research relevant for your work.