• Journal of the Korean Institute of Intelligent Systems
• /
• v.23 no.1
• /
• pp.57-64
• /
• 2013

In this paper, we propose the classification method of medicine bottle images using the features with color and size information. It is difficult to classify with size feature only, because there are many similar sizes of bottles. Therefore, we suggest a classification method based on color information, which robust to illumination variations. First, we extract MBR(Minimum Boundary Rectangle) of medicine bottle area using Binary Threshold of Red, Green, and Blue in image and classify images with size. Then, hue information and RGB color average rate are used to classify image, which features are robust to lighting variations. Finally, using SURF(Speed Up Robust Features) algorithm, corresponding image can be found from candidates with previous extracted features. The proposed method makes to reduce execution time and minimize the error rate and is confirmed to be reliable and efficient from experiment.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.14 no.6
• /
• pp.1429-1434
• /
• 2010

Generally, the simulator for mobile device tests automatically an application software after instilling again the event, which is saved in log file according to an event generation sequence, into the application software of device. But, the simulator performance for mobile device can be different according to a extraction layer even if the events are same. And, the sequence of events extracted from an application is changeable in the environment that multiple applications are operated concurrently. Therefore, even though the same applications is executed to the same sequence, the generation sequence of events is revised in accordance with the state of mobile device system, and whether the errors occur according to circumstances or not. This kind of application software error is very difficult to perform a debugging operation. In this paper, the execution state of various applications is verifiable through the re-editing of events after analyzing the events which is generated in application, kernel, middleware layer, and the event arrange/editor is designed and implemented to understand efficiently the influence on application, kernel, and middleware layer for events.

• Journal of the Korea Society for Simulation
• /
• v.23 no.4
• /
• pp.181-188
• /
• 2014

Heterogeneous physical systems and computational devices are incorporated on a large-scale in a CPS (cyber-physical system) environment. Simulations can be useful for the reliable behaviors of CPSs. Time synchronization is one of major technical issues for the simulations. In the CPS, distributed systems control themselves by interacting with each other during runtime. When some simulation models have high complexity, wrong control commands as well as incorrect data can be exchanged due to the time error. We propose a time synchronization algorithm for the hybrid model that has characteristics of both continuous time systems and discrete event systems. In addition, we develop a CPS simulator based on our algorithm. For the verification of the algorithm and the execution of the simulator, we develop an example hybrid model and simulate considering user controls as well as interactions among the distributed systems.

• Journal of Korea Multimedia Society
• /
• v.10 no.3
• /
• pp.303-315
• /
• 2007

This paper proposes a 3D structure recovery and registration method that uses four or more common points. For each frame of a given video, a partial structure is recovered using tracked points. The 3D coordinates, camera positions and camera directions are computed at once by our improved scaled orthographic factorization method. The partially recovered point sets are parts of a whole model. A registration of point sets makes the complete shape. The recovered subsets are integrated by transforming each coordinate system of the local point subset into a common basis coordinate system. The process of shape recovery and integration is performed uniformly and linearly without any nonlinear iterative process and without loss of accuracy. The execution time for the integration is significantly reduced relative to the conventional ICP method. Due to the fast recovery and registration framework, our shape recovery scheme is applicable to various interactive video applications. The processing time per frame is under 0.01 seconds in most cases and the integration error is under 0.1mm on average.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.9 no.6
• /
• pp.1195-1201
• /
• 2005

This paper deals with procedures and results for teal time implementation of G.729 speech coder and channel coder including convolution codec, viterbi decoder, and interleaver using a fixed point DSP chip for radio communication systems. We described the method for real-time implementation based on integer simulation results and explained the implemented results by quality performance and required complexity for real-time operation. The required complexity was 24MIPS and 9MIPS in computational load, and 12K words and 4K words in execution code length for speech and channel. The functional evaluation was performed into two steps. The one was bit exact comparison with a fixed point C code, the other was executed by actual speech samples and error test vectors. Unlik other results such as individual implementation, We implemented speech and channel coders on a DSP chip with 160MIPS computation capability and 64 K words memory on chip. This results outweigh the conventional methods in the point of system complexity and implementation cost for radio communication system.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.19 no.10
• /
• pp.2409-2416
• /
• 2015

This paper presents an orientation-based adaptive prediction method for effective lossless image compression. For a robust prediction, the proposed method estimates the directional information and the property near the current pixel in a support region-based fashion, not a pixel-based one which is sensitive to a small variation. We improve the prediction performance effectively by selection of the prediction pixel adaptively according to the similarity between support regions of the current pixel and the neighboring pixels. Comprehensive experiments demonstrate that the proposed scheme achieves excellent prediction performance measured in entropy of the prediction error compared to a number of conventional prediction methods such as MED, GAP, and EDP. Moreover the complexity of the proposed algorithm measured by average execution time is low compared to MED which is the simplest prediction method.

• Journal of the Korean Society for Aeronautical & Space Sciences
• /
• v.48 no.10
• /
• pp.821-829
• /
• 2020

Health management system of airborne software repairs runtime errors to provide safety and to reduce cost of maintenance. It is critical to on-the-fly repair order violation errors, because it is difficult to identify them at the development phase. Previous work, called Repairing Atomicity Violations (Repairing-AV) diagnoses order violations for each access event by comparing execution order of accesses. As a result, Repairing-AV has time overhead that is proportional to the number of access events to shared variable. This paper presents a tool called On-the-fly Repairing System (ORS) that can repair order violations of object methods containing access events. The ORS diagnoses order violations by using correct order of object methods, and treats them by stalling its thread where the error is about to occur. Experimentation with five synthetic programs shows that ORS is more efficient than Repairing-AV when the number of access events is greater than sixty.

• Proceedings of the Korean Institute Of Construction Engineering and Management
• /
• 2006.11a
• /
• pp.87-91
• /
• 2006

After reformation of 'the law of private investment on social infrastructure' on January 2005, BTL of educational facilities can improve the education circumstance at early stage, however there are trial and error, problems of execution as well. The key of this problem is not only related to whether BTL project is more reasonable, but it also leads to the proper performance of eligibility analysis on BTL. Therefore, it lead to the proper carryout of eligibility analysis on BTL. In order to promote effective BTL project of educational facilities, this study analyzes problems of existing model and creates the evaluation model for solving this problem. In this study, the evaluation model of investment on BTL has more quick ,accuracy and useful effect than previous one, if it is applied on eligibility stage. Moreover, this method could be applied to public building, SOC facilities effectively based on being modified as each characteristics of structure suitably.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.13 no.10
• /
• pp.4940-4957
• /
• 2019

Compared with the localization methods in the static sensor networks, node localization in dynamic sensor networks is more complicated due to the mobility of the nodes. Dynamic Sampling Localization Algorithm Based on Virtual Anchor (DSLA) is proposed in this paper to localize the unknown nodes in dynamic sensor networks. Firstly, DSLA algorithm predicts the speed and movement direction of nodes to determine a sector sampling area. Secondly, a method of calculating the sampling quantity with the size of the sampling area dynamically changing is proposed in this paper. Lastly, the virtual anchor node, i.e., the unknown node that got the preliminary possible area (PLA), assists the other unknown nodes to reduce their PLAs. The last PLA is regarded as a filtering condition to filter out the conflicting sample points quickly. In this way, the filtered sample is close to its real coordinates. The simulation results show that the DSLA algorithm can greatly improve the positioning performance when ensuring the execution time is shorter and the localization coverage rate is higher. The localization error of the DSLA algorithm can be dropped to about 20%.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.38A no.7
• /
• pp.580-591
• /
• 2013

The Orthogonal Frequency Division Multiple Access (OFDMA) is considered as a novel modulation and multiple access technique for 4th generation wireless systems. In this paper, we formulate a base station's power allocation algorithm for each user to maximize the user's sum rate, subject to constraints on total power, bit error rate, and rate proportionality among the users for a better proportional rate adaptive (RA) resource allocation method for OFDMA based system. We propose a novel power allocation method based on the proportion of subcarrier allocation and the user's normalized proportionality constant. We adapt a greedy algorithm and waterfilling technique for allocating the subcarriers among the users. In an end-to-end simulation, we validate that the proposed technique has higher system capacity and lower CPU execution times, while maintaining the acceptable rate proportionality among users.