Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/65465
PIRA download icon_1.1View/Download Full Text
DC FieldValueLanguage
dc.contributorDepartment of Applied Mathematicsen_US
dc.creatorGao, Men_US
dc.creatorYiu, KFCen_US
dc.creatorNordholm, Sen_US
dc.creatorYe, Yen_US
dc.date.accessioned2017-05-22T02:08:40Z-
dc.date.available2017-05-22T02:08:40Z-
dc.identifier.issn1550-4859en_US
dc.identifier.urihttp://hdl.handle.net/10397/65465-
dc.language.isoenen_US
dc.publisherAssociation for Computing Machinaryen_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/2968449en_US
dc.subjectBeamformingen_US
dc.subjectConvex relaxationen_US
dc.subjectLocalizationen_US
dc.subjectSecond-order cone programmingen_US
dc.subjectSemi-definite programmingen_US
dc.titleOn a new SDP-SOCP method for acoustic source localization problemen_US
dc.typeJournal/Magazine Articleen_US
dc.identifier.volume12en_US
dc.identifier.issue4en_US
dc.identifier.doi10.1145/2968449en_US
dcterms.abstractAcoustic 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.accessRightsopen accessen_US
dcterms.bibliographicCitationACM transactions on sensor networks, Nov. 2016, v. 12, no. 4, 36en_US
dcterms.isPartOfACM transactions on sensor networksen_US
dcterms.issued2016-11-
dc.identifier.isiWOS:000388853800011-
dc.identifier.scopus2-s2.0-84994509793-
dc.identifier.ros2016001270-
dc.identifier.eissn1550-4867en_US
dc.identifier.artn36en_US
dc.identifier.rosgroupid2016001252-
dc.description.ros2016-2017 > Academic research: refereed > Publication in refereed journalen_US
dc.description.validate201804_a bcmaen_US
dc.description.oaAccepted Manuscripten_US
dc.identifier.FolderNumberAMA-0551-
dc.description.fundingSourceRGCen_US
dc.description.fundingSourceOthersen_US
dc.description.fundingTextPolyUen_US
dc.description.pubStatusPublisheden_US
dc.identifier.OPUS6693614-
Appears in Collections:Journal/Magazine Article
Files in This Item:
File Description SizeFormat 
Yiu_New_Sdp-Socp_Method.pdfPre-Published version787.55 kBAdobe PDFView/Open
Open Access Information
Status open access
File Version Final Accepted Manuscript
Access
View full-text via PolyU eLinks SFX Query
Show simple item record

Page views

150
Last Week
0
Last month
Citations as of Mar 24, 2024

Downloads

48
Citations as of Mar 24, 2024

SCOPUSTM   
Citations

3
Last Week
0
Last month
Citations as of Mar 28, 2024

WEB OF SCIENCETM
Citations

3
Last Week
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.