Surface compression with geometric bandelets
ACM SIGGRAPH 2005 Papers
On the importance of combining wavelet-based nonlinear approximation with coding strategies
IEEE Transactions on Information Theory
The JPEG2000 still image coding system: an overview
IEEE Transactions on Consumer Electronics
Adaptive polyphase subband decomposition structures for image compression
IEEE Transactions on Image Processing
Nonlinear wavelet transforms for image coding via lifting
IEEE Transactions on Image Processing
Design of signal-adapted multidimensional lifting scheme for lossy coding
IEEE Transactions on Image Processing
A 2-D orientation-adaptive prediction filter in lifting structures for image coding
IEEE Transactions on Image Processing
Directionlets: anisotropic multidirectional representation with separable filtering
IEEE Transactions on Image Processing
Curved wavelet transform for image coding
IEEE Transactions on Image Processing
| Hi-index | 0.00 |
The introduction of lifting implementations for image wavelet decomposition generated possibilities of several applications and several adaptive decomposition variations. The prediction step of a lifting stage constitutes the interesting part of the decomposition since it aims to reduce the energy of one of the decomposition bands by making predictions using the other decomposition band. In that aspect, more successful predictions yield better efficiency in terms of reduced energy in the lower band. In this work, we present a prediction filter whose prediction domain pixels are selected adaptively according to the local edge characteristics of the image. By judicuously selecting the prediction domain from pixels that are expected to have closer relation to the estimated pixel, the prediction error signal energy is reduced. In order to keep the adaptation rule symmetric for the encoder and the decoder sides, lossless compression applications are examined. Experimental results show that the proposed algorithm provides good compression results. Furthermore, the edge calculation is computationally inexpensive and comparable to the famous Daubechies 5/3 lifting implementation.