• 전기학회논문지
• /
• 제66권7호
• /
• pp.1072-1077
• /
• 2017

Mean-reverting analysis refers to a way of estimating the underlining tendency after new data has evoked the variation in the equilibrium state. In this paper, we propose a new method to interpret the specular portraits of Premature Ventricular Contraction(PVC) arrhythmia by applying K-means unsupervised learning algorithm on electrocardiogram(ECG) data. Aiming at this purpose, we applied a mean-reverting model to analyse Heart Rate Variability(HRV) in terms of the modified poincare plot by considering PVC rhythm as the component of disrupting the homeostasis state. Based on our experimental tests on MIT-BIH ECG database, we can find the fact that the specular patterns portraited by K-means clustering on mean-reverting HRV data can be more clearly visible and the Euclidean metric can be used to identify the discrepancy between the normal sinus rhythm and PVC beats by the relative distance among cluster-centroids.

• 한국발생생물학회지:발생과생식
• /
• 제24권3호
• /
• pp.241-248
• /
• 2020

This study used a PCR-based genetic analysis platform to create a hierarchical polar dendrogram of Euclidean genetic distances for two salmonid species, Oncorhynchus mykiss (rainbow trout, RT) and Oncorhynchus masou (masu salmon, MS). The species were distantly related to other fish species based on PCR results from using the designed oligonucleotide primer series. Five oligonucleotide primers were used to generate 330 and 234 scorable fragments in the RT and MS populations, respectively. The DNA fragments ranged in size from approximately 50 bp to more than 2,000 bp. The bandsharing (BS) results showed that the RT population had a higher average BS value (0.852) than that for the MS population (0.704). The genetic distance between individuals supported the presence of adjacent affiliation in cluster I (RT 01-RT 11). The observation of a significant genetic distance between the two Oncorhynchus species verifies that this PCR-based technique can be a useful approach for individual- and population-based biological DNA investigations. The results of this type of investigation can be useful for species safekeeping and the maintenance of salmonid populations in the mountain streams of Korea.

• 융합신호처리학회논문지
• /
• 제1권2호
• /
• pp.105-114
• /
• 2000

본 논문에서는 다중 심벌 검파를 터보 트렐리스 부호화 변조에 적용하여 대역폭 효율을 높일 수 있는 채널 코딩 방식을 제안하고 또한 다중 심벌 검파를 수행하는 터보 트켈리스 부호화 변조의 MAP 알고리듬을 설계한다. 터보 코드는 낮은 SNR에서 아주 좋은 BER 성능을 얻을 수 있다. 이은 두 개의 콘볼류션 부호화기와 인터리버에 의해 구성된다. TCM은 코드워드사이의 유클리드 거리를 최대화시킴으로써 코딩과 변조를 동시에 수행하는 방식이다. 터보 트렐리스 부호화 변조는 비터비혹은 symbol-by-symbol MAP 알고리듬에 의해 디코딩 될 수 있다. 그러나 본 논문에서는 다중 심벌검파를 수행하기 위해 1차 및 그 이상의 위상차를 이용한 유클리드 거리를 가지 메트릭으로 사용하는 터보 트렐리스 부호화 변조의 MAP 알고리듬을 설계한다 본 연구는 같은 SNR에서 좀 더 향상된 BER 성능을 얻을 수 있다는 것을 보여준다.

• 응용통계연구
• /
• 제30권1호
• /
• pp.83-93
• /
• 2017

k (${\geq}2$) 그룹의 p-차원 데이터의 시각화에서 가장 전형적인 방법은 Fisher의 정준판별분석(canonical discriminant analysis; CDA)이다. CDA는 마할라노비스 공간에서 k개 그룹 중심을 근사하게 통과하는 저차원 부공간에 관측점들을 사영한다. 본 논문은 척도화 유클리드 공간에서 다그룹 다차원 데이터를 시각화하는 방법을 제안하는데, 저차원 부공간의 제1축(또는 제1축과 제2축)은 그룹 중심들의 최대변별(maximum discrimination)에서 찾고 부공간의 제2축(또는 제3축)은 관측개체들의 최대산포(maximum dispersion)에서 찾는다. 이러한 혼종방법(hybrid method)은 2-그룹 다차원 자료의 시각화에서 특히 유용하다.

• Journal of Information Processing Systems
• /
• 제19권2호
• /
• pp.258-266
• /
• 2023

Aiming at the problems of poor customer satisfaction and poor accuracy of customer classification, this paper proposes a customer classification model based on speech recognition. First, this paper analyzes the temporal data characteristics of customer demand data, identifies the influencing factors of customer demand behavior, and determines the process of feature extraction of customer voice signals. Then, the emotional association rules of customer demands are designed, and the classification model of customer demands is constructed through cluster analysis. Next, the Euclidean distance method is used to preprocess customer behavior data. The fuzzy clustering characteristics of customer demands are obtained by the fuzzy clustering method. Finally, on the basis of naive Bayesian algorithm, a customer demand classification model based on speech recognition is completed. Experimental results show that the proposed method improves the accuracy of the customer demand classification to more than 80%, and improves customer satisfaction to more than 90%. It solves the problems of poor customer satisfaction and low customer classification accuracy of the existing classification methods, which have practical application value.

• 문화기술의 융합
• /
• 제10권4호
• /
• pp.663-668
• /
• 2024

본 논문에서는 웨이퍼 이송 로봇의 고장 진단에 시간 영역에서의 통계적 분석 방법을 적용하고, 진동 및 토크 신호의 중요 특성을 파악하는 방법을 제안한다. 이를 기반으로 데이터의 차원을 축소하기 위해 주성분 분석을 사용하고, 유클리드 거리와 Hotelling의 T-제곱 통계량을 활용하여 고장 진단 알고리즘을 개발했다. 이 알고리즘은 관측된 데이터에 대해 고장 상태를 분류하는 결정 경계를 형성한다. 속도 파라미터를 고려한 데이터 분류는 진단 정확도를 향상시킴을 확인했다. 이러한 접근 방식은 고장 진단의 정확성과 효율성을 개선하는 데 기여한다.

• 말소리와 음성과학
• /
• 제5권2호
• /
• pp.25-31
• /
• 2013

This study examined cross-generational changes in the vowel system of Seoul Korean. Acoustic analyses of the vowel formants of /o/ and /u/, and their Euclidean distances in the vowel space were undertaken to explore an on-going merger of these two vowels as proposed in previous acoustic studies and a phonological analysis by Chae (1999). A robust cross-generational change of /o/ and /u/ was found, more evident for female speakers than for male speakers. For female speakers, with each successive generation, /o/ became increasingly approximated with /u/, regardless of the syllable positions that the target vowels were posited, whereas the cross-generational differences in the Euclidean distances were only shown in the second syllable position for the male speakers. These results demonstrate that 1) women are more advanced than men in the on-going approximation of /o/ and /u/; 2) the approximation of /o/ and /u/ is common in the non-initial position. Taken together, the merger of /o/ and /u/ appears to be in progress in Seoul Korean.

• Journal of Communications and Networks
• /
• 제15권1호
• /
• pp.71-76
• /
• 2013

A new class of quantum low-density parity-check (LDPC) codes whose parity-check matrices are dual-containing matrices constructed based on lines of Euclidean geometries (EGs) is presented. The parity-check matrices of our quantum codes contain one and only one 4-cycle in every two rows and have better distance properties. However, the classical parity-check matrix constructed from EGs does not satisfy the condition of dual-containing. In some parameter conditions, parts of the rows in the matrix maybe have not any nonzero element in common. Notably, we propose four families of fascinating structure according to changes in all the parameters, and the parity-check matrices are adopted to satisfy the requirement of dual-containing. Series of matrix properties are proved. Construction methods of the parity-check matrices with dual-containing property are given. The simulation results show that the quantum LDPC codes constructed by this method perform very well over the depolarizing channel when decoded with iterative decoding based on the sum-product algorithm. Also, the quantum codes constructed in this paper outperform other quantum codes based on EGs.

• Communications for Statistical Applications and Methods
• /
• 제22권6호
• /
• pp.605-613
• /
• 2015

A three-arm parallel design has been proposed to assess the biosimilarity between a biological product and a reference product using relative distance (Kang and Chow, 2013). The three-arm parallel design consists of two arms for the reference product and one arm for the biosimilar product. This paper extended the three-arm parallel design to a (k + 1)-arm parallel design composed of k (${\geq}3$) arms for the reference product and one arm for the biosimilar product. A new relative distance was defined based on Euclidean distance; consequently, a corresponding test procedure was developed based on asymptotic distribution. Type I error rates and powers were investigated both theoretically and empirically.

• International Journal of Contents
• /
• 제12권1호
• /
• pp.1-5
• /
• 2016

To manipulate large video contents, effective video indexing and retrieval are required. A large number of video indexing and retrieval algorithms have been presented for frame-wise user query or video content query whereas a relatively few video sequence matching algorithms have been proposed for video sequence query. In this paper, we propose an efficient algorithm that extracts key frames using color histograms and matches the video sequences using edge features. To effectively match video sequences with a low computational load, we make use of the key frames extracted by the cumulative measure and the distance between key frames, and compare two sets of key frames using the modified Hausdorff distance. Experimental results with real sequence show that the proposed video sequence matching algorithm using edge features yields the higher accuracy and performance than conventional methods such as histogram difference, Euclidean metric, Battachaya distance, and directed divergence methods.