Publications related to Euclidean Distance Matrices: Essential Theory, Algorithms and Applications

Convex block-sparse linear regression with expanders - provably

Volkan Cevher, Quoc Tran Dinh, Anastasios Kyrillidis, Luca Baldassarre, Bubacarr Bah

Sparse matrices are favorable objects in machine learning and optimization. When such matrices are used, in place of dense ones, the overall complexity requirements in optimization can be significantly reduced in practice, both in terms of space and run-ti ...

2016

Relax and Unfold: Microphone Localization with Euclidean Distance Matrices

Martin Vetterli, Ivan Dokmanic, Juri Ranieri

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 ...

2015

Ad Hoc Microphone Array Calibration: Euclidean Distance Matrix Completion Algorithm and Theoretical Guarantees

Hervé Bourlard, Philip Neil Garner, Afsaneh Asaei, Mohammadjavad Taghizadeh, Reza Parhizkar

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 ...

2015

Listening to Distances and Hearing Shapes

Ivan Dokmanic

A central theme of this thesis is using echoes to achieve useful, interesting, and sometimes surprising results. One should have no doubts about the echoes' constructive potential; it is, after all, demonstrated masterfully by Nature. Just think about the ...

EPFL2015

Indoor localization method and system

Martin Vetterli, Reza Parhizkar, Gilles Baechler

An indoor localization method for estimating the location of nodes (n1, n2), at least one node (n1) being connected to at least another node (n2) by at least two different channels (ch1, ch1′), comprising the following steps: measuring a distance between t ...

2015

Euclidean distance versus travel time in business location: A probabilistic mixture of hurdle-Poisson models

Matthieu Marie Cochon de Lapparent

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 ...

2014

Approximate Matrix Multiplication with Application to Linear Embeddings

Michail Vlachos, Anastasios Kyrillidis

In this paper, we study the problem of approximately computing the product of two real matrices. In particular, we analyze a dimensionality-reduction-based approximation algorithm due to Sarlos [1], introducing the notion of nuclear rank as the ratio of th ...

Ieee2014

Theoretical Analysis of Euclidean Distance Matrix Completion for Ad hoc Microphone Array Calibration

Mohammadjavad Taghizadeh

We consider the problem of ad~hoc microphone array calibration where the distance matrix consisted of all microphones pairwise distances have entries missing corresponding to distances greater than

d_{\text{max}}

. Furthermore, the known entries are noisy ...

Idiap2014

Euclidean Distance Matrices

Reza Parhizkar

Euclidean distance matrices (EDMs) are central players in many diverse fields including psychometrics, NMR spectroscopy, machine learning and sensor networks. However, they are not often exploited in signal processing. In this thesis, we analyze attributes ...

EPFL2013

Low-Rank Matrix Completion By Riemannian Optimization

The matrix completion problem consists of finding or approximating a low-rank matrix based on a few samples of this matrix. We propose a new algorithm for matrix completion that minimizes the least-square distance on the sampling set over the Riemannian ma ...

Siam Publications2013

Euclidean Distance Matrices: Essential Theory, Algorithms and Applications

Graph Chatbot

Chat with Graph Search

Convex block-sparse linear regression with expanders - provably

Relax and Unfold: Microphone Localization with Euclidean Distance Matrices

Ad Hoc Microphone Array Calibration: Euclidean Distance Matrix Completion Algorithm and Theoretical Guarantees

Listening to Distances and Hearing Shapes

Indoor localization method and system

Euclidean distance versus travel time in business location: A probabilistic mixture of hurdle-Poisson models

Approximate Matrix Multiplication with Application to Linear Embeddings

Theoretical Analysis of Euclidean Distance Matrix Completion for Ad hoc Microphone Array Calibration

Euclidean Distance Matrices

Low-Rank Matrix Completion By Riemannian Optimization

Theoretical Analysis of Euclidean Distance Matrix Completion for Ad hoc Microphone Array Calibration

Low-Rank Matrix Completion By Riemannian Optimization

Indoor localization method and system

Listening to Distances and Hearing Shapes

Convex block-sparse linear regression with expanders - provably

Ad Hoc Microphone Array Calibration: Euclidean Distance Matrix Completion Algorithm and Theoretical Guarantees

Euclidean distance versus travel time in business location: A probabilistic mixture of hurdle-Poisson models

Relax and Unfold: Microphone Localization with Euclidean Distance Matrices

Approximate Matrix Multiplication with Application to Linear Embeddings

Euclidean Distance Matrices