arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1406.7338cs.GR
收藏

与阶数无关的纹理合成

Order-Independent Texture Synthesis

Li-Yi Wei, Marc Levoy

摘要:

基于搜索的纹理合成算法对纹理样本的生成顺序很敏感,不同的合成顺序会产生不同的纹理。不幸的是,大多数多边形光栅化器和光线跟踪器不能保证曲面的采样顺序。为了避免这个问题,纹理是预先合成在某一最大分辨率和渲染使用纹理映射。我们描述了一种基于搜索的纹理合成算法,其中可以以任意顺序生成样本,但所得到的纹理保持一致。我们的算法的关键是一个金字塔表示,其中每个纹理样本只依赖于一个固定数量的相邻样本在金字塔的每一级。金字塔的底部(粗)层由噪声图像组成,该噪声图像很小并且是预定的。当渲染器请求采样时,它所依赖的所有采样都会立即生成。使用这种方法,可以以任何顺序生成样本。为了使算法的效率,我们建议存储纹理样本和它们的依赖在一个金字塔缓存。虽然前几个采样的生成代价很高,但有大量的重用,因此后续采样的代价更低。幸运的是,大多数渲染算法都表现出良好的一致性,因此缓存重用率很高。

英文摘要:

Search-based texture synthesis algorithms are sensitive to the order in which texture samples are generated; different synthesis orders yield different textures. Unfortunately, most polygon rasterizers and ray tracers do not guarantee the order with which surfaces are sampled. To circumvent this problem, textures are synthesized beforehand at some maximum resolution and rendered using texture mapping. We describe a search-based texture synthesis algorithm in which samples can be generated in arbitrary order, yet the resulting texture remains identical. The key to our algorithm is a pyramidal representation in which each texture sample depends only on a fixed number of neighboring samples at each level of the pyramid. The bottom (coarsest) level of the pyramid consists of a noise image, which is small and predetermined. When a sample is requested by the renderer, all samples on which it depends are generated at once. Using this approach, samples can be generated in any order. To make the algorithm efficient, we propose storing texture samples and their dependents in a pyramidal cache. Although the first few samples are expensive to generate, there is substantial reuse, so subsequent samples cost less. Fortunately, most rendering algorithms exhibit good coherence, so cache reuse is high.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑