Analysis of Tomographic Reconstruction of 2D Images using the Distribution of Unknown Projection Angles

• URL: http://arxiv.org/abs/2304.06376v1
• Date: Thu, 13 Apr 2023 10:01:29 GMT
• Title: Analysis of Tomographic Reconstruction of 2D Images using the Distribution of Unknown Projection Angles
• Authors: Sheel Shah, Karthik S. Gurumoorthy, Ajit Rajwade
• Abstract summary: We extend the analytical bounds on the reconstruction error in such scenarios for quasi-bandlimited signals. We also prove that the method for such a reconstruction is resilient to a certain proportion of errors in the specification of the sample location ordering. This is the first piece of work to perform such an analysis for 2D cryo-EM, even though the associated reconstruction algorithms have been known for a long time.
• Score: 3.4720326275851994
• License: http://creativecommons.org/licenses/by-nc-nd/4.0/
• Abstract: It is well known that a band-limited signal can be reconstructed from its uniformly spaced samples if the sampling rate is sufficiently high. More recently, it has been proved that one can reconstruct a 1D band-limited signal even if the exact sample locations are unknown, but given just the distribution of the sample locations and their ordering in 1D. In this work, we extend the analytical bounds on the reconstruction error in such scenarios for quasi-bandlimited signals. We also prove that the method for such a reconstruction is resilient to a certain proportion of errors in the specification of the sample location ordering. We then express the problem of tomographic reconstruction of 2D images from 1D Radon projections under unknown angles with known angle distribution, as a special case for reconstruction of quasi-bandlimited signals from samples at unknown locations with known distribution. Building upon our theoretical background, we present asymptotic bounds for 2D quasi-bandlimited image reconstruction from 1D Radon projections in the unknown angles setting, which commonly occurs in cryo-electron microscopy (cryo-EM). To the best of our knowledge, this is the first piece of work to perform such an analysis for 2D cryo-EM, even though the associated reconstruction algorithms have been known for a long time.

Related papers

• 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)
• CoCPF: Coordinate-based Continuous Projection Field for Ill-Posed Inverse Problem in Imaging [78.734927709231]
  Sparse-view computed tomography (SVCT) reconstruction aims to acquire CT images based on sparsely-sampled measurements. Due to ill-posedness, implicit neural representation (INR) techniques may leave considerable holes'' (i.e., unmodeled spaces) in their fields, leading to sub-optimal results. We propose the Coordinate-based Continuous Projection Field (CoCPF), which aims to build hole-free representation fields for SVCT reconstruction.
  arXiv  Detail & Related papers  (2024-06-21T08:38:30Z)
• R2D2 image reconstruction with model uncertainty quantification in radio astronomy [1.7249361224827533]
  The Residual-to-Residual'' (R2D2) approach was recently introduced for Radio-Interferometric (RI) imaging in astronomy. R2D2's reconstruction is formed as a series of residual images, iteratively estimated as outputs of Deep Neural Networks (DNNs) We study the robustness of the R2D2 image estimation process, by studying the uncertainty associated with its series of learned models.
  arXiv  Detail & Related papers  (2024-03-26T19:10:08Z)
• Video Anomaly Detection via Spatio-Temporal Pseudo-Anomaly Generation : A Unified Approach [49.995833831087175]
  This work proposes a novel method for generating generic Video-temporal PAs by inpainting a masked out region of an image. In addition, we present a simple unified framework to detect real-world anomalies under the OCC setting. Our method performs on par with other existing state-of-the-art PAs generation and reconstruction based methods under the OCC setting.
  arXiv  Detail & Related papers  (2023-11-27T13:14:06Z)
• Gradient Descent Provably Solves Nonlinear Tomographic Reconstruction [60.95625458395291]
  In computed tomography (CT) the forward model consists of a linear transform followed by an exponential nonlinearity based on the attenuation of light according to the Beer-Lambert Law. We show that this approach reduces metal artifacts compared to a commercial reconstruction of a human skull with metal crowns.
  arXiv  Detail & Related papers  (2023-10-06T00:47:57Z)
• 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)
• Restoration-Degradation Beyond Linear Diffusions: A Non-Asymptotic Analysis For DDIM-Type Samplers [90.45898746733397]
  We develop a framework for non-asymptotic analysis of deterministic samplers used for diffusion generative modeling. We show that one step along the probability flow ODE can be expressed as two steps: 1) a restoration step that runs ascent on the conditional log-likelihood at some infinitesimally previous time, and 2) a degradation step that runs the forward process using noise pointing back towards the current gradient.
  arXiv  Detail & Related papers  (2023-03-06T18:59:19Z)
• SketchSampler: Sketch-based 3D Reconstruction via View-dependent Depth Sampling [75.957103837167]
  Reconstructing a 3D shape based on a single sketch image is challenging due to the large domain gap between a sparse, irregular sketch and a regular, dense 3D shape. Existing works try to employ the global feature extracted from sketch to directly predict the 3D coordinates, but they usually suffer from losing fine details that are not faithful to the input sketch.
  arXiv  Detail & Related papers  (2022-08-14T16:37:51Z)
• Orthogonal Matrix Retrieval with Spatial Consensus for 3D Unknown-View Tomography [58.60249163402822]
  Unknown-view tomography (UVT) reconstructs a 3D density map from its 2D projections at unknown, random orientations. The proposed OMR is more robust and performs significantly better than the previous state-of-the-art OMR approach.
  arXiv  Detail & Related papers  (2022-07-06T21:40:59Z)
• 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)
• Generalised Implicit Neural Representations [10.579386545934108]
  We consider the problem of learning implicit neural representations (INRs) for signals on non-Euclidean domains. In the Euclidean case, INRs are trained on a discrete sampling of a signal over a regular lattice. We show experiments with our method on various real-world signals on non-Euclidean domains.
  arXiv  Detail & Related papers  (2022-05-31T10:32:56Z)
• Robust reconstructions by multi-scale/irregular tangential covering [38.469070341871365]
  We employ a tangential cover algorithm - minDSS - in order to geometrically reconstruct noisy digital contours. By calculating multi-scale and irregular isothetic representations of the contour, we obtained 1-D intervals. We are now able to reconstruct the input noisy objects into cyclic contours made of lines or arcs with a minimal number of primitives.
  arXiv  Detail & Related papers  (2021-11-10T14:02:05Z)
• An Adversarial Learning Based Approach for Unknown View Tomographic Reconstruction [27.661868972910742]
  It is often presumed that projection angles associated with the projection lines are known in advance. Under certain situations, however, these angles are known only approximately or are completely unknown. We propose an adversarial learning based approach to recover the image and the projection angle distribution.
  arXiv  Detail & Related papers  (2021-08-23T00:28:47Z)
• 2-Step Sparse-View CT Reconstruction with a Domain-Specific Perceptual Network [14.577323946585755]
  We present a novel framework for sparse-view tomography by decoupling the reconstruction into two steps. The intermediate result allows for a closed-form tomographic reconstruction with preserved details and highly reduced streak-artifacts. Second, a refinement network, PRN, trained on the reconstructions reduces any remaining artifacts.
  arXiv  Detail & Related papers  (2020-12-08T21:16:43Z)
• Non-Convex Structured Phase Retrieval [0.0]
  Phase retrieval (PR) is a problem that occurs in numerous signal and image acquisition domains. Two commonly used structural assumptions are (i) sparsity a given signal/image or (ii) a low rank model on the matrix formed by a set, e.g., a time sequence of signals/images.
  arXiv  Detail & Related papers  (2020-06-23T20:12:40Z)
• The Generalized Lasso with Nonlinear Observations and Generative Priors [63.541900026673055]
  We make the assumption of sub-Gaussian measurements, which is satisfied by a wide range of measurement models. We show that our result can be extended to the uniform recovery guarantee under the assumption of a so-called local embedding property.
  arXiv  Detail & Related papers  (2020-06-22T16:43:35Z)

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.