article · 2007
Arbitrary Shape Wavelet Packet Image Processing
Zhuoer Shi, Zheng Bao, Licheng Jiao, Ieee Zheng Bao, Ieee Licheng Jiao, Senior Member, Senior Member
Cited by 0Abstract and details only
Abstract
Arbitrary-shape wavelet packet transform (ASWPT) is presented as an adjustment of the traditional quad-tree wavelet packet transform. The group normalization (GN) and softer logic masking (SLM) techniques are introduced for image restoration with optimal visual result and high PSNR. I. INTRODUCTION As an important development of wavelet theory, wavelet packet transform (WPT) [8, 10, 12, 14, 16] overcomes the drawbacks that high-frequency analysis tend to be less refined when the scale increases. Traditional WPT limited to quad-tree decomposition that the cost function is calculated and compared between each parent node and her/his one "quad-offspring" (namely, LL, HL, LH and HH) to truncate the "branches" and obtain the optimal tree structure. However, the quad-tree basis set is not large enough to obtain the "best basis". Egger and Li [5] developed an extension structure of wavelet coefficients, but the structure is fixed without additional freedom. We construct arbitrary shape wave...
Cite this paper
Shi, Z., Bao, Z., Jiao, L., Bao, I. Z., Jiao, I. L., Member, S., & Member, S. (2007). Arbitrary Shape Wavelet Packet Image Processing.
Shi, Zhuoer, et al. “Arbitrary Shape Wavelet Packet Image Processing.” 2007.
Shi, Zhuoer, Zheng Bao, Licheng Jiao, Ieee Zheng Bao, Ieee Licheng Jiao, Senior Member, and Senior Member. 2007. “Arbitrary Shape Wavelet Packet Image Processing.”
Shi, Z. et al. (2007) ‘Arbitrary Shape Wavelet Packet Image Processing’.
@article{shi2007arbitrary,
title = {{Arbitrary Shape Wavelet Packet Image Processing}},
author = {Shi, Zhuoer and Bao, Zheng and Jiao, Licheng and Bao, Ieee Zheng and Jiao, Ieee Licheng and Member, Senior and Member, Senior},
year = {2007}
}Made from the index record. Check names, capitalisation and page numbers against the paper. Need another style? AI for Research has over 10,000.