Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/108944
PIRA download icon_1.1View/Download Full Text
Title: Distributed microphone array localization problem via SDP-SOCP method
Authors: He, Q 
Gao, M
Yiu, KFC 
Nordholm, S
Issue Date: 2023
Source: IEEE/ACM transactions on audio, speech, and language processing, 2023, v. 31, p. 3579-3588
Abstract: In multimedia applications, it is common to employ acoustic sensors collectively to enhance signals and to locate sound sources. A direct problem can be formulated to locate sound sources from a set of known sensors. In order to form the acoustic sensor network, it is important to locate the sensor array locations first. However, unlike other networks in which direct time-of-arrival (TOA) measurements might be possible, acoustic distributed network can only obtain time-difference-of-arrival (TDOA) measures indirectly from various sound source anchors. While it is common to employ convex optimization techniques to localize sensor locations in a network with TOA information, it has not been studied properly when it comes to TDOAs. This article considers the microphone array localization problem in a distributed acoustic network with TDOA measurements. We formulate the inverse problem which applied the known source locations to identify the wireless array configuration and estimate the location for each array. The proposed method formulates a mixed semidefinite programming (SDP) and second-order cone programming (SOCP) relaxation model, and then the acoustic geometry is obtained by solving a linear optimal programming. Furthermore, the characteristics of the optimal solution are studied and exact relaxation conditions are given. Experimental results demonstrate that the proposed mixed model can successfully estimate the sensor locations in noisy and reverberant environments for 2-dimensional and 3-dimensional space, which outperforms other relaxation methods.
Keywords: Convex relaxation
Distributed sensor array network
Localization
Second order cone programming
Semi-definite programming
Publisher: Institute of Electrical and Electronics Engineers
Journal: IEEE/ACM transactions on audio, speech, and language processing 
ISSN: 2329-9290
EISSN: 2329-9304
DOI: 10.1109/TASLP.2023.3313437
Rights: © 2023 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works.
The following publication Q. He, M. Gao, K. F. C. Yiu and S. Nordholm, "Distributed Microphone Array Localization Problem via SDP-SOCP Method," in IEEE/ACM Transactions on Audio, Speech, and Language Processing, vol. 31, pp. 3579-3588, 2023 is available at https://doi.org/10.1109/TASLP.2023.3313437.
Appears in Collections:Journal/Magazine Article

Files in This Item:
File Description SizeFormat 
He_Distributed_Microphone_Array.pdfPre-Published version3.68 MBAdobe PDFView/Open
Open Access Information
Status open access
File Version Final Accepted Manuscript
Access
View full-text via PolyU eLinks SFX Query
Show full item record

Page views

108
Citations as of Nov 10, 2025

Downloads

97
Citations as of Nov 10, 2025

SCOPUSTM   
Citations

3
Citations as of Dec 19, 2025

Google ScholarTM

Check

Altmetric


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.