• Journal of Biosystems Engineering
• /
• v.38 no.2
• /
• pp.149-162
• /
• 2013

Purpose: In image segmentation via thresholding, Otsu and Kapur methods have been widely used because of their effectiveness and robustness. However, computational complexity of these methods grows exponentially as the number of thresholds increases due to the exhaustive search characteristics. Methods: Particle swarm optimization (PSO) and genetic algorithms (GAs) can accelerate the computation. Both methods, however, also have some drawbacks including slow convergence and ease of being trapped in a local optimum instead of a global optimum. To overcome these difficulties, we proposed two new multi-level thresholding methods based on Bacteria Foraging PSO (BFPSO) and real-coded GA algorithms for fast segmentation. Results: The results from BFPSO and real-coded GA methods were compared with each other and also compared with the results obtained from the Otsu and Kapur methods. Conclusions: The proposed methods were computationally efficient and showed the excellent accuracy and stability. Results of the proposed methods were demonstrated using four real images.

• Journal of the Korean Society of Industry Convergence
• /
• v.23 no.4_1
• /
• pp.549-558
• /
• 2020

We describe a new approach to real-time implementation of track record and trajectory control of robotic manipulator with eight joints based on monitoring simulator. Trajectory generator uses the kinematic equations of the arm to convert the task description into a series of set points for each of the joint control loops, while the joint controllers, with simple algorithms for just one joint can move at a fast sampling rate, guaranteeing a smooth motion. The proposed control scheme is robust, fast in computation, and suitable for real-time control. Moreover, this scheme does not require any accurate parameter information, nor values of manipulator parameters and payload. Reliability of the proposed technology is veriefied by monitoring simulation and experimental of robot manipulator for the smart factory with eight degrees of freedom.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.23 no.9A
• /
• pp.2365-2371
• /
• 1998

Discrete cosine transform (DCT) has wide applications in speech and image coding. In this paper, we propose a novel fast dCT scheme with the property of reduced multiplication stages and the smaller number of additions and multiplications. This exploits the symmetry property of the DCT kernel to decompose the N-point dCT to N/2 point, and can be generally applied recursively to $2^{m}$-point. The proposed algorithm has a structure that most of multiplications tend to be performed at final stage, and this reduces propagation of truncation error which could occur in the fixed-point computation. Also the minimization of the multiplication stages further decreases the error.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.29 no.9C
• /
• pp.1323-1329
• /
• 2004

This paper presents an enhanced MSEA(multi-level successive elimination algorithm) which is a fast algorithm of the full-search motion estimation. We predict the SAD at the final level using the values of norms at the preceding levels in MSEA and then decide on whether the processing at the following levels should be proceeded or not. We skip the computation at the following levels where the processing is not meaningful anymore. Consequently, we take computational gain. For the purpose of predicting the values of SAD at each level, we first show the theoretical analysis of the value of norm at each level, which is verified by experiments. Based on the analysis a new motion estimation method is proposed and its performance is evaluated.

• KIEE International Transactions on Power Engineering
• /
• v.2A no.4
• /
• pp.131-135
• /
• 2002

This paper describes a new ultra-fast contingency screening algorithm for on-line TSA without time simulation. All machines are represented in a classical model and the stability index is defined as the ratio between acceleration power during a fault and deceleration power after clearing the fault. Critical clustering of machines is done based on the stability index, and the power-angle curve of the critical machines is drawn assuming that the angles of the critical machines increase uniformly, while those of the non-critical ones remain constant. Finally, the critical clearing time (CCT) is computed using the power-angle curve. The proposed algorithm is tested on the KEPCO system comprised of 900-bus and 230-machines. The CCT values computed with the screening algorithm are in good agreement with those computed using the detailed model and the SIME method. The computation time for screening about 270 contingencies is 17 seconds with 1.2 GHz PC.

• Journal of Institute of Control, Robotics and Systems
• /
• v.22 no.12
• /
• pp.1021-1026
• /
• 2016

The graph-based SLAM (Simultaneous Localization and Mapping) approach has been gaining much attention in SLAM research recently thanks to its ability to provide better maps and full trajectory estimations when compared to the filtering-based SLAM approach. Even though graph-based SLAM requires batch processing causing it to be computationally heavy, recent advancements in optimization and computing power enable it to run fast enough to be used in real-time. However, data association problems still require large amount of computation when building a pose graph. For example, to find loop closures it is necessary to consider the whole history of the robot trajectory and sensor data within the confident range. As a pose graph grows, the number of candidates to be searched also grows. It makes searching the loop closures a bottleneck when solving the SLAM problem. Our approach to alleviate this bottleneck is to sample a limited number of pose nodes in which loop closures are searched. We propose a heuristic for sampling pose nodes that are most advantageous to closing loops by providing a way of ranking pose nodes in order of usefulness for closing loops.

• Journal of the Semiconductor & Display Technology
• /
• v.14 no.4
• /
• pp.56-60
• /
• 2015

Mobile devices like smartphones and tablets are becoming increasingly capable in terms of processing power. Although they are already used in computer vision, no comparable measurement experiments of the popular feature extraction algorithm have been made yet. That is, local feature descriptors are widely used in many computer vision applications, and recently various methods have been proposed. While there are many evaluations have focused on various aspects of local features, matching accuracy, however there are no comparisons considering on speed trade-offs of recent descriptors such as ORB, FAST and BRISK. In this paper, we try to provide a performance evaluation of feature descriptors, and compare their matching precision and speed in KD-Tree setup with efficient computation of Hamming distance. The experimental results show that the recently proposed real valued descriptors such as ORB and FAST outperform state-of-the-art descriptors such SIFT and SURF in both, speed-up efficiency and precision/recall.

• Convergence Security Journal
• /
• v.12 no.3
• /
• pp.35-43
• /
• 2012

The explosive growth of Internet traffic cause by smart equipment such as smart phone has led to a dramatic increase in demand for data transmission capacity and network control architecture, which requires high transmission rates beyond the conventional transmission capability. Next generation networks are expected to be controlled by Generalized Multi-Protocol Label Switching(GMPLS) protocol suite and operating at multiple switching layers. In order to ensure the most efficient utilization of multilayer network resources, effective global provisioning that providing the network with the possibility of reacting in advance to traffic changes should be provided. In this paper, we proposes a new path selection scheme in multilayer optical networks based on the vertical PCE architecture and a different approach to efficiently exploit multiple PCE cooperation.

• Journal of Ocean Engineering and Technology
• /
• v.20 no.3 s.70
• /
• pp.82-87
• /
• 2006

An approach to model a high-speed monohull vessel is introduced. The high-speed monohull form belonging to the category of multihull is drawing new attention, due to the rapidly growing trend of fast passenger ships and military purpose. Multihull forms are much thinner in their overall shape, compared to those of the conventional commercial vessels. Moreover, the parent hull forms are not readily obtainable when a new design is intended, which makes it hard to perform various technical calculations in terms of hull optimization, hydrodynamic computation, structural design, and so forth. In this paper, a parametric technique is used to design a high-speed hull form. To model a hull form, NURBS (Non Uniform Rational B-Spline) representation is used. The goal of research is to provide a fast and convenient tool to design an initial hull form with fewer parameters available in the early design stage. The technique employed in this paper will be applied to the design of multihull forms, such as catamaran, trimaran, and semi-swath.

• Journal of Broadcast Engineering
• /
• v.10 no.3
• /
• pp.348-356
• /
• 2005

In this paper, we propose a fast bitrate reduction transcoding method to convert a bitstream coded by H.264 into a lower bitrate H.264 bitstream. Block mode informations and motion vectors generated by H.264 decoder are used for probability-based block mode determination in the proposed transcoding method. And the motion vector reuse and motion vector refinement process are applied in the proposed transcoding. In the experiment results, the proposed methods achieves approximately 40 times improvement in computation complexity compared with the cascaded pixel domain transcoding, while the PSNR(Peak Signal to Noise Ratio) is degraded with only $0.1\~0.3$ dB.