Please use this identifier to cite or link to this item:
http://hdl.handle.net/10397/65465
DC Field | Value | Language |
---|---|---|
dc.contributor | Department of Applied Mathematics | en_US |
dc.creator | Gao, M | en_US |
dc.creator | Yiu, KFC | en_US |
dc.creator | Nordholm, S | en_US |
dc.creator | Ye, Y | en_US |
dc.date.accessioned | 2017-05-22T02:08:40Z | - |
dc.date.available | 2017-05-22T02:08:40Z | - |
dc.identifier.issn | 1550-4859 | en_US |
dc.identifier.uri | http://hdl.handle.net/10397/65465 | - |
dc.language.iso | en | en_US |
dc.publisher | Association for Computing Machinary | en_US |
dc.rights | © 2016 ACM. This is the author's version of the work. It is posted here for your personal use. Not for redistribution. The definitive Version of Record was published in ACM Transactions on Sensor Networks (TOSN), http://dx.doi.org/10.1145/10.1145/2968449 | en_US |
dc.subject | Beamforming | en_US |
dc.subject | Convex relaxation | en_US |
dc.subject | Localization | en_US |
dc.subject | Second-order cone programming | en_US |
dc.subject | Semi-definite programming | en_US |
dc.title | On a new SDP-SOCP method for acoustic source localization problem | en_US |
dc.type | Journal/Magazine Article | en_US |
dc.identifier.volume | 12 | en_US |
dc.identifier.issue | 4 | en_US |
dc.identifier.doi | 10.1145/2968449 | en_US |
dcterms.abstract | Acoustic source localization has many important applications. Convex relaxation provides a viable approach of obtaining good estimates very efficiently. There are two popular convex relaxation methods using either semi-definite programming (SDP) or second-order cone programming (SOCP). However, the performances of the methods have not been studied properly in the literature and there is no comparison in terms of accuracy and performance. The aims of this article are twofold. First of all, we study and compare several convex relaxation methods. We demonstrate, by numerical examples, that most of the convex relaxation methods cannot localize the source exactly, even in the performance limit when the time difference of arrival (TDOA) information is exact. In addressing this problem, we propose a novel mixed SDP-SOCP relaxation model and study the characteristics of the optimal solutions and its localizable region. Furthermore, an error correction scheme for the proposed SDP-SOCP model is developed so that exact localization can be achieved in the performance limit. Experimental data have been collected in a room with two different array configurations to demonstrate our proposed approach. | en_US |
dcterms.accessRights | open access | en_US |
dcterms.bibliographicCitation | ACM transactions on sensor networks, Nov. 2016, v. 12, no. 4, 36 | en_US |
dcterms.isPartOf | ACM transactions on sensor networks | en_US |
dcterms.issued | 2016-11 | - |
dc.identifier.isi | WOS:000388853800011 | - |
dc.identifier.scopus | 2-s2.0-84994509793 | - |
dc.identifier.ros | 2016001270 | - |
dc.identifier.eissn | 1550-4867 | en_US |
dc.identifier.artn | 36 | en_US |
dc.identifier.rosgroupid | 2016001252 | - |
dc.description.ros | 2016-2017 > Academic research: refereed > Publication in refereed journal | en_US |
dc.description.validate | 201804_a bcma | en_US |
dc.description.oa | Accepted Manuscript | en_US |
dc.identifier.FolderNumber | AMA-0551 | - |
dc.description.fundingSource | RGC | en_US |
dc.description.fundingSource | Others | en_US |
dc.description.fundingText | PolyU | en_US |
dc.description.pubStatus | Published | en_US |
dc.identifier.OPUS | 6693614 | - |
Appears in Collections: | Journal/Magazine Article |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
Yiu_New_Sdp-Socp_Method.pdf | Pre-Published version | 787.55 kB | Adobe PDF | View/Open |
Page views
150
Last Week
0
0
Last month
Citations as of Mar 24, 2024
Downloads
48
Citations as of Mar 24, 2024
SCOPUSTM
Citations
3
Last Week
0
0
Last month
Citations as of Mar 28, 2024
WEB OF SCIENCETM
Citations
3
Last Week
0
0
Last month
Citations as of Mar 28, 2024
Google ScholarTM
Check
Altmetric
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.