Published October 10, 2025 | Version v2

OGBT ( Orthogonalized Adaptive Gabor Basis for Energy Compaction in Two-Dimensional Block Transforms)

Description

Orthogonalized Adaptive Gabor Basis for Energy Compaction in Two-Dimensional Block Transforms

Author :

DR. NANIA Francesco Antonio, Italy, Terme V.re (ME)

mail : miadebora@hotmai.lit

I. Academic Preface and Transform Rationale

This manuscript formally derives the mathematical foundation of an optimized N×N block transform, designated the Orthogonalized Gabor Block Transform (OGBT). The use of Gabor functions in signal processing is motivated by their optimal joint spatial-frequency localization [1]. The central objective is the synthesis of an orthonormal basis that exploits these characteristics, overcoming the limitations of the naturally non-orthogonal Gabor family [2]. By systematically enforcing orthogonality via the Gram-Schmidt procedure, we maximize the energy compaction ratio of the transform coefficients, a critical requirement for high-efficiency data compression schemes [3].

The analysis is based on a block size N=8, leveraging the parameters σ=4.0 (Gabor window variance) and fmax=1.0 (maximum normalized frequency).

 

II. Mathematical Synthesis of the Transform Basis

 

Let B be the image block (BRN×N), and let T be the resulting one-dimensional (1D) orthonormal transform matrix (TRN×N).

A. The Gaussian Localization Window

The normalized Gaussian window samples w[k] are given by:

(Formula 1 - Finestra Gaussiana)

w[k]=exp(2σ2(kc)2)

where k{0,,N1} and c=(N1)/2.

B. Initial Gabor Basis Generation

The AC basis vectors, for n{1,,N1}, are formally defined as:

(Formula 2 - Componenti AC della Base)

T[n,k]=w[k]cos(2πfnN1k)

where the DC component is T[0,k]=1/sqrt(N).

C. Orthogonalization via Gram-Schmidt

The normalized vector tiortho is derived iteratively for i=1,,N1, using the Modified Gram-Schmidt procedure [4].

(Formula 3 - Gram-Schmidt)

tiorto=norm(tisumj=0i1((titjorto)tjorto))tisumj=0i1((titjorto)tjorto)

 

III. Two-Dimensional Transform Formulation

 

The 2D OGBT operates on the block B using the separable approach.

A. Forward Two-Dimensional OGBT

The coefficient matrix C is obtained through the double application of the 1D transform:

(Formula 4 - Trasformata Diretta Matrice)

C=TBTT

The generic coefficient C[i,j] is expressed via the double summation:

(Formula 5 - Trasformata Diretta Somma)

C[i,j]=sumk=0N1(suml=0N1(T[i,k]B[k,l]T[j,l]))

B. Inverse Two-Dimensional OGBT

Due to the orthonormality property (T−1=TT), the inverse transform, which reconstructs the block R, is:

(Formula 6 - Trasformata Inversa Matrice)

R=TTCT

The generic reconstructed element R[i,j] is formally written as:

(Formula 7 - Trasformata Inversa Somma)

R[i,j]=sumk=0N1(suml=0N1(T[k,i]C[k,l]T[l,j]))

This property ensures perfect reconstruction in the absence of quantization, adhering to Parseval's theorem for energy conservation [3].

 

IV. References

 

[1] D. Gabor, "Theory of communication," Journal of the Institution of Electrical Engineers - Part III: Radio and Communication Engineering, vol. 93, no. 26, pp. 429-457, Nov. 1946.

[2] H. G. Feichtinger and T. Strohmer, Gabor Analysis and Algorithms: Theory and Applications. Boston, MA, USA: Birkhäuser, 1998.

[3] A. K. Jain, Fundamentals of Digital Image Processing. Englewood Cliffs, NJ, USA: Prentice-Hall, 1989.

[4] G. H. Golub and C. F. Van Loan, Matrix Computations, 4th ed. Baltimore, MD, USA: Johns Hopkins University Press, 2013.

Files

OGBT.pdf

Files (146.8 kB)

Name Size Download all
md5:98b0277fe117959977c83a4f84a3a205
146.8 kB Preview Download