A fully automated greedy square jigsaw puzzle solver

Pomeranz, Dolev; Shemesh, Michal; Ben-Shahar, Ohad

doi:10.1109/cvpr.2011.5995331

Cited by 95 publications

(168 citation statements)

References 20 publications

(42 reference statements)

Supporting

Mentioning

162

Contrasting

Unclassified

Order By: Relevance

“…The computational assembly of puzzles has been explored in the literature, beginning with Freeman et al [3]. Some success has recently been shown for assembling squarepiece jigsaw puzzles arranged on a grid [4,5]. These methods assume that the pieces are perfect squares, and that the assembled puzzle forms a grid-graph of pieces.…”

Section: Related Workmentioning

confidence: 99%

Semi-automatic assembly of real cross-cut shredded documents

Deever

Gallagher

2012

2012 19th IEEE International Conference on Image Processing

View full text Add to dashboard Cite

This paper introduces a semi-automatic approach for crosscut shredded document reassembly. Automatic algorithms are proposed for segmenting and orienting individual shreds from a scanned shred image, as well as for computing features and ranking potential matches for each shred. Additionally, a human-computer interface is designed to allow semiautomatic assembly of the shreds using the computed feature and match information. Our document de-shredding system was tested on puzzles from the DARPA Shredder Challenge, allowing successful reconstruction of multiple shredded documents and demonstrating the effectiveness of the automatic algorithms.

show abstract

Section: Related Workmentioning

confidence: 99%

Semi-automatic assembly of real cross-cut shredded documents

Deever

Gallagher

2012

2012 19th IEEE International Conference on Image Processing

View full text Add to dashboard Cite

show abstract

“…Finding the correct pairwise adjacencies become available even if pieces were encrypted respectively by definition of transform functions as well as Eq. (13).…”

Section: Extended Pairwise Comparisonmentioning

confidence: 99%

“…Many papers have selected the jigsaw puzzle solver proposed by Gallagher [14] as a benchmark. Therefore we use this solver as in other works [13]- [23] to compare the proposed method with conventional ones. Figure 5 shows the process of assembling jigsaw puzzles by using proposed jigsaw puzzle solver.…”

Section: Jigsaw Puzzle Solver For New Type Puzzlesmentioning

confidence: 99%

“…The most papers about jigsaw puzzle solvers [13]- [23] aim to solve puzzles where the piece size is Bx = By = 14, 28 pixels. Therefore, the two piece sizes (Bx = By = 14, 28) are used to compare other papers in the field of jigsaw puzzle solvers.…”

Section: Experimental Conditionsmentioning

confidence: 99%

“…On the other hand, recently, jigsaw puzzle solvers, that utilize the correlation between pieces, have succeeded in solving puzzles with a large number of pieces [13]- [23]. In this paper, we regard the blocks of an encrypted image as pieces of a jigsaw puzzle and evaluate the safety of the encryption assuming the jigsaw puzzle solvers as crypto-attack methods.…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

On the Security of Block Scrambling-Based EtC Systems against Extended Jigsaw Puzzle Solver Attacks

Chuman

Kurihara

Kiya

2018

IEICE Trans. Inf. & Syst.

View full text Add to dashboard Cite

SUMMARYThe aim of this paper is to apply automatic jigsaw puzzle solvers, which are methods of assembling jigsaw puzzles, to the field of information security. Encryption-then-Compression (EtC) systems have been considered for the user-controllable privacy protection of digital images in social network services. Block scrambling-based encryption schemes, which have been proposed to construct EtC systems, have enough key spaces for protecting brute-force attacks. However, each block in encrypted images has almost the same correlation as that of original images. Therefore, it is required to consider the security from different viewpoints from number theory-based encryption methods with provable security such as RSA and AES. In this paper, existing jigsaw puzzle solvers, which aim to assemble puzzles including only scrambled and rotated pieces, are first reviewed in terms of attacking strategies on encrypted images. Then, an extended jigsaw puzzle solver for block scrambling-based encryption scheme is proposed to solve encrypted images including inverted, negative-positive transformed and color component shuffled blocks in addition to scrambled and rotated ones. In the experiments, the jigsaw puzzle solvers are applied to encrypted images to consider the security conditions of the encryption schemes.

show abstract

A Genetic Algorithm-Based Solver for Small-Scale Jigsaw Puzzles

Guo

Wei

Zhang

et al. 2020

Lecture Notes in Computer Science

View full text Add to dashboard Cite

In this paper, we present a genetic algorithm-based puzzle solver, which is mainly used to solve small-scale puzzle problems. We introduce a new measurement function that improves its accuracy by normalizing the Mahalanobis distance and the Euclidean distance between two puzzle pieces. By calculating the difference between edges of two puzzle pieces and using the genetic algorithm to assemble pieces correctly, two “parent” solutions are merged into one improved “child” solution. Using the idea of local search, it avoids the problem of local optimum solutions brought by the genetic algorithm, which greatly improves the accuracy of the puzzle.

show abstract

A fully automated greedy square jigsaw puzzle solver

Abstract: In the square jigsaw puzzle problem one is required to reconstruct the complete image from a set of non-overlapping, unordered, square puzzle

Cited by 95 publications

References 20 publications

Semi-automatic assembly of real cross-cut shredded documents

Semi-automatic assembly of real cross-cut shredded documents

On the Security of Block Scrambling-Based EtC Systems against Extended Jigsaw Puzzle Solver Attacks

A Genetic Algorithm-Based Solver for Small-Scale Jigsaw Puzzles

Contact Info

Product

Resources

About