On Round-Off Errors and Gaussian Blur in Superresolution and in Image Registration

• URL: http://arxiv.org/abs/2412.09741v1
• Date: Thu, 12 Dec 2024 22:08:53 GMT
• Title: On Round-Off Errors and Gaussian Blur in Superresolution and in Image Registration
• Authors: Serap A. Savari,
• Abstract summary: We consider superresolution and discrete image registration for one-dimensional spatially-limited piecewise constant functions. We show that the difficulties in determining the discontinuity points from two sets of samples even in the absence of other types of noise.
• Score: 0.0
• License:
• Abstract: Superresolution theory and techniques seek to recover signals from samples in the presence of blur and noise. Discrete image registration can be an approach to fuse information from different sets of samples of the same signal. Quantization errors in the spatial domain are inherent to digital images. We consider superresolution and discrete image registration for one-dimensional spatially-limited piecewise constant functions which are subject to blur which is Gaussian or a mixture of Gaussians as well as to round-off errors. We describe a signal-dependent measurement matrix which captures both types of effects. For this setting we show that the difficulties in determining the discontinuity points from two sets of samples even in the absence of other types of noise. If the samples are also subject to statistical noise, then it is necessary to align and segment the data sequences to make the most effective inferences about the amplitudes and discontinuity points. Under some conditions on the blur, the noise, and the distance between discontinuity points, we prove that we can correctly align and determine the first samples following each discontinuity point in two data sequences with an approach based on dynamic programming.

Related papers

• On the Logic Elements Associated with Round-Off Errors and Gaussian Blur in Image Registration: A Simple Case of Commingling [0.0]
  We examine superresolution and discrete image registration for one-dimensional spatially-limited piecewise constant functions. We focus on a regime with low blur and suggest that the operations of blur, sampling, and quantization are not unlike the operation of a computer program. We describe a way to reason about two sets of samples of the same signal that will often result in the correct recovery of signal amplitudes.
  arXiv  Detail & Related papers  (2025-02-17T16:33:33Z)
• 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)
• A Counterexample in Image Registration [0.0]
  Image registration is a widespread problem which applies models about image transformation or image similarity to align discrete images of the same scene. In this work we estimate spatially-limited piecewise constant signals from two or more sets of noiseless sampling patterns. As a consequence, the accuracy of the estimate of the signal depends on the reference point of that signal.
  arXiv  Detail & Related papers  (2024-10-14T17:05:03Z)
• The Crystal Ball Hypothesis in diffusion models: Anticipating object positions from initial noise [92.53724347718173]
  Diffusion models have achieved remarkable success in text-to-image generation tasks. We identify specific regions within the initial noise image, termed trigger patches, that play a key role for object generation in the resulting images.
  arXiv  Detail & Related papers  (2024-06-04T05:06:00Z)
• 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)
• NoiseDiffusion: Correcting Noise for Image Interpolation with Diffusion Models beyond Spherical Linear Interpolation [86.7260950382448]
  We propose a novel approach to correct noise for image validity, NoiseDiffusion. NoiseDiffusion performs within the noisy image space and injects raw images into these noisy counterparts to address the challenge of information loss.
  arXiv  Detail & Related papers  (2024-03-13T12:32:25Z)
• Statistical Component Separation for Targeted Signal Recovery in Noisy Mixtures [2.619794838436152]
  "Statistical component separation" problems focus on recovering a predefined set of statistical descriptors of a target signal from a noisy mixture. We show that our method better recovers the descriptors of the target data than a standard denoising method in most situations. We extend this method by introducing a diffusive stepwise algorithm which gives a new perspective to the initial method.
  arXiv  Detail & Related papers  (2023-06-26T18:51:02Z)
• Diffusion with Forward Models: Solving Stochastic Inverse Problems Without Direct Supervision [76.32860119056964]
  We propose a novel class of denoising diffusion probabilistic models that learn to sample from distributions of signals that are never directly observed. We demonstrate the effectiveness of our method on three challenging computer vision tasks.
  arXiv  Detail & Related papers  (2023-06-20T17:53:00Z)
• Overlap-guided Gaussian Mixture Models for Point Cloud Registration [61.250516170418784]
  Probabilistic 3D point cloud registration methods have shown competitive performance in overcoming noise, outliers, and density variations. This paper proposes a novel overlap-guided probabilistic registration approach that computes the optimal transformation from matched Gaussian Mixture Model (GMM) parameters.
  arXiv  Detail & Related papers  (2022-10-17T08:02:33Z)
• Markup-to-Image Diffusion Models with Scheduled Sampling [111.30188533324954]
  Building on recent advances in image generation, we present a data-driven approach to rendering markup into images. The approach is based on diffusion models, which parameterize the distribution of data using a sequence of denoising operations. We conduct experiments on four markup datasets: mathematical formulas (La), table layouts (HTML), sheet music (LilyPond), and molecular images (SMILES)
  arXiv  Detail & Related papers  (2022-10-11T04:56:12Z)
• Degradation-agnostic Correspondence from Resolution-asymmetric Stereo [96.03964515969652]
  We study the problem of stereo matching from a pair of images with different resolutions, e.g., those acquired with a tele-wide camera system. We propose to impose the consistency between two views in a feature space instead of the image space, named feature-metric consistency. We find that, although a stereo matching network trained with the photometric loss is not optimal, its feature extractor can produce degradation-agnostic and matching-specific features.
  arXiv  Detail & Related papers  (2022-04-04T12:24:34Z)

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.