Suppr超能文献

在块稀疏性约束下求解声源特征问题的迭代算法。

Iterative algorithm for solving acoustic source characterization problems under block sparsity constraints.

作者信息

Bai Mingsian R, Chung Chun, Lan Shih-Syuan

机构信息

Department of Power Mechanical Engineering, National Tsing Hua University, 101, Section 2, Kuang-Fu Road, Hsinchu 30013, Taiwan.

出版信息

J Acoust Soc Am. 2018 Jun;143(6):3747. doi: 10.1121/1.5042221.

Abstract

In this paper, an iterative Compressive Sensing (CS) algorithm is proposed for acoustical source characterization problems with block sparsity constraints. Source localization and signal separation are accomplished in a unified CS framework. The inverse problem is formulated with the Equivalent Source Method as a linear underdetermined system of equations. As conventional approaches based on convex optimization can be computationally expensive and fail to deal with continuously distributed sources, the proposed approach that is adapted from the Newton's method and is augmented with a special pruning procedure is capable of solving the inverse problem far more efficiently with comparable accuracy. The pruning procedure employs a binary mask that admits sparsity constraints of two-dimensional block sources. The binary mask is heuristic in that it tends to promote nonzero positive source magnitudes. In each iteration, the source amplitude vector is on one hand updated by the Newton's method and on the other hand pruned with the binary mask. With the pruning procedure, the source magnitudes become increasingly sparse and clustered such that the block characteristics are enhanced. In the post-processing phase, particle velocity is calculated on the basis of the equivalent source amplitudes. Numerical and experimental investigations are conducted to validate the proposed technique. The results have demonstrated the efficacy of the proposed Compressive Newton's method in imaging block sources and extracting signal waveforms with little computational cost, as compared to a convex optimization package.

摘要

本文针对具有块稀疏约束的声源表征问题,提出了一种迭代压缩感知(CS)算法。声源定位和信号分离在统一的CS框架中完成。逆问题采用等效源法表述为线性欠定方程组。由于基于凸优化的传统方法计算成本高且无法处理连续分布的声源,本文提出的方法是对牛顿法的改进,并增加了一种特殊的修剪过程,能够以相当的精度更高效地解决逆问题。修剪过程采用一个二进制掩码,该掩码允许二维块声源的稀疏约束。二进制掩码具有启发性,因为它倾向于促进非零正声源幅度。在每次迭代中,声源幅度向量一方面通过牛顿法更新,另一方面用二进制掩码进行修剪。通过修剪过程,声源幅度变得越来越稀疏且聚集,从而增强了块特征。在后期处理阶段,根据等效源幅度计算粒子速度。进行了数值和实验研究以验证所提出的技术。结果表明,与凸优化软件包相比,所提出的压缩牛顿法在对块声源成像和提取信号波形方面具有较低的计算成本且效果良好。

文献检索

告别复杂PubMed语法,用中文像聊天一样搜索,搜遍4000万医学文献。AI智能推荐,让科研检索更轻松。

立即免费搜索

文件翻译

保留排版,准确专业,支持PDF/Word/PPT等文件格式,支持 12+语言互译。

免费翻译文档

深度研究

AI帮你快速写综述,25分钟生成高质量综述,智能提取关键信息,辅助科研写作。

立即免费体验