声学成像与压缩传感和麦克风阵列

Fangli Ning, Yong Liu, Chao Zhang, Jingang Wei, Xudong Shi, Juan Wei
{"title":"声学成像与压缩传感和麦克风阵列","authors":"Fangli Ning, Yong Liu, Chao Zhang, Jingang Wei, Xudong Shi, Juan Wei","doi":"10.1142/S0218396X17500278","DOIUrl":null,"url":null,"abstract":"This work studies the acoustic imaging problem with compressed sensing (CS) and microphone arrays. The CS algorithm with Basis Pursuit (BP) algorithm has shown satisfying results in acoustic imaging, the maps of which are characterized by super-resolution. However, the performance of the CS algorithm with the BP algorithm is limited to Restricted Isometry Property (RIP), and the algorithm has a long CPU-time. We propose a new CS algorithm with Orthogonal Matching Pursuit (OMP) algorithm for acoustic imaging. The performance of the OMP algorithm with regard to RIP is examined through numerical simulation in this work. The simulation results and CPU-time for OMP algorithm are compared with those of the BP algorithm and the conventional beamformer (CBF). When the RIP does not hold, satisfying results can still be obtained by the OMP algorithm, and the CPU-time for OMP algorithm is far less than BP algorithm. In order to validate the feasibility of the OMP algorithm in acoustic imaging, an experiment is also ...","PeriodicalId":54860,"journal":{"name":"Journal of Computational Acoustics","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2017-11-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1142/S0218396X17500278","citationCount":"3","resultStr":"{\"title\":\"Acoustic Imaging with Compressed Sensing and Microphone Arrays\",\"authors\":\"Fangli Ning, Yong Liu, Chao Zhang, Jingang Wei, Xudong Shi, Juan Wei\",\"doi\":\"10.1142/S0218396X17500278\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This work studies the acoustic imaging problem with compressed sensing (CS) and microphone arrays. The CS algorithm with Basis Pursuit (BP) algorithm has shown satisfying results in acoustic imaging, the maps of which are characterized by super-resolution. However, the performance of the CS algorithm with the BP algorithm is limited to Restricted Isometry Property (RIP), and the algorithm has a long CPU-time. We propose a new CS algorithm with Orthogonal Matching Pursuit (OMP) algorithm for acoustic imaging. The performance of the OMP algorithm with regard to RIP is examined through numerical simulation in this work. The simulation results and CPU-time for OMP algorithm are compared with those of the BP algorithm and the conventional beamformer (CBF). When the RIP does not hold, satisfying results can still be obtained by the OMP algorithm, and the CPU-time for OMP algorithm is far less than BP algorithm. In order to validate the feasibility of the OMP algorithm in acoustic imaging, an experiment is also ...\",\"PeriodicalId\":54860,\"journal\":{\"name\":\"Journal of Computational Acoustics\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2017-11-21\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"https://sci-hub-pdf.com/10.1142/S0218396X17500278\",\"citationCount\":\"3\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Journal of Computational Acoustics\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1142/S0218396X17500278\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q1\",\"JCRName\":\"Mathematics\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of Computational Acoustics","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1142/S0218396X17500278","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"Mathematics","Score":null,"Total":0}
引用次数: 3

摘要

这项工作研究了压缩传感(CS)和麦克风阵列的声学成像问题。CS算法和BP算法在声学成像中取得了令人满意的结果,其映射具有超分辨率的特点。然而,CS算法和BP算法的性能仅限于限制等距性质(RIP),并且该算法的CPU时间较长。我们提出了一种新的CS算法和正交匹配寻踪(OMP)算法,用于声学成像。本文通过数值模拟检验了OMP算法在RIP方面的性能。将OMP算法的仿真结果和CPU时间与BP算法和传统波束形成器(CBF)的仿真结果进行了比较。当RIP不成立时,OMP算法仍然可以获得令人满意的结果,并且OMP算法的CPU时间远小于BP算法。为了验证OMP算法在声学成像中的可行性,还进行了实验。。。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Acoustic Imaging with Compressed Sensing and Microphone Arrays
This work studies the acoustic imaging problem with compressed sensing (CS) and microphone arrays. The CS algorithm with Basis Pursuit (BP) algorithm has shown satisfying results in acoustic imaging, the maps of which are characterized by super-resolution. However, the performance of the CS algorithm with the BP algorithm is limited to Restricted Isometry Property (RIP), and the algorithm has a long CPU-time. We propose a new CS algorithm with Orthogonal Matching Pursuit (OMP) algorithm for acoustic imaging. The performance of the OMP algorithm with regard to RIP is examined through numerical simulation in this work. The simulation results and CPU-time for OMP algorithm are compared with those of the BP algorithm and the conventional beamformer (CBF). When the RIP does not hold, satisfying results can still be obtained by the OMP algorithm, and the CPU-time for OMP algorithm is far less than BP algorithm. In order to validate the feasibility of the OMP algorithm in acoustic imaging, an experiment is also ...
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
CiteScore
3.90
自引率
0.00%
发文量
0
审稿时长
4.5 months
期刊介绍: Currently known as Journal of Theoretical and Computational Acoustics (JTCA).The aim of this journal is to provide an international forum for the dissemination of the state-of-the-art information in the field of Computational Acoustics. Topics covered by this journal include research and tutorial contributions in OCEAN ACOUSTICS (a subject of active research in relation with sonar detection and the design of noiseless ships), SEISMO-ACOUSTICS (of concern to earthquake science and engineering, and also to those doing underground prospection like searching for petroleum), AEROACOUSTICS (which includes the analysis of noise created by aircraft), COMPUTATIONAL METHODS, and SUPERCOMPUTING. In addition to the traditional issues and problems in computational methods, the journal also considers theoretical research acoustics papers which lead to large-scale scientific computations. The journal strives to be flexible in the type of high quality papers it publishes and their format. Equally desirable are Full papers, which should be complete and relatively self-contained original contributions with an introduction that can be understood by the broad computational acoustics community. Both rigorous and heuristic styles are acceptable. Of particular interest are papers about new areas of research in which other than strictly computational arguments may be important in establishing a basis for further developments. Tutorial review papers, covering some of the important issues in Computational Mathematical Methods, Scientific Computing, and their applications. Short notes, which present specific new results and techniques in a brief communication. The journal will occasionally publish significant contributions which are larger than the usual format for regular papers. Special issues which report results of high quality workshops in related areas and monographs of significant contributions in the Series of Computational Acoustics will also be published.
期刊最新文献
Nonlinear Distortion Characteristic Analysis for the Finite Amplitude Sound Pressures in the Pistonphone Acoustic Imaging with Compressed Sensing and Microphone Arrays Acoustical Green’s Function and Boundary Element Techniques for 3D Half-Space Problems A numerical model of an acoustic metamaterial using the boundary element method including viscous and thermal losses Diffusion Equation-Based Finite Element Modeling of a Monumental Worship Space
×
引用
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