Euclidean Distance Matrix Completion for Ad-hoc Microphone Array Calibration
Related publications (39)
Graph Chatbot
Chat with Graph Search
Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.
DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.
Recent methods for localization of microphones in a microphone array exploit sound sources at a priori unknown locations. This is convenient for ad-hoc arrays, as it requires little additional infrastructure. We propose a flexible localization algorithm by ...
This report explains all theoretical and practical aspects of a 2D room re- construction algorithm based on euclidean geometry. Detailed theoretical explanations about the procedure are given in the first part. In the second part, a precise description of ...
This paper addresses the problem of ad hoc microphone array calibration where only partial information about the distances between the microphones is available. We construct a matrix consisting of the pairwise distances and propose to estimate the missing ...
Representations of solutions of equations describing the diffusion and quantum dynamics of particles in a Riemannian manifold are discussed under the assumption that the mass of particles is anisotropic and depends on both time and position. These equation ...
The well-known "necklace splitting theorem" of Alon (1987) asserts that every k-colored necklace can be fairly split into q parts using at most t cuts, provided k(q - 1)
While the question of the specification of spatial weight matrix is now largely discussed in the spatial econometrics literature, the definition of distance has attracted less attention. The choice of the distance measure is often glossed over, with the ul ...
This paper addresses the application of missing data recovery via matrix completion for audio sensor networks. We propose a method based on Euclidean distance matrix completion for ad-hoc microphone array location calibration. This method can calibrate a f ...
Visualization tools can facilitate access to complex spatial phenomenon. This access is what the application to be presented aims at. As a case study to such a complex phenomenon, the addressed question is that of the commuters' space of the Swiss federal ...
Greedy (geometric) routing is an important paradigm for routing in communication networks. It uses an embedding of the nodes of a network into points of a space (e.g., R-d) equipped with a distance function (e.g., the Euclidean distance l(2)) and uses as a ...