The determination of critical-sampling scheme of preprocessing for multiwavelets decomposition as 1st and 2nd orders of approximations

Abstract EN

One of the important differences between multi wavelets and scalar wavelets is that each channel in the filter bank has a vector-valued input and a vector-valued output.

A scalar-valued input signal must somehow be converted into a suitable vector-valued signal.

This conversion is called preprocessing.

Preprocessing is a mapping process which is done by a profiler.

Apostfilter just does the opposite.

The most obvious way to get two input rows from a given signal is to repeat the signal.

Two rows go into the multifactor bank.

This procedure is called “Repeated Row” which introduces oversampling of the data by a factor of 2.

For data compression, where one is trying to find compact transform representations for a dataset, it is imperative to find critically sampled multi wavelet transforms schemes which this paper focuses on finding a simple and easy to follow algorithm for its computation.

One famous multi wavelet filter used here is the GHM filter proposed by Geronimo, Hadrian, and Massopust.

The GHM basis offers a combination of orthogonally, symmetry, and compact support, which cannot be achieved by any scalar wavelet basis.

Using a computer program for the proposed method, an example test on Lena image is verified which shows image properties after a single level decomposition and the reconstructed image after reconstruction.