Název: | A Non-Hierarchical Procedure for Re-Synthesis of Complex Textures |
Autoři: | Harrison, Paul |
Citace zdrojového dokumentu: | WSCG '2001: Conference proceedings: The 9-th International Conference in Central Europe on Computer Graphics, Visualization and Computer Vision 2001: University of West Bohemia, Plzen, Czech Republic, February 5.-9., 2001, p. 190-197. |
Datum vydání: | 2001 |
Nakladatel: | University of West Bohemia |
Typ dokumentu: | konferenční příspěvek conferenceObject |
URI: | http://wscg.zcu.cz/wscg2001/Papers_2001/R285.pdf http://hdl.handle.net/11025/11269 |
ISBN: | 80-7082-713-0 |
ISSN: | 1213-6972 |
Klíčová slova: | syntéza textur;manipulace s obrazem |
Klíčová slova v dalším jazyce: | texture synthesis;image manipulation |
Abstrakt: | A procedure is described for synthesizing an image with the same texture as a given input image. To achieve this, the output image is built up by successively adding pixels selected from the input image. Pixels are chosen by searching the input image for patches that closely match pixels already present in the output image. It is shown that the accurate reproduction of features in the input texture depends on the order in which pixels are added to the output image. A procedure for selecting an ordering which transfers large complex features of the input to the output image is described. This procedure is capable of reproducing large features even if only the interactions of nearby pixels are considered. The procedure can be altered to allow speci cation of the placement of particular features in the output texture. Several applications of this are described. |
Práva: | © University of West Bohemia |
Vyskytuje se v kolekcích: | WSCG '2001: Conference proceedings |
Soubory připojené k záznamu:
Soubor | Popis | Velikost | Formát | |
---|---|---|---|---|
Harrison.pdf | Plný text | 710,88 kB | Adobe PDF | Zobrazit/otevřít |
Použijte tento identifikátor k citaci nebo jako odkaz na tento záznam:
http://hdl.handle.net/11025/11269
Všechny záznamy v DSpace jsou chráněny autorskými právy, všechna práva vyhrazena.