• Speech Sciences
• /
• v.11 no.2
• /
• pp.211-216
• /
• 2004

In this paper, we present a fast encoding algorithm for vector quantization with an approximate Euclidean distance calculation. An approximation is performed by converting floating point to the near integer. An inequality between the approximate Euclidean distance and the nearest distance is developed to avoid unnecessary distance calculations. Since the proposed algorithm rejects those codewords that are impossible to be the nearest codeword, it produces the same output as conventional full search algorithm.

• Journal of The Korean Society of Agricultural Engineers
• /
• v.57 no.4
• /
• pp.39-49
• /
• 2015

Since most medical facilities and medical personnel are concentrated in urban areas in South Korea, an imbalance of access to medical facilities causes a gap in medical resource availability between urban and rural areas. Accessibility to medical facilities is a means of assessment that evaluates a measure of inequality in utilization of medical resources. The evaluation of accessibility uses Euclidean distance, in general; however, this method has its limits in that Euclidean distance cannot reflect actual distance. This study aims to estimate real road distance from village halls to medical facilities in rural areas using Open Application Programming Interface (Open API) of an internet portal site. Using real road distance, we evaluated medical accessibility and compared it with Euclidean distance. The accessibility to primary medical institutions was valued relatively well, but secondary and tertiary medical institutions were vulnerable in Pyeonchang-gun. Comparing Euclidean distance with real road distance from village halls to medical facilities, real road distance appeared to be approximately 1.4 times that of Euclidean distance. This calculation is similar to the circuity factor of Gangwon-do in Korea that estimated to fix the limits of Euclidean distance and assumed real road distance.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.29 no.5C
• /
• pp.611-617
• /
• 2004

The optimum convolutional error correction codes for recently standardized Feher-patented quadrature phase-shift keying (FQPSK-B) modulation are proposed. We utilize the continuous phase modulation characteristics of FQPSK-B signals for calculating the minimum Euclidean distance of convolutional coded FQPSK-B signal. It is shown that the Euclidean distance between two FQPSK-B signals is proportional to the Hamming distance between two binary data sequence. Utilizing this characteristic, we show that the convolutional codes with optimum free Hamming distance is the optimum convolutional codes for FQPSK-B signals.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.29 no.12C
• /
• pp.1686-1691
• /
• 2004

In this paper, we present an improved method to calculate Euclidean distance transform based on Guan's method. Compared to the conventional method, Euclidean distance can be computed faster using Guan's method when the number of feature pixels is small; however, overall computational cost increases proportional to the number of feature pixels in an image. To overcome this problem, we divide feature pixels into two groups: boundary feature pixels (BFPs) and non-boundary feature pixels (NFPs). Here BFPs are defined as those in the 4-neighborhood of foreground pixels. Then, only BFPs are used to calculate the Voronoi diagram resulting in a Euclidean distance map. Experimental results indicate that the proposed method takes 40 Percent less computing time on average than Guan's method. To prove the performance of the proposed method, the computing time of Euclidean distance map by proposed method is compared with the computing time of Guan's method in 16 images that are binary and the size of 512${\times}$512.

• International Journal of Advanced Culture Technology
• /
• v.9 no.3
• /
• pp.298-304
• /
• 2021

Currently, to prevent the spread of COVID-19 virus infection, gathering of more than 5 people in the same space is prohibited. The purpose of this paper is to measure the distance between objects using the Yolov5 model for processing real-time images with OpenCV in order to restrict the distance between several people in the same space. Also, Utilize Euclidean distance calculation method in DeepSORT and OpenCV to minimize occlusion. In this paper, to detect the distance between people, using the open-source COCO dataset is used for learning. The technique used here is using the YoloV5 model to measure the distance, utilizing DeepSORT and Euclidean techniques to minimize occlusion, and the method of expressing through visualization with OpenCV to measure the distance between objects is used. Because of this paper, the proposed distance measurement method showed good results for an image with perspective taken from a higher position than the object in order to calculate the distance between objects by calculating the y-axis of the image.

• Journal of the Korean Society of Environmental Restoration Technology
• /
• v.24 no.6
• /
• pp.35-48
• /
• 2021

In Suwon, the overall hygiene of the city is threatened by the emergence of the rook(Corvus fugilegus) in the city. Rooks began to appear in November of 2016 and has continued to appear from November to March every year. In order to eradicate or to prepare an alternative habitat for rooks, this study aimed to identify the preferred habitat and specific environmental variables. Therefore, in this work, we aim to understand the predicted distribution of rooks in Suwon City with citizen science and through MaxENT, the most widely utilized habitat modeling using citizen science to analyze the preferred habitat of harmful tides appearing in urban areas. In this study, seven environmental variables were chosen: biotope group complex, building floor, vegetation, euclidean distance from farmland, euclidean distance from streetlamp, and euclidean distance from pole and DEM. Among the estimated models, after the time period of sunrise (08:00~18:00) the contribution percentage were as following: euclidean distance from arable land(39.2%), DEM(25.5%), euclidean distance from streetlamp(22.3%), euclidean distance from pole(7.1%), biotope group complex(4.9%), building floor(1%), vegetation(0%). In the time period after sunset(18:00~08:00) the contribution percentage were as following: biotope group complex(437.4%), euclidean distance from pole(26.8%), DEM(13.4%), euclidean distance from streetlamp(11.8%), euclidean distance from farmland(7.9%), building floor(1.4%), vegetation(1.3%).

• Korean Journal of Acupuncture
• /
• v.33 no.1
• /
• pp.18-32
• /
• 2016

Objectives : This study aims to analyze the co-occurrence of pathological symptoms and corresponding acupoints as documented by the comprehensive acupuncture and moxibustion records in the classical texts of Far East traditional medicine as an aid to a more efficient understanding of the tacit treatment principles of ancient physicians. Methods : The Classic of Nourishing Life with Acupuncture and Moxibustion(Zhenjiu Zisheng Jing; hereinafter ZZJ) was selected as the primary reference book for the analysis. The pathology-acupoint co-occurrence analysis was performed by applying 4 values of vector space measures(weighted Euclidean distance, Euclidean distance, $Cram\acute{e}r^{\prime}s$ V and Canberra distance), which measure the distance between the observed and expected co-occurrence counts, and 3 values of probabilistic measures(association strength, Fisher's exact test and Jaccard similarity), which measure the probability of observed co-occurrences. Results : The treatment records contained in ZZJ were preprocessed, which yielded 4162 pathology-acupoint sets. Co-occurrence was performed applying 7 different analysis variables, followed by a prediction simulation. The prediction simulation results revealed the Weighted Euclidean distance had the highest prediction rate with 24.32%, followed by Canberra distance(23.14%) and association strength(21.29%). Conclusions : The weighted Euclidean distance among the vector space measures and the association strength among the probabilistic measures were verified to be the most efficient analysis methods in analyzing the correlation between acupoints and pathologies found in the classical medical texts.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.14 no.4
• /
• pp.875-885
• /
• 2010

CBR (Case-Based Reasoning) is a technique to infer the relationships between existing data and case data, and the method to calculate similarity and Euclidean distance is mostly frequently being used. However, since those methods compare all the existing and case data, it also has a demerit that it takes much time for data search and filtering. Therefore, to solve this problem, various researches have been conducted. This paper suggests the method of SE(Speed Euclidean-distance) calculation that utilizes the patterns discovered in the existing process of computing similarity and Euclidean distance. Because SE calculation applies the patterns and weight found during inputting new cases and enables fast data extraction and short operation time, it can enhance computing speed for temporal or spatial restrictions and eliminate unnecessary computing operation. Through this experiment, it has been found that the proposed method improves performance in various computer environments or processing rate more efficiently than the existing method that extracts data using similarity or Euclidean method does.

• Journal of the Korean Mathematical Society
• /
• v.49 no.3
• /
• pp.475-491
• /
• 2012

In 1950 a class of generalized Petersen graphs was introduced by Coxeter and around 1970 popularized by Frucht, Graver and Watkins. The family of $I$-graphs mentioned in 1988 by Bouwer et al. represents a slight further albeit important generalization of the renowned Petersen graph. We show that each $I$-graph $I(n,j,k)$ admits a unit-distance representation in the Euclidean plane. This implies that each generalized Petersen graph admits a unit-distance representation in the Euclidean plane. In particular, we show that every $I$-graph $I(n,j,k)$ has an isomorphic $I$-graph that admits a unit-distance representation in the Euclidean plane with a $n$-fold rotational symmetry, with the exception of the families $I(n,j,j)$ and $I(12m,m,5m)$, $m{\geq}1$. We also provide unit-distance representations for these graphs.

• The Journal of Korean Institute of Electromagnetic Engineering and Science
• /
• v.12 no.3
• /
• pp.417-424
• /
• 2001

This paper proposes new symbol mapping method that can enhance the performance of trellis coded M-ary PSK compared with conventional symbol mapping methods in AWGN environment. Since the basic criteria of TCM design is Maximum Euclidean distance in AWGN, conventional symbol mapping method keep this basic criteria. In this paper, proposed new symbol mapping method uses both Euclidean distance and Hamming distance to design, while conventional methods make use of only optimal Euclidean distance. New symbol mapping method show the better BER performance than the other through computer simulation and error equations.