A novel low-rank matrix completion approach to estimate missing entries in Euclidean distance matrix
- 93 Downloads
A Euclidean distance matrix (EDM) is a table of distance-square between points on a k-dimensional Euclidean space, with applications in many fields (e.g., engineering, geodesy, economics, genetics, biochemistry, and psychology). A problem that often arises is the absence (or uncertainty) of some EDM elements. In many situations, only a subset of all pairwise distances is available and it is desired to have some procedure to estimate the missing distances. In this paper, we address the problem of missing data in EDM through low-rank matrix completion techniques. We exploit the fact that the rank of a EDM is at most \(k+2\) and does not depend on the number of points, which is, in general, much bigger then k. We use a singular value decomposition approach that considers the rank of the matrix to be completed and computes, in each iteration, a parameter that controls the convergence of the method. After performing a number of computational experiments, we could observe that our proposal was able to recover, with high precision, random EDMs with more than 1000 points and up to 98% of missing data in few minutes. In addition, our method required a smaller number of iterations when compared to other competitive state-of-art technique.
KeywordsEuclidean distance matrix Low-rank Matrix completion
Mathematics Subject Classification15A83 Matrix completion problems 51Kxx Distance geometry
The authors would like to thank the Brazilian research agencies CAPES, CNPq, and FAPESP for their financial support.
- Cui A, Peng J, Li H, Zhang C, Yu Y (2018) Affine matrix rank minimization problem via non-convex fraction function penalty. J Comput Appl Math 336:353–374. https://doi.org/10.1016/j.cam.2017.12.048. URL http://www.sciencedirect.com/science/article/pii/S0377042718300165 (ISSN 0377-0427)
- Fazel M (2002) Matrix rank minimization with applications. PhD thesis, Stanford UniversityGoogle Scholar
- Krislock N (2010) Semidefinite facial reduction for low-rank Euclidean distance matrix completion. PhD thesis, School of Computer Science, University of WaterlooGoogle Scholar
- Leeuw J (2004) Multidimensional scaling. International encyclopedia of the social and behavioral sciences. Elsevier, Amsterdam, pp 13512–13519Google Scholar