Efficient Constrained Signal Reconstruction by Randomized Epigraphical Projection

Abstract

This paper proposes a randomized optimization framework for constrained signal reconstruction, where the word "constrained" implies that data-fidelity is imposed as a hard constraint instead of adding a data-fidelity term to an objective function to be minimized. Such formulation facilitates the selection of regularization terms and hyperparameters, but due to the non-separability of the data-fidelity constraint, it does not suit block-coordinate-wise randomization as is. To resolve this, we give another expression of the data-fidelity constraint via epigraphs, which enables to design a randomized solver based on a stochastic proximal algorithm with randomized epigraphical projection. Our method is very efficient especially when the problem involves non-structured large matrices. We apply our method to CT image reconstruction, where the advantage of our method over the deterministic counterpart is demonstrated.

To be presented at ICASSP 2019

Cited by in corpus (7)

• Randomized Subspace Newton Convex Method Applied to Data-Driven Sensor Selection Problem
• Graph Spatio-Spectral Total Variation Model for Hyperspectral Image Denoising
• A General Destriping Framework for Remote Sensing Images Using Flatness Constraint
• Randomized Group-Greedy Method for Large-Scale Sensor Selection Problems
• Epigraphical Relaxation for Minimizing Layered Mixed Norms
• Robust Hyperspectral Image Fusion with Simultaneous Guide Image Denoising via Constrained Convex Optimization
• A Constrained Convex Optimization Approach to Hyperspectral Image Restoration with Hybrid Spatio-Spectral Regularization