Constraint-Based Visual Generation

07/16/2018
by   Giuseppe Marra, et al.
0

In the last few years the systematic adoption of deep learning to visual generation has produced impressive results that, amongst others, definitely benefit from the massive exploration of convolutional architectures. In this paper, we propose a general approach to visual generation that combines learning capabilities with logic descriptions of the target to be generated. The process of generation is regarded as a constrained satisfaction problem, where the constraints describe a set of properties that characterize the target. Interestingly, the constraints can also involve logic variables, while all of them are converted into real-valued functions by means of the t-norm theory. We use deep architectures to model the involved variables, and propose a computational scheme where the learning process carries out a satisfaction of the constraints. We propose some examples in which the theory can naturally be used, including the modeling of GAN and auto-encoders, and report promising results in problems with the generation of handwritten characters and face transformations.

READ FULL TEXT

page 5

page 7

page 8

research
02/19/2021

Probabilistically Guaranteed Satisfaction of Temporal Logic Constraints During Reinforcement Learning

We present a novel reinforcement learning algorithm for finding optimal ...
research
03/02/2020

Piecewise Linear Valued Constraint Satisfaction Problems with Fixed Number of Variables

Many combinatorial optimisation problems can be modelled as valued const...
research
03/13/2013

Possibilistic Constraint Satisfaction Problems or "How to handle soft constraints?"

Many AI synthesis problems such as planning or scheduling may be modeliz...
research
07/19/2023

Automatic Conversion of MiniZinc Programs to QUBO

Obtaining Quadratic Unconstrained Binary Optimisation models for various...
research
03/31/2022

Current Challenges in Infinite-Domain Constraint Satisfaction: Dilemmas of the Infinite Sheep

A Constraint Satisfaction Problem (CSP) is a computational problem where...
research
03/20/2013

Compressed Constraints in Probabilistic Logic and Their Revision

In probabilistic logic entailments, even moderate size problems can yiel...
research
05/27/2023

Computing a partition function of a generalized pattern-based energy over a semiring

Valued constraint satisfaction problems with ordered variables (VCSPO) a...

Please sign up or login with your details

Forgot password? Click here to reset