• 제목/요약/키워드: euclidean distance

검색결과 555건 처리시간 0.026초

An Approximate Euclidean Distance Calculation for Fast VQ Encoding

  • Baek, Seong-Joon;Kim, Jin-Young;Kang, Sang-Ki
    • 음성과학
    • /
    • 제11권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.

  • PDF

실제 도로거리를 이용한 농촌지역 생활권의 의료시설 접근성 평가 -평창군을 중심으로- (Assessment of Accessibility to Medical Facilities in Rural Areas using Real Road Distance focusing on Pyeongchang-gun)

  • 김솔희;김태곤;서교
    • 한국농공학회논문집
    • /
    • 제57권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.

Optimum Convolutional Error Correction Codes for FQPSK-B Signals

  • Park, Hyung-Chul
    • 한국통신학회논문지
    • /
    • 제29권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.

보로노이 다이어그램에 기반한 개선된 유클리디언 거리 변환 방법 (Improved Euclidean transform method using Voronoi diagram)

  • 장석환;박용섭;김회율
    • 한국통신학회논문지
    • /
    • 제29권12C호
    • /
    • pp.1686-1691
    • /
    • 2004
  • 본 논문에서는 기존의 고속 유클리디언 거리 변환법을 개선한 새로운 계산 방법을 제안한다. 기존의 고속 유클리디언 거리 변환법이 가지고 있는 단점인 특징점의 수에 비례하여 계산량이 늘어나는 단점을 극복하기 위해서, 본 논문에서는 특징점들 중에서 비특징점과 4방향으로 연결되어 있는 특징점만을 이용하여 보로노이 다이어그램을 계산함으로써 유클리디언 거리 변화도(Euclidean distance map)의 계산 시간을 기존의 방법보다 평균 40%로 감소시켰다. 본 논문에서 제안한 방법의 효율성을 검증하기 위해서 크기의 바이너리 영상 16장에서 대해서 기존의 방법과 제안한 방법으로 똑같이 유클리디언 거리 변화도를 계산하여 계산 시간을 비교함으로써 그 효능을 입증하였다.

A study on object distance measurement using OpenCV-based YOLOv5

  • Kim, Hyun-Tae;Lee, Sang-Hyun
    • International Journal of Advanced Culture Technology
    • /
    • 제9권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.

시민과학을 활용한 수원시에 출몰하는 떼까마귀(Corvus frugilegus)의 일출 및 일몰시 선호 서식지 분석 (Spatial Usage and Patterns of Corvus frugilegus after Sunrise and Sunset in Suwon Using Citizen Science)

  • 윤지원;신원협;김지환;이석영;김도희;김유빈;류영렬;송영근
    • 한국환경복원기술학회지
    • /
    • 제24권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%).

고의서에 나타난 경혈과 병증의 연관성 측정 및 시각화 - 침구자생경 분석 예를 중심으로 - (Measure of the Associations of Accupoints and Pathologies Documented in the Classical Acupuncture Literature)

  • 오준호
    • Korean Journal of Acupuncture
    • /
    • 제33권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.

유사도와 유클리디안 계산패턴을 이용한 CBR 패턴연구 (A Study on the CBR Pattern using Similarity and the Euclidean Calculation Pattern)

  • 윤종찬;김학철;김종진;윤성대
    • 한국정보통신학회논문지
    • /
    • 제14권4호
    • /
    • pp.875-885
    • /
    • 2010
  • 사례기반추론(CBR:Case-Based Reasoning)은 기존 데이터와 사례 데이터들의 관계성을 추론하는 기법으로 유사도(Similarity)와 유클리디안(Euclidean) 거리 계산 방법이 가장 많이 사용되고 있다. 그러나 이 방법들은 기존 데이터와 사례 데이터를 모두 비교하기 때문에 데이터 검색과 필터링에 많은 시간이 소요되는 단점이 있다. 따라서 이를 해결하기 위한 다양한 연구들이 진행되고 있다. 본 논문에서는 기존의 유사도와 유클리디안 계산과정에서 발견된 패턴을 활용한 SE(Speed Euclidean-distance) 계산방법을 제안한다. SE 계산방법은 새로운 사례입력에 발견된 패턴과 가중치를 적용하여 빠른 데이터 추출과 수행시간 단축으로 시간적 공간적 제약사항에 대한 연산 속도를 향상시키고 불필요한 연산 수행을 배제하는 것이다. 실험을 통해 유사도나 유클리디안 방법으로 데이터를 추출하는 기존의 방법보다 제안하는 방법이 다양한 컴퓨터 환경과 처리 속도에서 성능이 향상됨을 확인할 수 있었다.

ALL GENERALIZED PETERSEN GRAPHS ARE UNIT-DISTANCE GRAPHS

  • Zitnik, Arjana;Horvat, Boris;Pisanski, Tomaz
    • 대한수학회지
    • /
    • 제49권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.

최소해밍거리를 이용한 트렐리스 부호화된 M- ray PSK의 성능 향상 (Performance Enhancement of Trellis Coded Mary PSK using Minimum Hamming Distance)

  • 은도현;조훈상;이순흠
    • 한국전자파학회논문지
    • /
    • 제12권3호
    • /
    • pp.417-424
    • /
    • 2001
  • 본 논문은 부가 백색 가우시안 잡음 채널에서 M-ary PSK 트렐리스 부호화변조기법의 비트 오차 성능을 향상시키기 위하여 기존의 심볼사상방법에 비해 개선된 오류특성을 나타낼 수 있는 새로운 심볼사상방법을 제안하고 그 성능향상을 확인한 내용을 담고 있다. 본 논문에서 제안된 새로운 심볼사상방법은 셋분할 하는 경우 유클리드 거리뿐 아니라 해밍거리도 고려한 심볼사상방법으로 본 방법에 의한 성능향상을 기존 방식과 비교하여 수식을 이용한 분석한 컴퓨터 시뮬레이션을 통해 검증하였다.

  • PDF