A remark on global positioning from local distances

Finding the global positioning of points in Euclidean space from a local or partial set of pairwise distances is a problem in geometry that emerges naturally in sensor networks and NMR spectroscopy of proteins. We observe that the eigenvectors of a certain sparse matrix exactly match the sought coordinates. This translates to a simple and efficient algorithm that is robust to noisy distance data.

[1]  O. Bagasra,et al.  Proceedings of the National Academy of Sciences , 1914, Science.

[2]  I. J. Schoenberg.  Remarks to Maurice Frechet's Article ``Sur La Definition Axiomatique D'Une Classe D'Espace Distances Vectoriellement Applicable Sur L'Espace De Hilbert , 1935 .

[3]  M. Fréchet.  Sur La Definition Axiomatique D'Une Classe D'Espaces Vectoriels Distancies Applicables Vectoriellement Sur L'Espace de Hilbert , 1935 .

[4]  A. Householder,et al.  Discussion of a set of points in terms of their mutual distances , 1938 .

[5]  B. Roth.  Rigid and Flexible Frameworks , 1981 .

[6]  Gordon M. Crippen,et al.  Distance Geometry and Molecular Conformation , 1988 .

[7]  M. V. Rossum,et al.  In Neural Computation , 2022 .

[8]  Christopher M. Bishop,et al.  Advances in Neural Information Processing Systems 8 (NIPS 1995) , 1991 .

[9]  Bruce Hendrickson,et al.  Conditions for Unique Graph Realizations , 1992, SIAM J. Comput..

[10]  Bruce Hendrickson,et al.  The Molecule Problem: Exploiting Structure in Global Optimization , 1995, SIAM J. Optim..

[11]  Stephen P. Boyd,et al.  Semidefinite Programming , 1996, SIAM Rev..

[12]  B. Hendrickson,et al.  Regular ArticleAn Algorithm for Two-Dimensional Rigidity Percolation: The Pebble Game , 1997 .

[13]  B. Hendrickson,et al.  An Algorithm for Two-Dimensional Rigidity Percolation , 1997 .

[14]  Jorge J. Moré,et al.  Global Continuation for Distance Geometry Problems , 1995, SIAM J. Optim..

[15]  Reconstructing a three-dimensional model with arbitrary errors , 1999, JACM.

[16]  Jos F. Sturm,et al.  A Matlab toolbox for optimization over symmetric cones , 1999 .

[17]  S T Roweis,et al.  Nonlinear dimensionality reduction by locally linear embedding. , 2000, Science.

[18]  Thomas G. Dietterich,et al.  Editors. Advances in Neural Information Processing Systems , 2002 .

[19]  Anoop Sarkar,et al.  Proceedings of the Twentieth International Conference on Machine Learning (ICML-2003) , 2003 .

[20]  D. Donoho,et al.  Hessian eigenmaps: Locally linear embedding techniques for high-dimensional data , 2003, Proceedings of the National Academy of Sciences of the United States of America.

[21]  Tommi S. Jaakkola,et al.  Weighted Low-Rank Approximations , 2003, ICML.

[22]  Mikhail Belkin,et al.  Laplacian Eigenmaps for Dimensionality Reduction and Data Representation , 2003, Neural Computation.

[23]  Lawrence K. Saul,et al.  Think Globally, Fit Locally: Unsupervised Learning of Low Dimensional Manifold , 2003, J. Mach. Learn. Res..

[24]  Xiang Ji,et al.  Sensor positioning in wireless ad-hoc sensor networks using multidimensional scaling , 2004, IEEE INFOCOM 2004.

[25]  James Aspnes,et al.  On the Computational Complexity of Sensor Network Localization , 2004, ALGOSENSORS.

[26]  Ann B. Lee,et al.  Geometric diffusions as a tool for harmonic analysis and structure definition of data: diffusion maps. , 2005, Proceedings of the National Academy of Sciences of the United States of America.

[27]  Distributed Graph Layout for Sensor Networks , 2005, J. Graph Algorithms Appl..

[28]  Stephen J. Wright,et al.  Framework for kernel regularization with application to protein clustering. , 2005, Proceedings of the National Academy of Sciences of the United States of America.

[29]  Jing Wang,et al.  MLLE: Modified Locally Linear Embedding Using Multiple Weights , 2006, NIPS.

[30]  Kilian Q. Weinberger,et al.  Graph Laplacian Regularization for Large-Scale Semidefinite Programming , 2006, NIPS.

[31]  Brian D. O. Anderson,et al.  A Theory of Network Localization , 2006, IEEE Transactions on Mobile Computing.

[32]  Dan Suciu,et al.  Journal of the ACM , 2006 .

[33]  Kim-Chuan Toh,et al.  Semidefinite Programming Approaches for Sensor Network Localization With Noisy Distance Measurements , 2006, IEEE Transactions on Automation Science and Engineering.

[34]  Stephen P. Boyd,et al.  The Fastest Mixing Markov Process on a Graph and a Connection to a Maximum Variance Unfolding Problem , 2006, SIAM Rev..

[35]  Leyuan Shi,et al.  IEEE Transactions on Automation Science and Engineering , 2009, IEEE Transactions on Automation Science and Engineering.

[36]  Daniel J. Velleman.  American Mathematical Monthly , 2010 .

[37]  Eric F Darve,et al.  Author ' s personal copy A hybrid method for the parallel computation of Green ’ s functions , 2009 .