Synthesis of tiled patterns using factor graphs
暂无分享,去创建一个
Pat Hanrahan | Matthew Fisher | Lingfeng Yang | Yi-Ting Yeh | Katherine Breeden | P. Hanrahan | Matthew Fisher | K. Breeden | Lingfeng Yang | Yi-Ting Yeh
[1] Pascal Müller,et al. Procedural modeling of cities , 2001, SIGGRAPH.
[2] Anton Alstes. Wang Tiles for Image and Texture Generation , 2004 .
[3] S. Walker. Invited comment on the paper "Slice Sampling" by Radford Neal , 2003 .
[4] Sung Yong Shin,et al. On pixel-based texture synthesis by non-parametric sampling , 2006, Comput. Graph..
[5] Pedro M. Domingos,et al. Sound and Efficient Inference with Probabilistic and Deterministic Dependencies , 2006, AAAI.
[6] M. Paskin. Maximum-Entropy Probabilistic Logics , 2001 .
[7] Alexei A. Efros,et al. Image quilting for texture synthesis and transfer , 2001, SIGGRAPH.
[8] H. Seidel,et al. A connection between partial symmetry and inverse procedural modeling , 2010, ACM Trans. Graph..
[9] Ares Lagae,et al. Tile-based methods for interactive applications , 2008, SIGGRAPH '08.
[10] W. K. Hastings,et al. Monte Carlo Sampling Methods Using Markov Chains and Their Applications , 1970 .
[11] Radford M. Neal. Slice Sampling , 2003, The Annals of Statistics.
[12] Song-Chun Zhu,et al. Filters, Random Fields and Maximum Entropy (FRAME): Towards a Unified Theory for Texture Modeling , 1998, International Journal of Computer Vision.
[13] Przemyslaw Prusinkiewicz,et al. The Algorithmic Beauty of Plants , 1990, The Virtual Laboratory.
[14] Irfan A. Essa,et al. Graphcut textures: image and video synthesis using graph cuts , 2003, ACM Trans. Graph..
[15] Brendan J. Frey,et al. Factor graphs and the sum-product algorithm , 2001, IEEE Trans. Inf. Theory.
[16] H.-A. Loeliger,et al. An introduction to factor graphs , 2004, IEEE Signal Process. Mag..
[17] William T. Freeman,et al. A probabilistic image jigsaw puzzle solver , 2010, 2010 IEEE Computer Society Conference on Computer Vision and Pattern Recognition.
[18] Marc Levoy,et al. Fast texture synthesis using tree-structured vector quantization , 2000, SIGGRAPH.
[19] Ian P. Gent,et al. Minion: A Fast Scalable Constraint Solver , 2006, ECAI.
[20] A. Sokal,et al. Generalization of the Fortuin-Kasteleyn-Swendsen-Wang representation and Monte Carlo algorithm. , 1988, Physical review. D, Particles and fields.
[21] Paul Merrell,et al. Example-based model synthesis , 2007, SI3D.
[22] David Salesin,et al. Computer-generated floral ornament , 1998, SIGGRAPH.
[23] Shiri Gordon,et al. An efficient image similarity measure based on approximations of KL-divergence between two gaussian mixtures , 2003, Proceedings Ninth IEEE International Conference on Computer Vision.
[24] Michael Ashikhmin,et al. Synthesizing natural textures , 2001, I3D '01.
[25] Linda C. van der Gaag,et al. Probabilistic Graphical Models , 2014, Lecture Notes in Computer Science.
[26] Colen Campbell. Vitruvius Britannicus : the classic of eighteenth-century British architecture , 2007 .
[27] Bart Selman,et al. Towards Efficient Sampling: Exploiting Random Walk Strategies , 2004, AAAI.
[28] Makoto Yokoo,et al. Why Adding More Constraints Makes a Problem Easier for Hill-climbing Algorithms: Analyzing Landscapes of CSPs , 1997, CP.
[29] Sylvain Lefebvre,et al. State of the Art in Example-based Texture Synthesis , 2009, Eurographics.
[30] Antonietta Mira,et al. On the use of auxiliary variables in Markov chain Monte Carlo sampling , 1997 .
[31] John Hart,et al. ACM Transactions on Graphics , 2004, SIGGRAPH 2004.
[32] Luc Van Gool,et al. Procedural modeling of buildings , 2006, SIGGRAPH 2006.