Generic uniform search grid generation algorithm for far-field source localization

Jeesok Lee; Soo Whan Chung; Hong Goo Kang; Min Seok Choi

doi:10.1121/1.5021708

Generic uniform search grid generation algorithm for far-field source localization

Jeesok Lee, Soo Whan Chung, Hong Goo Kang, Min Seok Choi

Department of Electrical and Electronic Engineering

Research output: Contribution to journal › Article

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	https://doi.org/10.1121/1.5021708
Publication status	Published - 2018 Jan 1

Fingerprint

All Science Journal Classification (ASJC) codes

Arts and Humanities (miscellaneous)
Acoustics and Ultrasonics

Cite this

Lee, J., Chung, S. W., Kang, H. G., & Choi, M. S. (2018). Generic uniform search grid generation algorithm for far-field source localization. Journal of the Acoustical Society of America, 143(1), EL37-EL42. https://doi.org/10.1121/1.5021708

@article{9c1b7d81b9084f07a628707914540793,

title = "Generic uniform search grid generation algorithm for far-field source localization",

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.",

author = "Jeesok Lee and Chung, {Soo Whan} and Kang, {Hong Goo} and Choi, {Min Seok}",

year = "2018",

month = jan,

day = "1",

doi = "10.1121/1.5021708",

language = "English",

volume = "143",

pages = "EL37--EL42",

journal = "Journal of the Acoustical Society of America",

issn = "0001-4966",

publisher = "Acoustical Society of America",

number = "1",

}

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 -

Access to Document

10.1121/1.5021708