Maximum entropy methods for texture synthesis: theory and practice - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue SIAM Journal on Mathematics of Data Science Année : 2020

Maximum entropy methods for texture synthesis: theory and practice

Valentin de Bortoli
  • Fonction : Auteur
  • PersonId : 1084097
  • IdRef : 249460300
Alain Durmus
Arthur Leclaire

Résumé

Recent years have seen the rise of convolutional neural network techniques in exemplar-based image synthesis. These methods often rely on the minimization of some variational formulation on the image space for which the minimizers are assumed to be the solutions of the synthesis problem. In this paper we investigate, both theoretically and experimentally, another framework to deal with this problem using an alternate sampling/minimization scheme. First, we use results from information geometry to assess that our method yields a probability measure which has maximum entropy under some constraints in expectation. Then, we turn to the analysis of our method and we show, using recent results from the Markov chain literature, that its error can be explicitly bounded with constants which depend polynomially in the dimension even in the non-convex setting. This includes the case where the constraints are defined via a differentiable neural network. Finally, we present an extensive experimental study of the model, including a comparison with state-of-the-art methods and an extension to style transfer.
Fichier principal
Vignette du fichier
main_simods.pdf (6.5 Mo) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-03037099 , version 1 (02-12-2020)

Identifiants

Citer

Valentin de Bortoli, Agnès Desolneux, Alain Durmus, Bruno Galerne, Arthur Leclaire. Maximum entropy methods for texture synthesis: theory and practice. SIAM Journal on Mathematics of Data Science, 2020, ⟨10.1137/19M1307731⟩. ⟨hal-03037099⟩
49 Consultations
19 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More