• Journal of Biosystems Engineering
• /
• 제38권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.

• 한국산업융합학회 논문집
• /
• 제23권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.

• 한국통신학회논문지
• /
• 제23권9A호
• /
• pp.2365-2371
• /
• 1998

이산 여현 변환(Discrete Cosine Transform: DCT)은 음성 및 영상 신호의 압축에 광범위하게 응용되고 있다. 본 논문에서는 $2^{m}$-포인트의 일반적인 경우로 확장이 가능한 새로운 고속 DCT 알고리즘과 구조를 제안한다. 제안한 알고리즘은 커널의 대칭성을 이용하여 N-포인트의 DCT를 N/2-포인트의 DCT로 나누어 처리하며 이를 재귀적으로 적용해 나간다. 제안한 알고리즘은 적은 덧셈 및 곱셈 연산을 통해 변환을 수행하며, 변환을 위해 통과해야 하는 곱셈 연산단의 수가 적고 대부분의 곱셈 연산이 흐름도상의 후반부에서 일괄적으로 수행되므로 고정 소수점 연산시에 발생할 수 있는 오차의 전파를 줄일 수 있다.

• 한국통신학회논문지
• /
• 제29권9C호
• /
• pp.1323-1329
• /
• 2004

본 논문은 고속 전역탐색법 중의 하나인 MSEA(multi level successive elimination algorithm)를 개선한 방식으로서, MSEA의 단계에 따른 norm의 계산 결과를 이용하여 최종 단계의 SAD를 예측함으로써 더 이상의 단계를 수행할 필요가 없다고 판단되는 단계의 계산을 생략함으로써 계산 량을 감소시키는 방법을 제안한다. 각 단계별 SAD의 예측을 위해 norm에 대한 이론적 분석이 이루어지며 실험을 통해 분석내용을 검증하고, 이를 바탕으로 새로운 알고리즘을 제안하고 실험을 통해 제안된 알고리즘의 성능을 평가한다.

• KIEE International Transactions on Power Engineering
• /
• 제2A권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.

• 제어로봇시스템학회논문지
• /
• 제22권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.

• 반도체디스플레이기술학회지
• /
• 제14권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.

• 융합보안논문지
• /
• 제12권3호
• /
• pp.35-43
• /
• 2012

최근 스마트 폰과 같은 다양한 단말의 보급이 확대됨에 따라 지속적인 트래픽 증가로 인해 이를 처리하기 위한 전달망 및 통신망 제어기술 또한 급속히 발전하고 있다. 이러한 추세를 반영하여 차세대 네트워크는 다양한 스위칭 계층으로 구성되고 이를 Generalized Multi-Protocol Label Switching(GMPLS) 프로토콜로 제어하는 형태로 구성될 것이다. 그러나 다계층 네트워크에서의 장애는 보호 복구 기능들 간의 충돌을 유발하여, 복구 시간의 지연, 망 자원의 비효율적 사용 등을 초래할 수 있다. 따라서 계층별 보호 복구 기능 간의 신속한 복구 경로설정이 다계층 네트워크에서 가장 중요한 과제가 되었다. 본 논문에서는 PCE(Path Computation Element)를 기반으로 다계층, 다중 도메인 네트워크에서 최적의 트래픽 엔지니어링을 지원하기 위한 기법을 제안하였다.

• 한국해양공학회지
• /
• 제20권3호
• /
• 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.

• 방송공학회논문지
• /
• 제10권3호
• /
• pp.348-356
• /
• 2005

본 논문에서는 H.264로 부호화 된 비트스트림을 이전보다 낮은 비트율을 갖는 비트스트림으로 변환시키기 위한 고속 비트율 감축 트랜스코딩을 제안한다. 제안된 트랜스코딩 기법은, 복호기에서 나온 블록 모드 정보와 움직임 벡터를 이용하여, 확률 기반의 블록 모드 결정 기법과 움직임 벡터 재사용 및 정제 기법을 사용하였다. 그 결과, 직렬 화소 영역 트랜스코딩과 비교하였을 때 약 0.1$\∼$0.3 dB 정도의 화질 저하가 있지만, 부호화 시간을 비교하였을 때 약 40배 빠른 결과를 얻었다.