A way of generalizing onedimensional root-finding algorithms to the multidimensional case by means of recursion is shown and means to make the algorithms robust are discussed. In the second part, the algorithm is modified so as to exploit sparsity of large systems of equations for reducing the recursion depth and consequently decreasing the computational requirements of the method.
The paper presents an overview of image analysis activities of the Brno DAR group in the medical application area of retinal imaging. Particularly, illumination correction and SNR enhancement by registered averaging as preprocessing steps are briefly described; further mono- and multimodal registration methods developed for specific types of ophthalmological images, and methods for segmentation of optical disc, retinal vessel tree and autofluorescence areas are presented. Finally, the designed methods...
Page 1