• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.38 no.4
• /
• pp.18-26
• /
• 2001

In this paper, we propose an ATC(Automatic Transfer mode Controller) algorithm and an average-mode-change method for use in Gear shift PLL which can automatically change loop gain. The proposed ATC algorithm accurately detects proper timing or the mode change and has a very simpler structure - than the conventional lock detector algorithm often used in QPSK. And the proposed average mode change method can obtain low errors of estimated frequency offset by averaging the loop filter output of frequency component in shift register. These algorithms are also useful in designing ASIC, since these algorithms occupy small circuit area and are adaptable for high speed digital processing. We also present phase tracking performance of proposed Gear-shift PLL, which is composed of polarity decision PD, ATC and average mode change circuit, and analyze the results by examining constellation at each mode.

• Journal of Broadcast Engineering
• /
• v.15 no.2
• /
• pp.236-247
• /
• 2010

Recently, mean shift tracking algorithms have been proposed which use the information of color histogram together with some spatial information provided by the kernel. In spite of their fast speed, the algorithms are suffer from an inherent instability problem which is due to the use of an isotropic kernel for spatiality and the use of the Bhattacharyya coefficient as a similarity function. In this paper, we analyze how the kernel and the Bhattacharyya coefficient can arouse the instability problem. Based on the analysis, we propose a novel tracking scheme that uses a new representation of the location of the target which is constrained by the color, the area, and the spatiality information of the target in a more stable way than the mean shift algorithm. With this representation, the target localization in the next frame can be achieved by one step computation, which makes the tracking stable, even in difficult situations such as low-rate-frame environment, and partial occlusion.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.45 no.4
• /
• pp.27-33
• /
• 2008

The clustering of gene expression data is used to analyze the results of microarray studies. This clustering is one of the frequently used methods in understanding degrees of biological change and gene expression. In biological research, MCL algorithm is an algorithm that clusters nodes within a graph, and is quick and efficient. We have modified the existing MCL algorithm and applied it to microarray data. In applying the MCL algorithm we put forth a simulation that adjusts two factors, namely inflation and diagonal tent and converted them by making use of Markov matrix. Furthermore, in order to distinguish class more clearly in the modified MCL algorithm we took the average of each row and used it as a threshold. Therefore, the improved algorithm can increase accuracy better than the existing ones. In other words, in the actual experiment, it showed an average of 70% accuracy when compared with an existing class. We also compared the MCL algorithm with the self-organizing map(SOM) clustering, K-means clustering and hierarchical clustering (HC) algorithms. And the result showed that it showed better results than ones derived from hierarchical clustering and K-means method.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.41 no.11
• /
• pp.1463-1471
• /
• 2016

The indoor localization algorithm using the Difference Means based on Fingerprint (DMFPA) to improve the performance of indoor localization in moving Wi-Fi environment is proposed in this paper. In addition to this, the performance of the proposed algorithm is also compared with the Original Fingerprint Algorithm (OFPA) and the Gaussian Distribution Fingerprint Algorithm (GDFPA) by our developed indoor localization simulator. The performance metrics are defined as the accuracy of the average localization accuracy; the average/maximum cumulative distance of the occurred errors and the average measurement time in each reference point.

• Proceedings of the Korea Water Resources Association Conference
• /
• 2022.05a
• /
• pp.482-482
• /
• 2022

하천의 합류부에서는 수질이 다른 유체가 혼합하여 합류 전과 다른 특성을 보인다. 하천의 합류부에서 수질을 효율적으로 관리하기 위해서는 수질의 공간적인 혼합 특성을 규명하는 것이 중요하다. 합류부에서 수질의 공간적인 혼합 특성을 분석하기 위해 본 연구에서는 토폴로지 데이터 분석(topological data analysis, TDA), 자기 조직화 지도(Self-Organizing Map, SOM), k-평균 알고리즘(K-means clustering algorithm) 세 가지 기법을 이용하였다. 세 가지 기법을 비교하여 어떤 알고리즘이 합류부의 수질 변화 특성을 더 뚜렷하게 나타내는지 분석하였다. 수질 변화 비교 인자들은 pH, chlorophyll, DO, Turbidity 등이 있고, 수질 인자들은 YSI를 활용해 측정하였다. 자료의 측정 지역은 낙동강과 황강이 합류하는 지역이며, 보트에 YSI 장비를 부착하고 횡단하여 측정하였다. 측정한 데이터를 R 프로그램을 통해 세 가지 기법을 적용시켜 수질 변화 비교를 분석한다. 토폴로지 데이터 분석(topological data analysis, TDA)은 거대하고 복잡한 데이터로부터 유의미한 정보를 추출하는 데 사용하고, 자기조직화지도(Self-Organizing Map, SOM) 기법은 차원 축소와 군집화를 동시에 수행한다. k-평균 알고리즘(K-means clustering algorithm) 기법은 주어진 데이터를 k개의 클러스터로 묶는 머신러닝 비지도학습에 속하는 알고리즘이다. 세 가지 방법들의 주목적은 클러스터링이다. 클러스터 분석(Cluster analysis)이란 주어진 데이터들의 특성을 고려해 동일한 성격을 가진 여러 개의 그룹으로 대상을 분류하는 데이터 마이닝의 한 방법이다. 군집화 방법들인 TDA, SOM, K-means를 이용해 합류 지역의 수질 특성들을 클러스터링하여 수질 패턴들을 분석해 하천 수질 오염을 방지할 수 있을 것이다. 본 연구에서는 토폴로지 데이터 분석(topological data analysis, TDA), 자기조직화지도(Self-Organizing Map, SOM), k-평균 알고리즘(K-means clustering algorithm) 세 가지 기법을 이용하여 합류부에서의 수질 특성을 비교하며 어떤 기법이 합류의 특성을 더욱 뚜렷하게 나타내는지 규명했다. 합류의 특성을 군집화 방법을 이용해 알게 된다면, 합류부의 수질 변화 패턴을 다른 합류 지역에서도 적용할 수 있을 것으로 기대된다.

• Journal of Broadcast Engineering
• /
• v.21 no.1
• /
• pp.60-65
• /
• 2016

This paper introduces the non-local means (NLM) algorithm for image denoising, and also introduces an improved algorithm which is based on the principal component analysis (PCA). To do the PCA, a covariance matrix of a given image should be evaluated first. If we let the size of neighborhood patches of the NLM S × S², and let the number of pixels Q, a matrix multiplication of the size S² × Q is required to compute a covariance matrix. According to the characteristic of images, such computation is inefficient. Therefore, this paper proposes an efficient method to compute the covariance matrix by sampling the pixels. After sampling, the covariance matrix can be computed with matrices of the size S² × floor (Width/l) × (Height/l).

• The Journal of The Korea Institute of Intelligent Transport Systems
• /
• v.15 no.6
• /
• pp.90-101
• /
• 2016

This study was initiated to develop an algorithm for traffic condition adaptive optimal traffic signal control for isolated intersections based on the vehicle trajectory data. The algorithm determines the optimal cycle length, phase lengths, phase sequences using the data collected under V2X communication environment every second. In addition, the algorithm utilizes a traditional feature of the actuated signal control, gap-out, using traditional detector systems to consider the mixture of normal vehicles and vehicles equipped with the V2X communication function. The performance of the algorithm was compared with that of the fixed signal timing plan which was optimized with Synchro under a microscopic traffic simulation-based test bed. As a result, the overall performance, including average delay, average stop delay, the number of stops, and average speed, are improved apparently. In addition, the amount of improvement get bigger as the traffic volume in the intersection as well as the number of vehicles equipped with the V2X communication function increase.

• The Journal of Korean Institute of Electromagnetic Engineering and Science
• /
• v.29 no.7
• /
• pp.484-490
• /
• 2018

This paper describes an algorithm for calculating load impedance by measuring voltage and current components using a VI sensor in a 13.56 MHz impedance automatic matching system. We propose an algorithm that improves the error rate by using an arbitrary complex calibration load instead of the conventional $50{\Omega}$ calibration load. The error rate is targeted to attain average values of $R_{IN}$ and $X_{IN}$ at 1% and 20% or less, respectively. First, the IF frequency is calculated using a mixer to reduce the error rate. Second, when the arbitrary complex load is used as the calibration load, the error rate $R_{IN}$ decreased from 4.7 % to 0.3 % on average, and $X_{IN}$ decreased from 102 % to 18.3 % on average.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.42 no.2 s.302
• /
• pp.87-100
• /
• 2005

In this paper, we propose a new selective temporal error concealment algerian best suited for H.264/AVC. The proposed algorithm performs selective temporal error concealment depending on whether the lost block is at background or foreground. It the corrupted macroblock is decided as at background, then the simple temporal replacement is performed. Also we propose replacing a lost block at foreground with the selective average of respectively estimated blocks from the multiple reference frames. This paper supposes error-corrupted H.264/AVC video bitstreams over CDMA2000 (or UMTS) air interface. It is shown that under Flexible Macroblock Ordering (FMO) coding of H.264/AVC, the proposed algorithm provides PSNR gain up to 1.18dB compared to built-in algorithm in the K264/AVC test model. In addition, the proposed error concealment method has average PSNR improvement of 0.33dB compared with that under N-slice coding mode. The proposed algorithm also provides better subjective video quality than other conventional error concealment algorithms.

• The Journal of Bigdata
• /
• v.1 no.1
• /
• pp.19-22
• /
• 2016

Many Studies have been actively conducted on the early diagnosis of the crop pest utilizing IT technology. The purpose of the paper is to discuss on the image processing method capable of detecting the crop leaf pest prematurely by analyzing the image of the leaf received from the camera sensor. This paper proposes an algorithm of diagnosing leaf infection by utilizing an improved K means clustering method. Leaf infection grouping test showed that the proposed algorithm illustrated a better performance in the qualitative evaluation.