Solving Jigsaw Puzzles by the Graph Connection Laplacian

DOI10.1137/19M1290760zbMath1451.90111arXiv1811.03188MaRDI QIDQ5143313

Gilad Lerman, Hau-Tieng Wu, Vahan Huroyan

Publication date: 11 January 2021

Published in: SIAM Journal on Imaging Sciences (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1811.03188

zbMATH Keywords

vector diffusion mapsgraph connection Laplacianjigsaw puzzlesZ4 synchronization

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Applications of mathematical programming (90C90) Quadratic programming (90C20) Combinatorial optimization (90C27)

Related Items

On recovery guarantees for angular synchronization, Coastline matching via a graph-based approach, Shotgun assembly threshold for lattice labeling model, Robust group synchronization via cycle-edge message passing

Cites Work

• Unnamed Item
• Jigsaw puzzles, edge matching, and polyomino packing: Connections and complexity
• Vector diffusion maps and the connection Laplacian
• An $\ell_{\infty}$ Eigenvector Perturbation Bound and Its Application to Robust Covariance Estimation
• Shotgun assembly of random jigsaw puzzles
• Fibonacci heaps and their uses in improved network optimization algorithms
• A useful variant of the Davis–Kahan theorem for statisticians
• A Cheeger Inequality for the Graph Connection Laplacian
• The Rotation of Eigenvectors by a Perturbation. III
• Graph connection Laplacian methods can be made robust to noise