Abstract

This paper studies the problem of efficiently tuning the hyper-parameters in penalised least-squares reconstruction for XCT. Discovered through the lens of the Compressed Sensing paradigm, penalisation functionals such as Total Variation types of norms, form an essential tool for enforcing structure in inverse problems, a key feature in the case where the number of projections is small as compared to the size of the object to recover. In this paper, we propose a novel hyper-parameter selection approach for total variation (TV)-based reconstruction algorithms, based on a boosting type machine learning procedure initially proposed by Freund and Shapire and called Hedge. The proposed approach is able to select a set of hyper-parameters producing better reconstruction than the traditional Cross-Validation approach, with reduced computational effort. Traditional reconstruction methods based on penalisation can be made more efficient using boosting type methods from machine learning.

Highlights

  • X-ray computed tomography (XCT) is an important diagnostic tool used in medicine

  • This paper studies the problem of efficiently tuning the hyper-parameters in penalised least-squares reconstruction for XCT

  • We propose a novel hyper-parameter selection approach for total variation (TV)-based reconstruction algorithms, based on a boosting type machine learning procedure initially proposed by Freund and Shapire and called Hedge

Read more

Summary

Introduction

X-ray computed tomography (XCT) is an important diagnostic tool used in medicine. Recently, with the improvement of resolution and increase of energy, the technology is increasingly used for industrial application. The problem of image reconstruction in XCT considered in the present paper belongs to the wider family of inverse problems of the type: given a set of projections, concatenated into a vector y ∈ Y , and a forward operator A: X 7→ Y , find x s.t. kA( x ) − yk2 ≤ e. Recent advances in the field of MRI reconstruction opened the door to a whole new family of regularisations, based on the discovery that, in an appropriate dictionary, some features of the sought vector x are sparse. This breakthrough discovery appeared essential in the field of Compressed. On of the latest development in this area is the design of Total Variation type of regularisation functionals [6] and associated fast reconstruction algorithms [7,8]

Algorithms for XCT with Few Projections
The Problem of Hyperparameter Calibration
Description of the Reconstruction Method
Hyper-Parameters and Stopping Criterion of the AwPCSD Algorithm
Hedging Parameter Selection
The Proposed Approach
The Cross-Validation Approach
Numerical Studies
Performance Evaluation
Experiments with Different Datasets
Experiments with Real Data
Findings
Conclusions
Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.