• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• v.9 no.1
• /
• pp.457-461
• /
• 2005

본 논문에서는 RGB 컬러 정보와 오류 역전파 알고리즘을 이용한 신 차량 번호판 인식 방법을 제안한다. 차량 영상에서 평균 Blue값을 이용하여 차량 영상을 보정한다. 보정된 차량 영상에서 순수 Red픽셀과 현재 픽셀의 차이와 순수 Green 픽셀과 현재의 픽셀의 차이를 각각 구하여 Red 후보 영역과 Green 후보 영역으로 구분한다. 구분된 2개의 후보 영역의 픽셀 값을 오류 역전파 알고리즘에 적용하여 최종 Green 영역을 찾는다. 그리고 오류 역전파 알고리즘에 의해서 Green 영역으로 판명된 영역을 제외한 영역들은 잡음으로 처리한다. 잡음이 제거된 영역에 대해 수평 및 수직 히스토그램의 빈도수를 이용하여 번호판 영역을 추출한다. 추출된 번호판 영역에서 윤곽선 추적 알고리즘을 적용하여 개별 코드들을 추출하고, 오류 역전파 알고리즘을 적용하여 개별 코드들을 인식한다. 제안된 차량 번호판 추출 및 인식 방법의 성능을 평가하기 위하여 실제 비영업용 신 차량 번호판에 적용한 결과, 제안된 번호판 추출 방법이 기존의 HSI 정보를 이용한 번호판 추출 방법보다 추출률이 개선되었고 제안된 차량 번호판 인식 방법이 효율적인 것을 확인하였다.

• The Journal of the Acoustical Society of Korea
• /
• v.37 no.3
• /
• pp.156-162
• /
• 2018

The LMF (Least Mean Fourth) algorithm is well known for its fast convergence and low steady-state error especially in non-Gaussian noise environments. Recently, there has been increasing interest in the LMS (Least Mean Square) algorithms with self-adjusted step size. It is because the self-adjusted step-size LMS algorithms have shown to outperform the conventional fixed step-size LMS in the various situations. In this paper, a self-adjusted step-size LMF algorithm is proposed, which adopts an averaged gradient based step size as a self-adjusted step size. It is expected that the proposed algorithm also outperforms the conventional fixed step-size LMF. The superiority of the proposed algorithm is confirmed by the simulations in the time invariant and time variant channels.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.7 no.4
• /
• pp.691-698
• /
• 2003

We extend the sue of the method of least square to develop a recursive algorithm for the design of adaptive transversal filters such that, given the least-square estimate of this vector of the filter at iteration n-l, we may compute the updated estimate of this vector at iteration n upon the arrival of new data. We begin the development of the RLS algorithm by reviewing some basic relations that pertain to the method of least squares. Then, by exploiting a relation in matrix algebra known as the matrix inversion lemma, we develop the RLS algorithm. An important feature of the RLS algorithm is that it utilizes information contained in the input data, extending back to the instant of time when the algorithm is initiated. In this paper, we propose new tap weight updated RLS algorithm in adaptive transversal filter with data-recycling buffer structure. We prove that convergence speed of learning curve of RLS algorithm with data-recycling buffer is faster than it of exiting RLS algorithm to mean square error versus iteration number. Also the resulting rate of convergence is typically an order of magnitude faster than the simple LMS algorithm. We show that the number of desired sample is portion to increase to converge the specified value from the three dimension simulation result of mean square error according to the degree of channel amplitude distortion and data-recycle buffer number. This improvement of convergence character in performance, is achieved at the B times of convergence speed of mean square error increase in data recycle buffer number with new proposed RLS algorithm.

• Progress in Medical Physics
• /
• v.23 no.1
• /
• pp.48-53
• /
• 2012

The pencil beam convolution (PBC) algorithms in radiation treatment planning system have been widely used to calculate the radiation dose. A new photon dose calculation algorithm, referred to as the anisotropic analytical algorithm (AAA), was released for use by the Varian medical system. The aim of this paper was to investigate the difference in dose calculation between the AAA and PBC algorithm using the intensity modulated radiation therapy (IMRT) plan for lung cancer cases that were inhomogeneous in the low density. We quantitatively analyzed the differences in dose using the eclipse planning system (Varian Medical System, Palo Alto, CA) and I'mRT matirxx (IBA, Schwarzenbruck, Germany) equipment to compare the gamma evaluation. 11 patients with lung cancer at various sites were used in this study. We also used the TLD-100 (LiF) to measure the differences in dose between the calculated dose and measured dose in the Alderson Rando phantom. The maximum, mean, minimum dose for the normal tissue did not change significantly. But the volume of the PTV covered by the 95% isodose curve was decreased by 6% in the lung due to the difference in the algorithms. The difference dose between the calculated dose by the PBC algorithms and AAA algorithms and the measured dose with TLD-100 (LiF) in the Alderson Rando phantom was -4.6% and -2.7% respectively. Based on the results of this study, the treatment plan calculated using the AAA algorithms is more accurate in lung sites with a low density when compared to the treatment plan calculated using the PBC algorithms.

• Korean Journal of Remote Sensing
• /
• v.39 no.6_1
• /
• pp.1235-1243
• /
• 2023

This study proposes the detection algorithm for the cold water mass (CWM) along the eastern coast of the Korean Peninsula using sea surface temperature (SST) data provided by the Korea Institute of Ocean Science and Technology (KIOST). Considering the occurrence and distribution of the CWM, the eastern coast of the Korean Peninsula is classified into 3 regions("Goseong-Uljin", "Samcheok-Guryongpo", "Pohang-Gijang"), and the K-means clustering is first applied to SST field of each region. Three groups, K-means clusters are used to determine CWM through applying a double threshold filter predetermined using the standard deviation and the difference of average SST for the 3 groups. The estimated sea area is judged by the CWM if the standard deviation in the sea area is 0.6℃ or higher and the average water temperature difference is 2℃ or higher. As a result of the CWM detection in 2022, the number of CWM occurrences in "Pohang-Gijang" was the most frequent on 77 days and performance indicators of the confusion matrix were calculated for quantitative evaluation. The accuracy of the three regions was 0.83 or higher, and the F1 score recorded a maximum of 0.95 in "Pohang-Gijang". The detection algorithm proposed in this study has been applied to the KIOST SST system providing a CWM map by email.

• Radiation Oncology Journal
• /
• v.28 no.4
• /
• pp.238-248
• /
• 2010

Purpose: To compare the dose distributions between three-dimensional (3D) and four-dimensional (4D) radiation treatment plans calculated by Ray-tracing or the Monte Carlo algorithm, and to highlight the difference of dose calculation between two algorithms for lung heterogeneity correction in lung cancers. Materials and Methods: Prospectively gated 4D CTs in seven patients were obtained with a Brilliance CT64-Channel scanner along with a respiratory bellows gating device. After 4D treatment planning with the Ray Tracing algorithm in Multiplan 3.5.1, a CyberKnife stereotactic radiotherapy planning system, 3D Ray Tracing, 3D and 4D Monte Carlo dose calculations were performed under the same beam conditions (same number, directions, monitor units of beams). The 3D plan was performed in a primary CT image setting corresponding to middle phase expiration (50%). Relative dose coverage, D95 of gross tumor volume and planning target volume, maximum doses of tumor, and the spinal cord were compared for each plan, taking into consideration the tumor location. Results: According to the Monte Carlo calculations, mean tumor volume coverage of the 4D plans was 4.4% higher than the 3D plans when tumors were located in the lower lobes of the lung, but were 4.6% lower when tumors were located in the upper lobes of the lung. Similarly, the D95 of 4D plans was 4.8% higher than 3D plans when tumors were located in the lower lobes of lung, but was 1.7% lower when tumors were located in the upper lobes of lung. This tendency was also observed at the maximum dose of the spinal cord. Lastly, a 30% reduction in the PTV volume coverage was observed for the Monte Carlo calculation compared with the Ray-tracing calculation. Conclusion: 3D and 4D robotic radiotherapy treatment plans for lung cancers were compared according to a dosimetric viewpoint for a tumor and the spinal cord. The difference of tumor dose distributions between 3D and 4D treatment plans was only significant when large tumor movement and deformation was suspected. Therefore, 4D treatment planning is only necessary for large tumor motion and deformation. However, a Monte Carlo calculation is always necessary, independent of tumor motion in the lung.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 2017.06a
• /
• pp.89-90
• /
• 2017

본 논문에서는 평균이동 (mean shift) 기법을 이용하여 랜덤포레스트 (random forest) 기반 실시간 얼굴 특징점 추적 (facial features tracking) 방법을 제안한다. 우선, 눈의 위치를 이용하여 검출된 얼굴영역을 적절한 크기와 위치로 개선하여 랜덤포레스트를 이용한 얼굴 특징점 추적 알고리즘이 받는, 얼굴검출 (face detection) 과정에 얻어지는 얼굴영역 상자 (face bounding box) 크기와 위치의 영향을 감소 하였다. 또한 랜덤포레스트의 얼굴 특징점 추정결과에서 추정평균 대신 평균이동기법을 이용하여 잘못된 추정결과들을 제거하고 제대로 된 추정결과만 사용하여 얼굴 특징점 검출 정확도를 개선하였다. 따라서 제안하는 방법들을 이용하여 기존의 랜덤포레스트 기반 얼굴 특징점 검출 기법의 성능을 제고하고 실시간으로 얼굴 특징점을 추적할 수 있다.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.13 no.1
• /
• pp.83-88
• /
• 2013

This paper proposes a recommending system of the similar blogs gathered with similarities between blogs according to the similarity, dividing words, for each frequency, that individual blogs have. It improved the algorithm of k-means, using the model of the habits of white ants for better performance of clustering, and showed better performance of clustering as a result of evaluating and comparing with the existing algorithm of k-means as the improved algorithm. The recommending system of similar blog was designed and embodied, using the improved algorithm. TCA can reduce clustering time and the number of moving time for clustering compare with K-means algorithm.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2015.10a
• /
• pp.1361-1364
• /
• 2015

본 연구에서는 노인들이 일상에서 많이 행동하는 7가지 유형의 행동의 특징을 추출하고, 총 7가지 분류 알고리즘에 적용하여 가장 인식률이 높은 알고리즘을 도출하고자 하였다. 행동패턴은 정상보행, 절름발이, 지팡이, 느린 보행, 허리가 굽은 상태에서 보행, 스스로 휠체어 끌 때 그리고 누군가가 휠체어를 끌어줄 때 총 7가지로 구성하였다. 행동패턴의 특징은 3축 가속도 센서의 값, 평균, 표준편차, 수직 및 수평축의 데이터를 사용하였다. 분류 알고리즘은 Naive Bayes, Bayes Net, k-NN, SVM, Decision Tree, Multilayer perception, Logistic regression을 사용하였다. 연구결과 k-NN 알고리즘의 인식률이 98.7%로 다른 분류알고리즘에 비해 인식률이 높게 나타났다.

• Proceedings of the Korean Information Science Society Conference
• /
• 2006.10d
• /
• pp.586-590
• /
• 2006

본 논문에서는 다이아몬드 탐색(diamond search, DS)과 효율적인 3 단계 탐색(efficient three-step search, E3SS) 등의 블록 정합 기법(block matching algorithm, BMA)들에서 이용된 작은 다이아몬드(small diamond) 패턴을 광역 탐색에 적합하도록 확장시킨 고속의 움직임 추정 알고리즘을 제안한다. 제안된 알고리즘에서는 탐색 윈도우(search window)의 중앙으로부터 설치된 정사각형 패턴의 크기가 내부에서 대수적으로 감소되며 작은 다이아몬드 탐색(small diamond search, SDS) 기법에 의해 탐색이 완료된다. 실험 결과는 제안된 알고리즘이 DS 보다 평균 3개의 탐색 점을 더 적게 사용하고 E3SS에 비하여 약 5개 정도의 탐색 점 수에 대한 이득을 보이지만 움직임 추정상의 정확도는 다른 고속 BMA들과 거의 동일한 수준을 유지하는 것으로 확인된다.