• Corpus ID: 237513757

Application of integral invariants to apictorial jigsaw puzzle assembly

  title={Application of integral invariants to apictorial jigsaw puzzle assembly},
  author={Peter Illig and Robert Thompson and Qimeng Yu},
We present a method for the automatic assembly of apictorial jigsaw puzzles. This method relies on integral area invariants for shape matching and an optimization process to aggregate shape matches into a final puzzle assembly. Assumptions about individual piece shape or arrangement are not necessary. We illustrate our method by solving example puzzles of various shapes and sizes. 
Iterative Respacing of Polygonal Curves
A computationally efficient method for respacing the points of a polygonal curve is presented and it is shown that iteration of this method converges to an equilateral polygonals curve.


Automatic Solution of Jigsaw Puzzles
  • D. Hoff, P. Olver
  • Mathematics, Computer Science
    Journal of Mathematical Imaging and Vision
  • 2013
We present a method for automatically solving apictorial jigsaw puzzles that is based on an extension of the method of differential invariant signatures. Our algorithms are designed to solve
An automatic jigsaw puzzle solver
A computer vision system to automatically analyze and assemble an image of the pieces of a jigsaw puzzle is presented, which derives a new set of features based on the shape and color characteristics of the puzzle pieces.
Solving jigsaw puzzles by computer
An algorithm to assemble large jigsaw puzzles using curve matching and combinatorial optimization techniques is presented. The pieces are photographed one by one and then the assembly algorithm,
A global approach to automatic solution of jigsaw puzzles
The overall strategy follows that of previous algorithms but applies a number of new ideas, such as robust fiducial points, "highest- confidence-first" search, and frequent global reoptimization of partial solutions.
Automatic Reassembly of Three-Dimensional Jigsaw Puzzles
An effective algorithm for reassembling three-dimensional apictorial jigsaw puzzles obtained by dividing a curved surface into a finite number of interlocking pieces that is able to successfully reassemble a broad range of artificial puzzles, including those subjected to a reasonable amount of noise.
Apictorial Jigsaw Puzzles: The Computer Solution of a Problem in Pattern Recognition
This paper describes the development of a procedure that enables a digital computer to solve ``apictorial'' jigsaw puzzles, i.e., puzzles in which all pieces are uniformly gray and the only available
Identifiability and reconstruction of shapes from integral invariants
Integral invariants have been proven to be useful for shape matching and recognition, but fundamental mathematical questions have not been addressed in the computer vision literature. In this
Integral Invariants for Shape Matching
Numerical results on shape matching demonstrate that this framework can match shapes despite the deformation of subparts, missing parts and noise, and a notion of distance between shapes is defined.
Integral Invariant Signatures
A class of functionals are introduced that are invariant with respect to the Euclidean and similarity group, obtained by performing integral operations, and the invariant signature can be used as a basis to define various notions of distance between shapes.
Computation of Circular Area and Spherical Volume Invariants via Boundary Integrals
The Divergence Theorem is used to express the area and volume integrals as line and surface integrals, respectively, against particular kernels; the results also extend to higher dimensional hypersurfaces.