Rough sets offer an effective approach of managing uncertainties and can be employed for tasks such as data dependency analysis, feature identification, dimensionality reduction, and pattern classification. As these tasks are common in many medical applications it is only natural that rough sets, despite their relative ‘youth’ compared to other techniques, provide a suitable method in such applications. In this paper, we provide a short summary on the use of rough sets in the medical informatics domain, focussing on applications of medical image segmentation, pattern classification and computer assisted medical decision making.

In this paper, we propose a new image metamorphosis algorithm which uses elastic body splines to generate warp functions for interpolating scattered data points. The spline is based on a partial differential equation proposed by Navier that describes the equilibrium displacement of an elastic body subjected to forces. The spline maps can be expressed as the linear combination of an affine transformation and a Navier spline. The proposed algorithm generates a smooth warp that reflects feature point correspondences. It is efficient in time complexity and smoothly interpolated morphed images with only a remarkably small number of specified feature points. The algorithm allows each feature point in the source image to be mapped to the corresponding feature point in the destination image. Once the images are warped to align the positions of features and their shapes, the in-between facial animation from two given facial images can be defined by cross dissolving the positions of correspondence features and their shapes and colors. We describe an efficient cross-dissolve algorithm for generating the in-between images

This paper presents a feature-based retinal image registration schema. A structural feature, namely, bifurcation structure, has been used for the proposed feature-based registration schema. The bifurcation structure is composed of a master bifurcation point and its three connected neighbors. The characteristic vector of each bifurcation structure consists of the normalized branching angle and length, which is invariant against translation, rotation, scaling, and even modest distortion. The proposed schema is composed of five fundamental phases, namely, input retinal images pre-processing, vascular network detection, noise removal, bifurcation points detection in vascular networks, and bifurcation points matching in pairs of retinal images. The effectiveness of the proposed schema is demonstrated by the experiments with 12 pairs retinal images collected from clinical patients. The registration is carried out through optimizing a certain similarity function, namely, normalized correlation of images. It has been observed that the proposed schema has achieved good performance accuracy.

This paper proposes an elementary pattern detection approach for viruses propagated through e-mail and address books using the non-uniform pheromone deposition mechanism of ant colony. The local temporary tabu memory has been used to learn the pattern and it can combine known information from past viruses with a type of prediction for future viruses. This is achieved through certain generated test signature of viruses associated with e-mail over landscape. A non-uniform and non-decreasing time function for pheromone deposition and evaporation ensures that subsequent ants who are close enough to a previously selected trial solution will follow the trajectory or test landscape. They are capable to examine gradually thicker deposition of pheromone over the trajectory. It is empirically shown that the proposed modified pheromone learning mechanism can be an alternative approach to detect virus pattern for e-mail messages.