Reducing Computation in an i-Vector Speaker Recognition System using a Tree-Structured Universal Background Model.
Journal Article
·
· IEEE Transactions on Audio, Speech, and Language Processing
OSTI ID:1106124
Abstract not provided.
- Research Organization:
- Sandia National Lab. (SNL-NM), Albuquerque, NM (United States)
- Sponsoring Organization:
- USDOE National Nuclear Security Administration (NNSA)
- DOE Contract Number:
- AC04-94AL85000
- OSTI ID:
- 1106124
- Report Number(s):
- SAND2013-6634J; 464806
- Journal Information:
- IEEE Transactions on Audio, Speech, and Language Processing, Related Information: Proposed for publication in IEEE Transactions on Audio, Speech, and Language Processing.
- Country of Publication:
- United States
- Language:
- English
Similar Records
Reducing computation in an i-vector speaker recognition system using a tree-structured universal background model
Towards a More Efficient SVM Supervector Speaker Verification System using Gaussian Reduction and a Tree-Structured Hash.
TOWARDS A MORE EFFICIENT SVM SUPERVECTOR SPEAKER VERIFICATION SYSTEM USING GAUSSIAN REDUCTION AND A TREE-STRUCTURED HASH.
Journal Article
·
Wed Aug 20 00:00:00 EDT 2014
· Speech Communication
·
OSTI ID:1106124
Towards a More Efficient SVM Supervector Speaker Verification System using Gaussian Reduction and a Tree-Structured Hash.
Conference
·
Fri Mar 01 00:00:00 EST 2013
·
OSTI ID:1106124
TOWARDS A MORE EFFICIENT SVM SUPERVECTOR SPEAKER VERIFICATION SYSTEM USING GAUSSIAN REDUCTION AND A TREE-STRUCTURED HASH.
Conference
·
Thu Aug 01 00:00:00 EDT 2013
·
OSTI ID:1106124