Papers
Topics
Authors
Recent
Search
2000 character limit reached

Complex Temporal Alignment GRU

Updated 25 November 2025
  • CTA-GRU is a complex-valued recurrent unit that aligns spatiotemporal features by fusing low-light video frames with high-temporal-resolution event data.
  • It employs bidirectional processing and complex convolutions to integrate modality-specific cues, enhancing deblurring performance in challenging environments.
  • Quantitative evaluations demonstrate that its design significantly improves PSNR compared to static or real-valued alternatives, addressing temporal misalignments effectively.

A Complex Temporal Alignment GRU (CTA-GRU) is a recurrent neural module designed for precise spatiotemporal alignment and continuous fusion when processing multi-modal sequential data—specifically, complex-valued representations that encode complementary signals such as low-light video frames (real part) and corresponding high-temporal-resolution event streams (imaginary part). Emerging in the context of low-light video deblurring and jointly restoring video signals degraded by both poor illumination and motion blur, the CTA-GRU generalizes the standard gated recurrent unit (GRU) by extending both its internal arithmetic and gating mechanisms to the complex domain, and by employing bidirectional temporal processing for enhanced context aggregation and temporal alignment (Zhong et al., 18 Nov 2025).

1. Formulation and Functional Overview

CTA-GRU is introduced in the CompEvent architecture for holistic video restoration in challenging low-light conditions. At each time step tt, the model receives a pair of inputs: an RGB frame ItRH×W×3I_t \in \mathbb{R}^{H \times W \times 3} and a synchronous event image EtRH×W×CEE_t \in \mathbb{R}^{H \times W \times C_E}. Channel-wise, these are fused into a single complex-valued tensor

Zt=FR(It)+iFI(Et)CH×W×CZ_t = \mathcal{F}_\mathbb{R}(I_t) + i\,\mathcal{F}_\mathbb{I}(E_t) \in \mathbb{C}^{H \times W \times C}

where FR\mathcal{F}_\mathbb{R} and FI\mathcal{F}_\mathbb{I} are per-modality feature extractors. The recurrent CTA-GRU aligns and integrates these features over time, leveraging bidirectional passes so that each output HtH'_t encodes both forward and backward temporal contexts, yielding HtCH×W×2CH'_t \in \mathbb{C}^{H \times W \times 2C} (Zhong et al., 18 Nov 2025).

2. Architectural Structure and Core Equations

The architecture comprises a per-frame embedding block, followed by a bidirectional complex-valued GRU applied iteratively over time. The primary recurrence formulas, with all operations in the complex domain, are as follows:

  • Reset gate:

rt=σc(CConvr([Zt,Ht1]))r_t = \sigma_c \big(CConv_r \big( [Z_t, H_{t-1}] \big)\big)

  • Update gate:

zt=σc(CConvu([Zt,Ht1]))z_t = \sigma_c \big(CConv_u \big( [Z_t, H_{t-1}] \big)\big)

  • Candidate hidden state:

ItRH×W×3I_t \in \mathbb{R}^{H \times W \times 3}0

  • Final hidden state:

ItRH×W×3I_t \in \mathbb{R}^{H \times W \times 3}1

Here, ItRH×W×3I_t \in \mathbb{R}^{H \times W \times 3}2 denote complex-valued convolutional layers with learnable real and imaginary parts; ItRH×W×3I_t \in \mathbb{R}^{H \times W \times 3}3 and ItRH×W×3I_t \in \mathbb{R}^{H \times W \times 3}4 apply the corresponding nonlinearity separately to the real and imaginary parts. Channel concatenation is denoted ItRH×W×3I_t \in \mathbb{R}^{H \times W \times 3}5, and ItRH×W×3I_t \in \mathbb{R}^{H \times W \times 3}6 is the elementwise complex product. The recurrent pass is performed in both temporal orders, then concatenated at each position to form the temporally aligned feature ItRH×W×3I_t \in \mathbb{R}^{H \times W \times 3}7 (Zhong et al., 18 Nov 2025).

3. Complex-valued Operations and Temporal Alignment Mechanisms

By encoding the RGB features into the real domain and event features into the imaginary domain, CTA-GRU enables explicit and continuous interaction via complex algebra. The reset and update gates, operating over concatenated ItRH×W×3I_t \in \mathbb{R}^{H \times W \times 3}8, yield gating signals sensitive to both motion (via events) and appearance/content (via RGB):

  • The reset gate ItRH×W×3I_t \in \mathbb{R}^{H \times W \times 3}9 can selectively suppress outdated features in EtRH×W×CEE_t \in \mathbb{R}^{H \times W \times C_E}0 wherever the event signal (imaginary component) indicates abrupt scene changes.
  • The update gate EtRH×W×CEE_t \in \mathbb{R}^{H \times W \times C_E}1 adaptively controls the blend between new fused features and prior state, modulating integration according to both appearance and rapid motion cues.

This complex gating, combined with bidirectional recurrence, achieves robust temporal alignment by leveraging both historical and future information at each location. A plausible implication is that such alignment resolves temporal lags and misregistration caused by non-invertible motion or rapid scene transitions, which standard real-valued or unidirectional mechanisms struggle to address (Zhong et al., 18 Nov 2025).

4. Implementation Details and Pseudocode

All major operations in CTA-GRU are implemented via complex-valued 2D convolutions (EtRH×W×CEE_t \in \mathbb{R}^{H \times W \times C_E}2 kernel, stride EtRH×W×CEE_t \in \mathbb{R}^{H \times W \times C_E}3, padding EtRH×W×CEE_t \in \mathbb{R}^{H \times W \times C_E}4). The complex convolutions are defined as: EtRH×W×CEE_t \in \mathbb{R}^{H \times W \times C_E}5 where EtRH×W×CEE_t \in \mathbb{R}^{H \times W \times C_E}6 and EtRH×W×CEE_t \in \mathbb{R}^{H \times W \times C_E}7 are the real and imaginary parts of the kernel.

Activation functions (EtRH×W×CEE_t \in \mathbb{R}^{H \times W \times C_E}8, EtRH×W×CEE_t \in \mathbb{R}^{H \times W \times C_E}9) are split elementwise over real and imaginary components. Hidden size Zt=FR(It)+iFI(Et)CH×W×CZ_t = \mathcal{F}_\mathbb{R}(I_t) + i\,\mathcal{F}_\mathbb{I}(E_t) \in \mathbb{C}^{H \times W \times C}0 or Zt=FR(It)+iFI(Et)CH×W×CZ_t = \mathcal{F}_\mathbb{R}(I_t) + i\,\mathcal{F}_\mathbb{I}(E_t) \in \mathbb{C}^{H \times W \times C}1 is typical. Complex Layer Normalization may be used for training stability.

Bidirectional processing is performed for each block over temporally adjacent frames. Representative forward pseudocode is:

FR\mathcal{F}_\mathbb{R}0 Final output at each step is Zt=FR(It)+iFI(Et)CH×W×CZ_t = \mathcal{F}_\mathbb{R}(I_t) + i\,\mathcal{F}_\mathbb{I}(E_t) \in \mathbb{C}^{H \times W \times C}2 (Zhong et al., 18 Nov 2025).

5. Quantitative Evidence and Comparative Evaluation

Ablation experiments on the RELED benchmark assess the direct benefit of CTA-GRU. Full CompEvent with complex-valued CTA-GRU achieves PSNR Zt=FR(It)+iFI(Et)CH×W×CZ_t = \mathcal{F}_\mathbb{R}(I_t) + i\,\mathcal{F}_\mathbb{I}(E_t) \in \mathbb{C}^{H \times W \times C}3 dB. Omitting the temporal GRU yields Zt=FR(It)+iFI(Et)CH×W×CZ_t = \mathcal{F}_\mathbb{R}(I_t) + i\,\mathcal{F}_\mathbb{I}(E_t) \in \mathbb{C}^{H \times W \times C}4 dB (Zt=FR(It)+iFI(Et)CH×W×CZ_t = \mathcal{F}_\mathbb{R}(I_t) + i\,\mathcal{F}_\mathbb{I}(E_t) \in \mathbb{C}^{H \times W \times C}5 dB), while replacing the GRU with simple cross-frame concatenation attains Zt=FR(It)+iFI(Et)CH×W×CZ_t = \mathcal{F}_\mathbb{R}(I_t) + i\,\mathcal{F}_\mathbb{I}(E_t) \in \mathbb{C}^{H \times W \times C}6 dB (Zt=FR(It)+iFI(Et)CH×W×CZ_t = \mathcal{F}_\mathbb{R}(I_t) + i\,\mathcal{F}_\mathbb{I}(E_t) \in \mathbb{C}^{H \times W \times C}7 dB). Replacing complex-valued gates and convolutions with real counterparts further decreases PSNR by Zt=FR(It)+iFI(Et)CH×W×CZ_t = \mathcal{F}_\mathbb{R}(I_t) + i\,\mathcal{F}_\mathbb{I}(E_t) \in \mathbb{C}^{H \times W \times C}8 dB.

These results substantiate that:

  • Complex-valued, bidirectional temporal modeling yields a substantial performance boost over static or non-learned temporal aggregation.
  • The advantage is not solely due to increased parameterization; rather, the architecture's explicit modeling of cross-modal interactions and temporal dependencies is critical (Zhong et al., 18 Nov 2025).

6. Limitations and Extensions

CTA-GRU incurs increased compute and memory costs, as complex-valued operations double the number of real-valued multiply-accumulate operations and feature channels. Fixed-size convolutional kernels (Zt=FR(It)+iFI(Et)CH×W×CZ_t = \mathcal{F}_\mathbb{R}(I_t) + i\,\mathcal{F}_\mathbb{I}(E_t) \in \mathbb{C}^{H \times W \times C}9) may limit motion compensation when frame misalignments are large; deformable or dilated complex convolutions are prospective improvements. Replacing the GRU with a complex-valued LSTM could afford even richer temporal gating at the cost of higher complexity. Integrating explicit cross-modal complex self-attention or migrating to continuous-time complex RNNs represents a promising direction for handling asynchronous, high-rate event streams (Zhong et al., 18 Nov 2025).

7. Contextualization within Temporal Alignment GRU Variants

CTA-GRU stands in contrast to other recurrent temporal alignment modules, such as:

  • Bidirectional gated architectures in vision-language tasks (e.g., the GRU-driven temporal cross-attention in SurgAnt-ViVQA), which achieves state-of-the-art BLEU-4 for surgical anticipation via bidirectional GRU recurrence and fine-grained adaptive gating on visual-language fused representations, but employs standard real-valued GRUs and attention modules (Dhake et al., 5 Nov 2025).
  • Continuous-Time and Task-Synchronized GRUs, designed to handle irregular event timing via explicit modeling of temporal decay and integration, yet not providing holistic multi-modal or complex-valued fusion (Mozer et al., 2017, Lukoševičius et al., 2022).

CTA-GRU is therefore distinct in its explicit, trainable complex-valued interleaving of spatial, channelwise, and temporal alignment, specifically targeted at multi-modal fusion for video restoration under challenging conditions.


References:

Topic to Video (Beta)

No one has generated a video about this topic yet.

Whiteboard

No one has generated a whiteboard explanation for this topic yet.

Follow Topic

Get notified by email when new papers are published related to Complex Temporal Alignment GRU.