In this paper we propose a new density based clustering algorithm via using the Mahalanobis metric. This is motivated by the current state-of-the-art density clustering algorithm DBSCAN and some fuzzy clustering algorithms. There are two novelties for the proposed algorithm: One is to adopt the Mahalanobis metric as distance measurement instead of the Euclidean distance in DBSCAN and the other ...

Purpose: To measure retinal vascular caliber by image segmentation with training based on color image segmentation using Mahalanobis distance function. Method: cross-sectional observational study with 20 eyes of 10 normal individuals. Fundus photographs were captured and processed for target feature segmentation using MATLAB R2008 a. Data matrices for all the classes were built followed by calc...

A flexible description of images is offered by a cloud of points in a feature space. In the context of image retrieval such clouds can be represented in a number of ways. Two approaches are here considered. The first approach is based on the assumption of a normal distribution, hence homogeneous clouds, while the second one focuses on the boundary description, which is more suitable for multimo...

During the late few years, research in recognition of handwritten Chinese and Japanese characters has matured significantly. However, in order to obtain high recognition rate, most character recognition systems have paid extremely expensive computational cost. For high performance character recognition systems, how to reduce the expensive computational cost is a very important problem now. Disc...

A minimum spanning tree (MST) rank histogram (RH) is a multidimensional ensemble reliability verification tool. The construction of debiased, decorrelated, and covariance-homogenized MST RHs is described. Experiments using Euclidean L2, variance, and Mahalanobis norms imply that, unless the number of ensemble members is less than or equal to the number of dimensions being verified, the Mahalano...

We investigate from a global point of view the existence of cohesiveness among experts’ opinions. We address this general issue from three basic essentials: the management of experts’ opinions when they are expressed by ordinal information; the measurement of the degree of dissensus among such opinions; and the achievement of a group solution that conveys the minimum dissensus to the experts’ g...