大尺寸纹理的实时合成
DOI:
作者:
作者单位:

作者简介:

通讯作者:

中图分类号:

基金项目:

Supported by National Natural Science Foundation of China under Grant Nos.60773026, 60873182, 60833007 (国家自然科学基金)


Real-Time Synthesis of Large Textures
Author:
Affiliation:

Fund Project:

  • 摘要
  • |
  • 图/表
  • |
  • 访问统计
  • |
  • 参考文献
  • |
  • 相似文献
  • |
  • 引证文献
  • |
  • 资源附件
  • |
  • 文章评论
    摘要:

    提出一种纹理合成方法,可实时高质量地生成大纹理.它先基于纹理特征变化的周期性分析,得到合适的纹理块尺寸,以使所划分的纹理块能高效反映这种周期性变化,便于生成高质量的纹理;然后,它在目标纹理上均衡地分布纹理块,使得垂直方向和水平方向上相邻的纹理块之间都留有一个块尺寸大小的空白区域,再对空白区域进行填充,以完成目标纹理的生成.显然,布块操作和填充操作均可并行地进行.同时,为每个纹理块预先生成可与其邻接匹配的纹理块集合,以便在填充计算时可用简便的集合求交计算来进行邻域约束的搜索,并将这种求交计算放在CPU中进行,而将邻接纹理块在重叠区域的缝合计算放到GPU中进行,以综合利用CPU和GPU的优势.实验表明,新方法可在一般微机上以45帧/秒的速度高质量地实时合成1024*1024的大纹理,而这是已有技术难以达到的.

    Abstract:

    This paper presents a novel technique for synthesizing large textures of high quality in real time. By analyzing the texture periodicity, patches in an optimized size are generated to well represent the variation of exemplar features. Then, during synthesizing, the paper first distributes patches on the output texture with a vacant region left between any pair of neighboring patches in every row and every column, where a vacant region is also in the same size as a patch. Thereafter, patches are selected to fill the vacant regions in the output texture. Obviously, both patch distributing and vacant region filling can be executed in parallel. To accelerate, for each patch, the paper constructs a set of matching patches that can be efficiently merged with the corresponding patch. The computation of patch selection for vacant regions, therefore, can be simplified into set intersection. Moreover, patch distribution and set intersection are performed on a CPU while patch stitching are executed on a GPU, to take advantage of both CPU and GPU. Experimental results show that the presented method is able to generate a high-quality texture in 1024*1024 pixels at over 45 frames per second, which is hard to achieve by existing techniques.

    参考文献
    相似文献
    引证文献
引用本文

陈 昕,王文成.大尺寸纹理的实时合成.软件学报,2009,20(zk):193-201

复制
分享
文章指标
  • 点击次数:
  • 下载次数:
  • HTML阅读次数:
  • 引用次数:
历史
  • 收稿日期:2009-05-15
  • 最后修改日期:2009-07-23
  • 录用日期:
  • 在线发布日期:
  • 出版日期:
您是第位访问者
版权所有:中国科学院软件研究所 京ICP备05046678号-3
地址:北京市海淀区中关村南四街4号,邮政编码:100190
电话:010-62562563 传真:010-62562533 Email:jos@iscas.ac.cn
技术支持:北京勤云科技发展有限公司

京公网安备 11040202500063号