• Smart Media Journal
• /
• v.11 no.1
• /
• pp.46-57
• /
• 2022

In this paper, multi-region based Radial Graph Convolutional Network (MRGCN) algorithm which can perform end-to-end action recognition using the optical flow and gradient of input image is described. Because this method does not use information of skeleton that is difficult to acquire and complicated to estimate, it can be used in general CCTV environment in which only video camera is used. The novelty of MRGCN is that it expresses the optical flow and gradient of the input image as directional histograms and then converts it into six feature vectors to reduce the amount of computational load and uses a newly developed radial type network model to hierarchically propagate the deformation and shape change of the human body in spatio-temporal space. Another important feature is that the data input areas are arranged being overlapped each other, so that information is not spatially disconnected among input nodes. As a result of performing MRGCN's action recognition performance evaluation experiment for 30 actions, it was possible to obtain Top-1 accuracy of 84.78%, which is superior to the existing GCN-based action recognition method using skeleton data as an input.

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

유기물의 복잡한 혼합물인 CDOM(Colored or Chromophoric Dissolved Organic Matter)은 하천 내 BOD(Biological Oxygen Demand), COD(Chemical Oxygen Demand) 및 유기 오염물질과 상당한 관련이 있다. CDOM은 가시광선 영역에서 빛을 흡수하는 성질을 가지고 있으며, 최근 원격감지 기술로 CDOM을 모니터링하기 위한 연구가 진행되고 있다. 본 연구에서는 백제보 상류 23km 구간에서 3년(2016~2018) 중 13일의 초분광영상을 활용하여 머신러닝 기반 CDOM을 추정 알고리즘을 개발하고자 한다. 초분광영상은 400~970 nm의 범위의 4 nm 간격 127개 대역의 분광해상도와 2 m의 공간해상도를 가진 항공기 탑재 AsiaFENIX 초분광 센서를 통해 수집하였으며 CDOM은 Millipore polycarbonate filter (𝚽47, 0.2 ㎛)에서 여과된 CDOM 샘플 자료를 200~800 nm의 흡수계수 스펙트럼으로 추출하여 사용하였다. CDOM 값은 전체기간 동안 2.0~11.0 m^-1의 값 분포를 보였으며 5 m^-1이상의 고농도 구간 자료개수가 전체 153개 샘플자료 중 21개로 불균형하다. 따라서 ADASYN(Adaptive Synthesis Sampling Approach)의 oversampling 방법으로 생성된 합성 데이터를 사용하여 원본 데이터의 소수계층 데이터 불균형을 해결하고 모델 예측 성능을 개선하고자 하였다. 생성된 합성 데이터를 입력변수로 하여 ANN(Artificial Neural Netowk)을 활용한 CDOM 예측 알고리즘을 구축하였다. ADASYN 기법을 통한 합성 데이터는 관측된 데이터의 불균형을 해결하여 기계학습 모델의 CDOM 탐지 성능을 향상시킬 수 있으며, 저수지 내 유기 오염물질 관리를 위한 설계를 지원하는데 사용할 수 있을 것으로 판단된다.

• Convergence Security Journal
• /
• v.24 no.3
• /
• pp.95-104
• /
• 2024

The performance capability of the future battlefield depends on whether the next-generation technology of the Fourth Industrial Revolution, called ABCMS (AI, Bigdata, Cloud, Mobile, Security), can be applied to secure innovative defense capabilities It is no exaggeration to say. In addition, the future military operation environment is rapidly changing into a net work-oriented war (NCW) in which all weapon systems mutually share battlefield information and operate in real-time within a single integrated information and communication network based on the network and is expanding to the scope of operation of the manned and unmanned complex combat system. In particular, communication networks responsible for high-speed and hyperconnectivity require high viability and efficiency in power operation based on multi-tier (defense mobile, satellite, M/W, wired) networks for the connection of multiple combat elements and smooth distribution of information. From this point of view, this study is different from conventional single-media, single-path transmission with fixed specifications, It is an artificial intelligence-based transmission technology using RNN (Recurrent Neural Networks) algorithm and load distribution during traffic congestion using available communication wired and wireless infrastructure multimedia simultaneously and It is the development of MMMP-Multi-Media Multi-Path adaptive network technology.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.49 no.12
• /
• pp.56-63
• /
• 2012

The WBAN technology means a short distance wireless network which provides each device interactive communication by connecting devices inside and outside of body. Standardization on the physical layer, data link layer, network layer and application layer is in progress by IEEE 802.15.6 TG BAN. Wireless body area network is usually configured in energy efficient using sensor and zigbee device due to the power limitation and the characteristics of human body. Wireless sensor network consist of sensor field and sink node. Sensor field are composed a lot of sensor node and sink node collect sensing data. Wireless sensor network has capacity of the self constitution by protocol where placed in large area without fixed position. Mobile sink node distribute energy consumption therefore network life time was increased than fixed sink node. The energy efficient is important matter in wireless body area network because energy resource was limited on sensor node. In this paper we proposed cluster topology algorithm for efficient data transmission in wireless body area network based mobile sink. The proposed algorithm show good performance under the advantage of grid routing protocol and TDMA scheduling that minimized overlap area on cluster and reduced amount of data on cluster header in error prone wireless sensor network based on mobile sink.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.43 no.9 s.351
• /
• pp.165-174
• /
• 2006

In this paper, we propose a new contention window control algorithm to increase TCP performance in wireless multi-hop networks. The new contention window control algorithm is suggested to reduce the hidden and exposed terminal problems of wireless multi-hop networks. Most of packet drops in wireless multi-hop networks results from hidden and exposed terminal problems, not from collisions. However, in normal DCF algorithm a failed user increases its contention window exponentially, thus it reduces the success probability of fined nodes. This phenomenon causes burst data transmissions in a particular node that already was successful in packet transmission, because the success probability increases due to short contention window. However, other nodes that fail to transmit packet data until maximum retransmission attempts try to set up new routing path configuration in network layer, which cause TCP performance degradation and restrain seamless data transmission. To solve these problems, the proposed algorithm increases the number of back-of retransmissions to increase the success probability of MAC transmission, and fixes the contention window at a predetermined value. By using ns-2 simulation for the chain and grid topology, we show that the proposed algorithm enhances the TCP performance.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.51 no.12
• /
• pp.20-29
• /
• 2014

Recently, LTE is preparing to make a new leap forward LTE-A all over the world. As LTE privides high speed service, the role of mobile phones seems to change from voice to data service. According to Cisco, global mobile data traffic will increase nearly 11-fold between 2013 and 2018. Mobile video traffic will reach 75% by 2018 from 66% in 2013 in Korea. However, voice service is still the most important role of mobile phones. Thus, controllability of throughput and low BLER is indispensable for high-quality VoIP service among various type of traffic. Although the maximum AMR-WB, 23.85 Kbps is sufficient to a VoIP call, it is difficult for the LTE which can provide tens to hundreds of MB/s may not keep the certain level VoIP QoS especially in the cell-edge area. This paper proposes a new scheduling algorithm in order to improve VoIP performance after analyzing various scheduling algorithms. The proposal is the technology which applies more priority processing for VoIP than other applications in cell-edge area based on two-tier scheduling algorithm. The simulation result shows the improvement of VoIP performance in the view point of throughput and BLER.

• The Transactions of the Korea Information Processing Society
• /
• v.3 no.3
• /
• pp.439-448
• /
• 1996

Extraction and selection of the informative features play a central role in pattern recognition. This paper describes a modified back-propagation algorithm that performs selection of the informative features and trains a neural network simultaneously. The algorithm is mainly composed of three repetitive steps : training, connection pruning, and input unit elimination. Afer initial training, the connections that have small magnitude are first pruned. Any unit that has a small number of connections to the hidden units is deleted,which is equivalent to excluding the feature corresponding to that unit.If the error increases,the network is retraned,again followed by connection pruning and input unit elimination.As a result,the algorithm selects the most im-portant features in the measurement space without a transformation to another space.Also,the selected features are the most-informative ones for the classification,because feature selection is tightly coupled with the classifi-cation performance.This algorithm helps avoid measurement of redundant or less informative features,which may be expensive.Furthermore,the final network does not include redundant parameters,i.e.,weights and biases,that may cause degradation of classification performance.In applications,the algorithm preserves the most informative features and significantly reduces the dimension of the feature vectors whiout performance degradation.

• KIPS Transactions on Software and Data Engineering
• /
• v.10 no.4
• /
• pp.125-132
• /
• 2021

As the layers of artificial neural network deepens, and the dimension of data used as an input increases, there is a problem of high arithmetic operation requiring a lot of arithmetic operation at a high speed in the learning and recognition of the neural network (NN). Thus, this study proposes a data dimensionality reduction method to reduce the dimension of the input data in the NN. The proposed Line-segment Feature Analysis (LFA) algorithm applies a gradient-based edge detection algorithm using median filters to analyze the line-segment features of the objects existing in an image. Concerning the extracted edge image, the eigenvalues corresponding to eight kinds of line-segment are calculated, using 3×3 or 5×5-sized detection filters consisting of the coefficient values, including [0, 1, 2, 4, 8, 16, 32, 64, and 128]. Two one-dimensional 256-sized data are produced, accumulating the same response values from the eigenvalue calculated with each detection filter, and the two data elements are added up. Two LFA256 data are merged to produce 512-sized LAF512 data. For the performance evaluation of the proposed LFA algorithm to reduce the data dimension for the recognition of handwritten numbers, as a result of a comparative experiment, using the PCA technique and AlexNet model, LFA256 and LFA512 showed a recognition performance respectively of 98.7% and 99%.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.20 no.3
• /
• pp.562-569
• /
• 2019

Raman spectroscopy has been receiving increased attention as a standoff explosive detection technique. In addition, there is a growing need for a fast search method that can identify raman spectrum for measured chemical substances compared to known raman spectra in large database. By far the most simple and widely used method is to calculate and compare the Euclidean distance between the given spectrum and the spectra in a database. But it is non-trivial problem because of the inherent high dimensionality of the data. One of the most serious problems is the high computational complexity of searching for the closet spectra. To overcome this problem, we presented the MPS Sort with Sorted Variance+PDS method for the fast algorithm to search for the closet spectra in the last paper. the proposed algorithm uses two significant features of a vector, mean values and variance, to reject many unlikely spectra and save a great deal of computation time. In this paper, we present two new methods for the fast algorithm to search for the closet spectra. the PCA+PDS algorithm reduces the amount of computation by reducing the dimension of the data through PCA transformation with the same result as the distance calculation using the whole data. the Hierarchical Cluster Tree algorithm makes a binary hierarchical tree using PCA transformed spectra data. then it start searching from the clusters closest to the input spectrum and do not calculate many spectra that can not be candidates, which save a great deal of computation time. As the Experiment results, PCA+PDS shows about 60.06% performance improvement for the MPS Sort with Sorted Variance+PDS. also, Hierarchical Tree shows about 17.74% performance improvement for the PCA+PDS. The results obtained confirm the effectiveness of the proposed algorithm.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.10 no.7
• /
• pp.1229-1236
• /
• 2006

Group oriented multicast service is a prerequisite for the current application system for remote lecture and customer service. IP multicast is used to be generally accepted as an internet standard. IP multicast which is designed to support network based replication model can efficiently use host and network resource, however it has some weak points that it has to support IP multicast in the internet by adding multicast-capable internet infrastructure such as router and is vulnerable to security by using public IP address for group identifier. Therefore we propose the trigger based application level multicast model that can enhance both scalability and security by separating the functions, which send and receive message to solve these problems. Our suggested model is expected to ensure the promotion of quality of service and reliability.