Ramanarayanan Ganesh, Bala Kavita
Department of Computer Science, Cornell University, Ithaca, NY 14853, USA.
IEEE Trans Vis Comput Graph. 2007 Jan-Feb;13(1):167-78. doi: 10.1109/TVCG.2007.4.
This paper describes CMS (constrained minimization synthesis), a fast, robust texture synthesis algorithm that creates output textures while satisfying constraints. We show that constrained texture synthesis can be posed in a principled way as an energy minimization problem that requires balancing two measures of quality: constraint satisfaction and texture seamlessness. We then present an efficient algorithm for finding good solutions to this problem using an adaptation of graphcut energy minimization. CMS is particularly well suited to detail synthesis, the process of adding high-resolution detail to low-resolution images. It also supports the full Image Analogies framework, while providing superior image quality and performance. CMS is easily extended to handle multiple constraints on a single output, thus enabling novel applications that combine both user-specified and image-based control.
本文介绍了CMS（约束最小化合成），一种快速、稳健的纹理合成算法，该算法在满足约束条件的同时创建输出纹理。我们表明，约束纹理合成可以以一种有原则的方式被表述为一个能量最小化问题，这需要平衡两种质量度量：约束满足度和纹理无缝性。然后，我们提出一种高效算法，通过改编图割能量最小化方法来找到该问题的良好解决方案。CMS特别适合细节合成，即向低分辨率图像添加高分辨率细节的过程。它还支持完整的图像类比框架，同时提供卓越的图像质量和性能。CMS很容易扩展以处理对单个输出的多个约束，从而实现结合用户指定控制和基于图像控制的新颖应用。
