 | ||
Generalized lifting scheme was developed by Joel Solé and Philippe Salembier and published in Joel's PhD Thesis. It is based on classical lifting scheme and generalizes it breaking out a restriction hidden in the scheme structure. Classical lifting scheme has three kind of operations.
Contents
- Lazy wavelet transform splits signal
f j [ n ] in two new signals: the odd samples signal denoted byf j o [ n ] and the even samples signal denoted byf j e [ n ] . - Prediction step its objective is compute a prediction for the odd samples, based on the even samples (or vice versa). This prediction is subtracted from the odd samples creating an error signal
g j + 1 [ n ] . - Update step This step recalibrates the low frequency branch with some of the energy removed during subsampling. In the case of classical Lifting, this is used in order to "prepare" the signal for the next prediction step. It uses the predicted odd samples
g j + 1 [ n ] to prepare the even onesf j e [ n ] (or vice versa). This update is subtracted from the even samples producing the signal denoted byf j + 1 [ n ] .
The scheme is invertible due to the structure of itself. In the receiver the update step is computed first. Its result is added to the even samples. After that, it's possible to compute exactly the same prediction and add it to the odd samples. In order to recover the original signal, we have to invert the Lazy Wavelet Transform. Generalized lifting scheme has the same three kind of operations. However this scheme avoids the addition-subtraction restriction that offered Classical Lifting. That fact has some consequences. For example, the design of all steps must guarantee the scheme invertibility (not guaranteed if the addition-subtraction restriction is avoided).
Definition
Generalized lifting scheme is a dyadic transform that follows these rules:
- Deinterleaves the input into a stream of even-numbered samples and another stream of odd-numbered samples. This is sometimes referred to as a Lazy Wavelet Transform.
- Computes a Prediction Mapping. This step tries to predict odd samples taking into account the even ones (or vice versa). This a mapping from the space of the samples in
f j e [ n ] to the space of the samples ing j + 1 [ n ] . In this case the samples (fromf j e [ n ] ) chosen to be the reference forf j o [ n ] are called the context. It could be expressed as:g j + 1 [ n ] = P ( f j o [ n ] ; f j e [ n ] ) - Computes an Update Mapping. This step tries to update the even samples taking into account the odd predicted samples. It would be a kind of preparation for the next prediction step, if any. It could be expressed:
f j + 1 [ n ] = U ( f j e [ n ] ; g j + 1 [ n ] )
Obviously, these mappings cannot be any functions. In order to guarantee the invertibility of the scheme itself, all mappings involved in the transform must be invertible. In case that mappings arise and arrive on finite sets (discrete bounded value signals), this condition is equivalent to saying that mappings are injective (one-to-one). Moreover, if a mapping goes from one set to a set of the same cardinality, it should be bijective.
In the Generalized Lifting Scheme the addition/subtraction restriction is avoided by including this step in the mapping. In this way the Classical Lifting Scheme is generalized.
Design
Some designs have been developed for the prediction-step mapping. The update-step design has not been considered as thoroughly, because it remains to be answered how exactly the update step is useful. The main application of this technique is image compression. There some interesting references such as, and.