An Optimal Control Approach for Texture Metamorphosis

In this paper, we introduce a new texture metamorphosis approach for interpolating texture samples from a source texture into a target texture. We use a new energy optimization scheme derived from optimal control principles which exploits the structure of the metamorphosis optimality conditions. Our approach considers the change in pixel position and pixel appearance in a single framework. In contrast to previous techniques that compute a global warping based on feature masks of textures, our approach allows to transform one texture into another by considering both intensity values and structural features of textures simultaneously. We demonstrate the usefulness of our approach for different textures, such as stochastic, semi‐structural and regular textures, with different levels of complexities. Our method produces visually appealing transformation sequences with no user interaction.     

Texture Particles

This paper presents an analytical extension of texture synthesis techniques based on the distribution of elementary texture components. Our approach is similar to the bombing, cellular, macrostructured and lapped textures techniques, but provides the user with more control on both the texture analysis and synthesis phases. Therefore, high quality results can be obtained for a large number of structured or stochastic textures (bricks, marble, lawn, etc.). The analysis consists in decomposing textures into elementary components — that we call ``texture particles'' — and for which we analyze their specific spatial arrangements. The synthesis then consists in recomposing similar textures directly on arbitrary surfaces by taking into account the previously computed arrangements, extended to 3D surfaces. Compared to ``pixel‐based'' analysis and synthesis methods, which have been recently generalized to arbitrary surfaces, our approach has three major advantages: (1) it is fast, which allows the user to interactively control the synthesis process. This further allows us to propose a large number of tools, granting a high degree of artistic freedom to the user. (2) It avoids the visual deterioration of the texture components by preserving their shapes as well as their spatial arrangements. (3) The texture particles can be not only images, but also 3D geometric elements, which extends significantly the domain of application.     

A unified framework for designing textures using energy optimization

A unified framework is proposed for designing textures using energy optimization and deformation. Our interactive scheme has the ability to globally change the visual properties of texture elements, and locally change texture elements with little user interaction. Given a small sample texture, the design process starts with applying a set of global deformation operations (rotation, translation, mirror, scale and flip) to the sample texture to obtain a set of deformed textures automatically. Then we further make the local deformation to the deformed textures interactively by replacing the local-texture elements regions from other textures. By utilizing the energy optimization method, interactive selections and deformations of local-texture elements are accomplished simply through indicating the positions of texture elements very roughly with a brush tool. Finally the deformed textures are further utilized to create large textures with the fast layer-based texture deformation algorithm, and the wavelet-based energy optimization. Our experimental results demonstrate that the proposed approach can help design a large variety of textures from a small example, change the locations of texture elements, increase or decrease the density of texture elements, and design cyclic marbling textures.     

Interactive texture design and synthesis from mesh sketches

Geometry mesh introduces user control into texture synthesis and editing, and brings more variations in the synthesized results. But still two problems related remain in need of better solutions. One problem is generating the meshes with desired size and pattern efficiently from easier user inputs. The other problem is improving the quality of synthesized results with mesh information. We present a new two-step texture design and synthesis method that addresses these two problems. Besides example texture, a small piece of mesh sketch drawn by hand or detected from example texture is input to our algorithm. And then a mesh synthesis method of geometry space is provided to avoid optimizations cell by cell. Distance and orientation features are introduced to improve the quality of mesh rasterization. Results show that with our method, users can design and synthesize textures from mesh sketches easily and interactively.     

Decorating surfaces with bidirectional texture functions

We present a system for decorating arbitrary surfaces with bidirectional texture functions (BTF). Our system generates BTFs in two steps. First, we automatically synthesize a BTF over the target surface from a given BTF sample. Then, we let the user interactively paint BTF patches onto the surface such that the painted patches seamlessly integrate with the background patterns. Our system is based on a patch-based texture synthesis approach known as quilting. We present a graphcut algorithm for BTF synthesis on surfaces and the algorithm works well for a wide variety of BTF samples, including those which present problems for existing algorithms. We also describe a graphcut texture painting algorithm for creating new surface imperfections (e.g., dirt, cracks, scratches) from existing imperfections found in input BTF samples. Using these algorithms, we can decorate surfaces with real-world textures that have spatially-variant reflectance, fine-scale geometry details, and surfaces imperfections. A particularly attractive feature of BTF painting is that it allows us to capture imperfections of real materials and paint them onto geometry models. We demonstrate the effectiveness of our system with examples.     

Texture evolution: 3D texture synthesis from single 2D growable texture pattern

An efficient model-independent 3D texture synthesis algorithm based on texture growing and texture turbulence is presented to create vivid 3D solid texture from a single 2D growable texture pattern. Given a 2D texture pattern of some growable material, our technique is able to create an anisotropic 3D volumetric texture cube to simulate the evolution of the material in 3D. An effective tiling scheme is designed to save computation and storage costs. Target objects are directly dipped into the synthesized 3D texture volume to generate creative, sculpture-like models that can be visualized with interactive speed. Our method is conceptually intuitive, computationally fast, and storage efficient compared with other solid texturing methods. As opposed to conventional 2D texture mapping work on polygonal surfaces, our approach is capable of decorating 3D point-rendering systems seamlessly. Furthermore, our combination of texture turbulence and texture growing techniques provides an attractive way to synthesize and tile natural 2D texture patterns, or generate simple but interesting motion textures.     

Dual Poisson-Disk Tiling: an efficient method for distributing features on arbitrary surfaces

This paper introduces a novel surface-modeling method to stochastically distribute features on arbitrary topological surfaces. The generated distribution of features follows the Poisson disk distribution, so we can have a minimum separation guarantee between features and avoid feature overlap. With the proposed method, we not only can interactively adjust and edit features with the help of the proposed Poisson disk map, but can also efficiently re-distribute features on object surfaces. The underlying mechanism is our dual tiling scheme, known as the Dual Poisson-Disk Tiling. First, we compute the dual of a given surface parameterization, and tile the dual surface by our specially-designed dual tiles; during the pre-processing, the Poisson disk distribution has been pre-generated on these tiles. By dual tiling, we can nicely avoid the problem of corner heterogeneity when tiling arbitrary parameterized surfaces, and can also reduce the tile set complexity. Furthermore, the dual tiling scheme is non-periodic, and we can also maintain a manageable tile set. To demonstrate the applicability of this technique, we explore a number of surface-modeling applications: pattern and shape distribution, bump-mapping, illustrative rendering, mold simulation, the modeling of separable features in texture and BTF, and the distribution of geometric textures in shell space.     

基于Wang Tiles的几何纹理合成

提出了一种基于Wang Tiles的几何纹理合成方法来在不同物体表面上即时地生成几何纹理.首先根据给定的几何纹理预计算出一组Wang Tiles,然后用这组Wang Tiles在不同的目标物体上即时生成新的几何纹理.尽管基于Wang Tiles的方法已经应用于图像纹理,但由于几何纹理采用了与图像纹理完全不同的表示方式,因此需要用完全不同的方法来处理.采用了基于约束的几何纹理合成技术自动生成几何纹理Wang Tiles,从而保证了生成的几何纹理Wang Tiles在所有排列下都能保持其几何连续性.与现有的方法相比,生成的几何纹理Wang Tiles可以重用到不同的目标物体上,同时占用的存储空间及计算量更小,速度更快.     

一种纹理特征分析与合成的方法

针对纹理合成中基本的 MRF 类模型在大尺度结构表达上的缺陷,提出了在纹理模式空间和素材空间内对纹元及其分布的新的描述框架:使用纹元基本形和特征向量表示纹元,使用特征纹理表示纹元分布状况.在此结构上进行素材合成,可以保留 MRF 类模型在素材合成上的优势.实验结果表明,对于结构性较强的纹理,文中方法可以得到更加接近纹理机制的合成结果和某些纹理合成特效.     

Transition Texture Synthesis

Synthesis of transition textures is essential for displaying visually acceptable appearances on a terrain. This investigation presents a modified method for synthesizing the transition texture to be tiled on a terrain. All transition pattern types are recognized for a number of input textures. The proposed modified patch-based sampling texture synthesis approach, using the extra feature map of the input source and target textures for patch matching, can synthesize any transition texture on a succession pattern by initializing the output texture using a portion of the source texture enclosed in a transition cut. The transition boundary is further enhanced to improve the visual effect by tracing out the integral texture elements. Either the Game of Life model or Wang tiles method are exploited to present a good-looking profile of successions on a terrain for tiling transition textures. Experimental results indicate that the proposed method requires few input textures, yet synthesizes numerous tileable transition textures, which are useful for obtaining a vivid appearance of a terrain.     

Real-Time Texture Synthesis Using s-Tile Set

This paper presents a novel method of generating a set of texture tiles from samples,which can be seamlessly tiled into arbitrary size textures in real-time.Compared to existing methods,our approach is simpler and more advantageous in eliminating visual seams that may exist in each tile of the existing methods,especially when the samples have elaborate features or distinct colors.Texture tiles generated by our approach can be regarded as single-colored tiles on each orthogonal direction border,which are easier for tiling and more suitable for sentence tiling.Experimental results demonstrate the feasibility and effectiveness of our approach.     

一种新的图像纹理表示方法

该文基于纹理元直方图导出了纹理的新表示方法,并根据正交镜像滤波器的小波变换能量的转换和量化来定义纹理元。此种,给出了数种小波纹理特征集的实验评价,此方法具有将Brodatz纹理分类的极好性能。同时还研究了数种考虑近似旋转不变性或比例不变性的变换。最后,引入了生成纹理直方图和形成二进制纹理集的特征空间的过程,而且纹理直方图和二进制纹理集的特征空间与颜色直方图是对称的。获得纹理的这些表示旨在为度量纹理的相似性和从图像中抽取纹理区域。     

Representing and Recognizing the Visual Appearance of Materials using Three-dimensional Textons

We study the recognition of surfaces made from different materials such as concrete, rug, marble, or leather on the basis of their textural appearance. Such natural textures arise from spatial variation of two surface attributes: (1) reflectance and (2) surface normal. In this paper, we provide a unified model to address both these aspects of natural texture. The main idea is to construct a vocabulary of prototype tiny surface patches with associated local geometric and photometric properties. We call these 3D textons. Examples might be ridges, grooves, spots or stripes or combinations thereof. Associated with each texton is an appearance vector, which characterizes the local irradiance distribution, represented as a set of linear Gaussian derivative filter outputs, under different lighting and viewing conditions.Given a large collection of images of different materials, a clustering approach is used to acquire a small (on the order of 100) 3D texton vocabulary. Given a few (1 to 4) images of any material, it can be characterized using these textons. We demonstrate the application of this representation for recognition of the material viewed under novel lighting and viewing conditions. We also illustrate how the 3D texton model can be used to predict the appearance of materials under novel conditions.     

带约束的基于样图地表纹理合成技术研究

在传统的视景仿真开发过程中,研究人员需要将海量的航空影像照片经过数字化等一系列处理变成可使用的地表纹理,映射在地形表面,生成地景数据库.此法耗费大量人力,而且地景库一经生成就不可再改变,真实性降低.提出一种新的地表纹理的生成方法,以随机生成的高度信息作为约束,不同的地表纹理单元作为样图,采用带约束的基于样图纹理合成算法合成出真实地表纹理图像.实验中,通过改变高程约束和对多种地表纹理进行组合,可以方便快速地合成高质量的二维地表纹理图像.提出的纹理合成的方法,为今后与数字地图相结合开发地景数据库,积累一定的经验.对提高视景数据库的真实性具有实际意义.     

A Randomized Approach for Patch-based Texture Synthesis using Wavelets

We present a wavelet‐based approach for selecting patches in patch‐based texture synthesis. We randomly select the first block that satisfies a minimum error criterion, computed from the wavelet coefficients (using 1D or 2D wavelets) for the overlapping region. We show that our wavelet‐based approach improves texture synthesis for samples where previous work fails, mainly textures with prominent aligned features. Also, it generates similar quality textures when compared against texture synthesis using feature maps with the advantage that our proposed method uses implicit edge information (since it is embedded in the wavelet coefficients) whereas feature maps rely explicitly on edge features. In previous work, the best patches are selected among all possible using a L2 norm on the RGB or grayscale pixel values of boundary zones. The L2 metric provides the raw pixel‐to‐pixel difference, disregarding relevant image structures — such as edges — that are relevant in the human visual system and therefore on synthesis of new textures.     

Dynamic texture segmentation based on deterministic partially self-avoiding walks

Recently there has been a considerable interest in dynamic textures due to the explosive growth of multimedia databases. In addition, dynamic texture appears in a wide range of videos, which makes it very important in applications concerning to model physical phenomena. Thus, dynamic textures have emerged as a new field of investigation that extends the static or spatial textures to the spatio-temporal domain. In this paper, we propose a novel approach for dynamic texture segmentation based on automata theory and k-means algorithm. In this approach, a feature vector is extracted for each pixel by applying deterministic partially self-avoiding walks on three orthogonal planes of the video. Then, these feature vectors are clustered by the well-known k-means algorithm. Although the k-means algorithm has shown interesting results, it only ensures its convergence to a local minimum, which affects the final result of segmentation. In order to overcome this drawback, we compare six methods of initialization of the k-means. The experimental results have demonstrated the effectiveness of our proposed approach compared to the state-of-the-art segmentation methods.     

Semi‐Stochastic Tilings for Example‐Based Texture Synthesis

We investigate semi‐stochastic tilings based on Wang or corner tiles for the real‐time synthesis of example‐based textures. In particular, we propose two new tiling approaches: (1) to replace stochastic tilings with pseudo‐random tilings based on the Halton low‐discrepancy sequence, and (2) to allow the controllable generation of tilings based on a user‐provided probability distribution. Our first method prevents local repetition of texture content as common with stochastic approaches and yields better results with smaller sets of utilized tiles. Our second method allows to directly influence the synthesis result which—in combination with an enhanced tile construction method that merges multiple source textures—extends synthesis tasks to globally‐varying textures. We show that both methods can be implemented very efficiently in connection with tile‐based texture mapping and also present a general rule that allows to significantly reduce resulting tile sets.     

模拟绘画的三维几何纹理生成研究

该文提出一种模拟绘画的三维几何纹理生成方法。该方法的主要思想如下：（1）对物体表面进行近似等距离分点；（2）假设在各分点处放置一个个小球，利用这些小球来获得物体表面的总体明暗信息；（3）建立各分点处画元的绘制模式；（4）在绘制阶段，利用所获得的光照信息和画元的绘制模式在各分点处绘制画元，以获得符合物体表面总体明暗调子的几何纹理；（5）在上述工作的基础上，通过对画元实施一系列操作来获得更为复杂的几何纹理。与传统方法相比，该文所给出的几何纹理生成技术具有对信息处理的同一性、可对画面信息进行离散处理、所生成的纹理更具立体感和速度快等特性。实验结果验证了方法的有效性。     

A new adaptive framework for unbiased orientation estimation in textured images

This paper focuses on directional texture analysis. We propose a new approach for orientation estimation. This approach hinges on two classes of convolution masks, i.e. the gradient and the valleyness operators. We provide a framework for their optimization regarding bias reduction and noise robustness.As the gradient and the valleyness operators are complementary, we propose a combination named GV-JOE. This combination consists in using the gradient on inflexion pixels, the valleyness on crests and valleys, and a linear mixture of both elsewhere. We implement an adaptive selection of the size of our operators, in order to take into account the variations of the texture scale in the image.We apply our approach both on synthetic and natural textures. These experiments show that, when used separately, both classes of operators are more accurate than classical derivative approaches. In noisy cases, the GV-JOE implementation improves the robustness of our operators without affecting their accuracy. Moreover, compared to well-known orientation estimators, it gives the best estimates in the most difficult cases i.e. for high-frequency textures and low SNR.     

统计纹理的自动表面检测*

提出了一种用于砂纸、铸件和许多工业材料中的随机纹理表面缺陷的自动检测的全局方法.该方法不依赖于纹理的局部特征,它应用傅里叶变换进行全局图像恢复.应用逆傅里叶变换去除任何统计纹理中的周期性、重复性结构.在恢复图像中,原图像中的同质区域灰度近似一致,而缺陷区域被明显地保留下来了.对不同实际统计纹理的实验结果表明了该方法的有效性.