Elsevier

Digital Signal Processing

Volume 51, April 2016, Pages 202-222
Digital Signal Processing

A biorthogonal wavelet design technique using Karhunen–Loéve transform approximation

https://doi.org/10.1016/j.dsp.2015.06.002Get rights and content

Abstract

The lifting style biorthogonal wavelet implementation has a nice property of enabling flexible design; it is immediately reversible and has a simple relation to subband filters. In this work, we present a method to design prediction (P) and update (U) filters of two-channel lifting structures by minimising the difference between Block Wavelet Transform (BWT) matrix of the wavelet and the Karhunen–Loéve Transform (KLT) of a stochastic process with certain autocorrelation. Here, BWTs are transform matrices that are generated by constructing columns through balanced wavelet trees fed by shifted impulse trains. Although wavelets already have fast implementations through subband filtering or lifting, parametric optimisation of the filter coefficients is still possible through indirectly mimicking the corresponding wavelet and a class of signals with certain KLT. This paper describes the above optimisation by putting constraints on the P and U filters for regularity and constructing the filter coefficients in a least-squares sense. In this part of the paper, the iterated orthogonality constraint over the BWT is resolved with a generalised 12k+1-tap/6k+1-tap P / U construction with numerical results for the 4×4 and 8×8 BWT cases. Experimental approximation to several KLT cases with numerical results in terms of filter coefficients, their spectral behaviour, compaction gain, etc. are provided.

Section snippets

Nomenclature

  • Matrices are notated by bold-face upper-case letters (i.e. X).

  • Vectors are notated by a bold-face lower-case letters (i.e. x).

  • Sizes of some matrices are indicated on the top-right of the matrix name (i.e. X2×2).

  • Coefficients of the matrix (e.g. X) are shown with a lower-case letter having subscripts that stand for the matrix index coordinates (e.g. X=[xi,j]i,j=1,,N).

  • (ζ)ξ stands for ζ(modξ). Such modulo operations may even exist in index subscripts or superscripts.

  • For a vector x[i]=[x0,x1,x2,xn]T

DAUB5/3 wavelet

The prediction and update filters of daub5/3 wavelet are P(z)=0.5(1+z) and U(z)=0.25(1+z1), respectively [10]. This particular wavelet produces orthogonal 2×2 and 4×4 BWTs. However, the condition in Equation (B.21) is violated for the 8×8 case. These BWT matrices of daub5/3 areAdaub5/32×2=(121211)Adaub5/34×4=(141414141010010112121212)Adaub5/38×8=(181818181818181834140143414014014341401434141201201201200120120120121201211201211211201211201414141414141414)

CRF13/7 wavelet

The crf13/7

Wavelets which develop circulant and orthogonal submatrices: X00, X01 and X10

The prediction and update filters of a particular biorthogonal wavelet example, where the corresponding BWT matrices become orthogonal, are given below:P13/7(z)=12(z11+z+z2)U13/7(z)=14(z1+z1+z2) The corresponding 2×2, 4×4 and 8×8 BWT matrices (which all happen to be orthogonal) areA13/72×2=(121211)A13/74×4=(1414141412121212111112121212)A13/78×8=(18181818181818181414141414141414121212121212121214141414141414141212121212121212111111111212121212121212141414141

Approximating a block wavelet transform matrix to a Karhunen–Loéve transform matrix

KLT is a transform matrix that minimises the reconstruction error between the signal in its original form and the one that is reconstructed from a “restricted” set of basis signals: ε[n]=x[n]x˜[n], where the signal and its basis-restricted versions are:x[n]=y1e1[n]+y2e2[n]++ymem[n]+ym+1em+1[n]++ynen[n]x˜[n]=y1e1[n]+y2e2[n]++ymem[n]

The minimisation of the squared-error yields a set of basis signals (ei[n]) as the eigenvectors of the autocorrelation matrix R corresponding to the signal, x[n].

Numerical results and discussion

In this research, 16 test images were used (out of which, 4 are deliberately constructed to contain different autocorrelation characteristics, 2 by using Canny edge detection over Lena and Mandrill images, and another 2 by taking frame differences of from Foreman and Bus video sequences). First, we consider the detailed case study of the Lena image and illustrate all the numerical steps during the 4×4 BWT approximation (in Section 4.1 and its subsections). Then we present results for the

Conclusions

In this research, a signal specific methodology to design lifting wavelets at certain sizes (5/3 for the 4×4 case and 13/7 for the 8×8 case) is presented. On the road, the dependence of 2k+1×2k+1 BWT matrix to the 2k×2k BWT matrix using k-level lifting decomposition structure is discovered. With this dependency relationship, our method provided a recursion to achieve the BWT of a k+1-level lifting decomposition structure using only a k-level lifting scheme, while keeping the orthogonality

Mehmet Cemil Kale received his Ph.D. from the Ohio State University, Ohio, USA, in 2008. During his Ph.D., he was a Graduate Research Associate at the Department of Radiology and the Department of Electrical and Computer Engineering. Currently, he is an assistant professor at the Osmangazi University, Eskisehir, Turkey. His research interests include wavelet design.

References (17)

  • W. Sweldens

    The lifting scheme: a custom-design construction of biorthogonal wavelets

    Appl. Comput. Harmon. Anal.

    (1996)
  • I. Daubechies

    Ten Lectures on Wavelets

    (1992)
  • M. Vetterli et al.

    Wavelets and Subband Coding

    (1995)
  • G. Battle

    A block spin construction of ondelettes. Part I: Lemarie functions

    Commun. Math. Phys.

    (1987)
  • I. Daubechies

    Orthonormal bases for compactly supported wavelets

    Commun. Pure Appl. Math.

    (1988)
  • G. Battle

    A block spin construction of ondelettes. Part II: the QFT connection

    Commun. Math. Phys.

    (1988)
  • S. Mallat

    Multiresolution approximations and wavelet orthonormal bases of L2(R)

    Trans. Am. Math. Soc.

    (1989)
  • A. Cohen et al.

    Biorthogonal bases of compactly supported wavelets

    Commun. Pure Appl. Math.

    (1992)
There are more references available in the full text version of this article.

Cited by (6)

Mehmet Cemil Kale received his Ph.D. from the Ohio State University, Ohio, USA, in 2008. During his Ph.D., he was a Graduate Research Associate at the Department of Radiology and the Department of Electrical and Computer Engineering. Currently, he is an assistant professor at the Osmangazi University, Eskisehir, Turkey. His research interests include wavelet design.

Gizem Atac received his B.S. from Bilecik University, Turkey, in 2015. During her undergraduate studies, she spent several months at the Anadolu University as a researcher under the supervision of Dr. Ömer Nezih Gerek. Her research interests include scientific computation for signal processing applications and neural network designs.

Ömer Nezih Gerek received his Ph.D. from Bilkent University, Turkey, in 1998. During his Ph.D., he spent a semester at the University of Minnesota as a researcher. From 1998 to 1999, he was a Technical Researcher at the Swiss Federal Institute of Technology, Lausanne. Currently, he is a full professor at the Anadolu University, Department of Electrical and Electronics Engineering, Eskisehir, Turkey. Prof. Gerek is a member of TUBITAK (Turkish Scientific and Technological Research Council) EE-CS management committee. He is an IEEE senior member, and is serving in the editorial boards of Elsevier: DSP and TUBITAK: TJEECS. His research interests include signal and image processing and analysis.

View full text