Please use this identifier to cite or link to this item: http://repo.lib.jfn.ac.lk/ujrr/handle/123456789/2092
Full metadata record
DC FieldValueLanguage
dc.contributor.authorThiruvaran, T.
dc.contributor.authorNosratighods, M.
dc.contributor.authorAmbikairajah, E.
dc.contributor.authorEpps, J.
dc.date.accessioned2021-03-19T03:07:46Z
dc.date.accessioned2022-06-27T10:02:15Z-
dc.date.available2021-03-19T03:07:46Z
dc.date.available2022-06-27T10:02:15Z-
dc.date.issued2009
dc.identifier.citationThiruvaran, T., Nosratighods, M., Ambikairajah, E., & Epps, J. (2009). Computationally efficient frame-averaged FM feature extraction for speaker recognition. Electronics letters, 45(6), 335-337.en_US
dc.identifier.urihttp://repo.lib.jfn.ac.lk/ujrr/handle/123456789/2092-
dc.description.abstractRecently, subband frame-averaged frequency modulation (FM) as a complementary feature to amplitude-based features for several speech based classification problems including speaker recognition has shown promise. One problem with using FM extraction in practical implementations is computational complexity. Proposed is a computationally efficient method to estimate the frame-averaged FM component in a novel manner, using zero crossing counts and the zero crossing counts of the differentiated signal. FM components, extracted from subband speech signals using the proposed method, form a feature vector. Speaker recognition experiments conducted on the NIST 2008 telephone database show that the proposed method successfully augments mel frequency cepstrum coefficients (MFCCs) to improve performance, obtaining 17% relative reductions in equal error rates when compared with an MFCC-based system.en_US
dc.language.isoenen_US
dc.publisherIEEEen_US
dc.titleComputationally efficient frame-averaged FM feature extraction for speaker recognitionen_US
dc.typeArticleen_US
Appears in Collections:Electrical & Electronic Engineering

Files in This Item:
File Description SizeFormat 
Computationally efficient frame-averaged.pdf41.84 kBAdobe PDFThumbnail
View/Open


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.