2014
DOI: 10.1007/978-3-319-10599-4_3
|View full text |Cite
|
Sign up to set email alerts
|

Solving Square Jigsaw Puzzles with Loop Constraints

Abstract: Abstract. We present a novel algorithm based on "loop constraints" for assembling non-overlapping square-piece jigsaw puzzles where the rotation and the position of each piece are unknown. Our algorithm finds small loops of puzzle pieces which form consistent cycles. These small loops are in turn aggregated into higher order "loops of loops" in a bottom-up fashion. In contrast to previous puzzle solvers which avoid or ignore puzzle cycles, we specifically seek out and exploit these loops as a form of outlier r… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

1
65
0

Year Published

2015
2015
2024
2024

Publication Types

Select...
4
4
1

Relationship

0
9

Authors

Journals

citations
Cited by 48 publications
(70 citation statements)
references
References 20 publications
1
65
0
Order By: Relevance
“…Son et al [20] proposed a novel algorithm based on "loop constraints" for assembling jigsaw puzzles where the rotation and the position of each piece are unknown. Their key idea is to find all small loops, or cycles of pieces, and group these small loops into higher order "loops of loops", in a bottom-up fashion, to form a structure with no geometric conflict.…”
Section: B Pictorial Puzzlesmentioning
confidence: 99%
See 1 more Smart Citation
“…Son et al [20] proposed a novel algorithm based on "loop constraints" for assembling jigsaw puzzles where the rotation and the position of each piece are unknown. Their key idea is to find all small loops, or cycles of pieces, and group these small loops into higher order "loops of loops", in a bottom-up fashion, to form a structure with no geometric conflict.…”
Section: B Pictorial Puzzlesmentioning
confidence: 99%
“…The available literature for image reconstruction from identical rectangular tiles comprises mainly a few recent works [18], [19], [9], [10], [11], [20].…”
Section: B Pictorial Puzzlesmentioning
confidence: 99%
“…For example, the jigsaw puzzle solver [22] completely succeeded in assembling large puzzles which consist of 30745 pieces with the size of 28 × 28, in 2016. Table 1 Permutation of color components for a random integer [15] • × 2013 540 28×28 Son [16] • × 2014 9801 28×28 Son [16] • × 2014 221 10×10 Paikin [17] • × 2015 22755 28×28 Son [18] • × 2016 3300 28×28 Son [18] • On the other hand, a solver for puzzles including rotated pieces (pieces with unknown orientation) was first proposed in 2012 [14]. Thus, even when the number of blocks in an encrypted image is larger than 22755, there is a possibility that the image is completely decrypted if the piece size is large.…”
Section: Related Workmentioning
confidence: 99%
“…The key space of the scheme is generally large enough against the brute-force attacks as ciphertext-only attack. However, regarding the blocks of an encrypted image as pieces of a jigsaw puzzle, jigsaw puzzle solver attacks based on the correlation can be assumed [23][24][25][26][27][28]. For example, the jigsaw puzzle solver [25] completely succeeded in assembling large puzzles which consist of 30745 pieces with the size of 28 × 28.…”
Section: Security Analysismentioning
confidence: 99%