Localization from incomplete noisy distance measurements

A Javanmard, A Montanari - Foundations of Computational Mathematics, 2013 - Springer
We consider the problem of positioning a cloud of points in the Euclidean space ℝ d, using
noisy measurements of a subset of pairwise distances. This task has applications in various …

3-D relative localization of mobile systems using distance-only measurements via semidefinite optimization

B Jiang, BDO Anderson… - IEEE Transactions on …, 2019 - ieeexplore.ieee.org
In a network of cooperating unmanned aerial vehicles (UAVs), individual UAVs usually need
to localize themselves in a shared and generally global frame. This paper studies the …

Cooperative network localizability via semidefinite programming

H Noureddine, D Castelain… - 2011 IEEE 22nd …, 2011 - ieeexplore.ieee.org
In cooperative localization, the aim is to compute the locations in Euclidean space of a set of
nodes performing pairwise distance measurements. In cases of lack of measurements …

Point localization and density estimation from ordinal knn graphs using synchronization

M Cucuringu, J Woodworth - arxiv preprint arxiv:1504.00722, 2015 - arxiv.org
We consider the problem of embedding unweighted, directed k-nearest neighbor graphs in
low-dimensional Euclidean space. The k-nearest neighbors of each vertex provides ordinal …

[KNYGA][B] Numerical Optimization Methods for Image Processing and Machine Learning

J Woodworth - 2016 - search.proquest.com
In this dissertation, numerical optimization methods for three different classes of problems
are presented: statistical modeling of crime, compressive sensing, and ordinal embedding. A …

[CITATA][C] A Particle Swarm Optimization to Round the Semidefinite Programming Relaxation Solutions for Wireless Sensor Network Localization Problem