Abstract
We explore the idea of abstracting the jigsaw puzzle problem as a consistent labeling problem, a classical concept introduced in the1980 s by Hummel and Zucker for which a solid theory and powerful algorithms are available. The problem amounts to maximizing a well-known quadratic function over a probability space which we solve using standard relaxation labeling algorithms endowed with matrix balancing mechanisms to enforce one-to-one correspondence constraints. Preliminary experimental results on publicly available datasets demonstrate the feasibility of the proposed approach.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Andaló, F.A., Taubin, G., Goldenstein, S.: PSQP: puzzle solving by quadratic programming. IEEE TPAMI 39(2), 385–396 (2017)
Cho, T.S., Avidan, S., Freeman, W.T.: A probabilistic image jigsaw puzzle solver. In: Proceedings CVPR, pp. 183–190 (2010)
Cruz, R.S., Fernando, B., Cherian, A., Gould, S.: Deeppermnet: visual permutation learning. CoRR abs/1704.02729 (2017)
Deever, A., Gallagher, A.: Semi-automatic assembly of real cross-cut shredded documents. In: Proceedings ICIP, pp. 233–236 (2012)
Demaine, E.D., Demaine, M.L.: Jigsaw puzzles, edge matching, and polyomino packing: connections and complexity. Graphs Comb. 23(Suppl. 1), 195–208 (2007)
Derech, N., Tal, A., Shimshoni, I.: Solving archaeological puzzles. CoRR abs/1812.10553 (2018)
Gallagher, A.C.: Jigsaw puzzles with pieces of unknown orientation. In: Proceedings CVPR, pp. 382–389 (2012)
Gur, S., Ben-Shahar, O.: From square pieces to brick walls: The next challenge in solving jigsaw puzzles. In: ICCV, pp. 4029–4037 (2017)
Haralick, R.M., Shapiro, L.G.: The consistent labeling problem: part I. IEEE TPAMI 1(2), 173–184 (1979)
Hummel, R.A., Zucker, S.W.: On the foundations of relaxation labeling processes. IEEE TPAMI 5(3), 267–287 (1983)
Miller, D.A., Zucker, S.W.: Copositive-plus Lemke algorithm solves polymatrix games. Oper. Res. Lett. 10, 285–290 (1991)
Paumard, M., Picard, D., Tabia, H.: Deepzzle: solving visual jigsaw puzzles with deep learning and shortest path optimization. CoRR abs/2005.12548 (2020)
Pelillo, M.: The dynamics of nonlinear relaxation labeling processes. J. Math. Imag. Vis. 7(4), 309–323 (1997)
Pomeranz, D., Shemesh, M., Ben-Shahar, O.: A fully automated greedy square jigsaw puzzle solver. In: Proceedings CVPR, pp. 9–16 (2011)
Rosenfeld, A., Hummel, R.A., Zucker, S.W.: Scene labeling by relaxation operations. IEEE Trans. Syst. Man Cybern. 6, 420–433 (1976)
Sholomon, D., David, O.E., Netanyahu, N.S.: A generalized genetic algorithm-based solver for very large jigsaw puzzles of complex types. In: Proceedings AAAI, pp. 2839–2845 (2014)
Sinkhorn, R., Knopp, P.: Concerning nonnegative matrices and doubly stochastic matrices. Pacific J. Math. 21(2), 343–348 (1967)
Son, K., Hays, J., Cooper, D.B.: Solving square jigsaw puzzle by hierarchical loop constraints. IEEE TPAMI 41(9), 2222–2235 (2018)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2021 Springer Nature Switzerland AG
About this paper
Cite this paper
Khoroshiltseva, M., Vardi, B., Torcinovich, A., Traviglia, A., Ben-Shahar, O., Pelillo, M. (2021). Jigsaw Puzzle Solving as a Consistent Labeling Problem. In: Tsapatsoulis, N., Panayides, A., Theocharides, T., Lanitis, A., Pattichis, C., Vento, M. (eds) Computer Analysis of Images and Patterns. CAIP 2021. Lecture Notes in Computer Science(), vol 13053. Springer, Cham. https://doi.org/10.1007/978-3-030-89131-2_36
Download citation
DOI: https://doi.org/10.1007/978-3-030-89131-2_36
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-89130-5
Online ISBN: 978-3-030-89131-2
eBook Packages: Computer ScienceComputer Science (R0)