Name
Abstract | ||
|---|---|---|
In order to improve the speed of texture synthesis, we propose an improved synthesis algorithm according to the Image Quilting algorithm in this paper. In this algorithm, the L-overlap region is replaced by r-overlap region to reduce the amount of the pixels used to compute the error of Sum-of-Squared Differences SSD and to lower the calculation redundancy. Parallel calculation is adopted to search the best synthesis patch from texture sample image and make further improvement on the synthesis speed. In addition, the area used for looking for the minimal cost path is enlarged from one patch to more patches that belong to the same row to retain or improve the synthesis effect. The experiment results show the proposed method has faster synthesis speed and lower algorithm complexity than the Image Quilting algorithm. |
Year | DOI | Venue |
|---|---|---|
2015 | 10.1007/978-3-662-48247-6_10 | Transactions on Edutainment XI - Volume 8971 |
Keywords | Field | DocType |
feature map,rectangle-area texture,texture synthesis | Computer vision,Texture compression,Projective texture mapping,Pattern recognition,Computer science,Image texture,Algorithm,Artificial intelligence,Pixel,Texture synthesis,Texture filtering | Journal |
Volume | Issue | ISSN |
11 | 05 | 0302-9743 |
ISBN | Citations | PageRank |
978-3-662-48246-9 | 0 | 0.34 |
References | Authors | |
0 | 5 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Yuanyuan Pu | 1 | 0 | 2.37 |
| Dan Xu | 2 | 201 | 52.67 |
| Wenhua Qian | 3 | 2 | 6.11 |
| Yaqun Huang | 4 | 3 | 1.15 |
| Youyan Dan | 5 | 0 | 0.34 |