Pub. online:1 Jan 1995Type:Research ArticleOpen Access
Volume 6, Issue 2 (1995), pp. 167–180
The use of vector quantization for speaker identification is investigated. This method differs from the known methods in that the number of centroids is not doubled but increases by 1 at every step. This enables us to obtain identification results at any number of centroids. This method is compared experimentally with the method (Lipeika and Lipeikienė, 1993a, 1993b), where feature vectors of investigative and comparative speakers are compared directly.
Pub. online:1 Jan 1993Type:Research ArticleOpen Access
Volume 4, Issues 1-2 (1993), pp. 45–56
Speaker identification problem is investigated. The identification is carried out comparing feature vectors (parameters of LPC model) of the “criminal” and “suspicious” speakers. Both likelihood ratio and cepstral distances are used for comparing feature vectors. The feature vectors are extracted from pseudostationary parts of speech utterances. The identification approach is suitable for text-dependent and text-independent identification. Experimental results illustrate the performance of the algorithm.
Pub. online:1 Jan 1992Type:Research ArticleOpen Access
Volume 3, Issue 1 (1992), pp. 37–46
The dynamic programming method for estimation of many change-points in univariate autoregressive (AR) sequences with known AR parameters between change-points is investigated. A problem how to use this method for long autoregressive sequences is solved and a constructive solution is given. A simulation experiment illustrates the advantages of the solution obtained.