In neighborhood-based texture synthesis, adjacent local regions need to satisfy color continuity constraints in order to avoid visible seams. Such continuity constraints seriously restrict the variability of synthesized textures, making it impossible to generate new textures by mixing multiple input textures with very different base colors. In this paper, we propose to relax such restrictions a...

Recently, the special kind of near-regular texture has drawn significant attention from researchers in the field of texture synthesis. Near-regular textures contain global regular structures that pose significant problems to the popular sample-based approaches, and irregular stochastic structures that can not be reproduced by simple tiling. Existing work tries to overcome this problem by user a...

In neighborhood-based texture synthesis, adjacent local regions need to satisfy color continuity constraints in order to avoid visible seams. Such continuity constraints seriously restrict the variability of synthesized textures, making it impossible to generate new textures by mixing multiple input textures with very different base colors. In this paper, we propose to relax such restrictions a...

Multiple-Point Simulations (MPS) is a family of geostatistical tools that has received a lot of attention in recent years for the characterization of spatial phenomena in geosciences. It relies on the definition of training images to represent a given type of spatial variability, or texture. We show that the algorithmic tools used are similar in many ways to techniques developed in computer gra...

Image texture can arise not only from surface albedo variations (2D texture) but also from surface height variations (3D texture). Since the appearance of 3D texture depends on the illumination and viewing direction in a complicated manner, such image texture can be called a bidirectional texture function. A fundamental representation of image texture is the histogram of pixel intensities. Sinc...

Patch-based texture synthesis algorithms produce reasonable results for a wide variety of texture classes. They preserve global structure, but often introduce unwanted visual artifacts along patch boundaries. Pixel-based synthesis algorithms, on the other hand, tend to blur out small objects while maintaining a consistent texture impression, which in return doesn’t necessarily resemble the inpu...

This paper presents a novel texture synthesis algorithm that performs a sparse expansion of the patches of the image in a dictionary learned from an input exemplar. The synthesized texture is computed through the minimization of a non-convex energy that takes into account several constraints. Our first contribution is the computation of a sparse expansion of the patches imposing that the dictio...

A novel fast algorithm for realistic colour texture synthesis is introduced. The algorithm starts with spectral factorization of an input colour texture image using the Karhunen-Loeve expansion. Single orthogonal monospectral components are further decomposed into a multi-resolution grid and each resolution data are independently mod-eled by their dedicated Gaussian Markov random eld model (GMR...

In this technical report, we present a texture synthesis technique that stores all possible histories in memory structure acting as a Finite State Machine. The histories, which are the most probable spatial neighborhood for each pixel or patch, are stored in each state of the FSM. After constructing that structure, the synthesis goes very fast and smooth in a raster scan order. We found that ou...