Sixth International Conference on Spoken Language Processing
In this paper, a fast search method is proposed that is based on pre-selection and hierarchical matching so as to eliminate a large amount of impossible candidates before doing final fine matching with larger size codebooks meanwhile keep the success rate not degraded. Pre -selection is achieved using divergences between unknown input speech and all registered codebooks. Hierarchical matching is implemented using smaller size codebook and larger size codebook corresponding to each person respectively. With this method, for a population of 290, time required for identification can be reduced to about 13% while memory occupation is increased by just 6% when baselines are taken as those using larger size codebooks in conventional way. Success rate is not degraded as 94% comparing to that acquired in conventional way as well.
Bibliographic reference. Pan, Zhibin / Kotani, Koji / Ohmi, Tadahiro (2000): "A fast search method of speaker identification for large population using pre-selection and hierarchical matching", In ICSLP-2000, vol.2, 290-293.