• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.14 no.3
• /
• pp.1416-1421
• /
• 2013

In this paper, the Euclidean distance between the probability density functions (PDFs) for biased errors and a Dirac-delta function located at zero on the error axis is proposed as a new performance criterion for adaptive systems in non-Gaussian noise environments. Also, based on the proposed performance criterion, a supervised adaptive algorithm is derived and applied to adaptive equalization in the shallow-water communication channel distorted by severe multipath fading, impulsive and DC-bias noise. The simulation results compared with the performance of the existing MEDE algorithm show that the proposed algorithm yields over 5 dB of MSE enhancement and the capability of relocating the mean of the error PDF to zero on the error axis.

• The Pure and Applied Mathematics
• /
• v.19 no.4
• /
• pp.337-347
• /
• 2012

The taxicab distance and Chinese-checker distance in the plane are practical distance notions with a wide range of applications compared to the Euclidean distance. The ${\alpha}$-distance was introduced as a generalization of these two distance functions. In this paper, we study alpha circle, trigonometry, and the area of a triangle in the plane with ${\alpha}$-distance.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.19 no.5
• /
• pp.667-673
• /
• 2009

This paper presents an efficient facial expression recognition method by measuring the histogram distance based on preprocessing. The preprocessing that uses both centroid shift and histogram equalization is applied to improve the recognition performance, The distance measurement is also applied to estimate the similarity between the facial expressions. The centroid shift based on the first moment balance technique is applied not only to obtain the robust recognition with respect to position or size variations but also to reduce the distance measurement load by excluding the background in the recognition. Histogram equalization is used for robustly recognizing the poor contrast of the images due to light intensity. The proposed method has been applied for recognizing 72 facial expression images(4 persons * 18 scenes) of 320*243 pixels. Three distances such as city-block, Euclidean, and ordinal are used as a similarity measure between histograms. The experimental results show that the proposed method has superior recognition performances compared with the method without preprocessing. The ordinal distance shows superior recognition performances over city-block and Euclidean distances, respectively.

• Journal of KIISE:Computing Practices and Letters
• /
• v.16 no.10
• /
• pp.949-954
• /
• 2010

Computing the rotation-invariant distance between image time-series is a time-consuming process that incurs a lot of Euclidean distances for all possible rotations. In this paper we propose an innovative solution that significantly reduces the number of Euclidean distances using the triangular inequality. To this end, we first present the notion of self rotation distance and show that, by using the self rotation distance with the triangular inequality, we can prune many unnecessary distance computations. We next present that only one self-rotation is enough for all self-rotation distances required. Experimental results show that our self rotation distance-based methods outperform the existing methods by up to an order of magnitude.

• Proceedings of the IEEK Conference
• /
• 2000.11d
• /
• pp.263-266
• /
• 2000

We proposes a new fingerprint minutia matching algorithm which matches the fingerprint minutiae by using adaptive distance. In general, fingerprint is deformed by pressure and orientation when a user press his fingerprint to sensor. These nonlinear deformations change the distance between minutiae and reduce verification rate. We define the adaptive distance using ridge frequency. Adaptive distance normalizes the distance between minutiae and compensates for nonlinear deformation. Our algorithm can distinguish two different fingerprints better and is more robust. Experimental results show that the performance of the proposed algorithm is superior to using Euclidean distance.

• Journal of applied mathematics & informatics
• /
• v.13 no.1_2
• /
• pp.323-334
• /
• 2003

This paper presents a goal-programming (GP) model for management decision-making for sugarcane fertilizer mix problems. Sensitivity analysis on the priority structure of the goals has been performed to obtain all possible solutions. The study uses Euclidean distance function to measure distances of all possible solutions from the ideal solution. The optimum solution is determined from the minimum distance between the ideal solution and other possible solutions of the problem. The optimum solution corresponds to the appropriate priority structure of the problem in the decision-making context. furthermore, the results obtained from sensitivity analysis on the cost of combination of fertilizers confirm the priority structure.

• Journal of the Korea Society for Simulation
• /
• v.14 no.3
• /
• pp.137-146
• /
• 2005

In parametric approach to a signature verification, it generally uses so many redundant features unsuitable for each individual signature that it causes harm, instead. This paper proposes a method of determining personalized weights of a feature set in signature verification with parametric approach by identifying the characteristics of each feature. For an individual signature, we define a degree of how difficult it is for any other person to forge the one's (called 'DFD' as the Degree of Forgery Difficulty). According to the statistical characteristics and the intuitional characteristics of each feature, the standard features are classified into four types. Four types of DFD functions are defined and applied into the distance calculation as a personalized weight factor. Using this method, the error rate of signature verification is reduced and the variation of the performance is less sensitive to the changes of decision threshold.

• Communications for Statistical Applications and Methods
• /
• v.22 no.4
• /
• pp.321-331
• /
• 2015

The K-means clustering algorithm is a popular and widely used method for clustering. For covariance matrices, we consider a geodesic clustering algorithm based on the K-means clustering framework in consideration of symmetric positive definite matrices as a Riemannian (non-Euclidean) manifold. This paper considers a geodesic clustering algorithm for data consisting of symmetric positive definite (SPD) matrices, utilizing the Riemannian geometric structure for SPD matrices and the idea of a K-means clustering algorithm. A K-means clustering algorithm is divided into two main steps for which we need a dissimilarity measure between two matrix data points and a way of computing centroids for observations in clusters. In order to use the Riemannian structure, we adopt the geodesic distance and the intrinsic mean for symmetric positive definite matrices. We demonstrate our proposed method through simulations as well as application to real financial data.

• Journal of Broadcast Engineering
• /
• v.8 no.4
• /
• pp.481-491
• /
• 2003

We present a near-optimal blind decision feedback equalizer (DFE) for Advanced Television Systems Committee digital television (DTV) receivers. By adopting a modified trellis decoder (MTD) with trace back depth of 1 for the decision device In the DFE, we obtain a hardware-efficient near-optimal blind DFE approaching to the optimal DFE which has no error propagation. The MTD uses absolute distance instead of Euclidean distance for computation of a path metric, resulting. In reduced computational complexity. Comparing to the conventional slicer, the MTD shows outstanding performance improvement of decision error probability and is comparable to the original trellis decoder using Euclidean distance. Reducing error propagation in the DFE leads to the improvement of convergence performance in terms of convergence speed and residual error. Simulation results show that the proposed blind DFE performs much better than the blind DFE with the slicer.

• Journal of the Korean Data and Information Science Society
• /
• v.17 no.2
• /
• pp.529-536
• /
• 2006

Investigators use either Euclidean distance or volume of a simplex defined composed of data points as agreement index to measure chance-corrected agreement among observers for multivariate interval data. The agreement coefficient proposed by Um(2004) is based on a volume of a simplex and does not depend on the variables' measuring units. We consider a comparison of Um(2004)'s agreement coefficient with others based on two unit-free distance measures, Pearson distance and Mahalanobis distance. Comparison among them is made using hypothetical data set.