1992
DOI: 10.1088/0031-9155/37/1/004
|View full text |Cite
|
Sign up to set email alerts
|

Constrained least-squares restoration and renogram deconvolution: a comparison by simulation

Abstract: Before deconvolution can be used in renography, it is necessary to decide whether the renal function is sufficiently good to allow it. To see if this decision can be circumvented, an iterative constrained least-squares restoration (CLSR) method was implemented in which the point of termination of the iteration occurs when a residual vector has a value less than an estimate of the noise in the original renogram curve. The technique was compared with the matrix algorithm and with direct FFT division. The compari… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
14
0

Year Published

1993
1993
2021
2021

Publication Types

Select...
6
2

Relationship

1
7

Authors

Journals

citations
Cited by 16 publications
(14 citation statements)
references
References 13 publications
0
14
0
Order By: Relevance
“…has been addressed by Tawatchai et al (1994), who applied a large set of different Butterworth ®lters when analysing the vascular phase of the RRF. Sutton & Kempi, 1992, 1993 proposed instead a constrained least-squares restoration (CLSR) deconvolution algorithm based on the FT, and employed a Wiener ®lter to handle the noise. They reported results superior to the outcome of 3-point smoothing, although the 3-point smoothings were not investigated with respect to the number of smoothings.…”
Section: Discussionmentioning
confidence: 99%
“…has been addressed by Tawatchai et al (1994), who applied a large set of different Butterworth ®lters when analysing the vascular phase of the RRF. Sutton & Kempi, 1992, 1993 proposed instead a constrained least-squares restoration (CLSR) deconvolution algorithm based on the FT, and employed a Wiener ®lter to handle the noise. They reported results superior to the outcome of 3-point smoothing, although the 3-point smoothings were not investigated with respect to the number of smoothings.…”
Section: Discussionmentioning
confidence: 99%
“…Processes of deconvolution and convolution were carried out in frequency domain as follows. For convolution the response function (time-activity curve; y ( t )) was described as the convolution integral (⊗) of the input function x ( t ) with the impulse response function f ( t ): y(t)=x(t)f(t). Equation (6) represents (5) in frequency domain: ψ=ξϕ. Frequency-domain deconvolution analysis [12] included regularization by the third difference operator function c = [1, −3,3, −1,0,…, 0]: (6)ϕ=ξψξξ+κκ. For this equation κ was the Fourier transform of c , the symbol * represented complex conjugate of the Fourier transforms, and ϕ , ξ , and ψ were the Fourier transforms of f ( t ), x ( t ), and y ( t ) calculated by fast Fourier transformations (FFTs).…”
Section: Methodsmentioning
confidence: 99%
“…A vascular spike (10,11) on the TAC, frequently observed at 30 sec after injection, i.e., the second curve point, was removed by bounding (10). The TAC were then subjected to three smooths using the smoothing operator (9,12,17). Prior to deconvolution, the data points of the first frame were excluded from calculations (10).…”
Section: Methodsmentioning
confidence: 99%
“…To address this problem, a variant of the AMA technique (AMA+) in which the AMA parameters were combined with the amplitude from the matrix algorithm was also entered to the study. In all cases, the MaxTT was defined as the time at which the retention function crossed the time-axis and the MTT as the area under the retention curve, divided by its amplitude (10,12).…”
Section: Deconvolution Techniques and Parametersmentioning
confidence: 99%