• Journal of Korea Multimedia Society
• /
• v.15 no.4
• /
• pp.485-491
• /
• 2012

This paper proposes 'Coding Unit Tree' based on quadtree efficiently with motion vector to represent splitting information of a Coding Unit (CU) in HEVC. The new international video coding, High Efficiency Video Coding (HEVC), adopts various techniques and new unit concept: CU, Prediction Unit (PU), and Transform Unit (TU). The basic coding unit, CU is larger than macroblock of H.264/AVC and it splits to process image-based quadtree with a hierarchical structure. However, in case that there are complex motions in CU, the more signaling bits with motion information need to be transmitted. This structure provides a flexibility and a base for a optimization, but there are overhead about splitting information. This paper analyzes those signals and proposes a new algorithm which removes those redundancy. The proposed algorithm utilizes a type code, a dominant value, and residue values at a node in quadtree to remove the addition bits. Type code represents a structure of an image tree and the two values represent a node value. The results show that the proposed algorithm gains 13.6% bit-rate reduction over the HM-1.0.

• Journal of Korea Multimedia Society
• /
• v.12 no.11
• /
• pp.1640-1651
• /
• 2009

In this paper we introduce a new approach to stroke based rendering using brush stroke profile. Our proposed method, based on image retrieval method, is a simple but flexible and scalable method to create various painting styles, for which scalable database constructed with the collection of real stroke data is used. Input image is reproduced with combinations of brush stoke in the database, when a search process to determinate appropriate brush stroke and a judgment process to decide whether to draw the retrieved brush stroke on the canvas or not are presented. In addition, this paper suggests a new brush stroke model and a depiction technique in order to utilize effective height information which allows natural texture depiction, or good visual effect, without carrying out physical simulation. Our method is able to create diverse variations of painting by controling various user parameters. It also provides scalable framework that can produce various painting styles with different artistic media by changing the stroke combinations of stroke database.

• Journal of Advanced Navigation Technology
• /
• v.14 no.4
• /
• pp.489-494
• /
• 2010

According to the recent increase in air traffic more efficient air traffic control automation is required. Aeronautical traffic environment is different from the common traffic environment since it exist controller for control of aircraft And controller have to control jurisdiction hand-off by manual when aircraft move to the other sector. This paper proposes the automatic control jurisdiction hand-off algorithm for efficient air traffic flow management. It is sector distinction algorithm that aircraft move sector to the other sector it recognized sector and then give permission to authorized controller. As a simulation result, so unlilke simply manual control sector hand-off of existing algorithm. we confirmed that proposed algorithm in this paper can do air traffic control more efficiently by performing automatic aircraft. control sector hand-off.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.44 no.10
• /
• pp.20-28
• /
• 2007

Zigbee sensor network base on IEEE802.15.4 has local address of 2 byte on transmit packet data which is pick up the address for each sensor node. Sensor network is requested low power, low cost, many nodes at hues physical area. There for Zigbee is very good solution supporting for next Ubiquitous generation but the Zigbee sensor network has address allocation problem of each sensor node. Is established standard from Zigbee Alliance, to the address allocation method uses Cskip algorithm. The Cskip algorithm use the hazard which allocates an address must blow Hop of the maximum modification and child node number. There is to address allocation and from theoretically it will be able to compose a personal 65536 sensor nodes only actual with concept or space, only 500 degree will be able to compose expansion or the low Zigbee network. We proposed an address allocation method using coordinate value for Zigbee sensor network.

• Journal of Korea Society of Industrial Information Systems
• /
• v.18 no.2
• /
• pp.1-12
• /
• 2013

Information Security System is implemented in software, hardware and FPGA device. Implementation of S/W provides high flexibility about various information security algorithm, but it has very vulnerable aspect of speed, power, safety, and performing ASIC is really excellent aspect of speed and power but don't support various security platform because of feature's realization. To improve conflict of these problems, implementation of recent FPGA device is really performed. The goal of this thesis is to design and develop a FPGA hardware accelerator for information security system. It performs as AES, SHA-256 and ECC and is controlled by the Integrated Interface. Furthermore, since the proposed Security Information System can satisfy various requirements and some constraints, it can be applied to numerous information security applications from low-cost applications and high-speed communication systems.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.28 no.5B
• /
• pp.448-456
• /
• 2003

In this parer, an ABR (Available Bit Rate) congestion control algorithm for voice transmission in ATM networks was proposed. To deal with the network congestion problem, not only the buffer level of a switch but also the variation of the buffer level were considered. Also, to resolve the unfairness among sources where the bit transfer rates vary, a loading factor that is used to adjust the bit rate was introduced. To show the superiority of this paper over others, simulation was done with a network of 7 voice sources and 4 switches, which was represented by Petri net model. ExSpect was used for simulation. The simulation results showed that there was improvement in network utilization and that unfairness among sources were resolved a lot.

• Journal of the Korea Society of Computer and Information
• /
• v.18 no.5
• /
• pp.95-102
• /
• 2013

In metabolomics, metabolic pathway is represented by well-displayed graph. Metabolic pathways, especially, have a complex binding structure, which makes the graphical representation hard to visualize. There is a problem that edge crossings exponentially increase as the number of nodes grows. To apply automatic graph layout techniques to the genome-scale metabolic flow of metabolism domains, it is very important to reduce unnecessary edge crossing on a metabolic pathway layout. we proposed a metabolic pathway layout algorithm based on 2-layer layout. Our algorithm searches any meaningful component existing in a pathway, such as circular components, highly connected nodes, and the components are drawn in upper layer. Then the remaining subgraphs except meaningful components are drawn in lower layer by utilizing a new radial layout algorithm. It reduces ultimately reduced the number of edge crossings. This algorithm is the basis of flexible analysis for metabolic pathways.

• Journal of Practical Engineering Education
• /
• v.14 no.1
• /
• pp.219-224
• /
• 2022

Q-Learning is a technique widely used as a basic algorithm for reinforcement learning. Q-Learning trains the agent in the direction of maximizing the reward through the greedy action that selects the largest value among the rewards of the actions that can be taken in the current state. In this paper, we studied a policy that can speed up agent training using Q-Learning in Frozen Lake 8×8 grid environment. In addition, the training results of the existing algorithm of Q-learning and the algorithm that gave the attribute 'direction' to agent movement were compared. As a result, it was analyzed that the Q-Learning policy proposed in this paper can significantly increase both the accuracy and training speed compared to the general algorithm.

• Journal of the Korea Society of Computer and Information
• /
• v.20 no.3
• /
• pp.19-27
• /
• 2015

Technologies of wind power generation for development of alternative energy technology have been accumulated over the past 20 years. Wind power generation is environmentally friendly and economical because it uses the wind blowing in nature as energy resource. In order to operate wind power generation efficiently, it is necessary to accurately predict wind speed changing every moment in nature. It is important not only averagely how well to predict wind speed but also to minimize the largest absolute error between real value and prediction value of wind speed. In terms of generation operating plan, minimizing the largest absolute error plays an important role for building flexible generation operating plan because the difference between predicting power and real power causes economic loss. In this paper, we propose a method of wind speed prediction using numeric prediction algorithm-based wind speed forecast model made to analyze the wind speed forecast given by the Meteorological Administration and pattern value for considering seasonal property of wind speed as well as changing trend of past wind speed. The wind speed forecast given by the Meteorological Administration is the forecast in respect to comparatively wide area including wind generation farm. But it contributes considerably to make accuracy of wind speed prediction high. Also, the experimental results demonstrate that as the rate of wind is analyzed in more detail, the greater accuracy will be obtained.

• Journal of KIISE
• /
• v.44 no.2
• /
• pp.213-222
• /
• 2017

The Internet of Things (IoT) technology is rapidly developing in recent years, and is applicable to various fields. A smart factory is one wherein all the components are organically connected to each other via a WSN, using an intelligent operating system and the IoT. A smart factory technology is used for flexible process automation and custom manufacturing, and hence needs adaptive network management for frequent network fluctuations. Moreover, ensuring the timeliness of the data collected through sensor nodes is crucial. In order to ensure network timeliness, the power consumption for information exchange increases. In this paper, we propose an IEEE 802.15.4e DSME-based distributed scheduling algorithm for mobility support, and we evaluate various performance metrics. The proposed algorithm adaptively assigns communication slots by analyzing the network traffic of each node, and improves the network reliability and timeliness. The experimental results indicate that the throughput of the DSME MAC protocol is better than the IEEE 802.15.4e TSCH and the legacy slotted CSMA/CA in large networks with more than 30 nodes. Also, the proposed algorithm improves the throughput by 15%, higher than other MACs including the original DSME. Experimentally, we confirm that the algorithm reduces power consumption by improving the availability of communication slots. The proposed algorithm improves the power consumption by 40%, higher than other MACs.