• The Journal of Korea Institute of Information, Electronics, and Communication Technology
• /
• v.10 no.2
• /
• pp.192-197
• /
• 2017

In this paper, image filter optimization method based on common sub-expression elimination is proposed for low-power image feature extraction hardware design. Low power and high performance object recognition hardware is essential for industrial robot which is used for factory automation. However, low area Gaussian gradient filter hardware design is required for object recognition hardware. For the hardware complexity reduction, we adopt the symmetric characteristic of the filter coefficients using the transposed form FIR filter hardware architecture. The proposed hardware architecture can be implemented without degradation of the edge detection data quality since the proposed hardware is implemented with original Gaussian gradient filtering algorithm. The expremental result shows the 50% of multiplier savings compared with previous work.

• Journal of Intelligence and Information Systems
• /
• v.8 no.2
• /
• pp.1-13
• /
• 2002

In this paper, we propose an object tracking system which can be convinced of moving area shaped on objects through color sequential images, decided moving directions of foot messengers or vehicles of image sequences. In static camera, we suggests a new evaluating method extracting co-occurrence matrix with feature vectors of RGB after analyzing and blocking difference images, which is accessed to field of camera view for motion. They are energy, entropy, contrast, maximum probability, inverse difference moment, and correlation of RGB color vectors. we describe how to analyze and compute corresponding relations of objects between adjacent frames. In the clustering, we apply an algorithm of FCM(fuzzy c means) to analyze matching and clustering problems of adjacent frames of the featured vectors, energy and entropy, gotten from previous phase. In the matching phase, we also propose a method to know correspondence relation that can track motion each objects by clustering with similar area, compute object centers and cluster around them in case of same objects based on membership function of motion area of adjacent frames.

• Journal of the Korea Institute of Military Science and Technology
• /
• v.23 no.4
• /
• pp.407-416
• /
• 2020

Recent complex battle field demands Network Centric Warfare(NCW) ability to control various parts into a cohesive unit. In path planning filed, the NCW ability increases complexity of path planning algorithm, and it has to consider a communication coverage map as well as traditional parameters such as minimum radar exposure and survivability. In this paper, pros and cons of various propagation models are summarized, and we suggest a coverage map generation method using a Longley-Rice propagation model. Previous coverage map based on line of sight has significant discontinuities that limits selection of path planning algorithms such as Dijkstra and fast marching only. If there is method to remove discontinuities in the coverage map, optimization based path planning algorithms such as trajectory optimization and Particle Swarm Optimization(PSO) can also be used. In this paper, the Longley-Rice propagation model is used to calculate continuous RF strengths, and convert the strength data using smoothed leaky BER for the coverage map. In addition, we also suggest other types of rough coverage map generation using a lookup table method with simple inputs such as terrain type and antenna heights only. The implemented communication coverage map can be used various path planning algorithms, especially in the optimization based algorithms.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.22 no.4
• /
• pp.617-623
• /
• 2018

In this paper, we propose a novel seamless video composition method based on shape matching and Poisson equation. Video composition method consists of video segmentation process and video blending process. In the video segmentation process, the user first sets a trimap for the first frame, and then performs a grab-cut algorithm. Next, considering that the performance of video segmentation may be reduced if the color, brightness and texture of the object and the background are similar, the object region segmented in the current frame is corrected through shape matching between the objects of the current frame and the previous frame. In the video blending process, the object of source video and the background of target video are blended seamlessly using Poisson equation, and the object is located according to the movement path set by the user. Simulation results show that the proposed method has better performance not only in the naturalness of the composite video but also in computational time.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.24 no.9B
• /
• pp.1631-1642
• /
• 1999

In this paper, we propose a new fault tolerant ATM Switch and a new adaptive self-routing scheme used to make the switch to be fault tolerant. It can provide more multiple paths than the related previous switches between an input/output pair of a switch by adding extra links between switching elements in the same stage and extending the self-routing scheme of the Banyan network. Our routing scheme is as simple as that of the banyan network, which is based on the topological relationships among the switching elements (SE’s) that render a packet to the same destination with the regular self-routing. These topological properties of the Banyan network are discovered in this paper. We present an algebraic proof to show the correctness of this scheme, and an analytic reliability analysis to provide quantitative comparisons with other switches, which shows that the new switch is more cost effective than the Banyan network and other augmented MIN’s in terms of the reliability.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.36 no.6B
• /
• pp.728-737
• /
• 2011

For the real time monitoring and tracking of shipping container which is one of the core objects for global logistics, Wireless Ad-Hoc Network technology might be needed in stacking environments such as ports, yards and ships. In this paper, we propose a container network routing protocol suitable for port or yard stacking environments which include some constraints such as shadow area problem from metal material, frequent movement of container, etc. With this protocol in which a mesh network algorithm is applied, every container data packet can be delivered to the sink node reliably even with frequent join/leave of container nodes. As soon as a node on path gets malfunction, alternative backup path is supported with notice to neighbor node, which makes constant total optimal path. We also verified that the performance of proposed protocol is better than AODV, one of previous major MANet(Mobile Ad-Hoc Network) protocol with a function for alternative path, which says the proposed protocol is better for frequent join/leave and variable link quality.

• The KIPS Transactions:PartD
• /
• v.18D no.3
• /
• pp.169-178
• /
• 2011

Recently, data sharing between enterprises or organizations is required matter for task cooperation. In this process, when the enterprise opens its database to the affiliates, it can be occurred to problem leaked sensitive information. To resolve this problem it is needed to hide sensitive information from the database. Previous research hiding sensitive information applied different heuristic algorithms to maintain quality of the database. But there have been few studies analyzing the effects on the items modified during the hiding process and trying to minimize the hided items. This paper suggests eFP-Tree(Extended Frequent Pattern Tree) based FP-Tree(Frequent Pattern Tree) to hide sensitive frequent itemsets. Node formation of eFP-Tree uses border to minimize impacts of non sensitive frequent itemsets in hiding process, by organizing all transaction, sensitive and border information differently to before. As a result to apply eFP-Tree to the example transaction database, the lost items were less than 10%, proving it is more effective than the existing algorithm and maintain the quality of database to the optimal.

• The KIPS Transactions:PartA
• /
• v.19A no.3
• /
• pp.161-168
• /
• 2012

The study of Cloud based system is emerging to become the core technology in IT field due to the tremendous growth of Cloud Computing. Researches to deliver applications to Thin-Client based mobile virtual machine and Desktop as a Service(DaaS) using Cloud Computing are conducted actively. In this paper, we propose a Cloud system to run the mobile application in the mobile Thin-Client device and resource allocation mechanism Dynamic Resource Allocation Manager for Mobile Application(DRAMMA). Thus, through performance check, we show DRAMMA has improved the utilization of Cloud system, less migration of virtual machines and decreased the error rate of resource allocation. Also our proposed system delivers service more efficiently than the previous resource allocation algorithm.

• The KIPS Transactions:PartC
• /
• v.9C no.1
• /
• pp.21-30
• /
• 2002

Nowadays the fair queuing field is studied actively for solving the unfair queuing problem which degrades the service performance of various applications on network. Above all DRR is a scheme that has lower work complexity and can be implemented easily. It guarantees the fair service by serving each queue every round Service Quantum(SQ) that includes the service deficit of the previous round. But it increases the delay by the numbers of unnecessary resetting of SQ or round circulation for the service that have the packet size over maximum several kbyte. In this paper, We propose the method that sets SQ dynamically to minimize this problem and the method that minimizes the work complexity on processing of packet. The proposed scheme minimizes the delay on various applications in enterprise environment by setting SQ dynamically and processing the packet simply.

• Journal of Biosystems Engineering
• /
• v.20 no.1
• /
• pp.95-103
• /
• 1995

A series of study has been conducted to develop a multi-purpose fruit grader using a black ＆ white image processing system equipped with a 550 nm interference filter. A device and high performance algorithms were developed for sizing and color grading of Fuji apple in the previous study. In this study an emphasis was put on finding correlations between weights of several kinds of fruits and their area fractions(AF), and on compensating the blurring effect upon sizing and color grading by conveying speed of fruit. Also, the effect of orientation and direction of fruit on conveyor during image forming was analyzed to identify any difficulty (or utilizing an automatic fruit feeder. The results are summarized as follows. 1. The correlation coefficients(r) between the weights of fruits and their image sizes were 0.984~0.996 for apples, 0.983~0.990 for peachs, 0.995 for tomato, 0.986 for sweet persimmon and 0.970~0.993 for pears. 2. It was possible to grade fruits by color with the area weighted mean gray values(AWMGV) based on the mean gray valves of direct image and the compensated values of reflected image of a fruit, and also possible to sort fruits by size with AF. Accuracies in sizing and color grading ranged over 81.0% ~95.0% and 82.0% ~89.7% respectively as compared with results from sizing by electronic weight scale and grading by expert. 3. The blurring effect on the sizing and color grading depending on conveying speed was identified and regression equations were derived. 4. It was found that errors in sizing and coloring grading due to the change in direction and orientation of Fuji apple on the conveyor were not significant as far as the stem end of apple keeping upward.