Retinal fundus photographs are employed as standard diagnostic tools in ophthalmology. Serial photographs of the flow of fluorescein and indocyanine green (ICG) dye are used to determine the areas of the retinal lesions. For objective measurements of features, the registration of the images is a necessity. In this paper, we employ optimization techniques for registration with the help of 2-parameter translational motion model of retinal angiograms, based on non-linear pre-processing (Wiener filtering and morphological gradient) and computation of the similarity criteria for the alignment of the two gradient images for any given rigid transformation. The optimization methods are effectively employed to minimize the similarity criterion.
The presence of noise, the variations in the background and the temporal variation of the fluorescence level pose serious problems in obtaining a robust registration of the retinal images. Moreover, local search strategies are not robust in the case of ICG angiograms, even if one uses a multiresolution approach.
The present work makes a systematic comparison of different optimization techniques, namely the minimization method derived from the optical flow formulation, the Nelder-Mead local search and the HCIAC ant colony metaheuristic, each optimizing a similarity criterion for the gradient images. The impact of the resolution and median filtering of gradient image is studied and the robustness of the approaches is tested through experimental studies, performed on macular fluorescein and ICG angiographies.
Our proposed optimization techniques have shown interesting results especially for high resolution difficult registration problems. Moreover, this approach seems promising for affine (6-parameter motion model) or elastical registrations. 相似文献
Summary There have been a number of attempts in the last years to localize the generators of brain electromagnetic activity, considering one current dipole as the source model. Single Dipole Localization (SDL) requires the selection of an optimization algorithm (OA). General aspects related with the selection, implementation and evaluation of some of the OA employed for SDL are discussed in this paper. Specifically the performance of two algorithms, those of Hooke-Jeeves and Levenberg-Marquardt, are tested by simulations. Suggestions for including restrictions to the dipole position and comments about some commonly used measures of the goodness of fit are given. Examples of erroneous implementations of these algorithms are also illustrated. A simple graphic rejection criterion, which can be easily used by inexperienced researchers, is introduced and tested in noisy and noise free simulations.The authors are grateful to Roberto D. Pascual Marqui for programming the Hooke-Jeeves algorithm. 相似文献
In this paper it is demonstrated how the optimum composition of a mixture for direct compression consisting of -lactose monohydrate, roller-dried -lactose and microcrystalline cellulose can be found using a systematic optimization technique. The experiments were chosen according to a simplex lattice design. The results of these experiments were used to fit a mathematical model, which then can predict the properties of all possible mixture compositions and enables a graphic representation of these properties in the form of contour plots. At a level of 4% the effect of three disintegrants (sodium starch glycolate, croscarmellose sodium and crospovidone) on the properties of the tablets compressed from these filler-binders, was evaluated by superimposing the contour plots of the different tablet responses. It was found that all the disintegrants used were effective in this combination of filler-binders. In order to evaluate drug dissolution rate an extra experiment with crospovidone as the disintegrant was performed, in which oxazepam was used as a test drug. 相似文献
In this paper a survey of recent results on iterative reconstruction algorithms is given. These results, many of which have not yet appeared elsewhere, are applicable to a very general formulation of the reconstruction problem based on the series expansion approach. A set of optimization criteria and a number of iterative reconstruction algorithms are stated, together with theorems on the convergence of the algorithms to optimum images. The efficacy of the algorithms is compared to that of the convolution method. In particular, the falseness of the claim that ART and the backprojection method are the same is demonstrated. 相似文献