CoShaRP: a convex program for single-shot tomographic shape sensing

DOI10.1088/1361-6420/AC1776MaRDI QIDQ4957754zbMATH OpenOpenAlexFDO

Authors Ajinkya Kadu, T. van Leeuwen, K. Joost Batenburg

Publication date 9 September 2021

Published in Inverse Problems (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/2012.04551

zbMATH Keywords

compressed sensingcomputational imagingconvex optimizationshape identificationx-ray tomography

Mathematics Subject Classification ID

Convex programming (90C25) Applications of mathematical programming (90C90)

Abstract: We introduce single-shot X-ray tomography that aims to estimate the target image from a single cone-beam projection measurement. This linear inverse problem is extremely under-determined since the measurements are far fewer than the number of unknowns. Moreover, it is more challenging than conventional tomography where a sufficiently large number of projection angles forms the measurements, allowing for a simple inversion process. However, single-shot tomography becomes less severe if the target image is only composed of known shapes. Hence, the shape prior transforms a linear ill-posed image estimation problem to a non-linear problem of estimating the roto-translations of the shapes. In this paper, we circumvent the non-linearity by using a dictionary of possible roto-translations of the shapes. We propose a convex program CoShaRP to recover the dictionary-coefficients successfully. CoShaRP relies on simplex-type constraint and can be solved quickly using a primal-dual algorithm. The numerical experiments show that CoShaRP recovers shapes stably from moderately noisy measurements.

Recommendations

• Sparse shape reconstruction
• Shape-based image reconstruction using linearized deformations
• scientific article; zbMATH DE number 1241803
• Sparse Radiographic Tomography and System Identification Imaging from Single View, Multiple Time Sample Density Plots
• Shape recovery for sparse-data tomography

Cites work

• A first-order primal-dual algorithm for convex problems with applications to imaging
• A unified primal-dual algorithm framework based on Bregman iteration
• An introduction to X-ray tomography and Radon transforms
• An inversion formula for cone-beam reconstruction
• Convex cardinal shape composition
• DART: A Practical Reconstruction Algorithm for Discrete Tomography
• Distributed optimization and statistical learning via the alternating direction method of multipliers
• Easy implementation of advanced tomography algorithms using the ASTRA toolbox with spot operators
• First-order methods in optimization
• scientific article; zbMATH DE number 2107836 (Why is no real title available?)
• Iterative Krylov Methods for Large Linear Systems
• On the Douglas-Rachford splitting method and the proximal point algorithm for maximal monotone operators
• Proximal splitting methods in signal processing
• Reducibility among combinatorial problems
• Sparse regularization in limited angle tomography
• Sparse shape reconstruction
• The mathematics of computerized tomography
• TVR-DART: A More Robust Algorithm for Discrete Tomography From Limited Projection Data With Automated Gray Value Estimation

Cited in

(3)

• Sparse shape reconstruction
• scientific article; zbMATH DE number 1241803 (Why is no real title available?)
• CoShaRP

Describes a project that uses

Uses Software

• UNLocBoX
• ASTRA
• RELION
• TVR-DART
• Trace

This page was built for publication: CoShaRP: a convex program for single-shot tomographic shape sensing

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4957754)