標題: Optimized microphone deployment for near-field acoustic holography: To be, or not to be random, that is the question
作者: Bai, Mingsian R.
Lin, Jia-Hong
Liu, Kwan-Liang
機械工程學系
Department of Mechanical Engineering
公開日期: 5-Jul-2010
摘要: Arrays with sparse and random sensor deployment are known to be capable of delivering high quality far-field images without grating lobes. This raises the question of whether or not this idea can be applied to near-field imaging as well. To answer this question that has not yet been widely investigated in previous research, numerical simulations are undertaken in this paper to optimize the microphone deployment for both far-field and near-field arrays with the latter being the main focus. In the simulation, a recently introduced near-field equivalent source imaging (NESI) technique is employed for the near-field imaging. Global optimization techniques including the simulated annealing (SA) algorithm and the intra-block Monte Carlo (IBMC) algorithm are exploited to find the optimal microphone position efficiently. The combined use of the SA and the IBMC algorithms enables efficient search for satisfactory deployment with excellent beam pattern and relatively uniform distribution of microphones. In the near-field optimization, a special kind of beam pattern and cost function definition is used for the multiple-input-multiple-output (MIMO) imaging problem. As indicated by the simulation results, random deployment of microphones is necessary to avoid grating lobes in far-field imaging. In the near-field simulation, all results suggest that the optimal near-field array is the uniform rectangular array (URA) and the random deployment presents no particular benefit in near-field imaging. (C) 2010 Elsevier Ltd. All rights reserved.
URI: http://dx.doi.org/10.1016/j.jsv.2010.01.027
http://hdl.handle.net/11536/5149
ISSN: 0022-460X
DOI: 10.1016/j.jsv.2010.01.027
期刊: JOURNAL OF SOUND AND VIBRATION
Volume: 329
Issue: 14
起始頁: 2809
結束頁: 2824
Appears in Collections:Articles


Files in This Item:

  1. 000276696300007.pdf

If it is a zip file, please download the file and unzip it, then open index.html in a browser to view the full text content.