Tree-based wavelets for image coding: Orthogonalization and tree selection
Authors:
- 1 May 2009
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1-4
Abstract
In this work we consider the design of the lifting filters and trees used in a separable tree-based wavelet transform. We first consider the use of improved prediction filters, optimized to represent more efficiently smooth signals for arbitrary tree structures. We then consider the design of update filters that are orthogonal to neighboring prediction operators. While the corresponding decomposition is not fully orthogonal, near orthogonality between prediction and update operators leads to significant improvements in energy compaction. Finally we consider the design of trees that (i) avoid filtering across discontinuities in an image to reduce the amount of high frequency energy, while (ii) maintaining some regularity in the downsampled grids over multiple levels of decomposition in order to achieve good spatial localization of filtering.Keywords
This publication has 7 references indexed in Scilit:
- Optimized distributed 2D transforms for irregularly sampled sensor network grids using wavelet lifting2008
- Comopact image representation using wavelet lifting along arbitrary trees2008
- Directionlets: anisotropic multidirectional representation with separable filteringIEEE Transactions on Image Processing, 2006
- An architecture for distributed wavelet analysis and processing in sensor networks2006
- Surface compression with geometric bandelets2005
- Sparse geometric image representations with bandeletsIEEE Transactions on Image Processing, 2005
- Boundary filters for finite-length signals and time-varying filter banksIEEE Transactions on Circuits and Systems II: Analog and Digital Signal Processing, 1995