Unified framework for image restoration using equivariant denoisers.
problem Restoring images with realistic priors and invariant transformations.
method Unified framework named ERED based on equivariant denoisers and stochastic optimization.
result Unified framework ERED converges and improves image restoration.
Equivariant diffusion model generates 3D molecules efficiently.
problem Generating high-quality 3D molecules efficiently.
method Equivariant Diffusion Model (EDM) that operates on atom coordinates and types.
result Significantly outperforms previous methods in molecule quality and training efficiency.
AbDiffuser generates full-atom antibodies with sequence and structure fidelity.
problem Generating high-fidelity antibodies with both structure and sequence information.
method Equivariant and physics-informed diffusion model with novel protein structure representation.
result AbDiffuser generates antibodies with sequence and structural properties matching a reference set.
AniDS improves molecular force field modeling by learning anisotropic noise.
problem Molecular force field modeling suffers from oversimplified assumptions about atomic motions.
method AniDS introduces anisotropic noise generation for better modeling of directional and structural variability.
result AniDS outperforms existing methods on benchmarks, achieving significant improvements in force prediction accuracy.
GCDM generates valid large 3D molecules and optimizes existing molecules.
problem Lack of geometric properties in 3D molecule generation models.
method Introduces Geometry-Complete Diffusion Model (GCDM) using equivariant GNNs.
result Significantly outperforms existing models in 3D molecule generation and optimization.
Extends diffusion models to non-Euclidean spaces with geometric priors.
problem Difficulties in natural sciences with symmetries and non-Euclidean data.
method Constructs a noising process and neural network equivariant to symmetry group, approximates score function.
result Model can generate complex scalar and vector fields on synthetic and real-world data.
Paper compares optimal denoising methods for generative models, finding different results based on data regularity.
problem Optimizing denoising in score-based generative models for various data types.
method Comparison of full-denoising and half-denoising approaches, analyzing performance in terms of distribution distances.
result Different denoising methods perform better under different data regularity conditions.
A new metric mav offers a practical alternative to costly Riemannian distance.
problem Efficiently compute Riemannian distance on SE(3) invariant metrics.
method Propose mav distance, defined as Riemannian length of a curve.
result Mav distance offers a trainable invariant for geometric deep learning.
Paper tackles image reconstruction from limited data using polyhedral norms and convex regularizers.
problem Learning convex regularizers for image reconstruction from limited data.
method Imposes amplitude-equivariance, approximates functionals with polyhedral norms, identifies synthesis and analysis forms, proposes a trainable tight frame architecture.
result Proposed framework outperforms sparsity-based methods in denoising and biomedical image reconstruction.
Improved generative models learn structured data better.
problem Training score-based generative models for structured data.
method Nonlinear denoising score matching with neural control variates.
result Enhanced learning of multimodal and symmetric data.
Unified method for simultaneous denoising and clustering.
problem Clustering noisy signals.
method Sparse convex wavelet clustering with fusion and group-sparse penalties.
result Unified approach that denoises and clusters simultaneously.
DDPD separates generation into planning and denoising for improved efficiency.
problem Efficiently denoise corrupted data during generation.
method Separates generation into a planner and denoiser, selecting denoising positions based on corruption severity.
result DDPD outperforms traditional methods on language and image generation benchmarks.
Improved self-supervised denoising for Poisson-Gaussian noise.
problem Handling Poisson-Gaussian noise in self-supervised denoising.
method Extended blindspot model, improved training scheme without hyperparameters.
result Improved denoising performance on microscope image benchmarks.
We consider the problem of estimating a low-rank matrix from a noisy observed matrix. Previous work has shown that the optimal method depends crucially on the choice of loss function. In this paper, we use a family of weighted loss functions, which arise naturally for problems such as submatrix denoising, denoising wit…
Image denoising is an important pre-processing step in medical image analysis. Different algorithms have been proposed in past three decades with varying denoising performances. More recently, having outperformed all conventional methods, deep learning based models have shown a great promise. These methods are however …
Total variation denoising improves image quality adaptively.
problem Improving image quality from noisy data.
method Total variation regularization for image denoising.
result Denoised images converge to true images at a parametric rate.
Gen-CUDE is a neural network for denoising noisy channels.
problem Denoising in finite-input, general-output noisy channels.
method Unsupervised neural network trained on noisy data.
result Gen-CUDE achieves better denoising results than other methods.
GDiff tackles blind denoising with Gibbs sampling and Monte Carlo inference.
problem Blind denoising of signals with unknown noise parameters.
method Gibbs Diffusion (GDiff) method that alternates sampling steps from a conditional diffusion model and a Monte Carlo sampler.
result GDiff achieves blind denoising of natural images and cosmic microwave background data.
The paper analyzes Laplacian pyramids for extending and denoising discrete functions.
problem Analyzing conditions for convergence and stability of Laplacian pyramids.
method Investigates Laplacian pyramids for extension and denoising, providing convergence conditions and stability bounds.
result Mild conditions are provided under which the Laplacian pyramids algorithm converges and stability bounds are proven.
While it is believed that denoising is not always necessary in many big data applications, we show in this paper that denoising is helpful in urban traffic analysis by applying the method of bounded total variation denoising to the urban road traffic prediction and clustering problem. We propose two easy-to-implement m…
Framework learns surrogates for molecular dynamics across multiple time-scales.
problem Stable molecular dynamics simulations require small time-steps, but long-time-scale moments need repeated simulations.
method Implicit Transfer Operator Learning with denoising diffusion probabilistic models and SE(3) equivariant architecture.
result Models can generate self-consistent stochastic dynamics across multiple time-scales.
This paper tackles denoising of complex measures using optimal transport and curvature analysis.
problem Denoising of complex, possibly non-log-concave measures.
method Score function and optimal transport theory to revert Langevin diffusion chains.
result The difficulty of denoising depends on the curvature complexity of the initial measure at specific SNR scales.
New denoisers improve signal recovery from noisy data without knowing noise distribution.
problem Denoising signals when only noise level is known, not distribution.
method Universal denoisers that shrink PY toward PX with higher-order accuracy. result Achieves O(σ4) and O(σ6) accuracy in matching generalized moments and densities. New model reduces sampling cost in diffusion models, making them faster and applicable to real-world applications.
problem Challenges in generating high-quality samples, mode coverage, and fast sampling in deep generative models.
method Proposes denoising diffusion GANs that model each denoising step using a multimodal conditional GAN to reduce sampling cost.
result Demonstrates 2000imes faster sampling on CIFAR-10 dataset while maintaining competitive sample quality and diversity. Nyström approximation for scalable operator learning
problem Scalability of operator learning for large datasets
method Nyström subsampling with operator learning
result Minimax-optimal convergence rates for functional outputs
UDVD uses deep learning to denoise videos without supervision.
problem Lack of clean video data for training deep learning models.
method UDVD is a CNN trained solely on noisy video data, adapting to local motion.
result UDVD performs as well as supervised methods, even with limited training data.
Unified framework for denoising models across various spaces.
problem Improving generative models and approximate posterior simulation.
method Generalizing denoising diffusions to a broader class of spaces using a new extension of score matching.
result Unified models for denoising and posterior simulation.
Nonparametric empirical Bayes denoising on Riemannian manifolds
problem Denoising measurements on compact Riemannian manifolds
method Using a surrogate oracle denoiser based on the marginal distribution of measurements
result Achieving nearly the Bayes risk in a low-noise regime
This paper explains GNNs using graph signal denoising.
problem Understanding how GNNs work for node representation learning.
method Spectral graph convolutional networks and graph attention networks are analyzed from the perspective of graph signal denoising.
result GNNs implicitly solve graph signal denoising problems.
Dantzig Selector (DS) is widely used in compressed sensing and sparse learning for feature selection and sparse signal recovery. Since the DS formulation is essentially a linear programming optimization, many existing linear programming solvers can be simply applied for scaling up. The DS formulation can be explained a…
New method quantifies uncertainty in denoising models.
problem Uncertainty quantification in denoising models.
method Derives a relation between posterior moments and derivatives, uses it for efficient uncertainty quantification.
result Efficient computation of principal components and full marginal distributions of the posterior.
New method improves image denoising with fewer parameters and less data.
problem Image denoising requires large datasets and supervised settings, limiting practical applications.
method Self-supervised framework using Tucker low-rank tensor approximation.
result Improves model generalizability and reduces data acquisition costs.
Physics-informed denoising improves sensor data accuracy without needing clean data.
problem Noise in real-life sensor data affects system performance and reliability.
method Physics-informed denoising model that uses algebraic relationships between sensor measurements governed by physical laws.
result Achieved state-of-the-art performance in various real-world applications.
We propose a new framework for manifold denoising based on processing in the graph Fourier frequency domain, derived from the spectral decomposition of the discrete graph Laplacian. Our approach uses the Spectral Graph Wavelet transform in order to per- form non-iterative denoising directly in the graph frequency domai…
Fluorescence microscopy has enabled a dramatic development in modern biology. Due to its inherently weak signal, fluorescence microscopy is not only much noisier than photography, but also presented with Poisson-Gaussian noise where Poisson noise, or shot noise, is the dominating noise source. To get clean fluorescence…
Image denoising based on a probabilistic model of local image patches has been employed by various researchers, and recently a deep (denoising) autoencoder has been proposed by Burger et al. [2012] and Xie et al. [2012] as a good model for this. In this paper, we propose that another popular family of models in the fie…
Noise2Inverse removes artifacts in noisy CT images without needing clean data.
problem Removing artifacts in noisy CT images.
method Noise2Inverse uses a deep CNN trained on multiple statistically independent reconstructions of the same noisy data.
result Noise2Inverse improves peak signal-to-noise ratio and structural similarity index compared to existing methods.
Paper introduces a new sampling method combining Consistency Models with importance sampling.
problem Inherent errors in samples and high NFEs for high-quality samples in Boltzmann distributions.
method Combines Consistency Models with importance sampling to produce unbiased samples with minimal NFEs.
result Produces unbiased samples using only 6-25 NFEs, comparable to 100 NFEs for DDPMs.
Paper analyzes self-supervised image denoising with denatured data.
problem Understanding the performance of self-supervised image denoising with denatured data.
method Theoretical analysis and numerical experiments on a denoising algorithm.
result Theoretical analysis shows the algorithm finds desired solutions to the optimization problem.
A denoising algorithm seeks to remove noise, errors, or perturbations from a signal. Extensive research has been devoted to this arena over the last several decades, and as a result, today's denoisers can effectively remove large amounts of additive white Gaussian noise. A compressed sensing (CS) reconstruction algorit…
New method denoises images without clean reference using Tweedie distributions.
problem Image denoising without clean reference images.
method Combining Tweedie distributions, Noise2Score, and saddle point approximation.
result General closed-form denoising formula for various noise distributions.
Paper optimizes diffusion models for denoising tasks with theoretical guarantees.
problem Lack of theoretical understanding of MSE optimality in diffusion models.
method Inspired by MSE-optimal CME, proposes a novel denoising strategy for diffusion models.
result Demonstrates polynomial-time convergence to the CME under mild conditions.
Measuring domain relevance of data and identifying or selecting well-fit domain data for machine translation (MT) is a well-studied topic, but denoising is not yet. Denoising is concerned with a different type of data quality and tries to reduce the negative impact of data noise on MT training, in particular, neural MT…
New linear denoiser outperforms standard Wiener filter in noisy data.
problem Improving denoising performance for unknown covariance data.
method Synthetically constructed noisy samples to train a linear denoiser using least-squares approximation.
result Optimal denoiser found using the Convex Gaussian Min-Max Theorem (CGMT) for proportional regime.
Heuristic weighting improves denoising score matching without requiring noise distribution assumptions.
problem Improving denoising score matching without assuming noise distribution.
method Demonstrated heteroskedasticity, derived optimal weighting functions, and provided theoretical and empirical comparisons.
result Heuristical weighting function can achieve lower variance than optimal weighting, facilitating more stable and efficient training.
SNORE applies denoiser only on images with noise of adequate level for image restoration.
problem Image restoration challenges with iterative algorithms and denoising.
method SNORE framework using stochastic regularization and stochastic gradient descent.
result SNORE is competitive with state-of-the-art methods on deblurring and inpainting tasks.
The paper analyzes statistical guarantees for denoising reflected diffusion models.
problem The mismatch between theoretical design and implementation of diffusion models introduces issues in high-dimensional target data.
method The paper uses a reflected diffusion process as the driver of noise and establishes rates of convergence in total variation.
result The statistical guarantees for denoising reflected diffusion models match the minimax lower bound up to a polylogarithmic factor.
Exact posterior score estimation for solving linear inverse problems
problem Solving linear inverse problems
method Derive the exact posterior score and use it as a denoising training objective
result EPS outperforms training-free and training-based baselines on various metrics