Orthogonal Matrix Retrieval with Spatial Consensus for 3D Unknown-View
Tomography
- URL: http://arxiv.org/abs/2207.02985v2
- Date: Sat, 10 Jun 2023 15:38:13 GMT
- Title: Orthogonal Matrix Retrieval with Spatial Consensus for 3D Unknown-View
Tomography
- Authors: Shuai Huang, Mona Zehni, Ivan Dokmani\'c, Zhizhen Zhao
- Abstract summary: 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.
- Score: 58.60249163402822
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: Unknown-view tomography (UVT) reconstructs a 3D density map from its 2D
projections at unknown, random orientations. A line of work starting with Kam
(1980) employs the method of moments (MoM) with rotation-invariant Fourier
features to solve UVT in the frequency domain, assuming that the orientations
are uniformly distributed. This line of work includes the recent orthogonal
matrix retrieval (OMR) approaches based on matrix factorization, which, while
elegant, either require side information about the density that is not
available, or fail to be sufficiently robust. For OMR to break free from those
restrictions, we propose to jointly recover the density map and the orthogonal
matrices by requiring that they be mutually consistent. We regularize the
resulting non-convex optimization problem by a denoised reference projection
and a nonnegativity constraint. This is enabled by the new closed-form
expressions for spatial autocorrelation features. Further, we design an
easy-to-compute initial density map which effectively mitigates the
non-convexity of the reconstruction problem. Experimental results show that the
proposed OMR with spatial consensus is more robust and performs significantly
better than the previous state-of-the-art OMR approach in the typical low-SNR
scenario of 3D UVT.
Related papers
- R$^2$-Gaussian: Rectifying Radiative Gaussian Splatting for Tomographic Reconstruction [53.19869886963333]
3D Gaussian splatting (3DGS) has shown promising results in rendering image and surface reconstruction.
This paper introduces R2$-Gaussian, the first 3DGS-based framework for sparse-view tomographic reconstruction.
arXiv Detail & Related papers (2024-05-31T08:39:02Z) - Hyperspectral Band Selection based on Generalized 3DTV and Tensor CUR Decomposition [8.812294191190896]
Hyperspectral Imaging serves as an important technique in remote sensing.
High dimensionality and data volume pose significant computational challenges.
We propose a novel hyperspectral band selection model by decomposing the data into a low-rank and smooth component and a sparse one.
arXiv Detail & Related papers (2024-05-02T02:23:38Z) - Gaussian Opacity Fields: Efficient Adaptive Surface Reconstruction in Unbounded Scenes [50.92217884840301]
Gaussian Opacity Fields (GOF) is a novel approach for efficient, high-quality, and adaptive surface reconstruction in scenes.
GOF is derived from ray-tracing-based volume rendering of 3D Gaussians.
GOF surpasses existing 3DGS-based methods in surface reconstruction and novel view synthesis.
arXiv Detail & Related papers (2024-04-16T17:57:19Z) - Plug-and-Play Regularization on Magnitude with Deep Priors for 3D Near-Field MIMO Imaging [0.0]
Near-field radar imaging systems are used in a wide range of applications such as concealed weapon detection and medical diagnosis.
We consider the problem of the three-dimensional (3D) complex-valued reflectivity by enforcing regularization on its magnitude.
arXiv Detail & Related papers (2023-12-26T12:25:09Z) - 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) - Decomposed Diffusion Sampler for Accelerating Large-Scale Inverse
Problems [64.29491112653905]
We propose a novel and efficient diffusion sampling strategy that synergistically combines the diffusion sampling and Krylov subspace methods.
Specifically, we prove that if tangent space at a denoised sample by Tweedie's formula forms a Krylov subspace, then the CG with the denoised data ensures the data consistency update to remain in the tangent space.
Our proposed method achieves more than 80 times faster inference time than the previous state-of-the-art method.
arXiv Detail & Related papers (2023-03-10T07:42:49Z) - Exact Decomposition of Joint Low Rankness and Local Smoothness Plus
Sparse Matrices [39.47324019377441]
We propose a new RPCA model based on three-dimensional correlated total variation regularization (3DCTV-RPCA for short)
We prove that under some mild assumptions, the proposed 3DCTV-RPCA model can decompose both components exactly.
arXiv Detail & Related papers (2022-01-29T13:58:03Z) - NuSPAN: A Proximal Average Network for Nonuniform Sparse Model --
Application to Seismic Reflectivity Inversion [23.080395291046408]
We solve the problem of proximal deconvolution in the context of high-resolution recovery of seismic data.
We employ a combination of convex and non-uniform signalizers.
The resulting sparse network architecture can be acquired in a data-driven fashion.
arXiv Detail & Related papers (2021-05-01T04:33:02Z) - Canny-VO: Visual Odometry with RGB-D Cameras based on Geometric 3D-2D
Edge Alignment [85.32080531133799]
This paper reviews the classical problem of free-form curve registration and applies it to an efficient RGBD visual odometry system called Canny-VO.
Two replacements for the distance transformation commonly used in edge registration are proposed: Approximate Nearest Neighbour Fields and Oriented Nearest Neighbour Fields.
3D2D edge alignment benefits from these alternative formulations in terms of both efficiency and accuracy.
arXiv Detail & Related papers (2020-12-15T11:42:17Z)
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.