Guiqi Sun, Z. Fan, N. Mastorakis, S. Kaminaris, X. Zhuang
{"title":"基于样本熵的浊音和浊音信号复杂度分析","authors":"Guiqi Sun, Z. Fan, N. Mastorakis, S. Kaminaris, X. Zhuang","doi":"10.1109/MCSI.2017.14","DOIUrl":null,"url":null,"abstract":"The difference of signal complexity for voiced/unvoiced speech is studied. The sample entropy is estimated for a group of single phoneme pronunciations. The experimental data indicates that voiced and unvoiced pronunciations are different in signal complexity, which proves the effectiveness of the sample entropy feature for voiced/unvoiced classification.","PeriodicalId":113351,"journal":{"name":"2017 Fourth International Conference on Mathematics and Computers in Sciences and in Industry (MCSI)","volume":"212 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2017-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"The Complexity Analysis of Voiced and Unvoiced Speech Signal Based on Sample Entropy\",\"authors\":\"Guiqi Sun, Z. Fan, N. Mastorakis, S. Kaminaris, X. Zhuang\",\"doi\":\"10.1109/MCSI.2017.14\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The difference of signal complexity for voiced/unvoiced speech is studied. The sample entropy is estimated for a group of single phoneme pronunciations. The experimental data indicates that voiced and unvoiced pronunciations are different in signal complexity, which proves the effectiveness of the sample entropy feature for voiced/unvoiced classification.\",\"PeriodicalId\":113351,\"journal\":{\"name\":\"2017 Fourth International Conference on Mathematics and Computers in Sciences and in Industry (MCSI)\",\"volume\":\"212 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2017-08-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2017 Fourth International Conference on Mathematics and Computers in Sciences and in Industry (MCSI)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/MCSI.2017.14\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2017 Fourth International Conference on Mathematics and Computers in Sciences and in Industry (MCSI)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/MCSI.2017.14","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
The Complexity Analysis of Voiced and Unvoiced Speech Signal Based on Sample Entropy
The difference of signal complexity for voiced/unvoiced speech is studied. The sample entropy is estimated for a group of single phoneme pronunciations. The experimental data indicates that voiced and unvoiced pronunciations are different in signal complexity, which proves the effectiveness of the sample entropy feature for voiced/unvoiced classification.