A GPU Implementation of FastICA in Audio Applications for Small Number of Components

Stefan Kanan, M. Gusev, Vladimir Zdraveski
{"title":"A GPU Implementation of FastICA in Audio Applications for Small Number of Components","authors":"Stefan Kanan, M. Gusev, Vladimir Zdraveski","doi":"10.1145/3351556.3351568","DOIUrl":null,"url":null,"abstract":"Extracting independent components from audio data has plenty of uses in biology, music, communication and media and in many other fields. The FastICA algorithm is a relatively fast and simple algorithm, that assumes the original sources to be nongaussian and works by lowering the gaussianity of the mixed sources. Yet as the number of samples increase so does the time required for its execution. While one solution would be to simply use just a subset of the samples, in this paper we look at the possibility of extending the FastICA algorithm to the GPU. While similar efforts have been pursued in the past, we deal with data of relatively few components, as would be more common when dealing with audio data. We implement a fully GPU FastICA as well as a CPU-GPU hybrid algorithm, both based on the CUDA platform and compare them with the CPU version. Our results indicate that for large samples the CPU-GPU hybrid and the GPU algorithms perform better than their CPU counterpart.","PeriodicalId":126836,"journal":{"name":"Proceedings of the 9th Balkan Conference on Informatics","volume":"59 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2019-09-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the 9th Balkan Conference on Informatics","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/3351556.3351568","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

Extracting independent components from audio data has plenty of uses in biology, music, communication and media and in many other fields. The FastICA algorithm is a relatively fast and simple algorithm, that assumes the original sources to be nongaussian and works by lowering the gaussianity of the mixed sources. Yet as the number of samples increase so does the time required for its execution. While one solution would be to simply use just a subset of the samples, in this paper we look at the possibility of extending the FastICA algorithm to the GPU. While similar efforts have been pursued in the past, we deal with data of relatively few components, as would be more common when dealing with audio data. We implement a fully GPU FastICA as well as a CPU-GPU hybrid algorithm, both based on the CUDA platform and compare them with the CPU version. Our results indicate that for large samples the CPU-GPU hybrid and the GPU algorithms perform better than their CPU counterpart.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
音频应用中FastICA的GPU实现
从音频数据中提取独立成分在生物、音乐、通信和媒体等许多领域都有广泛的应用。FastICA算法是一种相对快速和简单的算法,它假设原始源是非高斯的,并通过降低混合源的高斯来工作。然而,随着样本数量的增加,执行所需的时间也在增加。虽然一种解决方案是简单地使用样本的一个子集,但在本文中,我们将研究将FastICA算法扩展到GPU的可能性。虽然在过去已经进行了类似的努力,但我们处理的是相对较少的组件数据,这在处理音频数据时更为常见。我们实现了一个全GPU的FastICA以及一个CPU-GPU混合算法,两者都基于CUDA平台,并将它们与CPU版本进行比较。我们的结果表明,对于大样本,CPU-GPU混合算法和GPU算法比它们的CPU对应算法表现得更好。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Categorization of C++ Classes for Static Lifetime Analysis Trends Review of the Contemporary Security Problems in the Cyberspace Can a robot be an efficient mediator in promoting dyadic activities among children with Autism Spectrum Disorders and children of Typical Development? Complexity Aspects of Unstructured Sparse Graph Representation Female Students' Attitude Towards Studying Informatics and Expectations for Future Career - Balkan Case
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1