• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.26 no.6A
• /
• pp.1060-1066
• /
• 2001

레이어2 스위칭과 레이어3 라우팅의 통합 모델로써 MPLS(Multi-Protocol Label Switching) 환경에서 ATM LSR(Label-Switching Routers)은 백본망에서의 고속 전송이 가능하여 현재의 라우터 구조로써 제안되어지고 있다. MPLS가 코어 라이터로써 적용이 될 경우 확장성을 위해 label merging이라는 기술이 필요하다. VC(Virtual Circuit) merging은 ATM LSR에서 많은 IP 라우터를 하나의 라벨로 매핑을 시키며 수천 개의 목적지에 전송할 수 있는 확장성 있는 매핑 기술이다. VC merging은 같은 목적지인 다른 패킷들 간의 셀들의 섞임을 방지하기 위해 재 조합 버퍼가 요구된다. 재 조합 버퍼 사용시 일시적인 체증 현상이 발생하며 Non-VC merging과 비교시 많은 셀 손실과 많은 버퍼를 요구하게 된다. 본 논문에서는 RED(Random Early Detection) 알고리즘을 적용하여 VC merging이 필요한 버퍼의 요구량과 셀 손실을 줄였다.

• Journal of Korea Society of Digital Industry and Information Management
• /
• v.15 no.4
• /
• pp.103-110
• /
• 2019

A patent contains detailed information of the developed technology and is published to the public. Thus, patents can be used to overcome the limitations of traditional technology trend research and prediction techniques. Recently, due to the advantages of patented analytical methodology, IP R&D is carried out worldwide. The patent is big data and has a huge amount, various domains, and structured and unstructured data characteristics. For this reason, there are many difficulties in collecting and researching patent information. Patent research generally writes the Search formula to collect patent documents from DB. The collected patent documents contain some noise patents that are irrelevant to the purpose of analysis, so they are removed. However, eliminating noise patents is a manual task of reading and classifying technology, which is time consuming and expensive. In this study, we propose a model that automatically classifies The Noise patent for efficient patent information research. The proposed method performs Patent Embedding using Word2Vec and generates Noise seed label. In addition, noise patent classification is performed using the Random forest. The experimental data is published and registered with the USPTO among the patents related to Ocean Surveillance & Tracking Network technology. As a result of experimenting with the proposed model, it showed 73% accuracy with the label actually given by experts.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 2021.06a
• /
• pp.105-108
• /
• 2021

Generative adversarial networks (GANs) have reached a great result at creating the synthesis image, especially in the face generation task. Unlike other deep learning tasks, the input of GANs is usually the random vector sampled by a probability distribution, which leads to unstable training and unpredictable output. One way to solve those problems is to employ the label condition in both the generator and discriminator. CelebA and FFHQ are the two most famous datasets for face image generation. While CelebA contains attribute annotations for more than 200,000 images, FFHQ does not have attribute annotations. Thus, in this work, we introduce a method to learn the attributes from CelebA then predict both soft and hard labels for FFHQ. The evaluated result from our model achieves 0.7611 points of the metric is the area under the receiver operating characteristic curve.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.17 no.4
• /
• pp.1080-1099
• /
• 2023

Digital healthcare combined with telemedicine services in the form of convergence with digital technology and AI is developing rapidly. Digital healthcare research is being conducted on many conditions including shock. However, the causes of shock are diverse, and the treatment is very complicated, requiring a high level of medical knowledge. In this paper, we propose a shock detection method based on the correlation between shock and data extracted from hemodynamic monitoring equipment. From the various parameters expressed by this equipment, four parameters closely related to patient shock were used as the input data for a machine learning model in order to detect the shock. Using the four parameters as input data, that is, feature values, a random forest-based ensemble machine learning model was constructed. The value of the mean arterial pressure was used as the correct answer value, the so called label value, to detect the patient's shock state. The performance was then compared with the decision tree and logistic regression model using a confusion matrix. The average accuracy of the random forest model was 92.80%, which shows superior performance compared to other models. We look forward to our work playing a role in helping medical staff by making recommendations for the diagnosis and treatment of complex and difficult cases of shock.

• Proceedings of the Korean Information Science Society Conference
• /
• 2001.04b
• /
• pp.553-555
• /
• 2001

Markov Random Fields(MRF) 모델은 영상 분할 및 복원 등에 주로 사용되는 확률적 영상모델이다. 본 논문에서는 MRF 모델을 3차원으로 확장하여 분할을 위한 선 필드 모델(Line Field Model)과 움직임 검출을 위한 움직임 필드 모델(Motion Field Model)을 도입하여 동영상 내에서 움직이는 물체의 형상과 움직임을 추정한다. 제안된 방법을 이용하여 한국어 수화 동작에서 손의 형상과 이동방향을 검출하였다. 그 결과 optical flow를 사용하는 방법에 비해서 이동 방향이 왜곡되는 것을 방지하여 보다 정확한 이동 방향을 검출할 수 있었다. 또한 영상 추출의 경우에 있어서도 형상의 윤곽면과 내부가 하나의 라벨(label)로 묶이기 때문에 보다 깨끗한 영상을 추출할 수 있었다.

• The Journal of the Korea institute of electronic communication sciences
• /
• v.12 no.3
• /
• pp.451-456
• /
• 2017

Semantic segmentation, which is the most basic and complicated problem in computer vision, classifies each pixel of an image into a specific object and performs a task of specifying a label. MRF and CRF, which have been studied in the past, have been studied as effective methods for improving the accuracy of pixel level labeling. In this paper, we propose a semantic partitioning method that combines CNN, a kind of deep running, which is in the spotlight recently, and CRF, a probabilistic model. For learning and performance verification, Pascal VOC 2012 image database was used and the test was performed using arbitrary images not used for learning. As a result of the study, we showed better partitioning performance than existing semantic partitioning algorithm.

• Journal of the Korea Convergence Society
• /
• v.11 no.10
• /
• pp.45-51
• /
• 2020

Recently, many games provide data related to the users' game play, and there have been a few studies that predict opponent move by combining machine learning methods. This study predicts opponent move using match data of a real-time strategy game named ClashRoyale and a multi-label classification based on machine learning. In the initial experiment, binary card properties, binary card coordinates, and normalized time information are input, and card type and card coordinates are predicted using random forest and multi-layer perceptron. Subsequently, experiments were conducted sequentially using the next three data preprocessing methods. First, some property information of the input data were transformed. Next, input data were converted to nested form considering the consecutive card input system. Finally, input data were predicted by dividing into the early and the latter according to the normalized time information. As a result, the best preprocessing step was shown about 2.6% improvement in card type and about 1.8% improvement in card coordinates when nested data divided into the early.

• Journal of the Korean Society for information Management
• /
• v.36 no.2
• /
• pp.57-77
• /
• 2019

Random Forest (RF), a representative ensemble technique, was applied to automatic classification of journal articles in the field of library and information science. Especially, I performed various experiments on the main factors such as tree number, feature selection, and learning set size in terms of classification performance that automatically assigns class labels to domestic journals. Through this, I explored ways to optimize the performance of random forests (RF) for imbalanced datasets in real environments. Consequently, for the automatic classification of domestic journal articles, Random Forest (RF) can be expected to have the best classification performance when using tree number interval 100~1000(C), small feature set (10%) based on chi-square statistic (CHI), and most learning sets (9-10 years).

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.10 no.9
• /
• pp.4405-4418
• /
• 2016

Automatic image completion techniques have difficulty processing images in which the target region has multiple planes or is non-facade. Here, we propose a new image completion method that uses belief propagation based on planar priorities. We first calculate planar information, which includes planar projection parameters, plane segments, and repetitive regularity extractions within the plane. Next, we convert this planar information into planar guide knowledge using the prior probabilities of patch transforms and offsets. Using the energy of the discrete Markov Random Field (MRF), we then define an objective function for image completion that uses the planar guide knowledge. Finally, in order to effectively optimize the MRF, we propose a new optimization scheme, termed Planar Priority-belief propagation that includes message-scheduling-based planar priority and dynamic label cropping. The results of experiment show that our approach exhibits advanced performance compared with existing approaches.

• Journal of Computing Science and Engineering
• /
• v.7 no.2
• /
• pp.112-121
• /
• 2013

The last years have seen a rise of interest in using electroencephalography-based brain computer interfacing methodology for investigating non-medical questions, beyond the purpose of communication and control. One of these novel applications is to examine how signal quality is being processed neurally, which is of particular interest for industry, besides providing neuroscientific insights. As for most behavioral experiments in the neurosciences, the assessment of a given stimulus by a subject is required. Based on an EEG study on speech quality of phonemes, we will first discuss the information contained in the neural correlate of this judgement. Typically, this is done by analyzing the data along behavioral responses/labels. However, participants in such complex experiments often guess at the threshold of perception. This leads to labels that are only partly correct, and oftentimes random, which is a problematic scenario for using supervised learning. Therefore, we propose a novel supervised-unsupervised learning scheme, which aims to differentiate true labels from random ones in a data-driven way. We show that this approach provides a more crisp view of the brain states that experimenters are looking for, besides discovering additional brain states to which the classical analysis is blind.