Computer-generated floral ornament
Proceedings of the 25th annual conference on Computer graphics and interactive techniques
Filters, Random Fields and Maximum Entropy (FRAME): Towards a Unified Theory for Texture Modeling
International Journal of Computer Vision
Fast texture synthesis using tree-structured vector quantization
Proceedings of the 27th annual conference on Computer graphics and interactive techniques
I3D '01 Proceedings of the 2001 symposium on Interactive 3D graphics
Proceedings of the 28th annual conference on Computer graphics and interactive techniques
Image quilting for texture synthesis and transfer
Proceedings of the 28th annual conference on Computer graphics and interactive techniques
Texture Synthesis by Non-Parametric Sampling
ICCV '99 Proceedings of the International Conference on Computer Vision-Volume 2 - Volume 2
Graphcut textures: image and video synthesis using graph cuts
ACM SIGGRAPH 2003 Papers
Wang Tiles for image and texture generation
ACM SIGGRAPH 2003 Papers
ICCV '03 Proceedings of the Ninth IEEE International Conference on Computer Vision - Volume 2
Procedural modeling of buildings
ACM SIGGRAPH 2006 Papers
Proceedings of the 2007 symposium on Interactive 3D graphics and games
Tile-based methods for interactive applications
ACM SIGGRAPH 2008 classes
MINION: A Fast, Scalable, Constraint Solver
Proceedings of the 2006 conference on ECAI 2006: 17th European Conference on Artificial Intelligence August 29 -- September 1, 2006, Riva del Garda, Italy
Towards efficient sampling: exploiting random walk strategies
AAAI'04 Proceedings of the 19th national conference on Artifical intelligence
Sound and efficient inference with probabilistic and deterministic dependencies
AAAI'06 Proceedings of the 21st national conference on Artificial intelligence - Volume 1
A connection between partial symmetry and inverse procedural modeling
ACM SIGGRAPH 2010 papers
Probabilistic Graphical Models: Principles and Techniques - Adaptive Computation and Machine Learning
Factor graphs and the sum-product algorithm
IEEE Transactions on Information Theory
Probabilistic color-by-numbers: suggesting pattern colorizations using factor graphs
ACM Transactions on Graphics (TOG) - SIGGRAPH 2013 Conference Proceedings
Structure-aware shape processing
SIGGRAPH Asia 2013 Courses
Hi-index | 0.00 |
Patterns with pleasing structure are common in art, video games, and virtual worlds. We describe a method for synthesizing new patterns of tiles on a regular grid that are similar in appearance to a set of example patterns. Exemplars are used both to specify valid tile arrangements and to emphasize multi-tile structures. We model a pattern as a probabilistic graphical model called a factor graph. Factors represent the hard logical constraints between tiles, the soft statistical relationships that determine style, and the local dependencies between tiles at neighboring sites. We describe a simple method for learning factor functions from a small exemplar. We then synthesize new patterns through a stochastic search method that is inspired by MC-SAT. Efficient synthesis is challenging because of the combination of hard and soft constraints. Our synthesis algorithm, called BlockSS, scales linearly with the number of tiles and the hardness of the problem. We use our technique to model building facades, cities, and decorative patterns.