2017
DOI: 10.1016/j.jmr.2017.05.010
|View full text |Cite
|
Sign up to set email alerts
|

Obtaining sparse distributions in 2D inverse problems

Abstract: The mathematics of inverse problems has relevance across numerous estimation problems in science and engineering. L regularization has attracted recent attention in reconstructing the system properties in the case of sparse inverse problems; i.e., when the true property sought is not adequately described by a continuous distribution, in particular in Compressed Sensing image reconstruction. In this work, we focus on the application of L regularization to a class of inverse problems; relaxation-relaxation, T-T,… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
22
0

Year Published

2017
2017
2024
2024

Publication Types

Select...
8

Relationship

2
6

Authors

Journals

citations
Cited by 27 publications
(22 citation statements)
references
References 66 publications
0
22
0
Order By: Relevance
“…An important factor is that NTGV regularization is a two-parameter regularization technique, as opposed to TV regularization and NN regularization which For completeness, the 3D T 2 maps obtained from the T 2 -weighted images are now considered. Each pixel in the 3D image is assigned a T 2 distribution by using L 1 regularization [43] to convert the decay of the pixel intensity into a T 2 distribution. As this step is not the focus of the paper, only an example is presented; the optimisation of the L 1 regularization technique is not considered.…”
Section: Resultsmentioning
confidence: 99%
“…An important factor is that NTGV regularization is a two-parameter regularization technique, as opposed to TV regularization and NN regularization which For completeness, the 3D T 2 maps obtained from the T 2 -weighted images are now considered. Each pixel in the 3D image is assigned a T 2 distribution by using L 1 regularization [43] to convert the decay of the pixel intensity into a T 2 distribution. As this step is not the focus of the paper, only an example is presented; the optimisation of the L 1 regularization technique is not considered.…”
Section: Resultsmentioning
confidence: 99%
“…Most regularization methods employ the ℓ 2 norm, ie Tikhonov regularization 52 with p = 2, and L is the identity matrix 12,16,17,22,25 ; however, there are cases where the ℓ 1 norm is preferable. [53][54][55] The regularization term forces neighboring points in f α ð Þ…”
Section: And the Kernel Matrix Asmentioning
confidence: 99%
“…To date, the L1 regularization problem Equation (A10) in NMR data inversion has been solved by a one-step iterative algorithm whose solution is only affected by the solution of the previous step at each iteration, such as the IST algorithm and the primal-dual hybrid gradient algorithm [26,27]. To improve the inversion speed, we used a TIST algorithm [28,39] to solve the objective function Equation (A10).…”
Section: Appendix Amentioning
confidence: 99%