• Journal of IKEEE
• /
• v.15 no.4
• /
• pp.293-298
• /
• 2011

In the paper, we propose a new CMF(Constant Modulus Fourth) algorithm for WCDMA(Wideband Code Multiple Access) RF(Radio Frequency) Repeater. CMF algorithm is proposed by modifying the CMA(Constant Modulus Algorithm) algorithm and improved performances are achieved by properly adjusting step size values. The steady state MSE(Mean Square Error) performance of the proposed CMF algorithm with step size of 0.35 is about 4dB better than that of the conventional CMA algorithm. And the proposed CMF algorithm requires 400~1100 less iterations than the LMS(Least Mean Square) and NLMS(Normalized Least Mean Square) algorithms at MSE of -25dB.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2016.05a
• /
• pp.94-96
• /
• 2016

본 논문에서는 기존의 백내장 추출 방법을 개선하기 위해 FCM(Fuzzy C_Means) 알고리즘을 적용하여 백내장을 추출하고 분석하는 방법을 제안한다. 제안된 방법은 애견 안구 영상에서 ROI 영역을 추출한다. 추출된 ROI 영역에서 Fuzzy Stretching 기법을 적용하여 픽셀의 상한 값과 하한 값을 조정한다. 퍼지 스트레칭 기법이 적용된 ROI 영역에 Max-Min 기반 평균 이진화 기법을 적용하여 ROI 영역을 이진화한다. 그리고 퍼지 스트레칭 기법이 적용된 ROI 영역에 FCM 알고리즘을 적용하여 양자화한 후에 양자화된 ROI 영역에서 밝기 평균 이진화 기법을 적용하여 이진화한다. 따라서 Max-Min 기반 이진화 기법을 적용하여 이진화된 ROI 영역과 밝기 평균 이진화 기법을 적용하여 이진화된 ROI 영역을 AND 연산을 적용하여 백내장의 후보 영역을 추출한다. 추출된 백내장의 후보 영역에서 침식, 팽창 기법을 적용하여 ROI 영역의 픽셀 크기를 확대 또는 축소하고 타원 형태를 가진 객체 중에서 ROI의 전체 영역의 크기가 1/5보다 적은 객체를 잡음으로 간주하여 제거한다. 잡음이 제거된 백내장의 후보 영역에서 크기가 3/5이상인 영역을 백내장 영역으로 추출한다. 제안된 방법의 성능을 분석하기 위하여 기존의 백내장 추출 방법과 제안된 백내장 추출 방법을 15개의 백내장 영상을 대상으로 실험한 결과, 제안된 방법이 기존의 백내장 추출 방법보다 백내장 추출률이 개선된 것을 확인하였다.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2021.05a
• /
• pp.447-449
• /
• 2021

Various wireless sensor network protocols have been proposed to maintain the network for a long time by minimizing energy consumption. Using the K-means clustering algorithm takes longer to cluster than traditional hierarchical algorithms because the center point must be moved repeatedly until the final cluster is established. For K-means clustering-based protocols, only the residual energy of nodes or nodes near the center point of the cluster is considered when the cluster head is elected. In this paper, we propose a new wireless sensor network protocol based on K-means clustering to improve the energy efficiency while improving the aforementioned problems.

• The Journal of The Korea Institute of Intelligent Transport Systems
• /
• v.16 no.3
• /
• pp.59-72
• /
• 2017

As the part of study which handles the measure to use the individual vehicle information of taxi GPS data on signal controls in order to overcome the limitation of Loop detector-based collecting methods of real-time signal control system, this paper conducted series of evaluations and improvements on link travel time, queue vehicle time estimates and traffic condition decision algorithm from the research introduced in 2016. considering the control group and the other, the link travel time has enhanced the travel time and the length of queue vehicle has enhanced the estimated model taking account of the traffic situation. It is analyzed that the accuracy of the average link travel time and the length of queue vehicle are respectably both approximately 95 % and 85%. The traffic condition decision algorithm reflected the improved travel speed and vehicle length. Smoothing was performed to determine the trend of the traffic situation and reduce the fluctuation of the data, and the algorithms have refined so as to reflect the pass period on overflow judgment criterion.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2022.11a
• /
• pp.643-645
• /
• 2022

많은 온라인 쇼핑몰에서 색상 기반 필터링 서비스나 추천 시스템을 제공하지만, 수동 분류는 많은 시간이 들고 오류 위험이 있다. 본 연구의 실험에서는 먼저 분석할 의류 이미지를 실루엣 분석으로 수행한 경우와 수행하지 않는 경우의 k-평균 군집화 알고리즘으로 가장 우세한 색상 군집의 중심값을 도출하는데, 만약 군집 개수가 2개 이상이면 보다 큰 군집의 중심값만을 고려한다. 이 중심값을 이용해 사전 학습한 k-최근접 이웃 알고리즘으로 색상 클래스를 분류한다. 실험 결과 실루엣 분석을 수행하지 않은 k-평균 군집화 알고리즘을 사용한 분류 방식이 정확도와 수행 시간 모두 매우 준수하였으나, 배경색이 존재하여 의류 색 분석에 영향을 줄 수 있는 경우 잘못 분류한다는 문제도 있다.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.35 no.7C
• /
• pp.618-627
• /
• 2010

In this paper, we propose an adaptive K-best algorithm in which the number K of candidates is changed according to the differences of level radii. We also compare the bit error performance and complexity of the proposed algorithm with those of several conventional K-best algorithms, where the complexity is defined as the total number of candidates of which partial Euclidean distances have to be calculated. The proposed algorithm adaptively decides K at each level by eliminating the symbols, whose differences of radii are larger than a threshold, from the set of candidates, and the maximum or average value of differences can be adopted as the threshold. The proposed decoding algorithm shows the better bit error performance and the lower complexity than a conventional K-best decoding algorithm with a constant K, and also has a similar bit error performance and the lower complexity than other adaptive K-best algorithms.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.37 no.3
• /
• pp.79-87
• /
• 2000

In this paper, we propose a model based moving object tracking algorithm In dynamic scenes To adapt shape change of the moving object, the Hausdorff distance is applied as the measurement of similarity between model and image To reduce processing time, 2D logarithmic search method is applied for locate the position of moving object Experiments on a running vehicle and motorcycle, the result showed that the mean square error of real position and tracking result is 1150 and 1845; matching times are reduced average 1125times and 523 times than existing algorithm for vehicle image and motorcycle image, respectively It showed that the proposed algorithm could track the moving object accurately.

• Journal of the Institute of Electronics Engineers of Korea SD
• /
• v.39 no.3
• /
• pp.61-72
• /
• 2002

In this paper, we propose two timing-driven routing algorithms for single-source net and multi-source net as applications of 1-Steiner heuristic algorithm. Using the method of substituting the cost of 1-Steiner heuristic algorithms with interconnection delay, our routing algorithms can route both single-source net and multi-source net which have all critical source-terminal pairs or one critical pair efficiently Our single-source net routing algorithm reduced the average maximum interconnection delay by up to 2.1% as compared with previous single-source routing algorithm, SERT, and 10.6% as compared with SERT-C. and Our multi-source net routing algorithm increased the average maximum interconnection delay by up to 2.7% as compared with MCMD A-tree, but outperforms it by up to average 1.4% when the signal net has only subset of critical node pairs.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.42 no.5 s.335
• /
• pp.39-46
• /
• 2005

It is well known the fact that turbo codes has better performance as the number of iteration and the interleaver size increases in the AWGN channel environment. However, as the number of iteration and the interleaver size are increased, it is required much delay and computation for iterative decoding. Therefore, it is important to devise an efficient criterion to stop the iteration process and prevent unnecessary computations and decoding delay. In this paper, it proposes the efficient iterative decoding stop criterion using the absolute mean value of LLR difference. It is verifying that the proposal iterative decoding stop criterion can be reduced the average iterative decoding number compared to conventional schemes with a negligible degradation of the error performance.

• Journal of KIISE:Databases
• /
• v.35 no.3
• /
• pp.199-207
• /
• 2008

The FP-tree(Frequency Pattern Tree) mining association rules algorithm was proposed to improve mining performance by reducing DB scan overhead dramatically, and it is recognized that the performance of it is better than that of any other algorithms based on different approaches. But the FP-tree algorithm needs a few more memory because it has to store all transactions including frequent itemsets of the DB. This paper implements a FP-tree algorithm on a general purpose UNK system and compares it with the DHP(Direct Hashing and Pruning) algorithm which uses hash tree and direct hash table from the point of memory usage and execution time. The results show surprisingly that the FP-tree algorithm is poor than the DHP algorithm in some cases even if the system memory is sufficient for the FP-tree. The characteristics of the test data are as follows. The site of DB is look, the number of total items is $1K{\sim}7K$, avenrage length of transactions is $5{\sim}10$, avergage size of maximal frequent itemsets is $2{\sim}12$(these are typical attributes of data for large-scale convenience stores).