In this paper, we present a new fast architecture to compute the distance between cliques in different graphs. The distance obtained is used as a support function for graph labelling using probabflistic relaxation techniques. The architecture presented consists on a pipe-lined structure which computes the distance between an input clique and k reference cliques. The number of processing element...

The feature map represented by the set of weight vectors of the basic SOM (Self-Organizing Map) provides a good approximation to the input space from which the sample vectors come. But the timedecreasing learning rate and neighborhood function of the basic SOM algorithm reduce its capability to adapt weights for a varied environment. In dealing with non-stationary input distributions and changi...

potato image segmentation is an important part of image-based potato defect detection. this paper presents a robust potato color image segmentation through a combination of a fuzzy rule based system, an image thresholding based on genetic algorithm (ga) optimization and morphological operators. the proposed potato color image segmentation is robust against variation of background, distance and ...

Missing values in data are common in real world applications. Since the performance of many data mining algorithms depend critically on it being given a good metric over the input space, we decided in this paper to define a distance function for unlabeled datasets with missing values. We use the Bhattacharyya distance, which measures the similarity of two probability distributions, to define ou...

t i o Measurement of absolute myocardial blood flow (MBF) and coronary flow reserve (CFR) is of great importance clinically. To make such measurements quantitatively, one must also measure the arterial input function (AIF). Many studies, including the one reported by Vasquez et al. (1) in this issue of iJACC, which focuses on rubidium-82 (Rb), have sought optimal ways to measure the AIF for a v...