Spatiotemporal predictive learning (STPL) aims to forecast future frames from past observations and is essential across a wide range of applications. Compared with recurrent or hybrid architectures, pure convolutional models offer superior efficiency and full parallelism, yet their fixed receptive fields limit their ability to adaptively capture spatially varying motion patterns. Inspired by biological center-surround organization and frequency-selective signal processing, we propose PFGNet, a fully convolutional framework that dynamically modulates receptive fields through pixel-wise frequency-guided gating. The core Peripheral Frequency Gating (PFG) block extracts localized spectral cues and adaptively fuses multi-scale large-kernel peripheral responses with learnable center suppression, effectively forming spatially adaptive band-pass filters. To maintain efficiency, all large kernels are decomposed into separable 1D convolutions (1×k followed by k×1), reducing per-channel computational cost from O(k2) to O(2k). PFGNet enables structure-aware spatiotemporal modeling without recurrence or attention. Experiments on Moving MNIST, TaxiBJ, Human3.6M, and KTH show that PFGNet delivers SOTA or near-SOTA forecasting performance with substantially fewer parameters and FLOPs. Our code is available at https://github.com/fhjdqaq/PFGNet.
Figures & tables
Figure 1: Performance-efficiency trade-off on TaxiBJ. Bubble size denotes FLOPs. PFGNet achieves SOTA MSE with minimal cost.
Figure 2: Overall architecture and core modules of PFGNet. The model follows a SimVP-style encoder–translator–decoder pipeline. The input sequence {It}t=1Tin is encoded into latent features, temporally packed, and processed by a MSInit followed by Nt PFG blocks.
Figure 3: Frequency-Guided Peripheral Gating in the PFG block. Three local spectral cues (gradient magnitude, Laplacian, local variance) are extracted via fixed depthwise filters, channel-averaged, concatenated into a 3-channel frequency map, and passed through a 1×1 conv to produce per-pixel gate logits. Softmax over the K scales yields selection weights αk (the argmax visualization is only used to illustrate the preferred scale).
Dataset
Resolution
Tin
Tout
Ns
Nt
DropPath
Epochs
Learning Rate
Batch Size
GPU
Moving MNIST
(64,64,1)
10
10
4
8
0
2000
1e−3
16
1× RTX 4090
TaxiBJ
(32,32,2)
4
4
2
8
0.1
50
2e−3
16
1× RTX 3090
KTH
(128,128,1)
10
20/40
2
6
0.1
100
2e−4/1e−4
2/1
4× RTX 4090
Human3.6M
(256,256,3)
4
4
4
8
0.1
50
1.5e−3
2
5× RTX 3090
Table 1: Experimental setup. Tin and Tout denote the numbers of input and predicted frames, respectively.
Method
MSE ↓
SSIM ↑
Recurrent-based Methods
ConvLSTM [ 47 ]
103.3
0.707
DFN [ 22 ]
89.0
0.726
FRNN [ 43 ]
69.7
0.813
VPN [ 25 ]
64.1
0.870
PredRNN [ 61 ]
56.8
0.867
Table 2: Quantitative comparison on the Moving MNIST dataset.
Figure 4: Qualitative results of PFGNet on Moving MNIST.
Method
Params
FLOPs
MSE ↓
MAE ↓
SSIM ↑
Recurrent-based Methods
ConvLSTM [ 47 ]
15.0M
20.7G
0.3358
15.32
0.9836
PredNet [ 38 ]
12.5M
0.9G
0.3516
15.91
0.9828
PredRNN [ 61 ]
23.7M
42.4G
0.3194
15.31
0.9838
PredRNN++ [ 59 ]
38.4M
63.0G
0.3348
15.37
0.9834
E3D-LSTM [ 60 ]
51.0M
98.2G
0.3421
14.98
0.9842
Table 3: Quantitative comparison on the TaxiBJ dataset.
Figure 5: Qualitative results of PFGNet on TaxiBJ.
Method
KTH (10 → 20)
KTH (10 → 40)
SSIM ↑
PSNR ↑
SSIM ↑
PSNR ↑
Recurrent-based Methods
ConvLSTM [ 47 ]
0.712
23.58
0.639
22.85
SAVP [ 28 ]
0.746
25.38
0.701
23.97
FRNN [ 43 ]
0.771
26.12
0.678
23.77
DFN [ 22 ]
0.794
27.26
0.652
23.01
Table 4: Quantitative comparison on the KTH dataset.
Figure 6: Qualitative results of PFGNet on KTH.
Method
Params
FLOPs
MSE ↓
MAE ↓
SSIM ↑
Recurrent-based Methods
ConvLSTM [ 47 ]
15.5M
347.0G
125.5
1566.7
0.9813
E3D-LSTM [ 60 ]
60.9M
542.0G
143.3
1442.5
0.9803
PredNet [ 38 ]
12.5M
13.7G
261.9
1625.3
0.9786
PhyDNet [ 16 ]
4.2M
19.1G
125.7
1614.7
0.9804
MAU [ 4 ]
20.2M
105.0G
127.3
1577.0
0.9812
Table 5: Quantitative comparison on the Human3.6M dataset.
Figure 7: Qualitative results of PFGNet on Human3.6M.
model1
model2
model3
PFGNet
Archi
MSInit
✓
✓
✓
Fusion
mean
✓
softmax
✓
✓
✓
Center
3×3
✓
✓
✓
5×5
✓
TaxiBJ
MSE ↓
0.3119
0.3033
0.2995
0.2881
Table 6: Ablation on macro structure. We analyze the roles of MSInit and different fusion strategies under a unified kernel setting ( K={9,15,31} ).
Figure 8: Ablation results on TaxiBJ.
model1
model2
model3
model4
PFGNet
β
−1
✓
1
✓
0
✓
learnable
✓
✓
Gate
tanh
✓
✓
✓
✓
sigmoid
✓
Table 7: Ablation on detail mechanisms under full configuration (MSInit + softmax + all operators). We compare fixed vs. learnable β , and activation functions used for the suppression gate.
Figure 9: Frequency response of the PFG block. The large-kernel response HLk decays slowly, while the small-kernel response HS decays rapidly. Their difference Hk=HLk−βkHS (with βk=0.75 ) is positive within the green region, forming a ring-shaped band-pass filter as stated in the main text.
Figure 10: Visualization of tanh(β) on Moving MNIST and TaxiBJ datasets. Each pair shows (a,c) the branch-wise tanh(β) distributions and (b,d) the smoothed channel-wise count curves, where the horizontal axis denotes tanh(β) values and the vertical axis indicates the number of channels.
Method
Params
FLOPs
MSE ↓
MAE ↓
SSIM ↑
Recurrent-based Methods
ConvLSTM-S [ 47 ]
15.0M
56.8G
28.87
113.20
0.8793
ConvLSTM-L [ 47 ]
33.8M
127.0G
25.51
104.85
0.8928
PredNet [ 38 ]
12.5M
8.6G
185.94
318.30
0.6713
PhyDNet [ 16 ]
3.1M
15.3G
34.75
125.66
0.8567
PredRNN [ 61 ]
23.8M
116.0G
22.01
91.74
0.9091
Table 8: Quantitative comparison on the Moving FMNIST dataset.
Figure 11: Qualitative results of PFGNet on Moving FMNIST.
Figure 12: Ablation on asymmetric convolution ( n×k+k×n ).
Dataset
Nt
Params
FLOPs
MSE ↓
MAE ↓
SSIM ↑
Moving MNIST (100 epochs)
2
11.0M
7.4G
34.70
93.93
0.9201
4
21.1M
10.0G
29.74
83.38
0.9326
6
31.2M
12.6G
28.33
80.14
0.9363
8
41.3M
15.2G
27.61
78.54
0.9381
10
51.3M
17.7G
27.21
77.57
0.9391
TaxiBJ
2
0.53M
0.21G
0.3669
15.88
0.9826
Table 9: Ablation on the number of PFG blocks Nt on Moving MNIST and TaxiBJ.
Dataset
Nt
Params
FLOPs
SSIM ↑
PSNR ↑
KTH 10 → 20
2
10.8M
57.1G
0.908
33.88
4
20.8M
98.5G
0.910
34.01
6
30.9M
0.14T
0.911
34.10
8
41.0M
0.18T
0.909
34.10
10
51.1M
0.22T
0.912
34.24
Table 10: Ablation on the number of PFG blocks Nt on KTH (10 → 20).
Figure 13: Qualitative visualizations on TaxiBJ.
Figure 14: Mechanistic visualization of the learned PFGNet.
Spatiotemporal predictive learning aims to forecast future frames from historical observations in an unsupervised manner, and is critical to a wide range of applications. The key challenge is to model long-range dynamics while preserving high-frequency details for sharp multi-step predictions. Existing efficient recurrent-free frameworks typically rely on strided convolutions or pooling for sampling, which tends to discard textures and boundaries, while purely spatial operators often struggle to balance local interactions with global propagation. To address these issues, we propose WaveSFNet, an efficient framework that unifies a wavelet-based codec with a spatial--frequency dual-domain gated spatiotemporal translator. The wavelet-based codec preserves high-frequency subband cues during downsampling and reconstruction. Meanwhile, the translator first injects adjacent-frame differences to explicitly enhance dynamic information, and then performs dual-domain gated fusion between large-kernel spatial local modeling and frequency-domain global modulation, together with gated channel interaction for cross-channel feature exchange. Extensive experiments demonstrate that WaveSFNet achieves competitive prediction accuracy on Moving MNIST, TaxiBJ, and WeatherBench, while maintaining low computational complexity. Our code is available at https://github.com/fhjdqaq/WaveSFNet.
Xinyong Cai, Runming Xie, Hu Chen +1
College of Software Engineering, Sichuan University · College of Computer Science, Sichuan University · Sichuan University National Key Laboratory of Fundamental Science on Synthetic Vision
Spatio-Temporal forecasting is crucial in diverse fields, such as transportation, climate, and energy. Urban spatio-temporal data exhibits temporal mirage: similar short-window inputs have divergent future trends, and vice versa. Existing spatio-temporal graph neural networks (STGNNs) cannot effectively identify such mirages. We argue that the core reason lies in the short-window inputs that have incomplete period observation, heterogeneous global spatial correlation, and cross-period superposition causality. To bridge this gap, we develop a novel Multi- Period Pattern Pre-training (MP3), a plug-and-play pre-training plugin for distinguishing temporal mirages. MP3 presents two core innovations: (1) The multi-period pattern learning is designed to learn multi-period patterns from long time series. Specifically, multi-period temporal modeling leverages edge convolution to identify different multi-period patterns. Multi-period spatial modeling uses a bottleneck project and a global memory bank to capture heterogeneous global spatial relations efficiently. Cross-period pattern interaction employs a causality-enhanced Transformer to capture dependencies across different period patterns. (2) This plugin can seamlessly integrate into existing STGNN backbones to strengthen their forecasting performance. The experiment on five STGNN baselines across five real-world datasets (including a large-scale dataset CA) verify the effectiveness, superior scalability and strong adaptability of MP3, which brings consistent and robust performance improvements across all evaluated baselines. On average, MP3 reduces the MAE 4.7% and the RMSE 5.0%. The code can be available at https://github.com/YAN-outlook/MP3.
Lilan Peng, Yandi Liu, Qingren Yao +2
School of Computing and Artificial Intelligence, Southwest Jiaotong University, Chengdu 611756, China · Eindhoven University of Technology, Eindhoven 5612 AZ, Netherlands
Video prediction requires models to capture complex spatiotemporal dependencies and to retain relevant information over long sequences. PredRNN and its successor PredRNN-V2 address this challenge with spatiotemporal Long Short-Term Memory (ST-LSTM) units that maintain two separate memory states, at the cost of a relatively complex recurrent building block. In this work, we investigate whether the simpler gating of Gated Recurrent Units (GRUs) can be transferred to spatiotemporal predictive learning. To this end, we develop a spatiotemporal GRU (ST-GRU) unit as a GRU-based alternative to the ST-LSTM. The ST-GRU replaces the ST-LSTM's three gates per memory state with two GRU-style gates (update and reset), and merges the temporal memory state into the hidden state, which reduces the number of parameters by about 5%. We incorporate the ST-GRU into PredRNN-V2 and evaluate the resulting model on the Moving MNIST video prediction benchmark, following the original experimental protocol. Averaged over ten predicted frames, the ST-GRU-based PredRNN-V2 achieves an MSE of 55.1, an SSIM of 0.883, an LPIPS of 0.065 and a PSNR of 19.53dB. It does not surpass the original ST-LSTM-based PredRNN-V2 on MSE, SSIM or PSNR, but it achieves a lower LPIPS and performs on par with the earlier ST-LSTM-based PredRNN, while using a simpler recurrent cell. These results suggest that ST-GRUs are a promising building block for spatiotemporal predictive learning and motivate further work on their design and integration.
Augusta van Haren, Hanna Hoogen, Luca Pattavina +1