Modular Arithmetic and Wavelets for Speaker Verification
نویسندگان
چکیده
منابع مشابه
Advanced Speaker Verification System Using Wavelets
This paper presents an advanced speaker verification system using wavelet transforms. The conventional signal processing techniques assume the signal to be stationary and are ineffective in recognizing non stationary signals such as voice signals. Voice signals which are more dynamic could be analysed with far better accuracy using wavelet transform. The developed voice verification system is w...
متن کاملVowels Recognition by Modular Arithmetic and Wavelets using Neural Network
Recently, the speech recognition is very attractive for researchers because of the very significant related applications. For this reason, the novel research has been of very importance in the academic community. The aim of this work is to find out a new and appropriate feature extraction method for Arabic language recognition. In the present study, wavelet packet transform (WPT) with modular a...
متن کاملUsing Exciting and Spectral Envelope Information and Matrix Quantization for Improvement of the Speaker Verification Systems
Speaker verification from talking a few words of sentences has many applications. Many methods as DTW, HMM, VQ and MQ can be used for speaker verification. We applied MQ for its precise, reliable and robust performance with computational simplicity. We also used pitch frequency and log gain contour for further improvement of the system performance.
متن کاملUsing Exciting and Spectral Envelope Information and Matrix Quantization for Improvement of the Speaker Verification Systems
Speaker verification from talking a few words of sentences has many applications. Many methods as DTW, HMM, VQ and MQ can be used for speaker verification. We applied MQ for its precise, reliable and robust performance with computational simplicity. We also used pitch frequency and log gain contour for further improvement of the system performance.
متن کاملModular arithmetic
Since congruence modulo m is an equivalence relation, it partitions the universe of integers into equivalence classes, which we’ll call congruence classes modulo m. Within any one of these classes, all of the members are congruent to all of the other members; but congruence modulo m never holds between members of different equivalence classes. For instance, there are two congruence classes modu...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Applied Sciences
سال: 2011
ISSN: 1812-5654
DOI: 10.3923/jas.2011.2782.2790