Skip to Content
Applied SciencesApplied Sciences
  • Article
  • Open Access

5 July 2026

15 Pages

An Integrated Framework of Frequency-Domain Denoising with Learnable Parameters in Variational Autoencoders

and
College of Mathematics and Systems Science, Xinjiang University, Boda Campus, No. 777 Huarui Road, Shuimogou District, Urumqi 830017, China
*
Author to whom correspondence should be addressed.

Abstract

Variational autoencoders (VAEs) are sensitive to spatially heterogeneous noise because corrupted high-frequency components can be propagated into the latent posterior and degrade reconstruction. We propose Learnable Local FFT-VAE, a VAE-oriented localized frequency correction framework that performs windowed Fourier-domain modulation before variational encoding. The proposed Localized Denoising-Correction Module extracts overlapping patches, applies local FFT, predicts patch-conditioned frequency-control parameters ( α , σ , m ) , and reconstructs corrected inputs through inverse FFT and Hann overlap-add. This design preserves spatial locality while remaining differentiable and jointly trainable with the VAE objective. We evaluate the method on FashionMNIST, CIFAR-10, and PneumoniaMNIST under homogeneous and heterogeneous synthetic noise, and compare it with Direct VAE, AE, Local FFT-AE, best-tuned Fixed FFT-VAE, learnable Global FFT-VAE, BM3D, DnCNN, and FFDNet. The revised experiments demonstrate improvements in PSNR, SSIM, SNR, MSE, HFEN, and gradient-error, with statistical tests over random seeds. Parameter heatmaps and spectral visualizations further show that the learned local correction adapts to spatially varying corruption. PneumoniaMNIST is used only as a lightweight biomedical benchmark, and the method is not intended for clinical diagnosis.

1. Introduction

Variational autoencoders (VAEs) provide a principled probabilistic framework for learning compact latent representations and generating realistic samples, and have become a core tool in representation learning and scientific imaging pipelines [1]. Rezende et al. developed a complementary stochastic-gradient variational inference view that underpins modern deep generative training [2]. In practical applications such as biomedical screening benchmarks, remote sensing, and physics-informed inversion, the data acquisition process is inevitably affected by noise, sensor artifacts, and heterogeneous measurement conditions. In this work, biomedical images are used only for lightweight benchmark evaluation rather than clinical diagnosis, because frequency-domain enhancement may introduce local artifacts that require domain-expert validation.
Existing solutions typically mitigate corruption by incorporating a denoising or regularization stage before or within the reconstruction model. Classical Wiener filtering is computationally efficient and often effective when noise statistics are stationary or approximately known [3]. Wavelet shrinkage provides a transform domain alternative under sparsity assumptions [4]. However, when noise is spatially varying and signal structures span multiple scales, fixed-parameter denoisers can either under-filter noisy regions or over-smooth fine details. This creates a key practical problem: how to choose denoising strength adaptively so that noise is suppressed without erasing informative high-frequency structures that VAEs need to model.
This problem further implies two coupled challenges in building robust VAE-based reconstruction under realistic corruption. First, the denoising mechanism should preserve spatial locality: different regions of the same image may exhibit different noise levels and spectral characteristics, so a global cutoff or a single image-level bandwidth is generally suboptimal. This motivates localized or windowed frequency correction, where different overlapping patches can receive different frequency responses. Second, the denoiser must be representation-preserving and trainable with the generator: overly aggressive suppression of high-frequency components can harm edges and textures, while insufficient suppression can inject noise into the encoder, destabilize variational inference, and degrade latent disentanglement.
To tackle the above challenges, we propose Learnable Local FFT-VAE, a VAE-oriented framework that integrates a localized frequency-domain denoising-correction module with a VAE backbone in an end-to-end trainable pipeline. Specifically, an auxiliary parameter learning network predicts local frequency-control maps, which are aggregated onto an overlapping patch grid. For each patch, the Localized DCM applies a windowed FFT, modulates low- and high-frequency components using ( α , σ , m ) , and reconstructs the corrected image through inverse FFT and Hann overlap-add. The resulting denoised image is then fed into the VAE encoder–decoder to learn noise-robust latent representations and reconstructions.
The main contributions are summarized as follows. (1) We introduce Learnable Local FFT-VAE, an end-to-end framework that couples localized frequency correction with variational generative modeling. Unlike global FFT preprocessing, the proposed Localized DCM performs patch-wise spectral modulation and Hann overlap-add, preserving spatial locality under heterogeneous corruption. (2) We design an interpretable parameter learning strategy that predicts local ( α , σ , m ) maps controlling high-frequency blending, low-pass bandwidth, and confidence-aware gating. (3) We provide a broader evaluation on FashionMNIST [5], CIFAR-10, and PneumoniaMNIST [6] with homogeneous and heterogeneous synthetic noise, including BM3D, DnCNN, FFDNet, Direct VAE, AE, Local FFT-AE, best-tuned Fixed FFT-VAE, and learnable Global FFT-VAE baselines. (4) We report statistical significance, latent representation analysis, parameter/spectrum visualization, and complexity measurements to clarify the contribution and cost of the proposed VAE-oriented correction.

3. Methodology

This section describes Learnable Local FFT-VAE, which integrates a localized frequency-domain denoising-correction module with variational inference. The key change from a global FFT correction is that frequency modulation is performed over overlapping spatial patches, allowing different regions to use different learned spectral responses before VAE encoding.

3.1. Task Formulation and Notation

Let x ∈ R C × H × W denote an observed noisy image and x ⋆ ∈ R C × H × W denote the clean target when paired synthetic noise supervision is available. The model outputs a corrected image x ˜ before VAE encoding and a final reconstruction x ^ , and learns a latent variable z ∈ R d .
The VAE encoder and decoder are parameterized by ϕ and θ , respectively. The parameter learning network is parameterized by ψ and predicts three image-conditioned maps: α ∈ ( 0 , 1 ) H × W , σ ∈ R + H × W , and m ∈ ( 0 , 1 ) H × W . These dense maps are average-pooled onto an overlapping patch grid and used as local frequency-control parameters for each window. We denote patch extraction by P k ( x ) and Hann overlap-add aggregation by A ( · ) .

3.2. Model Architecture and Task Flow

Learnable Local FFT-VAE consists of three modules forming a complete pipeline (Figure 1): (i) the parameter network predicts ( α , σ , m ) from x; (ii) the Localized DCM extracts overlapping windows, performs patch-wise Fourier-domain correction, and aggregates corrected patches to obtain x ˜ ; and (iii) the VAE backbone performs probabilistic encoding/decoding on x ˜ to produce x ^ and latent representations.
Figure 1. Overview of Learnable Local FFT-VAE. Colored local-window outlines denote different overlapping patches, the blue frame marks the Localized DCM, and the purple frame marks the VAE backbone. The parameter network predicts local frequency-control maps ( α , σ , m ) , which are pooled onto overlapping patches. The Localized DCM performs patch-wise FFT correction, inverse local FFT, and Hann overlap-add before the VAE backbone reconstructs x ^ and learns latent variable z. The loss jointly optimizes the parameter network, Localized DCM, and VAE backbone.

3.3. VAE Backbone

The VAE backbone provides a probabilistic mechanism for learning a structured latent space and reconstructing images. We assume a standard Gaussian prior p ( z ) = N ( 0 , I ) and a conditional likelihood p θ ( x ^ ∣ z ) . Given x ˜ , the encoder defines q ϕ ( z ∣ x ˜ ) = N ( z ∣ μ ϕ ( x ˜ ) , diag ( σ ϕ 2 ( x ˜ ) ) ) , and the decoder reconstructs x ^ from sampled latent variables.

3.4. Parameter Learning Network

The parameter network provides input-conditioned local adaptivity by predicting dense control maps:
[ α , σ , m ] = f ψ ( x ) .
For a patch centered at location k, we obtain patch-level parameters through average pooling:
α k = AvgPool k ( α ) , σ k = AvgPool k ( σ ) , m k = AvgPool k ( m ) .
Here α k controls high-frequency blending, σ k controls the local low-pass bandwidth, and m k gates high-frequency residuals for the k-th window.
To improve reproducibility, we further specify the implementation of the parameter learning network. In our experiments, f ψ ( · ) is implemented as a lightweight convolutional network consisting of three 3 × 3 convolutional layers with ReLU activation, followed by a 1 × 1 convolutional prediction head. The network outputs three dense maps corresponding to α , σ , and m. Sigmoid activation is used to constrain α and m into ( 0 , 1 ) , while σ is mapped to a bounded positive range to avoid extremely narrow or overly smooth frequency masks. The dense maps are then average-pooled onto the overlapping patch grid and used as local frequency-control parameters for the Localized DCM.

3.5. Localized Denoising-Correction Module

The Localized DCM performs differentiable frequency correction over overlapping spatial windows. Let P k ( x ) ∈ R C × p × p denote the k-th Hann-windowed patch extracted from x with patch size p and stride s:
x k = w ⊙ P k ( x ) ,
where w is a two-dimensional Hann window. We compute a local Fourier transform for each patch:
x ^ k = shift F ( x k ) .
For local frequency coordinates ( u , v ) , we define d k 2 ( u , v ) = ( u − u 0 ) 2 + ( v − v 0 ) 2 and construct local low- and high-pass masks:
L k ( u , v ) = exp − d k 2 ( u , v ) 2 σ k 2 , H k ( u , v ) = 1 − L k ( u , v ) .
The corrected local spectrum is
x ^ c , k = L k ⊙ x ^ k + α k H k ⊙ x ^ k ⊙ m k .
The corrected patch is transformed back by inverse FFT:
x ˜ k = Re F − 1 shift − 1 ( x ^ c , k ) .
Finally, all corrected overlapping patches are aggregated by Hann overlap-add:
x ˜ = A { x ˜ k } k = 1 K .
For 28 × 28 images, we use patch size 8 and stride 4; for 32 × 32 images, we use patch size 16 and stride 8 unless otherwise stated.

3.6. Training Objective

We train Learnable Local FFT-VAE by minimizing a reconstruction loss, a KL regularization term, an auxiliary denoising loss for the Localized DCM output, and parameter regularization. The auxiliary denoising loss is defined as
L denoise ( x ⋆ , x ˜ ) = ∥ x ˜ − x ⋆ ∥ 1 .
The total objective is
L total = L rec ( x ⋆ , x ^ ) + β L KL + λ d L denoise ( x ⋆ , x ˜ ) + λ r L reg ( α , σ , m ) .
The auxiliary denoising term directly supervises the Localized DCM output and prevents the correction module from relying solely on decoder-side reconstruction. This term is used only when clean synthetic noise targets are available.

3.7. Training Pipeline

The end-to-end training flow follows the module order described above and is summarized in Table 2.
Table 2. End-to-end training pipeline for Learnable Local FFT-VAE.

3.8. Time and Space Complexity

For Localized DCM, the dominant cost is the local forward/inverse FFT over K overlapping patches:
O B C K p 2 log ( p 2 ) ,
where p is the patch size and K is the number of windows. Since p is small and fixed in our experiments, the added cost remains moderate. We report empirical parameters, runtime per image, and CUDA peak memory in Section 4.9.

4. Experiments

4.1. Experimental Setup

We evaluate the proposed method on three datasets with complementary roles. FashionMNIST is retained as a controlled low-resolution benchmark, CIFAR-10 is added as a more complex RGB benchmark, and PneumoniaMNIST is used as a lightweight biomedical benchmark for synthetic noise quantitative evaluation and artifact-sensitive analysis. We consider homogeneous Gaussian noise with σ ∈ { 0.10 , 0.20 , 0.25 , 0.30 } and heterogeneous block noise where each local block is assigned a noise level sampled from [ 0.05 , 0.35 ] . PneumoniaMNIST is additionally evaluated with Gaussian noise σ = 0.20 and Poisson noise with peak value 30. All methods share the same train/validation/test split, random seeds, noisy–clean pairs, and early stopping rule.
For Local FFT-VAE, 28 × 28 images use patch size 8 and stride 4, while 32 × 32 images use patch size 16 and stride 8. The best-tuned Fixed FFT-VAE is selected by validation SSIM over α ∈ { 0.2 , 0.4 , 0.6 , 0.8 , 1.0 } and cutoff ratio ∈ { 0.15 , 0.25 , 0.35 , 0.45 , 0.55 } rather than by a manually weak setting. We report PSNR, SSIM, SNR, MSE, HFEN, and gradient-error, and latent representation quality is evaluated with a linear probe. Table 3 lists the training and implementation settings used for the revised experiments.
Table 3. Training and implementation details used in the revised experiments.
All learning-based methods were trained using the same train/validation/test split, the same noisy–clean image pairs, and the same early stopping criterion. Hyperparameters were selected on the validation set only, and the test set was used exclusively for final reporting.

4.2. Compared Methods and Main Quantitative Results

We compare Clean VAE, Direct VAE, AE, Local FFT-AE, best-tuned Fixed FFT-VAE, learnable Global FFT-VAE, Learnable Local FFT-VAE, BM3D, DnCNN, FFDNet, and Restormer-lite. Table 4 summarizes the principal heterogeneous-noise results averaged over datasets and seeds. Restormer-lite is included as a lightweight Transformer-based restoration baseline and is evaluated using the same noisy–clean test pairs, data split, training protocol, and metrics as the other baselines. Learnable Local FFT-VAE obtains the best overall performance, with PSNR 24.86 , SSIM 0.861 , SNR 18.74 , MSE 0.00331 , HFEN 0.618 , and gradient-error 0.142 . Compared with Direct VAE, the proposed method improves PSNR by + 4.78 dB and SSIM by + 0.157 , while reducing HFEN by 0.407 and gradient-error by 0.136 .
Table 4. Main quantitative comparison under heterogeneous noise. Higher PSNR/SSIM/SNR and lower MSE/HFEN/gradient-error are better.
FashionMNIST is retained as a controlled visual benchmark. Figure 2 shows representative clean and noisy samples, and Figure 3 illustrates that VAE-family models can be optimized under the same training protocol. These visualizations are preserved from the original manuscript to document the controlled noise setting, while the main conclusions are now based on the broader quantitative evaluation in Table 4.
Figure 2. FashionMNIST samples retained as the controlled benchmark. Panel (a) shows clean inputs, and panel (b) shows matched noisy inputs with Gaussian corruption.
Figure 3. Training loss curves for the controlled VAE-family configurations under identical optimization settings. Black, red, blue, and green curves correspond to Clean VAE, Direct VAE, Fixed FFT-VAE, and Learnable FFT-VAE, respectively.

4.3. Local FFT Versus Global and Fixed FFT Variants

To directly address whether localized frequency correction is necessary, we compare Learnable Local FFT-VAE with learnable Global FFT-VAE and best-tuned Fixed FFT-VAE. As shown in Table 5, Local FFT-VAE improves over Global FFT-VAE by + 2.83 dB PSNR and + 0.059 SSIM, and reduces HFEN and gradient-error by 0.124 and 0.039 , respectively. The gain over best-tuned Fixed FFT-VAE is larger, confirming that both learnability and locality are important.
Table 5. Ablation of fixed, global learnable, and local learnable FFT correction.
Figure 4, Figure 5 and Figure 6 are retained to show the original controlled FashionMNIST reconstruction examples and noise-level behavior. They now serve as supporting visual evidence, while the revised tables provide the stronger multi-dataset and strong-baseline quantitative response requested by the reviewers.
Figure 4. Controlled FashionMNIST reconstruction comparison among VAE-family configurations.
Figure 5. Representative FashionMNIST sample under different Gaussian noise levels.
Figure 6. Controlled PSNR/SSIM/SNR trends across Gaussian noise levels for VAE-family configurations.

4.4. VAE/AE Ablation and Latent Representation Analysis

To clarify the role of variational modeling, we compare AE, Local FFT-AE, Direct VAE, learnable Global FFT-VAE, and Learnable Local FFT-VAE. This ablation separates the contribution of local frequency correction from the contribution of the VAE latent objective. Compared with Direct VAE, Learnable Local FFT-VAE improves PSNR by 4.78 dB and SSIM by 0.157 . Compared with AE, it improves PSNR by 6.44 dB and SSIM by 0.220 . Local FFT-AE also improves over AE, but the full VAE variant achieves the best balance between pixel fidelity and latent robustness. A linear probe trained on frozen latent means further confirms improved representation robustness for FashionMNIST/CIFAR-10 accuracy and PneumoniaMNIST accuracy/AUROC. Table 6 summarizes this ablation and latent-probe analysis.
Table 6. VAE/AE ablation and latent-probe summary under heterogeneous noise.

4.5. Comparison with Strong Denoising and Restoration Baselines

We compare the proposed method with BM3D, DnCNN, FFDNet, and Restormer-lite under the same noisy–clean test pairs. Learnable Local FFT-VAE outperforms BM3D by + 1.68 dB PSNR and + 0.032 SSIM, DnCNN by + 2.12 dB PSNR and + 0.048 SSIM, FFDNet by + 2.35 dB PSNR and + 0.055 SSIM, and Restormer-lite by + 1.22 dB PSNR and + 0.022 SSIM. The proposed method also obtains lower HFEN and gradient-error, indicating better high-frequency and edge-structure preservation under heterogeneous noise in this VAE-oriented reconstruction setting.
For fair comparison, all VAE/AE-family baselines use the same encoder–decoder capacity and the same training protocol unless otherwise specified. The Fixed FFT-VAE baseline is not manually weakened; its frequency parameters are selected by validation SSIM over the predefined grid. The learnable Global FFT-VAE uses the same parameter learning design but applies image-level frequency correction instead of patch-local correction. BM3D, DnCNN, FFDNet, and Restormer-lite are evaluated on the same noisy–clean test pairs. This setting ensures that the comparison focuses on the effect of localized learnable frequency correction rather than differences in data splits or evaluation conditions.

4.6. PneumoniaMNIST Quantitative and Artifact-Sensitive Evaluation

For PneumoniaMNIST, we use the original images as clean references and synthesize controlled Gaussian and Poisson corruptions. This setting enables quantitative evaluation using PSNR, SSIM, MSE, HFEN, and gradient-error. We additionally inspect residual maps and edge-error maps to identify possible artifact amplification. PneumoniaMNIST is treated only as a lightweight biomedical benchmark; no clinical diagnostic claim is made. Figure 7 summarizes the visual comparison and artifact-sensitive views.
Figure 7. PneumoniaMNIST reconstruction and artifact-sensitive comparison. The figure shows clean/noisy samples and method outputs together with residual or error-map style views. PneumoniaMNIST is used only as a lightweight biomedical benchmark and not for clinical diagnosis.

4.7. Statistical Significance Testing

In addition to mean and standard deviation, we perform seed-level paired statistical tests. For Local FFT-VAE versus Direct VAE and Local FFT-VAE versus Global FFT-VAE, we report paired t-test p-values, 95% confidence intervals, and Cohen’s d z effect sizes. Table 7 reports the paired-test results.
Table 7. Seed-level paired significance tests for Local FFT-VAE against Direct VAE and Global FFT-VAE. Results are computed over six random seeds. The confidence intervals are 95% paired t confidence intervals, and the paired t-tests are two-sided.

4.8. Hyperparameter and Parameter Visualization Analysis

Table 8 documents the recommended hyperparameter ranges, and Figure 8 keeps the original epoch-wise α and σ trajectories while adding patch-level local frequency-control maps. The added patch maps visualize learned α , σ , and m on the local patch grid, indicating that the model does not use a single global frequency response but assigns different local corrections according to spatial noise patterns.
Table 8. Recommended hyperparameter ranges for Learnable Local FFT-VAE and selected final values.
Figure 8. Visualization of learned frequency-control parameters. The first row retains the original epoch-wise α and σ trajectories, while the second row adds patch-level α , σ , and m maps for Local FFT-VAE. The patch maps support the claim that the model applies different local frequency responses rather than a single global FFT filter.

4.9. Complexity Analysis

To address the concern of over-engineering, we report the number of trainable parameters, runtime per image, and CUDA peak memory. Local FFT-VAE introduces moderate computational overhead compared with Direct VAE and Global FFT-VAE, but remains practical at the studied resolution. BM3D has no trainable parameters but is substantially slower due to CPU-based per-image processing. DnCNN and FFDNet are lightweight discriminative denoisers, whereas Local FFT-VAE additionally provides latent reconstruction and interpretable local spectral parameters. Table 9 reports the parameter count, runtime, and memory comparison.
Table 9. Complexity comparison. Runtime is measured as milliseconds per image.

5. Conclusions

5.1. Summary

We proposed Learnable Local FFT-VAE, an end-to-end framework that couples localized frequency-domain correction with variational inference for robust reconstruction and representation learning under heterogeneous corruption. The model predicts local frequency-control maps ( α , σ , m ) and applies patch-wise FFT correction with Hann overlap-add before VAE encoding. Experiments on FashionMNIST, CIFAR-10, and PneumoniaMNIST under homogeneous and heterogeneous synthetic noise compare Direct VAE, AE, best-tuned Fixed FFT-VAE, learnable Global FFT-VAE, BM3D, DnCNN, FFDNet, and the proposed Local FFT-VAE. The revised results show that Learnable Local FFT-VAE provides the best overall reconstruction metrics among the evaluated methods while also producing interpretable local parameter maps.

5.2. Limitations

Despite the improvements, several limitations remain. First, PneumoniaMNIST is used only as a lightweight biomedical benchmark; the proposed method is not intended for clinical diagnosis, and frequency-domain enhancement may introduce artifacts that require expert validation. Second, the current Localized DCM uses fixed patch sizes and Hann overlap-add; more adaptive multi-scale windows may be needed for high-resolution or strongly nonstationary data. Third, although Restormer-lite is included as a modern restoration baseline, larger transformer or diffusion restoration models and real-world corruptions require further investigation. Fourth, the local FFT module introduces additional runtime and memory overhead compared with a plain Direct VAE.

5.3. Future Work

Future work will explore three directions. (i) Multi-scale local spectral correction: extending the current fixed-size local FFT windows to adaptive multi-scale Fourier or wavelet representations. (ii) Stronger generative backbones: integrating hierarchical VAEs, normalizing flows, or diffusion priors while retaining interpretable local frequency-control parameters. (iii) Broader validation: evaluating on higher-resolution natural-image denoising benchmarks and real biomedical datasets with expert annotation to quantify both restoration quality and artifact risk.

Author Contributions

Conceptualization, X.L. and H.Z.; methodology, X.L.; software, X.L.; validation, X.L. and H.Z.; formal analysis, X.L.; investigation, X.L.; resources, X.L.; data curation, X.L.; writing—original draft preparation, X.L.; writing—review and editing, H.Z.; visualization, X.L.; supervision, H.Z.; project administration, X.L. All authors have read and agreed to the published version of the manuscript.

Funding

This work was sponsored in part by the Natural Science Foundation of Xinjiang Uygur Autonomous Region (Nos. 2025D01C276, 2025D14015), and the Xinjiang Tianchi Talent Program (No. 51052601848), and the university level computing platform of Xinjiang University’s Computing and Data Center.

Institutional Review Board Statement

Not applicable.

Data Availability Statement

FashionMNIST, CIFAR-10, and PneumoniaMNIST/MedMNIST are publicly available through their respective project pages or official Python packages. The synthetic noise generation protocol, seeds, train/validation/test splits, and evaluation scripts are provided in the supplementary revision experiment repository.

Conflicts of Interest

The authors declare no conflicts of interest.

References

  1. Kingma, D.P.; Welling, M. Auto-Encoding Variational Bayes. In Proceedings of the International Conference on Learning Representations (ICLR), Banff, AB, Canada, 14–16 April 2014. [Google Scholar]
  2. Rezende, D.J.; Mohamed, S.; Wierstra, D. Stochastic Backpropagation and Approximate Inference in Deep Generative Models. In Proceedings of the International Conference on Machine Learning (ICML), Beijing, China, 21–26 June 2014; JMLR.org: Norfolk, MA, USA, 2014; pp. 1278–1286. [Google Scholar]
  3. Wiener, N. Extrapolation, Interpolation, and Smoothing of Stationary Time Series; MIT Press: Cambridge, MA, USA, 1949. [Google Scholar]
  4. Donoho, D.L.; Johnstone, I.M. Ideal Spatial Adaptation by Wavelet Shrinkage. Biometrika 1994, 81, 425–455. [Google Scholar] [CrossRef]
  5. Xiao, H.; Rasul, K.; Vollgraf, R. Fashion-MNIST: A Novel Image Dataset for Benchmarking Machine Learning Algorithms. arXiv 2017, arXiv:1708.07747. [Google Scholar]
  6. Yang, J.; Shi, R.; Wei, D.; Liu, Z.; Zhao, L.; Ke, B.; Pfister, H.; Ni, B.; Liu, B. MedMNIST v2: A Large-Scale Lightweight Benchmark for 2D and 3D Biomedical Image Classification. Sci. Data 2023, 10, 41. [Google Scholar] [PubMed]
  7. Buades, A.; Coll, B.; Morel, J.M. A Non-Local Algorithm for Image Denoising. In 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR’05); IEEE: New York, NY, USA, 2005; Volume 2, pp. 60–65. [Google Scholar] [CrossRef] [Scilit]
  8. Dabov, K.; Foi, A.; Katkovnik, V.; Egiazarian, K. Image Denoising by Sparse 3-D Transform-Domain Collaborative Filtering. IEEE Trans. Image Process. 2007, 16, 2080–2095. [Google Scholar] [CrossRef] [Scilit] [PubMed]
  9. Zhang, K.; Zuo, W.; Chen, Y.; Meng, D.; Zhang, L. Beyond a Gaussian Denoiser: Residual Learning of Deep CNN for Image Denoising. IEEE Trans. Image Process. 2017, 26, 3142–3155. [Google Scholar] [CrossRef] [Scilit] [PubMed]
  10. Lehtinen, J.; Munkberg, J.; Hasselgren, J.; Laine, S.; Karras, T.; Aittala, M.; Aila, T. Noise2Noise: Learning Image Restoration without Clean Data. In Proceedings of the International Conference on Machine Learning (ICML), Stockholm, Sweden, 10–15 July 2018; JMLR.org: Norfolk, MA, USA, 2018; pp. 2965–2974. [Google Scholar]
  11. Krull, A.; Buchholz, T.O.; Jug, F. Noise2Void—Learning Denoising from Single Noisy Images. In Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR), Long Beach, CA, USA, 15–20 June 2019; IEEE: New York, NY, USA, 2019; pp. 2129–2137. [Google Scholar]
  12. Higgins, I.; Matthey, L.; Pal, A.; Burgess, C.; Glorot-Xavier, L.; Botvinick, M.; Mohamed, S.; Lerchner, A. beta-VAE: Learning Basic Visual Concepts with a Constrained Variational Framework. In Proceedings of the International Conference on Learning Representations (ICLR), Toulon, France, 24–26 April 2017. [Google Scholar]
  13. Zhao, S.; Song, J.; Ermon, S. InfoVAE: Information Maximizing Variational Autoencoders. arXiv 2017, arXiv:1706.02262. [Google Scholar]
  14. Kingma, D.P.; Welling, M. An Introduction to Variational Autoencoders. Found. Trends Mach. Learn. 2019, 12, 307–392. [Google Scholar] [CrossRef] [Scilit]
  15. Burda, Y.; Grosse, R.; Salakhutdinov, R. Importance Weighted Autoencoders. arXiv 2016. [Google Scholar] [CrossRef] [Scilit]
  16. Sohn, K.; Lee, H.; Yan, X. Learning Structured Output Representation using Deep Conditional Generative Models. Adv. Neural Inf. Process. Syst. 2015, 28, 3483–3491. [Google Scholar]
  17. Kingma, D.P.; Salimans, T.; Jozefowicz, R.; Chen, X.; Sutskever, I.; Welling, M. Improved Variational Inference with Inverse Autoregressive Flow. Adv. Neural Inf. Process. Syst. 2016, 29, 4743–4751. [Google Scholar]
  18. Goodfellow, I.; Pouget-Abadie, J.; Mirza, M.; Xu, B.; Warde-Farley, D.; Ozair, S.; Courville, A.; Bengio, Y. Generative Adversarial Nets. In Proceedings of the Advances in Neural Information Processing Systems (NeurIPS), Montreal, QC, Canada, 8–13 December 2014; NeurIPS: San Diego, CA, USA, 2014; Volume 27. [Google Scholar]
  19. Ho, J.; Jain, A.; Abbeel, P. Denoising Diffusion Probabilistic Models. In Proceedings of the Advances in Neural Information Processing Systems (NeurIPS), Virtual, 6–12 December 2020; NeurIPS: San Diego, CA, USA, 2020; Volume 33, pp. 6840–6851. [Google Scholar]
  20. Song, Y.; Sohl-Dickstein, J.; Kingma, D.P.; Kumar, A.; Ermon, S.; Poole, B. Score-Based Generative Modeling through Stochastic Differential Equations. In Proceedings of the International Conference on Learning Representations (ICLR), Vienna, Austria, 4 May 2021. [Google Scholar]
  21. Ledig, C.; Theis, L.; Huszar, F.; Caballero, J.; Cunningham, A.; Acosta, A.; Aitken, A.; Tejani, A.; Totz, J.; Wang, Z.; et al. Photo-Realistic Single Image Super-Resolution Using a Generative Adversarial Network. In Proceedings of the 2017 IEEE Conference on Computer Vision and Pattern Recognition (CVPR), Honolulu, HI, USA, 21–26 July 2017; IEEE: New York, NY, USA, 2017; pp. 105–114. [Google Scholar] [CrossRef] [Scilit]
  22. Kupyn, O.; Budzan, V.; Mykhailych, M.; Mishkin, D.; Matas, J. DeblurGAN: Blind Motion Deblurring Using Conditional Adversarial Networks. In Proceedings of the 2018 IEEE/CVF Conference on Computer Vision and Pattern Recognition, Salt Lake City, UT, USA, 18–23 June 2018; IEEE: New York, NY, USA, 2018; pp. 8183–8192. [Google Scholar] [CrossRef] [Scilit]
  23. Rombach, R.; Blattmann, A.; Lorenz, D.; Esser, P.; Ommer, B. High-Resolution Image Synthesis with Latent Diffusion Models. In Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR); IEEE: New York, NY, USA, 2022; pp. 10684–10695. [Google Scholar]
  24. Vahdat, A.; Kautz, J. NVAE: A Deep Hierarchical Variational Autoencoder. Adv. Neural Inf. Process. Syst. 2020, 33, 19667–19679. [Google Scholar]
  25. Vetterli, M.; Eurasip, M.; Nussbaumer, H.J. Simple FFT and DCT algorithms with reduced number of operations. Signal Process. 1984, 6, 267–278. [Google Scholar] [CrossRef] [Scilit]
  26. Stanley, H.M.; Kato, T. An FFT-Based Method for Rough Surface Contact. J. Tribol. 1997, 119, 481–485. [Google Scholar] [CrossRef] [Scilit]
  27. Zhang, K.; Zuo, W.; Zhang, L. FFDNet: Toward a Fast and Flexible Solution for CNN-based Image Denoising. IEEE Trans. Image Process. 2018, 27, 4608–4622. [Google Scholar] [CrossRef] [Scilit]
  28. Qin, Z.; Zhang, P.; Wu, F.; Li, X. FcaNet: Frequency Channel Attention Networks. In Proceedings of the IEEE/CVF International Conference on Computer Vision (ICCV), Montreal, QC, Canada, 11–17 October 2021; IEEE: New York, NY, USA, 2021; pp. 783–792. [Google Scholar]
  29. Jiang, Y.; Liu, S.; Chen, X.; Lu, H. MFNet: Multi-level Frequency Network for Image Restoration. Pattern Recognit. 2022, 131, 108853. [Google Scholar]
  30. Zamir, S.W.; Arora, A.; Khan, S.; Hayat, M.; Khan, F.S.; Yang, M.H. Restormer: Efficient Transformer for High-Resolution Image Restoration. In Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR); IEEE: New York, NY, USA, 2022; pp. 5728–5739. [Google Scholar]
Disclaimer/Publisher’s Note: The statements, opinions and data contained in all publications are solely those of the individual author(s) and contributor(s) and not of MDPI and/or the editor(s). MDPI and/or the editor(s) disclaim responsibility for any injury to people or property resulting from any ideas, methods, instructions or products referred to in the content.

Article Metrics

Citations

Article Access Statistics

Multiple requests from the same IP address are counted as one view.