2019
DOI: 10.1016/j.flowmeasinst.2019.02.003
|View full text |Cite
|
Sign up to set email alerts
|

Split Bregman iteration based image reconstruction algorithm for electrical capacitance tomography

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
5
0

Year Published

2020
2020
2024
2024

Publication Types

Select...
6

Relationship

0
6

Authors

Journals

citations
Cited by 9 publications
(5 citation statements)
references
References 35 publications
0
5
0
Order By: Relevance
“…With the introduction of compressed sensing theory, L 1 norm sparse constrained problems have received considerable attention (Donoho 2006). The sparse constrained algorithm enables the construction of images from small amounts of data (Tong et al 2019). Goldstein and Osher showed that the split Bregman (SB) method could be used to solve L 1 norm sparse constrained problems and applied it to a compressed sensing problem in magnetic resonance imaging (Goldstein and Osher 2009).…”
Section: Introductionmentioning
confidence: 99%
“…With the introduction of compressed sensing theory, L 1 norm sparse constrained problems have received considerable attention (Donoho 2006). The sparse constrained algorithm enables the construction of images from small amounts of data (Tong et al 2019). Goldstein and Osher showed that the split Bregman (SB) method could be used to solve L 1 norm sparse constrained problems and applied it to a compressed sensing problem in magnetic resonance imaging (Goldstein and Osher 2009).…”
Section: Introductionmentioning
confidence: 99%
“…The TV optimization problem defined by ( 25) and ( 32) can be solved using several techniques, such as the primal-dual interior point method (PD-IPM) [23]- [25], the alternating direction method of multipliers (ADMM) [25], [32] and the split-Bregman distance method [33]- [35], [132]- [134]. Since the problem is non-linear, these techniques require iterative procedures without the existence of a closed-form solution.…”
Section: E Total Variation Regularizationmentioning
confidence: 99%
“…The Split Bregman (SB) method can be used to solve the unconstrained optimization problem, which splits the complex optimization problem into several simple sub-tasks. Each subtask can be solved by proper method [22,23]. The SB method can be applied to solve the following minimization problem:…”
Section: Split Bregman Frameworkmentioning
confidence: 99%