7 results on '"Moonen, Marc"'
Search Results
2. Distributed adaptive estimation of covariance matrix eigenvectors in wireless sensor networks with application to distributed PCA.
- Author
-
Bertrand, Alexander and Moonen, Marc
- Subjects
- *
COVARIANCE matrices , *WIRELESS sensor networks , *EIGENVECTORS , *ESTIMATION theory , *SCIENTIFIC observation , *IMAGE reconstruction , *NUMERICAL analysis - Abstract
Abstract: We describe a distributed adaptive algorithm to estimate the eigenvectors corresponding to the Q largest or smallest eigenvalues of the network-wide sensor signal covariance matrix in a wireless sensor network. The proposed algorithm recursively updates the eigenvector estimates without explicitly constructing the full covariance matrix that defines them, i.e., without centralizing all the raw sensor signal observations. By only sharing fused Q-dimensional observations, each node obtains estimates of (a) the node-specific entries of the Q covariance matrix eigenvectors, and (b) Q-dimensional projections of the full set of sensor signal observations onto the Q eigenvectors. We also explain how the latter can be used for, e.g., compression and reconstruction of the sensor signal observations based on principal component analysis (PCA), in which each node acts as a data sink. We describe a version of the algorithm for fully-connected networks, as well as for partially-connected networks. In the latter case, we assume that the network has been pruned to a tree topology to avoid cycles in the network. We provide convergence proofs, as well as numerical simulations to demonstrate the convergence and optimality of the algorithm. [Copyright &y& Elsevier]
- Published
- 2014
- Full Text
- View/download PDF
3. Distributed computation of the Fiedler vector with application to topology inference in ad hoc networks
- Author
-
Bertrand, Alexander and Moonen, Marc
- Subjects
- *
AD hoc computer networks , *EIGENVECTORS , *ALGORITHMS , *COMPUTER simulation , *ESTIMATION theory , *LAPLACIAN matrices , *TOPOLOGY - Abstract
Abstract: The Fiedler vector of a graph is the eigenvector corresponding to the smallest non-trivial eigenvalue of the graph''s Laplacian matrix. The entries of the Fiedler vector are known to provide a powerful heuristic for topology inference, e.g., to identify densely connected node clusters, to search for bottleneck links in the information dissemination, or to increase the overall connectivity of the network. In this paper, we consider ad hoc networks where the nodes can process and exchange data in a synchronous fashion, and we propose a distributed algorithm for in-network estimation of the Fiedler vector and the algebraic connectivity of the corresponding network graph. The algorithm is fully scalable with respect to the network size in terms of per-node computational complexity and data transmission. Simulation results demonstrate the performance of the algorithm. [Copyright &y& Elsevier]
- Published
- 2013
- Full Text
- View/download PDF
4. Distributed adaptive node-specific signal estimation in a wireless sensor network with noisy links.
- Author
-
de la Hucha Arce, Fernando, Moonen, Marc, Verhelst, Marian, and Bertrand, Alexander
- Subjects
- *
WIRELESS sensor networks , *SENSOR networks , *COMPUTATIONAL complexity - Abstract
• Fusion rules for distributed adaptive node-specific signal estimation (DANSE) are not optimal when communication links are noisy in a wireless sensor network. • Fusion rules which take noisy links into account are developed, resulting in new algorithm named N-DANSE. • The strategy to prove convergence of N-DANSE is different from the strategy used for DANSE without noisy links, and includes the latter as a special case. • N-DANSE performs better than DANSE in scenarios with noisy links. • N-DANSE is consistently closer to the optimal performance than DANSE. We consider a distributed signal estimation problem in a wireless sensor network where each node aims to estimate a node-specific desired signal using all sensor signals available in the network. In this setting, the distributed adaptive node-specific signal estimation (DANSE) algorithm is able to learn optimal fusion rules with which the nodes fuse their sensor signals, as the fused signals are then transmitted between the nodes. Under the assumption of transmission without errors, DANSE achieves the performance of centralized estimation. However, noisy communication links introduce errors in these transmitted signals, e.g., due to quantization or communication errors. In this paper we show fusion rules which take additive noise in the transmitted signals into account at almost no increase in computational complexity, resulting in a new algorithm denoted as 'noisy-DANSE' (N-DANSE). As the convergence proof for DANSE cannot be straightforwardly generalized to the case with noisy links, we use a different strategy to prove convergence of N-DANSE, which also proves convergence of DANSE without noisy links as a special case. We validate the convergence of N-DANSE and compare its performance with the original DANSE through numerical simulations, which demonstrate the superiority of N-DANSE over the original DANSE in noisy links scenarios. [ABSTRACT FROM AUTHOR]
- Published
- 2020
- Full Text
- View/download PDF
5. Optimal distributed minimum-variance beamforming approaches for speech enhancement in wireless acoustic sensor networks.
- Author
-
Markovich-Golan, Shmulik, Bertrand, Alexander, Moonen, Marc, and Gannot, Sharon
- Subjects
- *
MINIMUM variance estimation , *BEAMFORMING , *SPEECH enhancement , *WIRELESS sensor networks , *ACOUSTIC transducers - Abstract
In multiple speaker scenarios, the 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 different speakers. Here, we address the algorithmic challenges arising when applying the LCMV beamformer in wireless acoustic sensor networks (WASNs), which are a next-generation technology for audio acquisition and processing. We review three optimal distributed LCMV-based algorithms, which compute a network-wide LCMV beamformer output at each node without centralizing the microphone signals. Optimality here refers to equivalence to a centralized realization where a single processor has access to all signals. We derive and motivate the algorithms in an accessible top-down framework that reveals their underlying relations. We explain how their differences result from their different design criterion (node-specific versus common constraints sets), and their different priorities for communication bandwidth, computational power, and adaptivity. Furthermore, although originally proposed for a fully connected WASN, we also explain how to extend the reviewed algorithms to the case of a partially connected WASN, which is assumed to be pruned to a tree topology. Finally, we discuss the advantages and disadvantages of the various algorithms [ABSTRACT FROM AUTHOR]
- Published
- 2015
- Full Text
- View/download PDF
6. Cooperative integrated noise reduction and node-specific direction-of-arrival estimation in a fully connected wireless acoustic sensor network.
- Author
-
Hassani, Amin, Bertrand, Alexander, and Moonen, Marc
- Subjects
- *
WIRELESS sensor networks , *ACOUSTIC transducers , *WIRELESS sensor nodes , *DIRECTION of arrival estimation , *MICROPHONE arrays - Abstract
In this paper, we consider cooperative node-specific direction-of-arrival (DOA) estimation in a fully connected wireless acoustic sensor network (WASN). We consider a scenario where each node is equipped with a local microphone array with a known geometry, but where the position of the nodes, as well as their relative geometry and hence the between-nodes signal coherence model is unknown. The local array geometry in each node defines node-specific DOAs with respect to a set of target speech sources and the aim is to estimate these in each node. We assume a noisy environment with localized and/or diffuse noise sources, i.e., the noise can be correlated over the different microphones. A distributed noise reduction algorithm can then be applied as a preprocessing step to denoise all the microphone signals of the WASN, based on the distributed adaptive node-specific signal estimation (DANSE) algorithm. The denoised local microphone signals can then be used in each node to estimate the node-specific DOAs by using a subspace-based DOA estimation, involving a (generalized) eigenvalue decomposition of the local microphone signal correlation matrices. It is seen that the fused microphone signals that are exchanged between the nodes in the DANSE algorithm can also be included in these correlation matrices to obtain improved DOA estimates, leading to a cooperative integrated noise reduction and DOA estimation scheme, where the noise reduction can actually be shortcut. The improved performance achieved by this cooperative DOA estimation is demonstrated by means of numerical simulations for two different subspace-based DOA estimation methods (MUSIC and ESPRIT). [ABSTRACT FROM AUTHOR]
- Published
- 2015
- Full Text
- View/download PDF
7. Greedy distributed node selection for node-specific signal estimation in wireless sensor networks.
- Author
-
Szurley, Joseph, Bertrand, Alexander, Ruckebusch, Peter, Moerman, Ingrid, and Moonen, Marc
- Subjects
- *
WIRELESS sensor networks , *WIRELESS sensor nodes , *ESTIMATION theory , *SIGNAL processing , *DISTRIBUTED computing , *ADAPTIVE computing systems , *COMBINATORICS - Abstract
Abstract: A wireless sensor network is envisaged that performs signal estimation by means of the distributed adaptive node-specific signal estimation (DANSE) algorithm. This wireless sensor network has constraints such that only a subset of the nodes are used for the estimation of a signal. While an optimal node selection strategy is NP-hard due to its combinatorial nature, we propose a greedy procedure that can add or remove nodes in an iterative fashion until the constraints are satisfied based on their utility. With the proposed definition of utility, a centralized algorithm can efficiently compute each nodes's utility at hardly any additional computational cost. Unfortunately, in a distributed scenario this approach becomes intractable. However, by using the convergence and optimality properties of the DANSE algorithm, it is shown that for node removal, each node can efficiently compute a utility upper bound such that the MMSE increase after removal will never exceed this value. In the case of node addition, each node can determine a utility lower bound such that the MMSE decrease will always exceed this value once added. The greedy node selection procedure can then use these upper and lower bounds to facilitate distributed node selection. [Copyright &y& Elsevier]
- Published
- 2014
- Full Text
- View/download PDF
Catalog
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.