File Download
There are no files associated with this item.
Supplementary
-
Citations:
- Scopus: 0
- Appears in Collections:
Conference Paper: Fast texture synthesis using tree-structured vector quantization
Title | Fast texture synthesis using tree-structured vector quantization |
---|---|
Authors | |
Keywords | Compression algorithms Image processing Texture synthesis |
Issue Date | 2000 |
Citation | Proceedings Of The Acm Siggraph Conference On Computer Graphics, 2000, p. 479-488 How to Cite? |
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. |
Persistent Identifier | http://hdl.handle.net/10722/141806 |
References |
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Wei, LY | en_HK |
dc.contributor.author | Levoy, M | en_HK |
dc.date.accessioned | 2011-09-27T03:02:15Z | - |
dc.date.available | 2011-09-27T03:02:15Z | - |
dc.date.issued | 2000 | en_HK |
dc.identifier.citation | Proceedings Of The Acm Siggraph Conference On Computer Graphics, 2000, p. 479-488 | en_HK |
dc.identifier.uri | http://hdl.handle.net/10722/141806 | - |
dc.description.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. | en_HK |
dc.language | eng | en_US |
dc.relation.ispartof | Proceedings of the ACM SIGGRAPH Conference on Computer Graphics | en_HK |
dc.subject | Compression algorithms | en_HK |
dc.subject | Image processing | en_HK |
dc.subject | Texture synthesis | en_HK |
dc.title | Fast texture synthesis using tree-structured vector quantization | en_HK |
dc.type | Conference_Paper | en_HK |
dc.identifier.email | Wei, LY:lywei@cs.hku.hk | en_HK |
dc.identifier.authority | Wei, LY=rp01528 | en_HK |
dc.description.nature | link_to_subscribed_fulltext | en_US |
dc.identifier.scopus | eid_2-s2.0-0034448271 | en_HK |
dc.relation.references | http://www.scopus.com/mlt/select.url?eid=2-s2.0-0034448271&selection=ref&src=s&origin=recordpage | en_HK |
dc.identifier.spage | 479 | en_HK |
dc.identifier.epage | 488 | en_HK |
dc.identifier.scopusauthorid | Wei, LY=14523963300 | en_HK |
dc.identifier.scopusauthorid | Levoy, M=6701783695 | en_HK |