A remark on global positioning from local distances

Proceedings of the National Academy of Sciences of the United States of America

Volumn 105, Issue 28, 2008, Pages 9507-9511

  Singer, Amit ^a  

^a YALE UNIVERSITY   (United States)

Author keywords

Distance geometry; Eigenvectors; Multidimensional scaling; Sensor networks

Indexed keywords

ALGORITHM; ARTICLE; DISTANCE PERCEPTION; GEOMETRY; MATHEMATICAL ANALYSIS; NOISE; NUCLEAR MAGNETIC RESONANCE SPECTROSCOPY; PRIORITY JOURNAL; SENSOR;

ALGORITHMS; CITIES; MAPS AS TOPIC; MODELS, STATISTICAL; UNITED STATES;

EID: 47749090558     PISSN: 00278424     EISSN: 10916490     Source Type: Journal    
DOI: 10.1073/pnas.0709842104     Document Type: Article

References (28)

1. Biswas P, Liang TC, Toh KC, Wang TC, Ye Y (2006) Semidefinite programming approaches for sensor network localization with noisy distance measurements. IEEE Trans Autom Sci Eng 3:360-371.
2. Aspnes J, et al. (2006) A theory of network localization. IEEE Trans Mobile Comput 5:1663-1678.
3. Ji X, Zha H (2004) Sensor positioning in wireless ad-hoc sensor networks using multidimensional scaling. Proc IEEE INFOCOM 4:2652-2661.
4. Crippen GM, Havel TF (1988) Distance Geometry and Molecular Conformation (Wiley, New York).
5. Berger B, Kleinberg J, Leighton FT (1999) Reconstructing a three-dimensional model with arbitrary errors. J Assoc Comput Mach 47:212-235.
6. Weinberger KQ, Sha F, Zhu Q, Saul LK (2007) Graph laplacian regularization for large-scale semidefinite programming. Advances in Neural Information Processing Systems (NIPS) 19, eds Schölkopf B, Platt J, Hofmann T (MIT Press, Cambridge, MA).
7. More JJ, Wu Z (1997) Global continuation for distance geometry problems. Soc Ind Appl Math J Optimization 7:814-836.
8. Roth B (1981) Rigid and flexible frameworks. Am Math Monthly 88:6-21.
9. Hendrickson B (1995) The molecule problem: Exploiting structure in global optimization. Soc Ind Appl Math J Optimization 5:835-857.
10. Hendrickson B (1992) Conditions for unique graph realizations. Soc Ind Appl Math J Comput 21:65-84.
11. Anderson BDO, et al. (2007) Graph properties of easily localizable networks. ACM Baltzer Wireless Networks (WINET) (Springer, Dordrecht, The Netherlands).
12. Aspnes J, Goldenberg DK, Yang YR (2004) On the computational complexity of sensor network localization. Proceedings of Algorithmic Aspects of Wireless Sensor Networks: First International Workshop (ALGOSENSORS), Lecture Notes in Computer Science 3121 (Springer, Berlin, Germany), pp 32-44.
13. Schoenberg IJ (1935) Remarks on Maurice Frechet's article "Sur la definition axiomatique d'une classe d'espaces vectoriels distnacies applicables vectoriellement sure l'espace de Hilbert." Ann Math 36:724-732.
14. Young G, Householder AS (1938) Discussion of a set of points in terms of their mutual distances. Psychometrika 3:19-22.
15. Cox TF, Cox MAA (2001) Multidimensional Scaling. Monographs on Statistics and Applied Probability 88 (Chapman & Hall/CRC, Boca Raton, FL).
16. Vandenberghe L, Boyd S (1996) Semidefinite programming. Soc Ind Appl Math Rev 38:49-95.
17. Wright SJ, Wahba G, Lu F, Keles S (2005) Framework for kernel regularization with application to protein clustering. Proc Natl Acad Sci USA 102:12332-12335.
18. Sun J, Boyd S, Xiao L, Diaconis P (2006) The fastest mixing markov process on a graph and a connection to a maximum variance unfolding problem. Soc Ind Appl Math Rev 48:681-699.
19. Gotsman C, Koren Y (2005) Distributed graph layout for sensor networks. J Graph Algorithms Appl 9(3):327-346.
20. Srebro N, Jaakkola T (2003) Weighted low-rank approximations. Proceedings of the Twentieth International Conference on Machine Learning (ICML) (AAAI Press, Menlo Park, CA), pp 720-727.
21. Roweis ST, Saul LK (2000) Nonlinear dimensionality reduction by locally linear embedding. Science 290:2323-2326.
22. Donoho DL, Grimes C (2003) Hessian eigenmaps: Locally linear embedding techniques for high-dimensional data. Proc Natl Acad Sci USA 100:5591-5596.
23. Belkin M, Niyogi P (2003) Laplacian eigenmaps for dimensionality reduction and data representation. Neural Comput 15:1373-1396.
24. Coifman RR, et al. (2005) Geometric diffusions as a tool for harmonic analysis and structure definition of data: Diffusion maps. Proc Natl Acad Sci USA 102:7426-7431.
25. Saul LK, Roweis ST (2003) Think globally, fit locally: Unsupervised learning of low dimensional manifolds. J Mach Learn Res 4:119-155.
26. Zhang Z, Wang J (2007) MLLE: Modified locally linear embedding using multiple weights. Advances in Neural Information Processing Systems (NIPS) 19, eds Schölkopf B, Platt J, Hofmann T (MIT Press, Cambridge, MA), pp 1593-1600.
27. Jacobs DJ, Hendrickson B (1997) An algorithm for two-dimensional rigidity percolation: The pebble game. J Comput Phys 137:346-365.
28. Sturm JF (1999) Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones. Optim Methods Software 11:625-653.