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 of EDMs and derive
new key properties of them. These analyses allow us to propose algorithms to approximate EDMs
and provide analytic bounds on the performance of our methods. We use these techniques to
suggest new solutions for several practical problems in signal processing. Together with these
properties, algorithms and applications, EDMs can thus be considered as a fundamental toolbox
to be used in signal processing.
Euclidean distance matrices (EDMs) are central players in many diverse fields includingpsychometrics, NMR spectroscopy, machine learning and sensor networks. However, they arenot often exploited in signal processing. In this thesis, we analyze attributes of EDMs and derivenew key properties of them. These analyses allow us to propose algorithms to approximate EDMsand provide analytic bounds on the performance of our methods. We use these techniques tosuggest new solutions for several practical problems in signal processing. Together with theseproperties, algorithms and applications, EDMs can thus be considered as a fundamental toolboxto be used in signal processing.
การแปล กรุณารอสักครู่..
