2015
DOI: 10.1016/j.sigpro.2014.07.014
|View full text |Cite
|
Sign up to set email alerts
|

Optimal distributed minimum-variance beamforming approaches for speech enhancement in wireless acoustic sensor networks

Abstract: In multiple speaker scenarios, the so-called linearly constrained minimum variance (LCMV) beamformer is a popular microphone array-based speech enhancement technique, as it allows minimizing the noise power while maintaining a set of desired responses towards the different speakers. In this paper, we address the algorithmic challenges arising in the application of the LCMV beamformer in so-called wireless acoustic sensor networks (WASNs), which are a next-generation technology for audio acquisition and process… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

1
55
0

Year Published

2016
2016
2023
2023

Publication Types

Select...
5
3

Relationship

1
7

Authors

Journals

citations
Cited by 83 publications
(56 citation statements)
references
References 44 publications
1
55
0
Order By: Relevance
“…However, this reduction comes at the cost of a decrease in the rate of adaptation of DGSC to changes in the noise field. As such, in practical applications DGSC requires a more frequent updating scheme to improve its ability to track noise correlation, increasing the total power it consumes [10].…”
Section: Algorithmmentioning
confidence: 99%
See 1 more Smart Citation
“…However, this reduction comes at the cost of a decrease in the rate of adaptation of DGSC to changes in the noise field. As such, in practical applications DGSC requires a more frequent updating scheme to improve its ability to track noise correlation, increasing the total power it consumes [10].…”
Section: Algorithmmentioning
confidence: 99%
“…This results in slower convergence to the optimal BF even in the case of static noise fields. Additionally, as only one node updates per audio section in DLCMV, increasing the number of nodes in the network decreases the algorithms ability to adapt to changing noise fields [10]. To demonstrate this, we consider the case of a linear array with mi = 1 ∀i ∈ V targeting a single speaker positioned perpendicular to the array.…”
Section: Algorithmmentioning
confidence: 99%
“…• If all nodes were MVDR nodes, i.e., if K = K MVDR , one could run the linearly constrained (LC-) DANSE algorithm [33], in which all nodes sequentially perform…”
Section: Distributed Mdmt-based Algorithmmentioning
confidence: 99%
“…In all of the three aforementioned algorithms (i.e., [25], [33], [20]), the fusion rule is updated in a similar fashion, i.e., the updating node q updates fq by replacing it with the first Mq rows of wq, i.e.,…”
Section: Distributed Mdmt-based Algorithmmentioning
confidence: 99%
“…Recently, research on speech enhancement using socalled acoustic sensor networks consisting of spatially distributed microphones has gained significant interest [1][2][3][4][5][6][7][8][9][10][11][12]. Compared with a microphone array at a single position, spatially distributed microphones are able to acquire more information about the sound field.…”
Section: Introductionmentioning
confidence: 99%