本論文旨在研究隱藏式條件隨機域(Hidden Conditional Random Field, HCRF)模型應用於千人語者辨識,並且比較HCRF模型與隱藏式馬可夫模型(Hidden Markov Model, HMM)的效能。經過實驗證實,在訓練以及測試所花費的時間方面,HCRF模型花費少於HMM模型,此外在固定相同系統資源下,HCRF具有更高的辨識率。在訓練模型方面我們提出約束最佳化(Constraint optimization)形式之HCRF訓練法,比傳統HCRF之廣義機率遞減法(Generalized Probabilistic Descent, GPD)訓練方式可得到更低的錯誤率。最後在跨組辨認方面,我們也對HCRF和HMM的表現進行討論。
In this thesis, we applied the Hidden Conditional Random Fields to a 1000-speakers identification task and compared the performance and computation cost of HCRF with the traditional Hidden Markov Models (HMMs). The experimental results indicate that HCRF models consume less training/testing time than the requirement of HMM; and furthermore HCRFs achieve a higher recognition rate than HMMs with the same system resources. In addition, we propose a constraint optimization method for training HCRF models. The proposed algorithm makes error rate of HCRF model lower than the method using the traditional Generalized Probabilistic Descent (GPD) method. Finally, we also discuss the performance of HCRF and HMM models in cross-group identification.