2011
DOI: 10.1002/nbm.1704
|View full text |Cite
|
Sign up to set email alerts
|

Using spatial prior knowledge in the spectral fitting of MRS images

Abstract: We propose a Bayesian smoothness prior in the spectral fitting of MRS images which can be used in addition to commonly employed prior knowledge. By combining a frequency-domain model for the free induction decay with a Gaussian Markov random field prior, a new optimization objective is derived that encourages smooth parameter maps. Using a particular parameterization of the prior, smooth damping, frequency and phase maps can be obtained whilst preserving sharp spatial features in the amplitude map. A Monte Car… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
22
0

Year Published

2016
2016
2022
2022

Publication Types

Select...
6
1

Relationship

0
7

Authors

Journals

citations
Cited by 15 publications
(22 citation statements)
references
References 44 publications
(96 reference statements)
0
22
0
Order By: Relevance
“…We solve this problem for all the spatial locations (or voxels) jointly, incorporating any spatial priors available (e.g., spatial smoothness constraints). Incorporation of spatial priors about the spectral parameters has been demonstrated to be useful for improving spectral quantification [10, 11] but at the expense of significantly increased computational complexity. The proposed subspace model in Eq.…”
Section: Proposed Methodsmentioning
confidence: 99%
See 2 more Smart Citations
“…We solve this problem for all the spatial locations (or voxels) jointly, incorporating any spatial priors available (e.g., spatial smoothness constraints). Incorporation of spatial priors about the spectral parameters has been demonstrated to be useful for improving spectral quantification [10, 11] but at the expense of significantly increased computational complexity. The proposed subspace model in Eq.…”
Section: Proposed Methodsmentioning
confidence: 99%
“…To simplify notation, let a ℓ, q = [ a ℓ, q ( x 1 ), a ℓ, q ( x 2 ), …, a ℓ, q ( x P )] T denote the linear coefficients for a particular basis and bold-italica=false[a1,1T,a1,2T,,a1,Q1T,,aL,1T,aL,2T,,aL,QLTfalse]T denote the collection of all the coefficients. Following [10, 11], we formulate the problem as a regularization problem: a=arg minap,ntrue‖dfalse(xp,tnfalse),qa,qfalse(xpfalse)b,qfalse(tnfalse)true‖22+Rfalse(bold-italicafalse),where R (·) represents a regularization functional imposing any desired spatial constraints. Two types of regularizations have been used for spectral quantification [10, 11]: a) weighted- L 2 regularization, and b) total variation regularization, both of which aim at imposing edge-preserving spatial smoothness on the linear coefficients.…”
Section: Proposed Methodsmentioning
confidence: 99%
See 1 more Smart Citation
“…Recent methods incorporate spatial prior knowledge as a regularization term, penalizing the parameter variation within neighboring voxels [18], [19]. The proposed method differs from these methods in the following key aspects.…”
Section: Discussionmentioning
confidence: 99%
“…Early efforts (e.g., Soher et al [17] and LCModel [11]) make use of parameters estimated from neighboring voxels to obtain a better initial guess or a stronger constraint to mitigate the local minimum problem. Recently, methods incorporating spatial prior knowledge through regularization have also been reported, promoting smoothness of the parameter maps (e.g., AQSES-MRSI [18] and Kelm et al [19]), which have led to significant improvements.…”
Section: Introductionmentioning
confidence: 99%