Abstract
In this letter, a generic search grid generation algorithm for far-field source localization (SL) is proposed. Since conventional uniform regular grid structures only consider the resolution of the distribution, it is difficult to control the number of grid points to be distributed. The proposed algorithm generates a search grid by distributing a desired number of points evenly, depending on the target criterion, in either direction of arrival or time difference of arrival domain. The experimental results show that the proposed algorithm provides optimally distributed grid points given the number of desired points and the corresponding domain for SL processing.
| Original language | English |
|---|---|
| Pages (from-to) | EL37-EL42 |
| Journal | Journal of the Acoustical Society of America |
| Volume | 143 |
| Issue number | 1 |
| DOIs | |
| Publication status | Published - 2018 Jan 1 |
Fingerprint
All Science Journal Classification (ASJC) codes
- Arts and Humanities (miscellaneous)
- Acoustics and Ultrasonics
Cite this
}
Generic uniform search grid generation algorithm for far-field source localization. / Lee, Jeesok; Chung, Soo Whan; Kang, Hong Goo; Choi, Min Seok.
In: Journal of the Acoustical Society of America, Vol. 143, No. 1, 01.01.2018, p. EL37-EL42.Research output: Contribution to journal › Article
TY - JOUR
T1 - Generic uniform search grid generation algorithm for far-field source localization
AU - Lee, Jeesok
AU - Chung, Soo Whan
AU - Kang, Hong Goo
AU - Choi, Min Seok
PY - 2018/1/1
Y1 - 2018/1/1
N2 - In this letter, a generic search grid generation algorithm for far-field source localization (SL) is proposed. Since conventional uniform regular grid structures only consider the resolution of the distribution, it is difficult to control the number of grid points to be distributed. The proposed algorithm generates a search grid by distributing a desired number of points evenly, depending on the target criterion, in either direction of arrival or time difference of arrival domain. The experimental results show that the proposed algorithm provides optimally distributed grid points given the number of desired points and the corresponding domain for SL processing.
AB - In this letter, a generic search grid generation algorithm for far-field source localization (SL) is proposed. Since conventional uniform regular grid structures only consider the resolution of the distribution, it is difficult to control the number of grid points to be distributed. The proposed algorithm generates a search grid by distributing a desired number of points evenly, depending on the target criterion, in either direction of arrival or time difference of arrival domain. The experimental results show that the proposed algorithm provides optimally distributed grid points given the number of desired points and the corresponding domain for SL processing.
UR - http://www.scopus.com/inward/record.url?scp=85041191791&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85041191791&partnerID=8YFLogxK
U2 - 10.1121/1.5021708
DO - 10.1121/1.5021708
M3 - Article
C2 - 29390776
AN - SCOPUS:85041191791
VL - 143
SP - EL37-EL42
JO - Journal of the Acoustical Society of America
JF - Journal of the Acoustical Society of America
SN - 0001-4966
IS - 1
ER -