Adaptive threshold split Bregman algorithm based on magnetic induction tomography for brain injury monitoring imaging

Author(s):  
Tao Zhang ◽  
Xuechao Liu ◽  
Weirui Zhang ◽  
Meng Dai ◽  
Cheng Chen ◽  
...  
Sensor Review ◽  
2019 ◽  
Vol 39 (2) ◽  
pp. 257-268
Author(s):  
F. Li ◽  
M. Soleimani ◽  
J. Abascal

Purpose Magnetic induction tomography (MIT) is a tomographic imaging technique with a wide range of potential industrial applications. Planar array MIT is a convenient setup but unable to access freely from the entire periphery as it only collects measurements from one surface, so it remains challenging given the limited data. This study aims to assess the use of sparse regularization methods for accurate position and depth detection in planar array MIT. Design/methodology/approach The most difficult challenges in MIT are to solve the inverse and forward problems. The inversion of planar MIT is severely ill-posed due to limited access data. Thus, this paper posed a total variation (TV) problem and solved it efficiently with the Split Bregman formulation to overcome this difficulty. Both isotropic and anisotropic TV formulations are compared to Tikhonov regularization with experimental MIT data. Findings The results show that Tikhonov method failed or underestimated the object position and depth. Both isotropic and anisotropic TV led to accurate recovery of depth and position. Originality/value There are numerous potential applications for planar array MIT where access to the materials under testing is restrict. Sparse regularization methods are a promising approach to improving depth detection for limited MIT data.


2019 ◽  
Vol 61 (3) ◽  
pp. 255-259
Author(s):  
Lipan Zhang ◽  
Qifeng Meng ◽  
Kai Song ◽  
Ming Gao ◽  
Zhiyuan Cheng

2011 ◽  
Author(s):  
Russell Warren ◽  
Stanley Osher ◽  
Richard Vanderbeek

Author(s):  
Jingwen Wang ◽  
Xu Wang ◽  
Dan Yang ◽  
Kaiyang Wang

Background: Image reconstruction of magnetic induction tomography (MIT) is a typical ill-posed inverse problem, which means that the measurements are always far from enough. Thus, MIT image reconstruction results using conventional algorithms such as linear back projection and Landweber often suffer from limitations such as low resolution and blurred edges. Methods: In this paper, based on the recent finite rate of innovation (FRI) framework, a novel image reconstruction method with MIT system is presented. Results: This is achieved through modeling and sampling the MIT signals in FRI framework, resulting in a few new measurements, namely, fourier coefficients. Because each new measurement contains all the pixel position and conductivity information of the dense phase medium, the illposed inverse problem can be improved, by rebuilding the MIT measurement equation with the measurement voltage and the new measurements. Finally, a sparsity-based signal reconstruction algorithm is presented to reconstruct the original MIT image signal, by solving this new measurement equation. Conclusion: Experiments show that the proposed method has better indicators such as image error and correlation coefficient. Therefore, it is a kind of MIT image reconstruction method with high accuracy.


2020 ◽  
Vol 12 (11) ◽  
pp. 1747 ◽  
Author(s):  
Yin Zhang ◽  
Qiping Zhang ◽  
Yongchao Zhang ◽  
Jifang Pei ◽  
Yulin Huang ◽  
...  

Deconvolution methods can be used to improve the azimuth resolution in airborne radar imaging. Due to the sparsity of targets in airborne radar imaging, an L 1 regularization problem usually needs to be solved. Recently, the Split Bregman algorithm (SBA) has been widely used to solve L 1 regularization problems. However, due to the high computational complexity of matrix inversion, the efficiency of the traditional SBA is low, which seriously restricts its real-time performance in airborne radar imaging. To overcome this disadvantage, a fast split Bregman algorithm (FSBA) is proposed in this paper to achieve real-time imaging with an airborne radar. Firstly, under the regularization framework, the problem of azimuth resolution improvement can be converted into an L 1 regularization problem. Then, the L 1 regularization problem can be solved with the proposed FSBA. By utilizing the low displacement rank features of Toeplitz matrix, the proposed FSBA is able to realize fast matrix inversion by using a Gohberg–Semencul (GS) representation. Through simulated and real data processing experiments, we prove that the proposed FSBA significantly improves the resolution, compared with the Wiener filtering (WF), truncated singular value decomposition (TSVD), Tikhonov regularization (REGU), Richardson–Lucy (RL), iterative adaptive approach (IAA) algorithms. The computational advantage of FSBA increases with the increase of echo dimension. Its computational efficiency is 51 times and 77 times of the traditional SBA, respectively, for echoes with dimensions of 218 × 400 and 400 × 400 , optimizing both the image quality and computing time. In addition, for a specific hardware platform, the proposed FSBA can process echo of greater dimensions than traditional SBA. Furthermore, the proposed FSBA causes little performance degradation, when compared with the traditional SBA.


Sign in / Sign up

Export Citation Format

Share Document