Please use this identifier to cite or link to this item: https://dspace.upt.ro/xmlui/handle/123456789/3828
Full metadata record
DC FieldValueLanguage
dc.contributor.authorLupu, Eugen-
dc.contributor.authorMoca, Vasile V.-
dc.contributor.authorPop, Petre G.-
dc.date.accessioned2021-09-13T09:29:31Z-
dc.date.available2021-09-13T09:29:31Z-
dc.date.issued2004-
dc.identifier.citationLupu, Eugen. Application for TESPAR coding study and speaker recognition experiments. Timişoara: Editura Politehnica, 2004en_US
dc.identifier.urihttp://primo.upt.ro:1701/primo-explore/search?query=any,contains,Application%20for%20TESPAR%20coding%20study%20and%20speaker%20recognition%20experiments&tab=default_tab&search_scope=40TUT&vid=40TUT_V1&lang=ro_RO&offset=0 Link Primo-
dc.description.abstractTESPAR coding (Time Encoding Signal Processing and Recognition) represents an effectiveness alternative to the other common methods (Dynamic Time Warping, Vector Quantization, Hidden Markov Models, etc.) used for speech/speaker recognition. The important advantage of this method is the time processing of signal with a decrease of two orders of magnitude of the computational requirements. This work presents an application for TESPAR coding study allowing speaker recognition experiments using parallel neural networks architecture.en_US
dc.language.isoenen_US
dc.publisherTimişoara : Editura Politehnicaen_US
dc.relation.ispartofseriesBuletinul ştiinţific al Universităţii „Politehnica” din Timişoara, România. Seria electronică şi telecomunicaţii, Tom 49(63), fasc. 1 (2004), p. 279-282-
dc.subjectTESPAR codingen_US
dc.subjectSpeaker recognitionen_US
dc.subjectParallel neural networksen_US
dc.subjectArchetypesen_US
dc.subjectTESPAR-A matrixen_US
dc.titleApplication for TESPAR coding study and speaker recognition experiments [articol]en_US
dc.typeArticleen_US
Appears in Collections:Articole științifice/Scientific articles

Files in This Item:
File Description SizeFormat 
BUPT_ART_Lupu_f.pdf653.4 kBAdobe PDFView/Open


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