Answers are grounded in this paper and cite their sources.
this paper a class of objective functions derived from an assumption of additive Gaussian errors by use of maximum likelihood principles is presented. Under these assumptions the likelihood functions L and objective functions # are related: L(m)=kexp - #(m) T (1.1) where T is a scaling parameter 4--6 and k is a normalization factor. The form in Eq. (1.1) is also related to the scaling of the objective functions in simulated annealing and genetic algorithms. m is the unknown parameters, these are any parameters used by an ocean-acoustic forward model, as geoacoustic, source and receiver parameters. 7 Good values of these parameters are found through optimization using exhaustive search, simulated annealing or 259 July 5, 2000 15:24 WSPC/130-JCA 00023 260 C. F. Mecklenbrauker & P. Gerstoft genetic algorithms. The forward models, the objective functions and the search methods are conveniently combined in one program package SAGA. 8 The assumptions leading to these objective functions are thus clear. As they are derived from maximum likelihood principles the resulting estimators have good properties. They are consistent, asymptotically Gaussian distributed, and asymptotically e#cient. Thus, they converge to the true value for a large number of data samples: The bias disappears asymptotically and the variance of the estimator approaches zero. Moreover, no other bias-free estimator exists with a smaller variance in the limit for a large number of data samples. The Cramer--Rao Bound is asymptotically tight. This means that no other ambiguity surface has stronger curvature at its peak if the peak is located at the true parameter. In that sense, it is the peakiest surface. However, the Cramer--Rao Bound is only a local measure, it provides no information abo...
No takes yet. Share an insight, caveat, or question.
Christoph F. Mecklenbräuker (2000) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: