A Cheeger Inequality for the Graph Connection Laplacian
SIAM J. Matrix Analysis Applications, pp. 1611-1630, 2013.
EI
Abstract:
The O(d) Synchronization problem consists of estimating a set of unknown orthogonal transformations O_i from noisy measurements of a subset of the pairwise ratios O_iO_j^{-1}. We formulate and prove a Cheeger-type inequality that relates a measure of how well it is possible to solve the O(d) synchronization problem with the spectra of a...More
Code:
Data:
Full Text
Tags
Comments