DeepAI AI Chat
Log In Sign Up

A Global Approach for Solving Edge-Matching Puzzles

by   Shahar Z. Kovalsky, et al.

We consider apictorial edge-matching puzzles, in which the goal is to arrange a collection of puzzle pieces with colored edges so that the colors match along the edges of adjacent pieces. We devise an algebraic representation for this problem and provide conditions under which it exactly characterizes a puzzle. Using the new representation, we recast the combinatorial, discrete problem of solving puzzles as a global, polynomial system of equations with continuous variables. We further propose new algorithms for generating approximate solutions to the continuous problem by solving a sequence of convex relaxations.


page 2

page 11

page 15

page 16

page 18


Rainbow matchings in properly-coloured multigraphs

Aharoni and Berger conjectured that in any bipartite multigraph that is ...

On the fixed-parameter tractability of the maximum 2-edge-colorable subgraph problem

A k-edge-coloring of a graph is an assignment of colors {1,...,k} to edg...

Edge Matching with Inequalities, Triangles, Unknown Shape, and Two Players

We analyze the computational complexity of several new variants of edge-...

Solving Dense Image Matching in Real-Time using Discrete-Continuous Optimization

Dense image matching is a fundamental low-level problem in Computer Visi...

Continuous Multiclass Labeling Approaches and Algorithms

We study convex relaxations of the image labeling problem on a continuou...

Peacock Bundles: Bundle Coloring for Graphs with Globality-Locality Trade-off

Bundling of graph edges (node-to-node connections) is a common technique...

Perfect Edge-Transmitting Recombination of Permutations

Crossover is the process of recombining the genetic features of two pare...

Code Repositories


Supplemental Matlab code for the paper "A Global Approach for Solving Edge-Matching Puzzles"

view repo