Please use this identifier to cite or link to this item:
|Title: ||Fast wavelet transform domain texture synthesis|
|Authors: ||Wickramanayake, Dhammike S.|
Edirisinghe, Eran A.
Bez, Helmut E.
|Keywords: ||Texture synthesis|
|Issue Date: ||2004|
|Publisher: ||© 2004 SPIE|
|Citation: ||WICKRAMANAYAKE, D.S., EDIRISINGHE, E.A. and BEZ, H.E., 2004. Fast wavelet transform domain texture synthesis. IN: Panchanathan, S. and Vasudev, B. (eds.), Visual Communications and Image Processing 2004, Proc. of SPIE-IS&T Electronic Imaging, 5308, 979, 10pp.|
|Abstract: ||Block based texture synthesis algorithms have shown better results than others as they help to preserve the global
structure. Previous research has proposed several approaches in the pixel domain, but little effort has been taken in the
synthesis of texture in a multiresolution domain. We propose a multiresolution framework in which coefficient-blocks of
the spatio-frequency components of the input texture are efficiently stitched together to form the corresponding
components of the output texture. We propose two algorithms to this effect. In the first, we use a constant block size
throughout the algorithm. In the second, we adaptively split blocks so as to use the largest possible block size in order to
preserve the global structure, while maintaining the mismatched error of the overlapped boundaries below a certain error
tolerance. Special consideration is given to minimization of the computational cost, throughout the algorithm designs.
We show that the adaptation of the multiresolution approach results in a fast, cost-effective, flexible texture synthesis
algorithm that is capable of being used in modern, bandwidth-adaptive, real-time imaging applications. A collection of
regular and stochastic test textures is used to prove the effectiveness of the proposed algorithm.|
|Description: ||Copyright 2004 Society of Photo-Optical Instrumentation Engineers. One print or electronic copy may be made for personal use only. Systematic electronic or print reproduction and distribution, duplication of any material in this paper for a fee or for commercial purposes, or modification of the content of the paper are prohibited. This paper can also be found at: http://dx.doi.org/10.1117/12.526801|
|Appears in Collections:||Conference Papers and Presentations (Computer Science)|
Files associated with this item:
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.