Please use this identifier to cite or link to this item: https://scholarbank.nus.edu.sg/handle/10635/161096
Title: Wavelet packet decomposition for the SPIHT
Authors: NIU YAN
Keywords: Wavelets, Wavelet packet transform, Set partitioning in hierarchical trees, Image coding
Issue Date: 25-Mar-2005
Citation: NIU YAN (2005-03-25). Wavelet packet decomposition for the SPIHT. ScholarBank@NUS Repository.
Abstract: 

THIS THESIS CONTRIBUTES AN INNOVATIVE COMBINATION OF THE STATE-OF-THE-ART IMAGE CODING ALGORITHM SET PARTITIONING IN HIERARCHICAL TREES (SPIHT) AND THE WAVELET PACKET TRANSFORM (WPT), WHICH SIGNIFICANTLY IMPROVES THE CODING EFFICIENCY OF THE SPIHT ALGORITHM.

AIMING AT IMPROVING SPIHT BY MERELY A SLIGHT MODIFICATION, THE WPT AND THE SPIHT ARE MATCHED IN A NOVEL WAY. THE NEW METHOD PUTS EMPHASIS ON AVOIDING THE PARENTAL-CONFLICTS PROBLEM. FIRSTLY, THE SUBBAND STRUCTURE OF THE WPT IS THOROUGHLY STUDIED, AND ONLY THE TRANSFORMS WITH THE CROSS SUBBAND SIMILARITY ARE CONSIDERED AS THE CANDIDATES. SECONDLY, AMONG THESE CANDIDATES, THE BEST TRANSFORM IS SELECTED, IN THE SENSE THAT THE ENERGY IS CONCENTRATED TO THE FEWEST TREES (THE BASIC DATA STRUCTURE OF SPIHT); TO ACCOMPLISH THE SELECTION, A PROPER COST FUNCTION IS PROVIDED TO MEASURE THE ENERGY CONCENTRATION ABILITY, AND A FAST SEARCHING ALGORITHM IS PROPOSED TO GOVERN THE SELECTION. IN THIS WAY, THE SELECTED WPT GUARANTEES HIGH

URI: https://scholarbank.nus.edu.sg/handle/10635/161096
Appears in Collections:Master's Theses (Open)

Show full item record
Files in This Item:
File Description SizeFormatAccess SettingsVersion 
thesis.pdf5.11 MBAdobe PDF

OPEN

NoneView/Download

Page view(s)

2
checked on Jan 16, 2020

Google ScholarTM

Check


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.