Exact Reconstruction of Euclidean Distance Geometry Problem Using Low-rank Matrix Completion

04/12/2018
by   Abiy Tasissa, et al.
0

The Euclidean distance geometry problem arises in a wide variety of applications, from determining molecular conformations in computational chemistry to localization in sensor networks. When the distance information is incomplete, the problem can be formulated as a nuclear norm minimization problem. In this paper, this minimization program is recast as a matrix completion problem of a low-rank r Gram matrix with respect to a suitable basis. The well known restricted isometry property can not be satisfied in the scenario. Instead, a dual basis approach is introduced to theoretically analyze the reconstruction problem. If the Gram matrix satisfies certain coherence conditions with parameter ν, the main result shows that the underlying configuration of n points can be recovered with very high probability from O(nrν^2(n)) uniformly random samples. Computationally, simple and fast algorithms are designed to solve the Euclidean distance geometry problem. Numerical tests on different three dimensional data and protein molecules validate effectiveness and efficiency of the proposed algorithms.

READ FULL TEXT

page 15

page 16

research
12/14/2018

Low-rank Matrix Completion in a General Non-orthogonal Basis

This paper considers theoretical analysis of recovering a low rank matri...
research
11/10/2020

Inverse Kinematics as Low-Rank Euclidean Distance Matrix Completion

The majority of inverse kinematics (IK) algorithms search for solutions ...
research
11/30/2018

Localization from Incomplete Euclidean Distance Matrix: Performance Analysis for the SVD-MDS Approach

Localizing a cloud of points from noisy measurements of a subset of pair...
research
03/09/2015

A Characterization of Deterministic Sampling Patterns for Low-Rank Matrix Completion

Low-rank matrix completion (LRMC) problems arise in a wide variety of ap...
research
10/08/2019

Deterministic Completion of Rectangular Matrices Using Ramanujan Bigraphs – II: Explicit Constructions and Phase Transitions

Matrix completion is a part of compressed sensing, and refers to determi...
research
03/10/2023

A dual basis approach to multidimensional scaling: spectral analysis and graph regularity

Classical multidimensional scaling (CMDS) is a technique that aims to em...
research
06/09/2014

Image Tag Completion by Low-rank Factorization with Dual Reconstruction Structure Preserved

A novel tag completion algorithm is proposed in this paper, which is des...

Please sign up or login with your details

Forgot password? Click here to reset