On the Logic Elements Associated with Round-Off Errors and Gaussian Blur in Image Registration: A Simple Case of Commingling

• URL: http://arxiv.org/abs/2502.11992v1
• Date: Mon, 17 Feb 2025 16:33:33 GMT
• Title: On the Logic Elements Associated with Round-Off Errors and Gaussian Blur in Image Registration: A Simple Case of Commingling
• Authors: Serap A. Savari,
• Abstract summary: 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.
• Score: 0.0
• License:
• Abstract: Discrete image registration can be a strategy to reconstruct signals from samples corrupted by blur and noise. We examine 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. Previous approaches address the signal recovery problem as an optimization problem. 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 and have an abstraction that can be studied with a type of logic. When the minimum distance between discontinuity points is between $1.5$ and 2 times the sampling interval, we can encounter the simplest form of a type of interference between discontinuity points that we call ``commingling.'' 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. We also discuss ways to estimate bounds on the distances between discontinuity points.

Related papers

• On Round-Off Errors and Gaussian Blur in Superresolution and in Image Registration [0.0]
  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.
  arXiv  Detail & Related papers  (2024-12-12T22:08:53Z)
• 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)
• A Sample Efficient Alternating Minimization-based Algorithm For Robust Phase Retrieval [56.67706781191521]
  In this work, we present a robust phase retrieval problem where the task is to recover an unknown signal. Our proposed oracle avoids the need for computationally spectral descent, using a simple gradient step and outliers.
  arXiv  Detail & Related papers  (2024-09-07T06:37:23Z)
• 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)
• Nonparametric Extrema Analysis in Time Series for Envelope Extraction, Peak Detection and Clustering [0.0]
  We propose a nonparametric approach that can be used in envelope extraction, peak-burst detection and clustering in time series. Our problem formalization results in a naturally defined splitting/forking of the time series.
  arXiv  Detail & Related papers  (2021-09-05T14:21:24Z)
• Lifting the Convex Conjugate in Lagrangian Relaxations: A Tractable Approach for Continuous Markov Random Fields [53.31927549039624]
  We show that a piecewise discretization preserves better contrast from existing discretization problems. We apply this theory to the problem of matching two images.
  arXiv  Detail & Related papers  (2021-07-13T12:31:06Z)
• Towards Sample-Optimal Compressive Phase Retrieval with Sparse and Generative Priors [59.33977545294148]
  We show that $O(k log L)$ samples suffice to guarantee that the signal is close to any vector that minimizes an amplitude-based empirical loss function. We adapt this result to sparse phase retrieval, and show that $O(s log n)$ samples are sufficient for a similar guarantee when the underlying signal is $s$-sparse and $n$-dimensional.
  arXiv  Detail & Related papers  (2021-06-29T12:49:54Z)
• Lattice partition recovery with dyadic CART [79.96359947166592]
  We study piece-wise constant signals corrupted by additive Gaussian noise over a $d$-dimensional lattice. Data of this form naturally arise in a host of applications, and the tasks of signal detection or testing, de-noising and estimation have been studied extensively in the statistical and signal processing literature. In this paper we consider instead the problem of partition recovery, i.e.of estimating the partition of the lattice induced by the constancy regions of the unknown signal. We prove that a DCART-based procedure consistently estimates the underlying partition at a rate of order $sigma2 k*
  arXiv  Detail & Related papers  (2021-05-27T23:41:01Z)
• Spatially Adaptive Inference with Stochastic Feature Sampling and Interpolation [72.40827239394565]
  We propose to compute features only at sparsely sampled locations. We then densely reconstruct the feature map with an efficient procedure. The presented network is experimentally shown to save substantial computation while maintaining accuracy over a variety of computer vision tasks.
  arXiv  Detail & Related papers  (2020-03-19T15:36:31Z)
• The Simulator: Understanding Adaptive Sampling in the Moderate-Confidence Regime [52.38455827779212]
  We propose a novel technique for analyzing adaptive sampling called the em Simulator. We prove the first instance-based lower bounds the top-k problem which incorporate the appropriate log-factors. Our new analysis inspires a simple and near-optimal for the best-arm and top-k identification, the first em practical of its kind for the latter problem.
  arXiv  Detail & Related papers  (2017-02-16T23:42:02Z)

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.