Ad hoc microphone array calibration: Euclidean distance matrix completion algorithm and theoretical guarantees
نویسندگان
چکیده
منابع مشابه
Ad Hoc Microphone Array Calibration: Euclidean Distance Matrix Completion Algorithm and Theoretical Guarantees
This paper addresses the problem of ad hoc microphone array calibration where only partial information about the distances between microphones is available. We construct a matrix consisting of the pairwise distances and propose to estimate the missing entries based on a novel Euclidean distance matrix completion algorithm by alternative low-rank matrix completion and projection onto the Euclide...
متن کاملEnhanced diffuse field model for ad hoc microphone array calibration
In this paper, we investigate the diffuse field coherence model for microphone array pairwise distance estimation. We study the fundamental constraints and assumptions underlying this approach and propose evaluation methodologies to measure the adequacy of diffuseness for microphone array calibration. In addition, an enhanced scheme based on coherence averaging and histogramming, is presented t...
متن کاملEuclidean distance matrix completion problems
A Euclidean distance matrix is one in which the (i, j) entry specifies the squared distance between particle i and particle j. Given a partially-specified symmetric matrix A with zero diagonal, the Euclidean distance matrix completion problem (EDMCP) is to determine the unspecified entries to make A a Euclidean distance matrix. We survey three different approaches to solving the EDMCP.We advoca...
متن کاملEnabling Speech Applications using Ad Hoc Microphone Arrays
Microphone arrays are central players in hands-free speech interface applications. The main duty of a microphone array is capturing distant-talking speech with high quality. A microphone array can acquire the desired speech signals selectively by leading the beampattern towards the desired speaker. The foreseen application of ubiquitous sensing motivated by the abundance of microphone-embedded ...
متن کاملOn Least Squares Euclidean Distance Matrix Approximation and Completion
The Euclidean distance matrix approximation problem as well as the completion problem have received a lot of attention in recent years because of their many important applications. In contrast to the many interesting but often sophisticated algorithms proposed in the literature, this paper offers a relatively straightforward procedure that can tackle both problems by the same framework. The loc...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Signal Processing
سال: 2015
ISSN: 0165-1684
DOI: 10.1016/j.sigpro.2014.07.016