ACM Home Page
Please provide us with feedback. Feedback
Fast texture synthesis using tree-structured vector quantization
Full text PdfPdf (4.61 MB)
Source International Conference on Computer Graphics and Interactive Techniques archive
Proceedings of the 27th annual conference on Computer graphics and interactive techniques table of contents
Pages: 479 - 488  
Year of Publication: 2000
ISBN:1-58113-208-5
Authors
Li-Yi Wei  Stanford University, Gates Computer Science Building, Stanford, CA
Marc Levoy  Stanford University, Gates Computer Science Building, Stanford, CA
Sponsor
SIGGRAPH: ACM Special Interest Group on Computer Graphics and Interactive Techniques
Publisher
ACM Press/Addison-Wesley Publishing Co.  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 24,   Downloads (12 Months): 209,   Citation Count: 145
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/344779.345009
What is a DOI?

ABSTRACT

Texture synthesis is important for many applications in computer graphics, vision, and image processing. However, it remains difficult to design an algorithm that is both efficient and capable of generating high quality results. In this paper, we present an efficient algorithm for realistic texture synthesis. The algorithm is easy to use and requires only a sample texture as input. It generates textures with perceived quality equal to or better than those produced by previous techniques, but runs two orders of magnitude faster. This permits us to apply texture synthesis to problems where it has traditionally been considered impractical. In particular, we have applied it to constrained synthesis for image editing and temporal texture generation. Our algorithm is derived from Markov Random Field texture models and generates textures through a deterministic searching process. We accelerate this synthesis process using tree-structured vector quantization.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

1
 
2
R Brodatz. Textures: A Photographic Album for Artists and Designers. Dover, New York, 1966.
3
 
4
 
5
 
6
 
7
 
8
R. Haralick. Statistical image texture analysis. In Handbook of Pattern Recognition and image Processing, volume 86, pages 247-279. Academic Press, 1986.
9
10
 
11
 
12
13
 
14
 
15
T. Malzbender and S. Spach. A context sensitive texture nib. In Proceedings of Computer Graphics international, pages 151-163, June 1993.
 
16
MIT Media Lab. Vision texture, http://www-white.media.mit.edu/vismod/- imagery/VisionTexture/vistex.html.
 
17
 
18
R. Paget and I. Longstaff. Texture synthesis via a noncausal nonparametric multiscale Markov random field. IEEE Transactions on image Processing, 7(6):925- 931, June 1998.
 
19
 
20
K. Popat and R. Picard. Novel cluster-based probability model for texture synthesis, classification, and compression. In Visual Communications and image Processing, pages 756-68, 1993.
21
 
22
E. Simoncelli and J. Portilla. Texture characterization via joint statistics of wavelet coefficient magnitudes. In Fifth international Conference on image Processing, volume 1, pages 62-66, Oct. 1998.
23
 
24
M. Szummer and R. W. Picard. Temporal texture modeling. In international Conference on image Processing, volume 3, pages 823-6, Sep 1996.
 
25
26
27
 
28

CITED BY  145