Institutional Repository
| An iterated randomized search algorithm for large-scale texture synthesis and manipulations | |
| Hao, CY; Chen, YD; Wu, W; Wu, EH | |
| 2015 | |
| Source | VISUAL COMPUTER
 |
| ISSN | 0178-2789 |
| Volume | 31Issue:11Pages:1447-1458 |
| English Abstract | In this paper, we introduce a novel iterated random search method for large-scale texture synthesis and manipulations. Previous researches on texture synthesis and manipulation have reached a great achievement both on quality and performance. However, the cost of the popular exhaustive search-based methods is still high especially for large-scale and complex synthesis scenes. Our algorithm contributes great improvements on performances about 2-50 times over the typical patch-based synthesis methods. Texture patterns have been well-known formalized as a Markov Random Field (MRF) whose two hypotheses, stationarity and locality, drive our bold guess that a random sampling may just catch a good match and allows us to propagate the natural coherence in the neighborhood. Meanwhile, the iteration constantly updates the bad guesses to make our algorithm converge fast with the results in the state of the art. We also provide a simple theoretical analysis to compare our iterated randomized search model and the classical synthesis algorithms. Besides, this simple method turns out to work well in various applications as well, such as texture transfer, image completion and video synthesis.; In this paper, we introduce a novel iterated random search method for large-scale texture synthesis and manipulations. Previous researches on texture synthesis and manipulation have reached a great achievement both on quality and performance. However, the cost of the popular exhaustive search-based methods is still high especially for large-scale and complex synthesis scenes. Our algorithm contributes great improvements on performances about 2-50 times over the typical patch-based synthesis methods. Texture patterns have been well-known formalized as a Markov Random Field (MRF) whose two hypotheses, stationarity and locality, drive our bold guess that a random sampling may just catch a good match and allows us to propagate the natural coherence in the neighborhood. Meanwhile, the iteration constantly updates the bad guesses to make our algorithm converge fast with the results in the state of the art. We also provide a simple theoretical analysis to compare our iterated randomized search model and the classical synthesis algorithms. Besides, this simple method turns out to work well in various applications as well, such as texture transfer, image completion and video synthesis. |
| Indexed Type | SCI |
| Keyword | Texture Synthesis Coherent Propagation Random Search Texture Transfer Approximate Match Patch |
| Department | Univ Macau, FST, Macau, Peoples R China. Chinese Acad Sci, Inst Software, State Key Lab CS, Beijing, Peoples R China. |
| Language | 英语 |
| WOS ID | WOS:000362680600002 |
| Citation statistics | |
| Content Type | 期刊论文 |
| URI | http://ir.iscas.ac.cn/handle/311060/17432 |
| Collection | 中国科学院软件研究所 |
| Recommended Citation GB/T 7714 | Hao, CY,Chen, YD,Wu, W,et al. An iterated randomized search algorithm for large-scale texture synthesis and manipulations[J]. VISUAL COMPUTER,2015,31(11):1447-1458. |
| APA | Hao, CY,Chen, YD,Wu, W,&Wu, EH.(2015).An iterated randomized search algorithm for large-scale texture synthesis and manipulations.VISUAL COMPUTER,31(11),1447-1458. |
| MLA | Hao, CY,et al."An iterated randomized search algorithm for large-scale texture synthesis and manipulations".VISUAL COMPUTER 31.11(2015):1447-1458. |
| Files in This Item: | There are no files associated with this item. | |||||
Items in the repository are protected by copyright, with all rights reserved, unless otherwise indicated.
Edit Comment