• The Journal of The Korea Institute of Intelligent Transport Systems
• /
• v.21 no.3
• /
• pp.18-29
• /
• 2022

Recently, cooperative intelligent transport systems (C-ITS) testbeds have been deployed in great numbers, and advanced autonomous driving research using V2X communication technology has been conducted actively worldwide. In particular, the broadcasting services in their beginning days, giving warning messages, basic safety messages, traffic information, etc., gradually developed into advanced network services, such as platooning, remote driving, and sensor sharing, that need to perform real-time. In addition, technologies improving these advanced network services' throughput and latency are being developed on many fronts to support these services. Notably, this research analyzed the network latency requirements of the advanced network services to develop a remote driving service for the droid type low-speed robot based on the 3GPP C-V2X communication technology. Subsequently, this remote driving service's performance was evaluated using system modeling (that included the operator behavior) and simulation. This evaluation showed that a respective core and access network latency of less than 30 ms was required to meet more than 90 % of the remote driving service's performance requirements under the given test conditions.

• Journal of the Korea Computer Industry Society
• /
• v.2 no.11
• /
• pp.1421-1426
• /
• 2001

Nowadays, as the quantity of multimedia information increases rapidly, an efficient management for multimedia has become more important. In this paper, to index and search multimedia contents efficiently, we designed the algorithm searching specific image and saving the extracted image using the semantic information extraction scheme based on contents and it is one of the schemes to indexing and searching of video data. After extracting the RGB information from input image, while all frames of video is inspected sequentially, the specific image is saved through referring to the position and distribution of contents from the collection scheme of RGB range. In case of using the proposed image extraction algorithm, because only saved video is searched instead of the whole the searching time can be reduced.

• The Journal of the Korea Contents Association
• /
• v.17 no.9
• /
• pp.12-20
• /
• 2017

This study aim to analyze the differences of the technology support on ICT SMEs conducted by ETRI - a government funded research institute. To collect the data, 167 beneficiaries participated in the survey and we classified them as 3 groups using cluster analysis. Then, we conducted ANOVA to verifying the differences among 3 groups. Results show that companies belonging to the higher revenue size groups have a highly effective technical support, while companies belonging to the lower revenue size groups have a highly effective information offering.

• Annual Conference on Human and Language Technology
• /
• 2019.10a
• /
• pp.246-251
• /
• 2019

품사 부착 말뭉치란 문장에 포함된 각 단어에 품사 표지를 부착한 말뭉치를 말한다. 이런 말뭉치에는 다양한 형태의 오류들이 포함되어 있으며, 오류가 포함된 말뭉치를 학습 자료로 사용하는 자연언어처리 시스템의 좋은 성능을 기대할 수 없다. 따라서 말뭉치의 일관성이나 정확도는 자연언어처리 시스템의 성능에 많은 영향을 준다. 하지만 말뭉치 구축 과정에서 작업자의 실수가 발생하고 여러 작업자가 작업을 수행하다 보니 일관성을 유지하기가 쉽지 않다. 본 논문에서는 이러한 문제를 해결하기 위해서 GMM을 이용한 군집화를 수행하여 오류 후보를 추출한다. 이를 통해서 말뭉치 구축 과정에서 작업자의 실수를 방지하고 일관성을 유지하고자 한다. 세종품사부착 말뭉치를 대상으로 임의로 오류를 유발시켜 실험한 결과, 재현율 84.74%의 성능으로 오류를 탐지하였다. 향후에 좀 더 높은 재현율을 위해서 자질 확장이나 회귀 분석 방법 등을 추진할 계획이다.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.9 no.5
• /
• pp.163-168
• /
• 2009

Most image segmentation methods are to represent observed feature vectors at each pixel, which are assumed as appropriated probability models. These models can be used by statistical estimating or likelihood clustering algorithms of feature vectors. EM algorithms have some calculation problems of maximum likelihood for unknown parameters from incomplete data and maximum value in post probability distribution. First, the performance is dependent upon starting positions and likelihood functions are converged on local maximum values. To solve these problems, we mixed the Gausian function and histogram at all the level values at the image, which are proposed most suitable image segmentation methods. This proposed algoritms are confirmed to classify most edges clearly and variously, which are implemented to MFC programs.

• The Journal of the Korea institute of electronic communication sciences
• /
• v.10 no.1
• /
• pp.139-148
• /
• 2015

In this paper, a new algorithm is proposed for detecting the product number of each thick plate and extracting each character of the product number from a image which contains several thick plates. In general, a image of thick plates contains several steal plates. To obtain the product number from the image, we first need to separate each plate. To do so, we use the line edges of thick plates and a clustering algorithm. After separating each plate, background parts are eliminated from the image of each plate. Background parts of an individual thick plate image consist of the dark part of steel and the white part of paint which is used for printing the product number. We propose a two-tiered method where dark background parts are first eliminated and then white parts are eliminated. Finally, each character is extracted from the product number image using the characteristics of product number. The results of the experiments on the various steal plates images emphasize that the proposed algorithm detects each thick plate and extracts the product number from a image effectively.

• The Journal of the Korea institute of electronic communication sciences
• /
• v.13 no.3
• /
• pp.579-586
• /
• 2018

With the beginning of the new era of bigdata, information extraction or prediction are an important research area. Here, we present the acquisition of semi-automatically curated large-scale biological database and the prediction of enzyme reaction annotation for analyzing the pharmacological activities of drugs. Because the xenobiotic metabolism of pharmaceutical drugs by cellular enzymes is an important aspect of pharmacology and medicine. In this study, we apply and analyze similarity models to predict bimolecular reactions between human enzymes and their corresponding substrates. Thirteen models select to reflect the characteristics of each cluster in the similarity model. These models compare based on sensitivity and AUC. Among the evaluation models, the Simpson coefficient model showed the best performance in predicting the reactivity between the enzymes. The whole similarity model implement as a web service. The proposed model can respond dynamically to the addition of reaction information, which will contribute to the shortening of new drug development time and cost reduction.

• The Journal of the Korea institute of electronic communication sciences
• /
• v.7 no.5
• /
• pp.1033-1039
• /
• 2012

In this paper, a simple and robust algorithm is proposed for detecting each steel plate from a image which contains several steel plates. Steel plate is characterized by line edge, so line detection is a fundamental task for analyzing and understanding of steel plate images. To detect the line edge, the proposed algorithm uses the small eigenvalue analysis. The proposed approach scans an input edge image from the top left corner to the bottom right corner with a moving mask. A covariance matrix of a set of edge pixels over a connected region within the mask is determined and then the statistical and geometrical properties of the small eigenvalue of the matrix are explored for the purpose of straight line detection. Using the detected line edges, each plate is determined based on the directional information and the distance information of the line edges. The results of the experiments emphasize that the proposed algorithm detects each steel plate from a image effectively.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.20 no.1
• /
• pp.58-64
• /
• 2016

In this paper presents Robust k-means clustering-based high-speed bar code decoding method to blur and lighting. for fast operation speed and robust decoding to blur, proposed method uses adaptive local threshold binarization methods that calculate threshold value by dividing blur region and a non-blurred region. Also, in order to prevent decoding fail from the noise, decoder based on k-means clustering algorithm is implemented using area data summed pixel width line of the same number of element. Results of simulation using samples taken at various worst case environment, the average success rate of proposed method is 98.47%. it showed the highest decoding success rate among the three comparison programs.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.15 no.12
• /
• pp.2647-2654
• /
• 2011

In this paper, the algorithm that recognizes the gesture by configuring the feature information obtained through edge orientation histogram and principal component analysis as low dimensional gesture symbol was described. Since the proposed method doesn't require a lot of computations compared to the existing geometric feature based method or appearance based methods and it can maintain high recognition rate by using the minimum information, it is very well suited for real-time system establishment. In addition, to reduce incorrect recognition or recognition errors that occur during gesture recognition, the model feature values projected in the gesture space is configured as a particular status symbol through clustering algorithm to be used as input symbol of hidden Markov models. By doing so, any input gesture will be recognized as the corresponding gesture model with highest probability.