Scale factor point spread function matching: Beyond aliasing in image
resampling
- URL: http://arxiv.org/abs/2101.06440v1
- Date: Sat, 16 Jan 2021 11:40:58 GMT
- Title: Scale factor point spread function matching: Beyond aliasing in image
resampling
- Authors: M. Jorge Cardoso, Marc Modat, Tom Vercauteren, Sebastien Ourselin
- Abstract summary: Imaging devices exploit the Nyquist-Shannon sampling theorem to avoid both aliasing and redundant oversampling by design.
In medical image resampling, images are considered as continuous functions, are warped by a spatial transformation, and are then sampled on a regular grid.
This paper shows that this oversight introduces artefacts, including aliasing, that can lead to important bias in clinical applications.
- Score: 4.81150027600776
- License: http://creativecommons.org/licenses/by/4.0/
- Abstract: Imaging devices exploit the Nyquist-Shannon sampling theorem to avoid both
aliasing and redundant oversampling by design. Conversely, in medical image
resampling, images are considered as continuous functions, are warped by a
spatial transformation, and are then sampled on a regular grid. In most cases,
the spatial warping changes the frequency characteristics of the continuous
function and no special care is taken to ensure that the resampling grid
respects the conditions of the sampling theorem. This paper shows that this
oversight introduces artefacts, including aliasing, that can lead to important
bias in clinical applications. One notable exception to this common practice is
when multi-resolution pyramids are constructed, with low-pass "anti-aliasing"
filters being applied prior to downsampling. In this work, we illustrate why
similar caution is needed when resampling images under general spatial
transformations and propose a novel method that is more respectful of the
sampling theorem, minimising aliasing and loss of information. We introduce the
notion of scale factor point spread function (sfPSF) and employ Gaussian
kernels to achieve a computationally tractable resampling scheme that can cope
with arbitrary non-linear spatial transformations and grid sizes. Experiments
demonstrate significant (p<1e-4) technical and clinical implications of the
proposed method.
Related papers
- A Counterexample in Cross-Correlation Template Matching [0.0]
We consider discrete image registration when the underlying function is a one-dimensional spatially-limited piecewise constant function.
If the samples of the function are noisy, then image registration requires alignment and segmentation of the data sequences.
arXiv Detail & Related papers (2024-10-24T18:42:01Z) - Provably Robust Score-Based Diffusion Posterior Sampling for Plug-and-Play Image Reconstruction [31.503662384666274]
In science and engineering, the goal is to infer an unknown image from a small number of measurements collected from a known forward model describing certain imaging modality.
Motivated Score-based diffusion models, due to its empirical success, have emerged as an impressive candidate of an exemplary prior in image reconstruction.
arXiv Detail & Related papers (2024-03-25T15:58:26Z) - Neural Fields with Thermal Activations for Arbitrary-Scale Super-Resolution [56.089473862929886]
We present a novel way to design neural fields such that points can be queried with an adaptive Gaussian PSF.
With its theoretically guaranteed anti-aliasing, our method sets a new state of the art for arbitrary-scale single image super-resolution.
arXiv Detail & Related papers (2023-11-29T14:01:28Z) - Improving Feature Stability during Upsampling -- Spectral Artifacts and the Importance of Spatial Context [15.351461000403074]
Pixel-wise predictions are required in a wide variety of tasks such as image restoration, image segmentation, or disparity estimation.
Previous works have shown that resampling operations are subject to artifacts such as aliasing.
We show that the availability of large spatial context during upsampling allows to provide stable, high-quality pixel-wise predictions.
arXiv Detail & Related papers (2023-11-29T10:53:05Z) - Entropy Transformer Networks: A Learning Approach via Tangent Bundle
Data Manifold [8.893886200299228]
This paper focuses on an accurate and fast approach for image transformation employed in the design of CNN architectures.
A novel Entropy STN (ESTN) is proposed that interpolates on the data manifold distributions.
Experiments on challenging benchmarks show that the proposed ESTN can improve predictive accuracy over a range of computer vision tasks.
arXiv Detail & Related papers (2023-07-24T04:21:51Z) - Self-Supervised Training with Autoencoders for Visual Anomaly Detection [61.62861063776813]
We focus on a specific use case in anomaly detection where the distribution of normal samples is supported by a lower-dimensional manifold.
We adapt a self-supervised learning regime that exploits discriminative information during training but focuses on the submanifold of normal examples.
We achieve a new state-of-the-art result on the MVTec AD dataset -- a challenging benchmark for visual anomaly detection in the manufacturing domain.
arXiv Detail & Related papers (2022-06-23T14:16:30Z) - Degradation-Aware Unfolding Half-Shuffle Transformer for Spectral
Compressive Imaging [142.11622043078867]
We propose a principled Degradation-Aware Unfolding Framework (DAUF) that estimates parameters from the compressed image and physical mask, and then uses these parameters to control each iteration.
By plugging HST into DAUF, we establish the first Transformer-based deep unfolding method, Degradation-Aware Unfolding Half-Shuffle Transformer (DAUHST) for HSI reconstruction.
arXiv Detail & Related papers (2022-05-20T11:37:44Z) - Frequency selective extrapolation with residual filtering for image
error concealment [2.3484130340004326]
The purpose of signal extrapolation is to estimate unknown signal parts from known samples.
We propose a modified frequency selective extrapolation (FSE) that takes into account the low-pass behaviour of natural images.
arXiv Detail & Related papers (2022-05-16T06:59:36Z) - Coarse-to-Fine Sparse Transformer for Hyperspectral Image Reconstruction [138.04956118993934]
We propose a novel Transformer-based method, coarse-to-fine sparse Transformer (CST)
CST embedding HSI sparsity into deep learning for HSI reconstruction.
In particular, CST uses our proposed spectra-aware screening mechanism (SASM) for coarse patch selecting. Then the selected patches are fed into our customized spectra-aggregation hashing multi-head self-attention (SAH-MSA) for fine pixel clustering and self-similarity capturing.
arXiv Detail & Related papers (2022-03-09T16:17:47Z) - Deblurring via Stochastic Refinement [85.42730934561101]
We present an alternative framework for blind deblurring based on conditional diffusion models.
Our method is competitive in terms of distortion metrics such as PSNR.
arXiv Detail & Related papers (2021-12-05T04:36:09Z) - SRWarp: Generalized Image Super-Resolution under Arbitrary
Transformation [65.88321755969677]
Deep CNNs have achieved significant successes in image processing and its applications, including single image super-resolution.
Recent approaches extend the scope to real-valued upsampling factors.
We propose the SRWarp framework to further generalize the SR tasks toward an arbitrary image transformation.
arXiv Detail & Related papers (2021-04-21T02:50:41Z)
This list is automatically generated from the titles and abstracts of the papers in this site.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.