The structure from motion (SfM) problem in computer vision is to recover the three-
dimensional (3D) structure of a stationary scene from a set of projective measurements …

Euclidean distance geometry is the study of Euclidean geometry based on the concept of
distance. This is useful in several applications where the input data consist of an incomplete …

The problem of estimating the phases (angles) of a complex unit-modulus vector z from their
noisy pairwise relative measurements C=zz^*+σW, where W is a complex-valued Gaussian …

The synchronization problem over the special orthogonal group SO (d) consists of
estimating a set of unknown rotations from noisy measurements of a subset of their pairwise …

Numerous problems in computer vision, pattern recognition, and machine learning are
formulated as optimization with manifold constraints. In this paper, we propose the Manifold …

The O(d) synchronization problem consists of estimating a set of n unknown orthogonal d*d
matrices O_1,...,O_n from noisy measurements of a subset of the pairwise ratios O_iO_j^-1 …

We introduce several novel and computationally efficient methods for detecting “core–
periphery structure” in networks. Core–periphery structure is a type of mesoscale structure …

Consider N points in R^d and M local coordinate systems that are related through unknown
rigid transforms. For each point, we are given (possibly noisy) measurements of its local …

Synchronization of rotations is the problem of estimating a set of rotations R i∈ SO (n), i= 1⋯
N, based on noisy measurements of relative rotations R i R j⊤. This fundamental problem …

We consider the classical problem of establishing a statistical ranking of a set of n items
given a set of inconsistent and incomplete pairwise comparisons between such items …