The Curve Fitting Problem: A Bayesian Rejoinder

1999 ◽  
Vol 66 ◽  
pp. S390-S402 ◽  
Author(s):  
Prasanta S. Bandyopadhyay ◽  
Robert J. Boik
2021 ◽  
Vol 15 ◽  
Author(s):  
Zhenghui Hu ◽  
Fei Li ◽  
Junhui Shui ◽  
Yituo Tang ◽  
Qiang Lin

Dynamic susceptibility contrast-enhanced magnetic resonance imaging is an important tool for evaluating intravascular indicator dynamics, which in turn is valuable for understanding brain physiology and pathophysiology. This procedure usually involves fitting a gamma-variate function to observed concentration-time curves in order to eliminate undesired effects of recirculation and the leakage of contrast agents. Several conventional curve-fitting approaches are routinely applied. The nonlinear optimization methods typically are computationally expensive and require reliable initial values to guarantee success, whereas a logarithmic linear least-squares (LL-LS) method is more stable and efficient, and does not suffer from the initial-value problem, but it can show degraded performance, especially when a few data or outliers are present. In this paper, we demonstrate, that the original perfusion curve-fitting problem can be transformed into a gamma-distribution-fitting problem by treating the concentration-time curves as a random sample from a gamma distribution with time as the random variable. A robust maximum-likelihood estimation (MLE) algorithm can then be readily adopted to solve this problem. The performance of the proposed method is compared with the nonlinear Levenberg-Marquardt (L-M) method and the LL-LS method using both synthetic and real data. The results show that the performance of the proposed approach is far superior to those of the other two methods, while keeping the advantages of the LL-LS method, such as easy implementation, low computational load, and dispensing with the need to guess the initial values. We argue that the proposed method represents an attractive alternative option for assessing intravascular indicator dynamics in clinical applications. Moreover, we also provide valuable suggestions on how to select valid data points and set the initial values in the two traditional approaches (LL-LS and nonlinear L-M methods) to achieve more reliable estimations.


Author(s):  
Bernd Jaeger

The method of least squares is a geometric principle of curve fitting. The unknown parameters of a function are calculated in such a way that the sum of squared differences between function values and measurements gets minimal. Examples are given for a linear and a nonlinear curve fitting problem. Consequences of model linearizations are explained.


2011 ◽  
Vol 460-461 ◽  
pp. 106-110 ◽  
Author(s):  
Hung Jen Chen ◽  
Hao En Chueh ◽  
Deng Yang Huang

Discontinuous curve fitting is the task of finding a suitable function which is best fitting to a given set of data points. Once the expression forms of function and of error are determined, curve fitting is regarded as an optimization problem. In this paper, a measurement method is proposed to optimize curve fitting problem. The proposed method is based on genetic algorithm, namely GAOCF (GA based Optimizer for Curve Fitting). The main advantage is that the proposed GA based method can skip the local optimum solutions, and find out better solution in a huge searching space. Consequently, some arc data will be used to verify the feasibility and effectiveness of the GA based measurement method proposed in this paper.


2010 ◽  
Vol 121-122 ◽  
pp. 183-187
Author(s):  
Hung Jen Chen ◽  
Hao En Chueh

Curve fitting refers to the process of finding an appropriate function that fits a finite set of data points. Representing a set of data points by a function is quite beneficial in data analysis and reapplication, and this technique is often used in engineering and technical problems. Fitting accuracy and computational time are usually the most crucial factors to be taken care of in curve fitting problems. Previous researchers have demonstrated that genetic algorithms can effectively solve curve fitting problems, but the difficulty of parameter coding is also widely encountered in computational processes. Hence, this study addresses on applying real-valued genetic algorithm to deal with curve fitting problems. Detailed discussion is made on the optimization efficiency among various data, and finally, some key parameters to curve fitting results are found and presented.


2001 ◽  
Vol 68 (2) ◽  
pp. 218-241 ◽  
Author(s):  
Stanley A. Mulaik

Sign in / Sign up

Export Citation Format

Share Document