scholarly journals Compression of 3-D echocardiographic images using a modified 3-D set-partitioning-in-hierarchical-trees algorithm based on a 3-D wavelet packet transform

2006 ◽  
Vol 15 (2) ◽  
pp. 023016
Author(s):  
Neil L. Greenberg
2013 ◽  
Vol 2013 ◽  
pp. 1-8
Author(s):  
Ying-Shen Juang ◽  
Hsi-Chin Hsin ◽  
Tze-Yun Sung ◽  
Carlo Cattani

Wavelet packet transform known as a substantial extension of wavelet transform has drawn a lot of attention to visual applications. In this paper, we advocate using adaptive wavelet packet transform for texture synthesis. The adaptive wavelet packet coefficients of an image are organized into hierarchical trees called adaptive wavelet packet trees, based on which an efficient algorithm has been proposed to speed up the synthesis process, from the low-frequency tree nodes representing the global characteristics of textures to the high-frequency tree nodes representing the local details. Experimental results show that the texture synthesis in the adaptive wavelet packet trees (TSIAWPT) algorithm is suitable for a variety of textures and is preferable in terms of computation time.


2011 ◽  
Vol 2011 ◽  
pp. 1-16
Author(s):  
Omid Ghahabi ◽  
Mohammad Hassan Savoji

A fast, efficient, and scalable algorithm is proposed, in this paper, for re-encoding of perceptually quantized wavelet-packet transform (WPT) coefficients of audio and high quality speech and is called “adaptive variable degree- zero-trees” (AVDZ). The quantization process is carried out by taking into account some basic perceptual considerations and achieves good subjective quality with low complexity. The performance of the proposed AVDZ algorithm is compared with two other zero-tree-based schemes comprising (1) embedded zero-tree wavelet (EZW) and (2) the set partitioning in hierarchical trees (SPIHT). Since EZW and SPIHT are designed for image compression, some modifications are incorporated in these schemes for their better matching to audio signals. It is shown that the proposed modifications can improve their performance by about 15–25%. Furthermore, it is concluded that the proposed AVDZ algorithm outperforms these modified versions in terms of both output average bit-rates and computation times.


2017 ◽  
Vol 229 (3) ◽  
pp. 1275-1295 ◽  
Author(s):  
N. Jamia ◽  
P. Rajendran ◽  
S. El-Borgi ◽  
M. I. Friswell

2007 ◽  
Vol 46 (15) ◽  
pp. 5152-5158 ◽  
Author(s):  
J. Jay Liu ◽  
Daeyoun Kim ◽  
Chonghun Han

Sign in / Sign up

Export Citation Format

Share Document