Optimal patch assignment for statistically constrained texture synthesis

12Citations
Citations of this article
6Readers
Mendeley users who have this article in their library.
Get full text

Abstract

This article introduces a new model for patch-based texture synthesis that controls the distribution of patches in the synthesized texture. The proposed approach relies on an optimal assignment of patches over decimated pixel grids. This assignment problem formulates the synthesis as the minimization of a discrepancy measure between input’s and output’s patches through their optimal permutation. The resulting non-convex optimization problem is addressed with an iterative algorithm alternating between a patch assignment step and a patch aggregation step. We show that this model statistically constrains the output texture content, while inheriting the structure-preserving property of patch-based methods. We also propose a relaxed patch assignment extension that increases the robustness to non-stationnary textures.

Cite

CITATION STYLE

APA

Gutierrez, J., Rabin, J., Galerne, B., & Hurtut, T. (2017). Optimal patch assignment for statistically constrained texture synthesis. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 10302 LNCS, pp. 172–183). Springer Verlag. https://doi.org/10.1007/978-3-319-58771-4_14

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free