Related papers: Solving Jigsaw Puzzles with Eroded Boundaries
Video outpainting presents a unique challenge of extending the borders while maintaining consistency with the given content. In this paper, we suggest the use of video inpainting models that excel in object flow learning and reconstruction…
This paper presents a new adversarial training framework for image inpainting with segmentation confusion adversarial training (SCAT) and contrastive learning. SCAT plays an adversarial game between an inpainting generator and a…
We consider the problem of reconstructing graphs or labeled graphs from neighborhoods of a given radius r. Special instances of this problem include the well known: DNA shotgun assembly; the lesser-known: neural network reconstruction; and…
Pattern-Based Constraint Satisfaction and Logic Puzzles develops a pure logic, pattern-based perspective of solving the finite Constraint Satisfaction Problem (CSP), with emphasis on finding the "simplest" solution. Different ways of…
The surface reconstruction problem from sets of planar parallel slices representing cross sections through 3D objects is presented. The final result of surface reconstruction is always based on the correct estimation of the structure of the…
In recent years, the field of image inpainting has developed rapidly, learning based approaches show impressive results in the task of filling missing parts in an image. But most deep methods are strongly tied to the resolution of the…
We consider a set of challenging sequential manipulation puzzles, where an agent has to interact with multiple movable objects and navigate narrow passages. Such settings are notoriously difficult for Task-and-Motion Planners, as they…
This paper introduces a variant of the classical edge coloring problem in graphs that can be applied to an offline scheduling problem for crossbar switches. We show that the problem is NP-complete, develop three lower bounds bounds on the…
Bayesian optimization has been successfully applied to optimize black-box functions where the number of evaluations is severely limited. However, in many real-world applications, it is hard or impossible to know in advance which designs are…
Adomian decomposition method is used for solving the seventh order boundary value problems. The approximate solutions of the problems are calculated in the form of a rapid convergent series and not at grid points. Two numerical examples…
Branch-and-bound approaches in integer programming require ordering portions of the space to explore next, a problem known as node comparison. We propose a new siamese graph neural network model to tackle this problem, where the nodes are…
We study the task of image inpainting, which is to fill in the missing region of an incomplete image with plausible contents. To this end, we propose a learning-based approach to generate visually coherent completion given a high-resolution…
Sudoku is a puzzle well-known to the scientific community with simple rules of completion, which may require a com-plex line of reasoning. This paper addresses the problem of partitioning the Sudoku image into a 1-D array, recognizing…
Self-supervised representation learning has achieved impressive results in recent years, with experiments primarily coming on ImageNet or other similarly large internet imagery datasets. There has been little to no work with these methods…
Automatic assembly of apictorial jigsaw puzzles presents a classic curve matching problem, fundamentally challenged by discrete and noisy contour data obtained from digitization. Conventional smoothing methods, which are required to process…
We study boundary value problems for degenerate elliptic equations and systems with square integrable boundary data. We can allow for degeneracies in the form of an $A_{2}$ weight. We obtain representations and boundary traces for solutions…
Peg solitaire is an old puzzle with a 300 year history. We consider two ways a computer can be utilized to find interesting peg solitaire puzzles. It is common for a peg solitaire puzzle to begin from a symmetric board position, we have…
Over the past decade, we have designed six typefaces based on mathematical theorems and open problems, specifically computational geometry. These typefaces expose the general public in a unique way to intriguing results and hard problems in…
Multi-material problems often exhibit complex geometries along with physical responses presenting large spatial gradients or discontinuities. In these cases, providing high-quality body-fitted finite element analysis meshes and obtaining…
We investigate an overdetermined Torsion problem, with a non-constant positively homogeneous boundary constraint on the gradient. We interpret this problem as the Euler equation of a shape optimization problems, we prove existence and…