运用局部纹理映射加速曲面纹理合成

基于样图的纹理合成方法能够在网格曲面上合成高质量纹理,但合成速度有待进一步提高,对此提出一种运用局部纹理映射加速曲面纹理合成的算法.首先以三角形法向量、切向矢量与纹理尺度为约束,将三角网格曲面分割为一系列映射区与合成区;然后用基于块的平面纹理合成方法生成大面积样图,用调和映射方法对映射区进行纹理映射;最后采用基于三角块的合成方法生成合成区纹理.实验结果表明,该算法对一般的随机性纹理与半结构性纹理具有很高的合成质量,能够控制纹理方向与尺度的变化.由于大部分三角形的纹理通过局部纹理映射得到,仅需要合成少数三角形的纹理,纹理合成过程得到大幅度地加速.     

基于三角块的曲面纹理合成

根据曲面网格上的切向矢量场,采用广度优先搜索策略从样本纹理空间中为每个三角面片映射纹理面片,直至完全覆盖整个网格．在搜索和映射过程中,首先使网格上相邻三角面片的纹理有最小的匹配误差;然后对相邻的三角面片纹理使用图的分割方法拼接纹理,得到曲面上连续的合成纹理;最后压缩存储合成的三角面片纹理．该算法适用于多种类型的样本纹理和任意的三角化曲面．     

基于三角网格模型的局部纹理映射

局部纹理映射可以增添三维模型的局部细节,加强模型的真实感。为了实现对三维模型的局部特征描写,增强局部纹理映射的用户可交互性,提出一种基于区域增长和平面投影的方法来实现三角网格模型的局部纹理映射。区域增长是以指定的三角面片为初始种子面片,搜索与种子面片共顶点的增长规则扩散出待映射区域。算法不仅保证了选取区域的完整性,不会出现缺角的情况;同时用户可以改变待映射区域的位置和大小。采用平面投影法对待映射区域进行纹理映射,将三维顶点投影到基准平面上,建立二维坐标系与纹理坐标系的关系,从而确定三维顶点和纹理坐标的对应关系。算法成功应用于实验,表明该方法的可行性。     

空间各向异性肝动脉体纹理合成方法研究

针对空间上具有各向异性的体纹理,提出一种基于样本的体纹理合成方法,把二维情况下基于二维纹理样本块的粘贴技术扩展至三维,应用到构建好的肝动脉模型。根据用户在四面体网格上定义的张量场,以四面体为合成单元,粘贴各向异性的三维纹理样本块。实验结果与理论分析表明,该方法可以在任意三维区域根据用户的交互合成预期的纹理效果,且能够较好地模拟肝动脉的内部结构,实现切割的实时可视化。     

VR技术下多投影视频纹理合成方法仿真

为解决纹理合成过程需要消耗大量时空资源的问题,提出一种VR技术下多投影视频纹理合成方法.设计以VR内容制作环节为核心的VR视频处理,经过拼接、投影映射与投影图像帧纹理合成生成一个封装帧,通过服务器显示在客户端.针对VR视频内三维平面或曲面场景,通过屏幕投影将三维场景透视变换投影至二维平面上.赋予二维平面上的三角网格一个连续的缩放因子场,将给定纹理缩放成不同等级,令其与网格上的缩放因子相对应.采用曲面纹理合成方法,利用矢量加平滑方法确定曲面内各三角面片的纹理方向矢量场,根据这些纹理方向合成纹理;依照扫描线顺序搜索样本纹理空间,确定对匹配的纹理坐标,结合缩放因子实现纹理合成.仿真结果表明,上述方法纹理合成用时与对比方法相比下降300％以上,存储空间与对比方法相比节省50％以上.     

三角网格曲面纹理合成技术研究

纹理合成是真实感图形绘制中重要的技术.对由三角网格组成的曲面模型,提出了一种基于表面三角块矢量场的纹理合成方法.首先用矢量加平滑方法来计算曲面上每个三角块上的纹理方向矢量,并根据这些纹理方向来合成纹理;然后在样本纹理空间按扫描线顺序搜索样本纹理空间,找出最匹配的纹理坐标;算法用队列作为存取结构,并且结果保存在队列中,达...     

大规模地貌场景的实时纹理合成

提出一种新的高效的大规模三维地貌纹理合成方法。把三维地貌场景进行透视变换投影到平面上,对这些平面上的三角网格赋一个连续的缩放因子场,把给定的纹理缩放成很多级别,使得可以和网格上的缩放因子相对应,按二维平面三角面片纹理合成的思想进行合成。实验表明,该方法在不拉伸纹理的同时能够达到实时,取得良好的视觉合成效果。     

尺寸自适应的T-Tile三维纹理合成

以Wang Tiles纹理合成算法思想为基础,提出一种新的三维网格纹理合成算法。首先,分析给定的样本纹理,得到适当的纹理块尺寸,根据该尺寸从样本纹理中选取3个菱形纹理块,生成T-Tile初始框架;其次,从样本纹理中提取与T-Tile初始框架尺寸相同的纹理块作为替代纹理块,与初始框架完全重叠放置,制作T-Tile;最后,调整给定的三角网格模型为等边三角形网格模型,按照T-Tile边界颜色匹配的原则进行三角形面片的纹理合成。实验结果表明,该算法能够以较快的速度进行纹理合成,达到了实时纹理合成的效果,同时也可以得到较高的纹理合成质量。     

基于三角剖分的人脸纹理映射

采用通用的三维人脸模型和任意的人脸纹理图像,基于Delaunay三角剖分,提出了一种灵活的3D人脸的纹理映射方法。该方法对人脸特征点集做三角剖分,在纹理图像和三维网格之间建立了一个准确的拓扑同构映射关系,从而得到高真实度的纹理映射。该算法不受网格调整精度的影响,同时适用于不同的纹理映射到同一三维人脸模型上。     

基于特征约束点的纹理映射算法

纹理映射技术用于生成物体表面的纹理细节,是真实感图形技术的重要组成部分,也是计算机图形学的一个重要研究方向.针对目前很多纹理映射算法计算量大,方法比较复杂的缺点,应用Candide3作为三维网格模型,提出了一种快速有效的基于特征约束点的纹理映射算法.通过在三维网格模型和纹理图像上选取少量对应的特征约束点,利用三角网格剖分算法在纹理图像上建立选取特征点的三角网格.进而通过求取质心坐标的方法计算出三维网格模型上所有特征点的纹理坐标并完成整个三维网格模型的纹理映射.实验结果表明,提出的算法计算速度较快,能够得到高真实度的纹理映射效果,并且适用于不同纹理图像映射到同一三维网格模型上.     

曲面渐变纹理合成中重采样问题研究

在渐变纹理合成过程中,纹理尺度和方向的变化需要不断对原样图进行重采样。为避免不断重采样对纹理合成速度的影响,在基于块合成方法的基础上,以线性函数作为纹理尺度的过渡函数,在二维空间生成渐变纹理,将二维渐变纹理作为新的样本,利用矢量场控制曲面纹理合成,采用灰度图像辅助合成,以避免纹元破裂。实验结果表明,该方法对自然界中大多数纹理进行合成时能取得较好的效果,能保持纹理的视觉连续性,合成效率较高。     

保相似的网格参数化

网格参数化是数字几何处理中的重要问题,而三角网格又是典型的一种网格表示形式。为能够快速求解三角网格的平面参数化,同时减少参数化带来的三角形的扭曲,提出了一种保持形状相似的三角网格平面参数化方法—保相似参数化,该方法使得参数化后的网格的相邻两边夹角和长度比例在最小二乘意义下整体上保持不变,从而建立对应三角形的相似性。通过三角形的相邻两条边的夹角和两边的比例值建立线性方程组,在给定初始条件后可以快速地求解该线性方程组,从而得到参数化后的平面网格。该方法也适用于添加任何线性约束条件,而且整个算法是线性的。与现有的一些方法相比,该算法几何意义直观,操作简便。实例表明,该方法可以得到较好的参数化结果,非常适合于纹理映射等计算机图形学的应用。     

Polynomial surfaces interpolating arbitrary triangulations

Triangular Bezier patches are an important tool for defining smooth surfaces over arbitrary triangular meshes. The previously introduced 4-split method interpolates the vertices of a 2-manifold triangle mesh by a set of tangent plane continuous triangular Bezier patches of degree five. The resulting surface has an explicit closed form representation and is defined locally. In this paper, we introduce a new method for visually smooth interpolation of arbitrary triangle meshes based on a regular 4-split of the domain triangles. Ensuring tangent plane continuity of the surface is not enough for producing an overall fair shape. Interpolation of irregular control-polygons, be that in 1D or in 2D, often yields unwanted undulations. Note that this undulation problem is not particular to parametric interpolation, but also occurs with interpolatory subdivision surfaces. Our new method avoids unwanted undulations by relaxing the constraint of the first derivatives at the input mesh vertices: The tangent directions of the boundary curves at the mesh vertices are now completely free. Irregular triangulations can be handled much better in the sense that unwanted undulations due to flat triangles in the mesh are now avoided.     

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.     

基于纹理约束和参数化运动模型的光流估计

提出了一种基于局部小平面运动的光流估计新方法。目的是获得精确致密的光流估计结果。与以往采用亮度一致性区域作为假设平面的算法不同，本算法利用序列图像的纹理信息，在纹理分割区域的基础上，进行运动估计。该算法首先通过微分法计算粗光流，可以得到参数化光流模型的初始估计，然后通过区域迭代算法，调整初始估计，从而得到精细的平面分割及其对应的参数化光流模型。基于纹理信息的部分拟合算法被用于算法的每一步当中，保证了纹理边缘位置的光流估计值的准确性。实验采用了标准图像序列，结果表明，可以得到更为精细的光流估计结果，特别是对于那些有着丰富纹理信息的室外环境的图像序列，而且在运动边界处的结果改善尤为明显。     

复用计算的虚拟肝脏体纹理合成与映射方法

虚拟手术中器官纹理能够给用户直观反映,加强临场感和操作感。研究在虚拟肝脏手术中纹理的表现技术,先合成体纹理空间,把二维情况下基于复用计算的纹理合成技术进行改进,扩展至三维空间中进行体纹理块分布并着色;同时计算每个三角面片内部点集并着色,以此增加纹理的真实感;切割肝脏体能看到内部纹理。实验结果表明,该方法能够生成具有高度真实感以及同样本体纹理相似的三维纹理,且合成速度能够满足虚拟手术要求。     

Diffusion equations over arbitrary triangulated surfaces for filtering and texture applications

In computer graphics, triangular mesh representations of surfaces have become very popular. Compared with parametric and implicit forms of surfaces, triangular mesh surfaces have many advantages, such as easy to render, convenient to store and the ability to model geometric objects with arbitrary topology. In this paper, we are interested in data processing over triangular mesh surfaces through PDEs (partial differential equations). We study several diffusion equations over triangular mesh surfaces, and present corresponding numerical schemes to solve them. Our methods work for triangular mesh surfaces with arbitrary geometry (the angles of each triangle are arbitrary) and topology (open meshes or closed meshes of arbitrary genus). Besides the flexibility, our methods are efficient due to the implicit/semi-implicit time discretization. We finally apply our methods to several filtering and texture applications such as image processing, texture generating and regularization of harmonic maps over triangular mesh surfaces. The results demonstrate the flexibility and effectiveness of our methods.     

Constrained Texture Mapping using Image Warping

We introduce in this paper a new method for smooth foldover-free warping of images. It allows users to specify the constraints in two different ways: positional constraints to constrain the position of points in the image and gradient constraints to constrain the orientation and scaling of some parts of the image. We then show how our method is used for texture mapping with hard constraints. We start with an unconstrained planar embedding of the target mesh calculated with conventional methods. In order to obtain a mapping that satisfies the user-defined constraints, we use our warping method to align the features of the texture image with those of the unconstrained embedding. Compared to previous work, our method generates a smoother texture mapping and offers higher level of control for defining the constraints.     

Adaptive Surface Texture Synthesis Using Round‐Shaped Neighbourhoods

This paper presents a novel surface texture synthesis method, which is capable of producing high‐quality results by performing the synthesis within an effective multi‐resolution scheme using an adaptive texture similarity metric. Compared with related works, our method allows us to directly carry out multi‐resolution synthesis without involving complicated operations such as mesh hierarchy and partitioning on the target surface. Also, the adaptive similarity metric focuses on measuring texture properties at different scales ranging from local to global, allowing for consistency within differently‐sized texture structures. Further, with the introduced round shaped neighbourhoods, we can save considerable amount of computation for the surface texture synthesis over variable texture directions. Experimental results are provided and comparisons are made against other latest works.     

任意平面域上内部特征约束的变密度三角化方法

基于Delaunay三角化方法和前沿生成方法，给出了具有任意内部特征的平面域变密度三角形网格生成方法，针对不同的内部特征，可任意设定其网格尺寸，通过加权平均，有效地控制网格的尺寸变化，最终实现了网格的疏密光滑过渡。