public class HaarWavelet extends LiftingSchemeBaseWavelet
HaarWavelet (flat LineWavelet) wavelet.
As with all Lifting scheme wavelet transform functions, the first stage of a transform step is the split stage. The split step moves the even element to the first half of an N element region and the odd elements to the second half of the N element region.
The Lifting Scheme version of the HaarWavelet transform uses a wavelet function (predict stage) that "predicts" that an odd element will have the same value as it preceeding even element. Stated another way, the odd element is "predicted" to be on a flat (zero slope LineWavelet) shared with the even point. The difference between this "prediction" and the actual odd value replaces the odd element.
The wavelet scaling function (a.k.a. smoothing function) used in the update stage calculates the average between an even and an odd element.
The merge stage at the end of the inverse transform interleaves odd and even elements from the two halves of the array (e.g., ordering them even0, odd0, even1, odd1, ...)
You may use this source code without limitation and without fee as long as you include:
This software was written and is copyrighted by Ian Kaplan, Bear Products International, www.bearcave.com, 2001.
This software is provided "as is", without any warrenty or claim as to its usefulness. Anyone who uses this source code uses it at their own risk. Nor is any support provided by Ian Kaplan and Bear Products International.
Please send any bug fixes or suggested source changes to:
iank@bearcave.com
| Constructor and Description |
|---|
HaarWavelet() |
| Modifier and Type | Method and Description |
|---|---|
void |
forwardTransOne(float[] vec) |
forwardTrans, inverseTrans