A Convex Formulation for Binary Tomography

07/24/2018
by   Ajinkya Kadu, et al.
0

Binary tomography is concerned with the recovery of binary images from a few of their projections (i.e., sums of the pixel values along various directions). To reconstruct an image from noisy projection data, one can pose it as a constrained least-squares problem. As the constraints are non-convex, many approaches for solving it rely on either relaxing the constraints or heuristics. In this paper we propose a novel convex formulation, based on the Lagrange dual of the constrained least-squares problem. The resulting problem is a generalized LASSO problem which can be solved efficiently. It is a relaxation in the sense that it can only be guaranteed to give a feasible solution; not necessarily the optimal one. In exhaustive experiments on small images (2x2, 3x3, 4x4) we find, however, that if the problem has a unique solution, our dual approach finds it. In case of multiple solutions, our approach finds the commonalities between the solutions. Further experiments on realistic numerical phantoms and an experiment on X-ray dataset show that our method compares favourably to Total Variation and DART.

READ FULL TEXT
research
07/24/2018

A convex formulation for Discrete Tomography

Discrete tomography is concerned with the recovery of binary images from...
research
04/26/2014

Sinogram constrained TV-minimization for metal artifact reduction in CT

A new method for reducing metal artifacts in X-ray computed tomography (...
research
06/11/2023

Self-supervised Equality Embedded Deep Lagrange Dual for Approximate Constrained Optimization

Conventional solvers are often computationally expensive for constrained...
research
08/07/2022

Parabolic Relaxation for Quadratically-constrained Quadratic Programming – Part II: Theoretical Computational Results

In the first part of this work [32], we introduce a convex parabolic rel...
research
05/31/2017

Learning Graphs with Monotone Topology Properties and Multiple Connected Components

Learning graphs with topology properties is a non-convex optimization pr...
research
12/08/2020

CoShaRP: A Convex Program for Single-shot Tomographic Shape Sensing

We introduce single-shot X-ray tomography that aims to estimate the targ...
research
04/05/2023

Per-RMAP: Feasibility-Seeking and Superiorization Methods for Floorplanning with I/O Assignment

The feasibility-seeking approach provides a systematic scheme to manage ...

Please sign up or login with your details

Forgot password? Click here to reset