基于Ashikhmin和Kong纹理合成算法的改进方法  

Improved method based on Ashikhmin and Kong texture synthesis algorithms

作　　者：余永胜[1] 顾耀林[1] 

机构地区：[1]江南大学信息工程学院,江苏无锡214122

出　　处：《计算机工程与设计》2007年第2期395-396,399,共3页Computer Engineering and Design

摘　　要：Ashikhmin和Kong等人分别于2001年和2002年提出的纹理合成算法是当今典型的两种纹理合成算法,虽然前者对大部分自然纹理合成有不错的效果,但对变化较平缓的纹理合成效果不佳,而后者在合成时的时间复杂度较高。在上述两种算法的基础上,结合其优点,提出了一种把搜索范围限制在当前块的邻域的新的合成算法,并取得了理想的效果。The texture synthesis algorithms of Ashikhmin and Kong, which were presented in 2001 and 2003, are two typical texture synthesis algorithms at present. Although the Ashikhmin algorithm has perfect effect in most natural textures, it has less use in the texture of slow moving, the Kong algorithm has a long time complexity. A new texture synthesis algorithm, which gain perfect effect based on the two present algorithms＇ merit by limiting the searching space to the neighborhood of the current patch is presented.

关 键 词：纹理合成 邻域大小 距离函数 最近邻搜索 纹理混合 

分 类 号：TP391.42[自动化与计算机技术—计算机应用技术]