Research
On-device research index

arXiv research

A locally-built, LLM-digested index of recent arXiv papers in quant finance, geometry/topology, and statistical ML — keyword search served straight from SQLite on this machine.

169,181 papers · 148 categories

Trend · papers per month

7142027 · Oct 202519922001200920182026
48 results for framelet denoising

Graph neural networks are explained through energy gradient flow and framelet decomposition.

problem Understanding and improving graph neural networks.
method Viewing framelet-based models as gradient flows of energy, proposing a generalized energy via framelet decomposition.
result The proposed model leads to more flexible dynamics, enhancing graph neural networks.

Deep convolution framelets improve deep learning for inverse problems.

problem Improving deep learning performance in inverse problems.
method Developed convolution framelets for signal representation, combined with deep neural networks.
result Deep convolution framelets achieve perfect reconstruction (PR) and outperform existing architectures.

Paper introduces a method to process medical images efficiently.

problem High computational cost in processing large medical image data.
method Framelet-pooling aided deep learning method to reduce complexity.
result Significant reduction in computational costs with comparable performance.

New deep learning methods improve CT image quality from few projections.

problem Sparse-view CT images suffer from streaking artifacts due to limited projections.
method Inspired by deep convolutional framelets, propose new U-Net variants that satisfy the frame condition.
result New U-Net variants provide better reconstruction performance for sparse-view CT.

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.

New method optimizes matrix denoising for weighted loss functions and heterogeneous signals.

problem Estimating low-rank matrices from noisy observed matrices.
method Developed a family of weighted loss functions and derived optimal spectral denoisers.
result A new denoiser exploiting heterogeneity in signal matrices improves estimation.

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.

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 …

2016-08-16abs ↗pdf ↗

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.

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.

A new Dantzig Selector with an optimal denoising matrix for reinforcement learning.

problem Improving Dantzig Selector's performance in sparse signal recovery and reinforcement learning.
method Defining an optimal denoising matrix through minimax optimization and proposing an approximate algorithm to estimate it.
result Empirical validation of the proposed ODDS algorithm's superior performance in reinforcement learning.

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 PYP_Y toward PXP_X with higher-order accuracy.
result Achieves O(σ4)O(σ^4) and O(σ6)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 imes faster sampling on CIFAR-10 dataset while maintaining competitive sample quality and diversity.

This paper improves neural machine translation training by selecting and denoising data.

problem Reduces negative impact of noisy data on neural machine translation training.
method Measures and selects domain data, applies denoising curriculum using online data selection.
result Significant effectiveness for training on noisy data.

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.

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.

A new autoencoder framework transforms latent space to improve generative and denoising models.

problem Improving the performance of generative and denoising models in autoencoders.
method Homeomorphic transformation of latent variables to reduce distance and preserve topological properties.
result The transformed latent space leads to better performance in generative and denoising models, as measured by Hausdorff distance and visual characteristics.

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…

2016-11-29abs ↗pdf ↗

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…

2013-01-15abs ↗pdf ↗

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 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…

2014-06-16abs ↗pdf ↗

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.

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.