Semiparametric maximum likelihood analysis allows inference in errors-invariables models with small loss of efficiency relative to full likelihood analysis but with significantly weakened assumptions. In addition, since no distributional assumptions are made for the nuisance parameters, the analysis more nearly parallels that for usual regression. These highly desirable features and the high degree of modelling flexibility permitted warrant the development of the approach for routine use. This thesis does so for the special cases of linear and nonlinear regression with measurement errors in one explanatory variable. A transparent and flexible computational approach is developed, the analysis is exhibited on some examples, and finite sample properties of estimates, approximate standard errors, and likelihood ratio inference are clarified with simulation. / Graduation date: 2001

In this thesis, a new scheme based on the concept of compress-and-forward (CF) technique has been proposed. And expectation maximization (EM) algorithm is utilized to attain the aim of converging to a local optimum solution. According to the characteristic of EM algorithm, destination node would feed back a better decision to the relay node to be the next initial value. After the iteration, relay node would obtain a better detection result which would converge to a local optimum performance. At last the destination node would receive the optimum detection result from each relay and make a final decision. In the new structure, channel estimation can also be made at the relay node by EM algorithm, which is the reason why it is called joint distributed detection and estimation. Simulation shows that the proposed scheme would acquire an iteration gain at both the relay and destination node.

No description available.

Optimization problems are common throughout science, engineering and commerce. The desire to continually improve solutions and resolve larger, complex problems has given prominence to this field of research for several decades and has led to the development of a range of optimization algorithms for different class of problems. The Estimation of Distribution Algorithms (EDAs) are a relatively recent class of metaheuristic optimization algorithms based on using probabilistic modeling techniques to control the search process. Within the general EDA framework, a number of different probabilistic models have been previously proposed for both discrete and continuous optimization problems. This thesis focuses on GMMEDAs; continuous EDAs based on the Gaussian Mixture Models (GMM) with parameter estimation performed using the Expectation Maximization (EM) algorithm. To date, this type of model has only received limited attention in the literature. There are few previous experimental studies of the algorithms. Furthermore, a number of implementation details of Continuous Iterated Density Estimation Algorithm based on Gaussian Mixture Model have not been previously documented. This thesis intends to provide a clear description of the GMMEDAs, discuss the implementation decisions and details and provides experimental study to evaluate the performance of the algorithms. The effectiveness of the GMMEDAs with varying model complexity (structure of covariance matrices and number of components) was tested against five benchmark functions (Sphere, Rastrigin, Griewank, Ackley and Rosenbrock) with varying dimensionality (2−, 10− and 30−D). The effect of the selection pressure parameters is also studied in this experiment. The results of the 2D experiments show that a variant of the GMMEDA with moderate complexity (Diagonal GMMEDA) was able to optimize both unimodal and multimodal functions. Further, experimental analysis of the 10 and 30D functions optimized results indicates that the simpler variant of the GMMEDA (Spherical GMMEDA) was most effective of all three variants of the algorithm. However, a greater consistency in the results of these functions is achieved when the most complex variant of the algorithm (Full GMMEDA) is used. The comparison of the results for four artificial test functions - Sphere, Griewank, Ackley and Rosenbrock - showed that the GMMEDA variants optimized most of complex functions better than existing continuous EDAs. This was achieved because of the ability of the GMM components to model the functions effectively. The analysis of the results evaluated by variants of the GMMEDA showed that number of the components and the selection pressure does affect the optimum value of artificial test function. The convergence of the GMMEDA variants to the respective functions best local optimum has been caused more by the complexity in the GMM components. The complexity of GMMEDA because of the number of components increases as the complexity owing to the structure of the covariance matrices increase. However, while finding optimum value of complex functions the increased complexity in GMMEDA due to complex covariance structure overrides the complexity due to increase in number of components. Additionally, the affect on the convergence due to the number of components decreases for most functions when the selection pressure increased. These affects have been noticed in the results in the form of stability of the results related to the functions. Other factors that affect the convergence of the model to the local optima are the initialization of the GMM parameters, the number of the EM components, and the reset condition. The initialization of the GMM components, though not visible graphically in the 10D optimization has shown: for different initialization of the GMM parameters in 2D, the optimum value of the functions is affected. The initialization of the population in the Evolutionary Algorithms has shown to affect the convergence of the algorithm to the functions global optimum. The observation of similar affects due to initialization of GMM parameters on the optimization of the 2D functions indicates that the convergence of the GMM in the 10D could be affected, which in turn, could affect the optimum value of respective functions. The estimated values related to the covariance and mean over the EM iteration in the 2D indicated that some functions needed a greater number of EM iterations while finding their optimum value. This indicates that lesser number of EM iterations could affect the fitting of the components to the selected population in the 10D and the fitting can affect the effective modeling of functions with varying complexity. Finally, the reset condition has shown as resetting the covariance and the best fitness value of individual in each generation in 2D. This condition is certain to affect the convergence of the GMMEDA variants to the respective functions best local optimum. The rate at which the reset condition was invoked could certainly have caused the GMM components covariance values to reset to their initials values and thus the model fitting the percentage of the selected population could have been affected. Considering all the affects caused by the different factors, the results indicates that a smaller number of the components and percentage of the selected population with a simpler S-GMMEDA modeled most functions with a varying complexity.

Thesis (Ph. D.)--University of Missouri-Columbia, 1998. / Typescript. Vita. Includes bibliographical references (leaves 216-229). Also available on the Internet.

Thesis (Ph. D.)--University of Missouri-Columbia, 1998. / Typescript. Vita. Includes bibliographical references (leaves 216-229). Also available on the Internet.

Project (M.S.)--Brigham Young University. Dept. of Statistics, 2006. / Includes bibliographical references (p. 45-46).

Thesis (Ph.D.)--McMaster University, 2003. / Advisor: Shui Feng. Includes bibliographical references (leaves 94-102). Also available via World Wide Web.

Thesis (Ph. D. in Electrical Engineering)--Vanderbilt University, Dec. 2007. / Title from title screen. Includes bibliographical references.

This paper presents a statistical framework which combines the registration of an atlas with the segmentation of MR images. We use an Expectation Maximization-based algorithm to find a solution within the model, which simultaneously estimates image inhomogeneities, anatomical labelmap, and a mapping from the atlas to the image space. An example of the approach is given for a brain structure-dependent affine mapping approach. The algorithm produces high quality segmentations for brain tissues as well as their substructures. We demonstrate the approach on a set of 30 brain MR images. In addition, we show that the approach performs better than similar methods which separate the registration from the segmentation problem.