• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.42 no.1
• /
• pp.268-278
• /
• 2017

In this paper, we propose two novel detection schemes with low-complexity based on the unified receiver architecture which minimizes a fundamental tradeoff at rate-energy region in SWIPT system. The proposed detection schemes are twofold: The two-stage detection scheme and Euclidean distance combination detection scheme. The two-stage detection scheme detects amplitude information of symbols from rectified signals for energy harvesting. In the sequel, it detects symbols based on phase information of baseband signals for information decoding. The Euclidean distance combination detection scheme detects symbols using linear positive-weighted sum of two metrics: Euclidean distance based on baseband signals for information decoding and Euclidean distance based on rectified signals for energy harvesting. For numerical results, we confirm that the proposed detection scheme can achieve better performance than the conventional scheme in terms of symbol error rate, symbol success rate-energy region and achievable rate-energy region.

• International Journal of CAD/CAM
• /
• v.8 no.1
• /
• pp.45-53
• /
• 2009

As the point sampling technology evolves rapidly, there has been increasing need in generating tool path from dense point set without creating intermediate models such as triangular meshes or surfaces. In this paper, we present a new tool path generation method from point set using Euclidean distance fields based on Algebraic Point Set Surfaces (APSS). Once an Euclidean distance field from the target shape is obtained, it is fairly easy to generate tool paths. In order to compute the distance from a point in the 3D space to the point set, we locally fit an algebraic sphere using moving least square method (MLS) for accurate and simple calculation. This process is repeated until it converges. The main advantages of our approach are : (1) tool paths are computed directly from point set without making triangular mesh or surfaces and their offsets, and (2) we do not have to worry about no local interference at concave region compared to the other methods using triangular mesh or surface model. Experimental results show that our approach can generate accurate enough tool paths from a point set in a robust manner and efficiently.

• Journal of the Korea Institute of Military Science and Technology
• /
• v.14 no.6
• /
• pp.1073-1080
• /
• 2011

In this study, a target detection algorithm was proposed for using hyperspectral imagery. The proposed algorithm is designed to have minimal processing time, low false alarm rate, and flexible threshold selection. The target detection procedure can be divided into two steps. Initially, candidates of target pixel are extracted using matching ratio of spectral pattern that can be calculated by spectral derivation. Secondly, spectral distance is computed only for those candidates using Euclidean distance. The proposed two-step method showed lower false alarm rate than the Euclidean distance detector applied over the whole image. It also showed much lower processing time as compared to the Mahalanobis distance detector.

• Journal of Korea Society of Industrial Information Systems
• /
• v.14 no.5
• /
• pp.43-51
• /
• 2009

In this paper, we propose an efficient method of face retrieval by using PCA(principal component analysis) based features. The coarse-to-fine strategy is adopted to sort the retrieval results in the lower dimensional eigenface space and to rearrange candidates at high ranks in higher dimensional eigenface space. To evaluate similarity between a query face image and class reference image, we utilize the PD (projection distance), MQDF(modified quadratic distance function) and MED(minimum Euclidean distance). The experimental results show that the proposed method which rearrange the retrieval results incrementally by using projection distance is efficient for face image retrieval.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.36 no.1A
• /
• pp.35-40
• /
• 2011

The complex-valued blind algorithm based on a set of randomly generated symbols and Euclidean distance can take advantage of information theoretic learning and cope with the channel phase rotation problems. On the algorithm, in this paper, the effect of kernel size has been studied and a kernel-modified version of the algorithm that rearranges the forces between the information potentials by kernel-modification has been proposed. In simulation results for 16 QAM and complex-channel models, the proposed algorithm show significantly enhanced performance of symbol-point concentration and no phase rotation problems caused by the complex channel models.

• 한국지형공간정보학회:학술대회논문집
• /
• 1993.10a
• /
• pp.141-145
• /
• 1993

A new digital change detection algorithm, Euclidean Distance Analysis, was developed in an attempt to utilize the multi-band information in a selected band-comination, as an alternative to the conventional single-band analysis methods. To evaluate the relative performance of this new method, image differencing was applied. The better performance in change detection between the two algorithms investigated was provided by the Euclidean distance analysis. The new technique of Euclidean distance analysis holds promise for change detection, since it summarizes the multiple-band information on the cover-type changes and reduces the data dimensionality. It is suggested to further evaluate this new method, quantitatively, in the different environments. The use of different accuracy indices was also examined in the determining the optimal threshold level for each change image. As the standard measure for classification accuracy, the Kappa coefficient of agreement was used for evaluation.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.10 no.7
• /
• pp.2914-2935
• /
• 2016

With the increasing popularization of cloud computing, how to reduce physical energy consumption and increase resource utilization while maintaining system performance has become a research hotspot of virtual machine deployment in cloud platform. Although some related researches have been reported to solve this problem, most of them used the traditional heuristic algorithm based on greedy algorithm and only considered effect of single-dimensional resource (CPU or Memory) on energy consumption. With considerations to multi-dimensional resource utilization, this paper analyzed impact of multi-dimensional resources on energy consumption of cloud computation. A multi-dimensional resource constraint that could maintain normal system operation was proposed. Later, a novel virtual machine deployment method (NVMDM) based on improved particle swarm optimization (IPSO) and Euclidean distance was put forward. It deals with problems like how to generate the initial particle swarm through the improved first-fit algorithm based on resource constraint (IFFABRC), how to define measure standard of credibility of individual and global optimal solutions of particles by combining with Bayesian transform, and how to define fitness function of particle swarm according to the multi-dimensional resource constraint relationship. The proposed NVMDM was proved superior to existing heuristic algorithm in developing performances of physical machines. It could improve utilization of CPU, memory, disk and bandwidth effectively and control task execution time of users within the range of resource constraint.

• Phonetics and Speech Sciences
• /
• v.2 no.4
• /
• pp.229-238
• /
• 2010

This study investigates the differences in acoustic parameters in vowel space across hearing loss, gender and vowels. The parameters include F1, F2, Euclidean Distance between vowels, and vowel triangular area comprised of /i/, /a/ and /u/. For this study, 20 hearing-impaired and normal hearing adults as a control group were asked to read 7 Korean vowels (/a, $\wedge$, o, u, w, i, $\varepsilon$/). Subjects' readings were recorded by NasalView and analyzed by Praat. Results showed that F1 were significantly higher in the hearing impaired group than in the normal hearing group, higher in the female group than in male group, and higher in low vowels than in high vowels. And the means of F2 was significantly higher in the hearing impaired group than in normal hearing group, higher in high vowels than in low vowels, and there was no difference between male and female group. Secondly, Euclidean distance between vowels was significantly shorter in the hearing-impaired group than in the normal group. Finally, acoustic vowel space area was significantly smaller in the hearing-impaired group than in the normal hearing group. The hearing-impaired group showed that front vowels tended to be backed and back vowels to be fronted.

• The Transactions of the Korean Institute of Power Electronics
• /
• v.10 no.1
• /
• pp.45-51
• /
• 2005

This paper presents a comparison of rotor position estimation of a switched reluctance motor(SRM) with built-in search coils by three methods. The search coil EMFs are not generated in the SRM with built-in search coils at standstill. So an initial rotor position estimation method is needed. In this paper squared euclidean distance, fuzzy logic and neural network methods we proposed for the estimation of initial rotor position. The simulated results of the three methods are compared. The simulated result of the squared euclidean distance method, which has the best performance, is supported by the experimental result.

• 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.