A new texture synthesis algorithm based on wavelet packet tree (Q1954638): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claim: author (P16): Item:Q277795
Set OpenAlex properties.
 
(6 intermediate revisions by 6 users not shown)
Property / author
 
Property / author: Carlo Cattani / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q58911413 / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: Steerable pyramid / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1155/2012/305384 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2064277523 / rank
 
Normal rank

Latest revision as of 11:51, 23 April 2024

scientific article
Language Label Description Also known as
English
A new texture synthesis algorithm based on wavelet packet tree
scientific article

    Statements

    A new texture synthesis algorithm based on wavelet packet tree (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    11 June 2013
    0 references
    Summary: We present an efficient texture synthesis based on wavelet packet tree (TSWPT). It has the advantage of using a multiresolution representation with a greater diversity of bases functions for the nonlinear time series applications such as fractal images. The input image is decomposed into wavelet packet coefficients, which are rearranged and organized to form hierarchical trees called wavelet packet trees. A 2-step matching, that is, coarse matching based on low-frequency wavelet packet coefficients followed by fine matching based on middle-high-frequency wavelet packet coefficients, is proposed for texture synthesis. Experimental results show that the TSWPT algorithm is preferable, especially in terms of computation time.
    0 references
    0 references
    0 references
    0 references