Orthogonal Matrix Image Transformation (OMIT)

• OMIT is a framework using orthogonal matrices for image and tensor mapping that preserves energy and ensures exact invertibility.
• It decomposes images into orthonormal basis images, redistributing energy across coefficients to enable effective compression and feature extraction.
• Recent approaches integrate learnable orthogonal transforms into low-rank tensor models, enhancing reconstruction quality in inverse imaging problems.

Orthogonal Matrix Image Transformation (OMIT) is a synthesized designation for image and tensor mappings implemented by orthogonal matrices, together with the associated orthonormal basis-image or transform-domain factorization. In its classical 2-D form, an image $F$ is mapped as $G = U^\top F V$ and inverted as $F = U G V^\top$; in multidimensional settings, a tensor $\mathcal{X}$ can be transformed along a chosen mode by an orthogonal matrix $Q$, as in $$\mathcal{T}_Q(\mathcal{X}) = \mathcal{X} \times_3 Q$$. Across the literature, this framework appears in several guises: basis-image decompositions and block operators for digital arrays (Gorbachev et al., 2019), constructive synthesis of discrete orthogonal transform matrices from symmetric sample sets (Chan et al., 2021), orthogonal low-complexity DCT approximations for image compression (Cintra et al., 2014), and learnable orthogonal transforms for low-rank tensor inverse problems (Wang et al., 2024).

1. Algebraic definition and orthogonality

The defining property of OMIT is orthogonality. A real square matrix $U$ or $Q$ is orthogonal if $U U^\top = I$ or $Q^\top Q = I$. In 1-D, the corresponding transform pair is

$G = U^\top F V$0

In 2-D, for an image $G = U^\top F V$1 and orthogonal matrices $G = U^\top F V$2, $G = U^\top F V$3,

$G = U^\top F V$4

In the square separable case emphasized in the basis-image literature, $G = U^\top F V$5 and $G = U^\top F V$6, yielding $G = U^\top F V$7 and $G = U^\top F V$8 (Gorbachev et al., 2019).

Orthogonality implies exact invertibility and norm preservation. For vectors, $G = U^\top F V$9; for images, the analogous preserved quantity is the Frobenius norm. This is the algebraic basis for interpreting OMIT as an energy-preserving image transformation rather than merely a change of coordinates (Gorbachev et al., 2019).

The same structure extends naturally to tensors. For a 3-way tensor $F = U G V^\top$0, the learned orthogonal-transform form used in low-rank inverse problems applies

$F = U G V^\top$1

Because $F = U G V^\top$2 is orthogonal, inversion is immediate through $F = U G V^\top$3, and the transform remains linear, differentiable, and invertible (Wang et al., 2024).

2. Basis images, decomposition, and data scattering

A central classical interpretation of OMIT is the basis-image decomposition. Let $F = U G V^\top$4 denote column $F = U G V^\top$5 of $F = U G V^\top$6. The basis images are defined by the outer products

$F = U G V^\top$7

Then the image admits the orthonormal expansion

$F = U G V^\top$8

with Frobenius inner product $F = U G V^\top$9. In the rectangular case with distinct $\mathcal{X}$0 and $\mathcal{X}$1, the separable basis images become $\mathcal{X}$2 and the same decomposition principle applies (Gorbachev et al., 2019).

These basis images are orthonormal: $\mathcal{X}$3 Consequently,

$\mathcal{X}$4

which is the Parseval-type energy identity for the basis-image domain. The completeness relations

$\mathcal{X}$5

show that the set $\mathcal{X}$6 spans the full matrix space (Gorbachev et al., 2019).

The paper on basis images describes orthogonal transforms as performing data scattering, meaning pixel energy redistribution across transform coefficients. In 1-D, each input component contributes to all transform coefficients through the entries of the orthogonal matrix. In 2-D, this redistribution occurs over the coefficient matrix $\mathcal{X}$7 or, equivalently, over the basis-image coefficients $\mathcal{X}$8. Energy is preserved globally, but its distribution depends on the chosen transform. The same source notes that DCT, WHT, and KLT tend to compact energy for natural images, whereas DST does not (Gorbachev et al., 2019).

A further extension uses a block matrix $\mathcal{X}$9 whose entries are basis images, enabling orthogonal transforms of block vectors whose components are themselves matrices. In that block formalism,

$Q$0

and the resulting transformed components can become non-separable even when the original block components are separable. The extraction identity

$Q$1

formalizes a correlation-producing property of the transform that was used to motivate a frequency-domain watermarking detection scheme recoverable from a single spatial block projection (Gorbachev et al., 2019).

3. Constructing orthogonal transform matrices

OMIT is not restricted to pre-existing transforms such as DCT or WHT. One line of work gives a constructive method for generating an $Q$2 orthogonal matrix $Q$3 directly from a symmetric discrete sample set, without discretizing continuous orthogonal functions. For $Q$4, one selects $Q$5 distinct positive values $Q$6 and uses the symmetric grid $Q$7. Two polynomial families are then constructed: even polynomials $Q$8 containing only even powers and odd polynomials $Q$9 containing only odd powers. Symmetry ensures that cross-parity terms cancel, while same-parity terms are enforced to be orthogonal on the half-grid. The coefficients are obtained iteratively from linear systems $$\mathcal{T}_Q(\mathcal{X}) = \mathcal{X} \times_3 Q$$0 and $$\mathcal{T}_Q(\mathcal{X}) = \mathcal{X} \times_3 Q$$1, and the resulting polynomials are normalized so that $$\mathcal{T}_Q(\mathcal{X}) = \mathcal{X} \times_3 Q$$2 (Chan et al., 2021).

The construction has a proof of existence and uniqueness by induction, with $$\mathcal{T}_Q(\mathcal{X}) = \mathcal{X} \times_3 Q$$3 and $$\mathcal{T}_Q(\mathcal{X}) = \mathcal{X} \times_3 Q$$4 for all required degrees. The assembled matrix $$\mathcal{T}_Q(\mathcal{X}) = \mathcal{X} \times_3 Q$$5 is formed by evaluating the normalized polynomials on the symmetric grid, using parity to fill the negative and positive halves efficiently. In this framework, the DCT-II arises by choosing

$$\mathcal{T}_Q(\mathcal{X}) = \mathcal{X} \times_3 Q$$6

while the DTT arises from an evenly spaced arithmetic sequence on $$\mathcal{T}_Q(\mathcal{X}) = \mathcal{X} \times_3 Q$$7; the same method also generates valid custom transforms from triangular numbers, primes, or Fibonacci values (Chan et al., 2021).

A different construction targets low-complexity compression rather than generic synthesis. The orthogonal 8-point DCT approximation defines an integer sign/zero matrix

$$\mathcal{T}_Q(\mathcal{X}) = \mathcal{X} \times_3 Q$$8

from the exact DCT matrix $$\mathcal{T}_Q(\mathcal{X}) = \mathcal{X} \times_3 Q$$9, then orthogonalizes it via

$U$0

where $U$1 is diagonal and chosen so that $U$2. The rows of $U$3 are mutually orthogonal with squared row norms $U$4, and the runtime transform core uses only additions and subtractions because the irrational diagonal scaling is merged into quantization (Cintra et al., 2014).

Construction family	Core mechanism	Noted properties
Discrete polynomial synthesis	Even/odd discrete-orthogonal polynomials on $U$5	Generates DCT-II, DTT, and custom orthogonal transforms
8-point DCT approximation	$U$6 with $U$7	22 additions, 0 multiplications, 0 shifts per 1-D transform
Learnable orthogonal transform	Product of Householder reflections	Exact orthogonality with data-adaptive learning

The constructive synthesis method has offline complexity approximately $U$8, whereas applying the resulting matrix in a separable 2-D transform is $U$9 per block. By contrast, the 8-point DCT approximation was evaluated on 45 grayscale $Q$0 images from the USC-SIPI dataset, and its summed integrated spectral error relative to the exact DCT was reported as 1.79, compared with 3.32 for SDCT, 5.93 for BAS-2008, and 26.40 for BAS-2011; the transform also outperformed SDCT at all compression ratios in the reported experiments and outperformed BAS-2008 at both low-$Q$1 and high-$Q$2 operating points (Chan et al., 2021, Cintra et al., 2014).

4. Learned OMIT in multidimensional inverse problems

Recent work extends OMIT from fixed image transforms to learnable orthogonal transforms inside tensor low-rank models. In this setting, the orthogonal matrix $Q$3 is parameterized as a product of Householder reflections,

$Q$4

Each $Q$5 is symmetric and orthogonal, so the product is exactly orthogonal for any values of the learnable vectors $Q$6. In practice, a normalized vector $Q$7 is used for stability (Wang et al., 2024).

This parameterization is used to define a transform-induced tensor algebra. For tensors $Q$8 and $Q$9, the transformed t-product is

$U U^\top = I$0

where $U U^\top = I$1 denotes frontal-slice matrix multiplication in the transformed domain. The corresponding transform-induced t-SVD has the form

$U U^\top = I$2

with a standard matrix SVD performed independently on each frontal slice of $U U^\top = I$3 (Wang et al., 2024).

The associated tensor nuclear norm is

$U U^\top = I$4

and yields the inverse-problem formulation

$U U^\top = I$5

The stated motivation is that learning $U U^\top = I$6 from data adapts the transform to the actual spectral or temporal correlation structure and can produce stronger energy compaction and lower effective tubal rank than fixed transforms such as DFT, DCT, or DWT (Wang et al., 2024).

Within this framework, OMIT becomes an explicitly task-aligned transform layer for multispectral images, multi-frame videos, and related inverse problems. A plausible implication is that the classical basis-image intuition of orthogonal scattering is being reinterpreted in modern tensor form as adaptive low-rank compaction in a learned transformed domain.

5. Solvers, optimization, and implementation

Two solution paradigms are described for learned tensor OMIT. The first is the classical convex-proximal route based on transformed-domain singular value soft-thresholding. For a proximal-gradient step with $U U^\top = I$7 and step size $U U^\top = I$8,

$U U^\top = I$9

Operationally, this means transforming a gradient step into the $Q^\top Q = I$0-domain, performing slice-wise SVDs, shrinking singular values by $Q^\top Q = I$1, and inverting with $Q^\top Q = I$2 (Wang et al., 2024).

The second paradigm is the paper’s generative t-SVD parameterization, designed to avoid differentiating through SVD altogether. The unknown low-rank tensor is represented through factors $Q^\top Q = I$3, $Q^\top Q = I$4, a rank matrix $Q^\top Q = I$5, and a dense rank estimation operator $Q^\top Q = I$6 implemented as an MLP. A simple form given in the source is

$Q^\top Q = I$7

The transformed-domain reconstruction is then

$Q^\top Q = I$8

$Q^\top Q = I$9

This realizes a learned, adaptive shrinkage in the transformed domain without backpropagating through eigenvectors or singular vectors (Wang et al., 2024).

The training objective combines task fidelity with an Orthogonal Total Variation regularizer: $G = U^\top F V$00 The fidelity term depends on the task: tensor completion uses $G = U^\top F V$01, CASSI reconstruction uses $G = U^\top F V$02, and denoising uses $G = U^\top F V$03 (Wang et al., 2024).

Implementation trade-offs are explicit. Materializing $G = U^\top F V$04 densely through $G = U^\top F V$05 Householder multiplications costs $G = U^\top F V$06, whereas applying stored reflection vectors implicitly costs $G = U^\top F V$07 per fiber through the update $G = U^\top F V$08. The tensor transform $G = U^\top F V$09 costs $G = U^\top F V$10 when reflections are applied implicitly and $G = U^\top F V$11 if a dense $G = U^\top F V$12 is precomputed. Slice-wise SVDs scale as

$G = U^\top F V$13

while skinny t-SVD with tubal rank $G = U^\top F V$14 reduces this to $G = U^\top F V$15 (Wang et al., 2024).

6. Applications, empirical behavior, and limitations

The application space of OMIT spans both classical signal processing and contemporary inverse problems. In the basis-image formulation, the cited applications are image coding, watermarking, basis-wavelet synthesis, and feature extraction through interpretable transform coefficients (Gorbachev et al., 2019). In compression-oriented orthogonal approximations, OMIT appears as a block transform inside JPEG-like pipelines, with the forward 2-D transform $G = U^\top F V$16, quantization scaling absorbed into the quantizer, and inverse reconstruction through the transpose (Cintra et al., 2014). In learned tensor settings, the applications are tensor completion, spectral imaging reconstruction with CASSI, and multispectral image denoising (Wang et al., 2024).

The reported datasets and metrics are specific. Tensor completion used CAVE multispectral images of size $G = U^\top F V$17 and NTT videos consisting of the first 30 frames of $G = U^\top F V$18, evaluated by PSNR and SSIM. CASSI reconstruction used KAIST scenes of size $G = U^\top F V$19 with shift $G = U^\top F V$20, also evaluated by PSNR and SSIM. MSI denoising used KAIST scenes with Gaussian noise $G = U^\top F V$21, evaluated by PSNR, SSIM, and FSIM (Wang et al., 2024).

The learned OMIT-based OTLRM model was reported to improve PSNR by about $G = U^\top F V$22–$G = U^\top F V$23 dB over strong baselines including fixed-transform TNN, UTNN, DTNN, LS2T2NN, and HLRTF, especially at low sampling rates such as $G = U^\top F V$24. One example given is the Balloons scene at $G = U^\top F V$25, where OTLRM achieved approximately $G = U^\top F V$26 dB versus the next best approximately $G = U^\top F V$27 dB. For CASSI, self-supervised OTLRM was reported to match or exceed supervised deep methods and to be on par or higher than the best supervised baselines in average PSNR over five KAIST scenes, with notably sharper boundaries. For MSI denoising, it was described as competitive with or better than model-based, Plug-and-Play, and diffusion-based methods, with qualitative improvements in texture fidelity and smoothness (Wang et al., 2024).

Several limitations recur across the literature. Energy compaction is transform-dependent: the basis-image source explicitly notes that DCT, WHT, and KLT tend to compact energy for natural images, whereas DST does not (Gorbachev et al., 2019). The discrete-polynomial construction requires even $G = U^\top F V$28, distinct positive sample values $G = U^\top F V$29, and uniform weights $G = U^\top F V$30 (Chan et al., 2021). The learned low-rank tensor model assumes a strong transform-induced low-rank structure and may degrade when inter-band correlations are weak or structures are highly non-stationary; it also becomes computationally expensive when many reflections or dense per-slice SVDs are used, and its relaxed semi-orthogonality for $G = U^\top F V$31 sacrifices some t-SVD optimality guarantees (Wang et al., 2024). In the watermarking setting, robustness to severe geometric attacks or desynchronization is not addressed (Gorbachev et al., 2019).

A common misconception is to treat OMIT as a single fixed transform comparable to the DCT. The cited material indicates a broader picture. In one reading, OMIT is the general orthogonal-array framework based on basis images and block operators; in another, it is a constructive family of discrete orthogonal matrices; in a more recent reading, it is a learnable orthogonal transform layer embedded in proximal or generative tensor solvers. The unifying invariant across these variants is not a particular matrix, but exact orthogonality, invertibility by transpose, and transform-domain structure that can be exploited for scattering, compaction, compression, denoising, reconstruction, or correlation-inducing block operations (Gorbachev et al., 2019, Chan et al., 2021, Cintra et al., 2014, Wang et al., 2024).