1997
DOI: 10.1006/jmre.1996.1043
|View full text |Cite
|
Sign up to set email alerts
|

The Use of Continuous Regularization in the Automated Analysis of MRS Time-Domain Data

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
5
0

Year Published

2001
2001
2013
2013

Publication Types

Select...
5
3

Relationship

0
8

Authors

Journals

citations
Cited by 13 publications
(5 citation statements)
references
References 7 publications
0
5
0
Order By: Relevance
“…By iterating this diagonalizationprojection-averaging procedure several times, we eventually get a K-rank Hankel matrix approximation to the original full rank noisy data matrix. Harmonic inversion methods are seen by us and others 18,19 to give significantly improved results when fed signals resulting from the Cadzow iterative scheme. Much of the past harmonic inversion work omitted this step.…”
Section: Windowingmentioning
confidence: 97%
“…By iterating this diagonalizationprojection-averaging procedure several times, we eventually get a K-rank Hankel matrix approximation to the original full rank noisy data matrix. Harmonic inversion methods are seen by us and others 18,19 to give significantly improved results when fed signals resulting from the Cadzow iterative scheme. Much of the past harmonic inversion work omitted this step.…”
Section: Windowingmentioning
confidence: 97%
“…Reference is a black box method with accompanying software that employs Cadzow’s preconditioning method and a Tikhanov type regularization called continuous regularization . Continuous regularization involves the calculation of polynomial coefficients in a way that minimizes a linear combination of the difference between the residual of the LP equation and the weighted norm of the solution vector whose elements are the LP coefficients.…”
Section: Relation To Other Workmentioning
confidence: 99%
“…Again, the method probably could not be used for the purposes of this paper. In fairness, the authors of ref never claimed it should be used for other than quantification at higher SNRs in MRS applications with signals obtained from the human brain.…”
Section: Relation To Other Workmentioning
confidence: 99%
“…Instead of truncating the SVD to rank K, a continuous regularization technique, called LPSVD(CR) 41 can be applied, an approach that leads to increased frequency resolution and the ability to automatically detect the number of significant peaks in the signal. 42,43 In EPLPSVD, 42,44 the Hankel structure of the H K matrix is restored by applying the Cadzow algorithm. In Chen et al 45 the principle of minimum variance is used to correct the K retained singular values prior to applying the Cadzow algorithm.…”
Section: Quantitation Algorithmsmentioning
confidence: 99%