• 한국인터넷방송통신학회논문지
• /
• 제15권2호
• /
• pp.99-104
• /
• 2015

본 논문에서는 통신 채널에서 발생되는 부호간 간섭 영향을 최소화시키기 위한 MMA 적응 등화 알고리즘의 성능을 개선시키기 위한 RMMA (Region based Multiple Modulus Algorithm) 알고리즘을 제안한다. RMMA 알고리즘에서는 적응을 위한 오차 신호를 얻기 위하여 등화기 출력 constellation을 4개의 영역으로 분할한 후 각 영역별로 4-QAM 신호로 매핑하므로서 nonconstant modulus 신호를 constant modulus 신호로의 변환 효과를 얻으며, 이로 인하여 더욱 적은 오차 신호를 얻을 수 있게 된다. 논문에서는 제안 알고리즘인 RMMA의 적응 등화 성능을 평가하기 위하여 기존 방식인 MMA와 비교하였다. 컴퓨터 시뮬레이션 결과 잔류 isi와 MD에서 수렴 속도와 잔류양에서 개선되었으며, 특히 SER에서 기존 MMA보다 월등함을 알 수 있었다.

• 로봇학회논문지
• /
• 제17권3호
• /
• pp.255-263
• /
• 2022

3D object detection pipelines often incorporate RGB-based object detection methods such as YOLO, which detects the object classes and bounding boxes from the RGB image. However, in complex environments where objects are heavily cluttered, bounding box approaches may show degraded performance due to the overlapping bounding boxes. Mask based methods such as Mask R-CNN can handle such situation better thanks to their detailed object masks, but they require much longer time for data preparation compared to bounding box-based approaches. In this paper, we present a 3D object recognition pipeline which uses either the YOLO or Mask R-CNN real-time object detection algorithm, K-nearest clustering algorithm, mask reduction algorithm and finally Principal Component Analysis (PCA) alg orithm to efficiently detect 3D poses of objects in a complex environment. Furthermore, we also present an improved YOLO based 3D object detection algorithm that uses a prioritized heightmap clustering algorithm to handle overlapping bounding boxes. The suggested algorithms have successfully been used at the Artificial-Intelligence Robot Challenge (ARC) 2021 competition with excellent results.

• Nuclear Engineering and Technology
• /
• 제56권6호
• /
• pp.2092-2098
• /
• 2024

Probabilistic safety assessment (PSA) plays a critical role in ensuring the safe operation of nuclear power plants. In PSA, event trees are developed to identify accident sequences that could lead to core damage. These event trees are then transformed into a core-damage fault tree, wherein the accident sequences are represented by usual and complemented logic gates representing failed and successful operations of safety systems, respectively. The core damage frequency (CDF) is estimated by calculating the minimal cut sets (MCSs) of the core-damage fault tree. Delete-term approximation (DTA) is commonly employed to approximately solve MCSs representing accident sequence logics from noncoherent core-damage fault trees. However, DTA can lead to an overestimation of CDF, particularly when fault trees contain many nonrare events. To address this issue, the present study introduces a new zero-suppressed ternary decision diagram (ZTDD) algorithm that averts the CDF overestimation caused by DTA. This ZTDD algorithm can optionally calculate MCSs with DTA or prime implicants (PIs) without any approximation from the core-damage fault tree. By calculating PIs, accurate CDF can be calculated. The present study provides a comprehensive explanation of the ZTDD structure, formula of the ZTDD algorithm, ZTDD minimization, probability calculation from ZTDD, strength of the ZTDD algorithm, and ZTDD application results. Results reveal that the ZTDD algorithm is a powerful tool that can quickly and accurately calculate CDF and drastically improve the safety of nuclear power plants.

• 한국가시화정보학회:학술대회논문집
• /
• 한국가시화정보학회 2004년도 Proceedings of 2004 Korea-Japan Joint Seminar on Particle Image Velocimetry
• /
• pp.25-32
• /
• 2004

The new algorithm for higher performance of dynamic PIV has been proposed. Present study considered mathematical basis of PIV analysis for multiple-time-step images and it enables us to analyze the high time-resolution PIV, which is obtained by dynamic PIV system. Conventional single pair image PIV analysis gives us the velocity field data in each time step but it sometimes contains unnecessary information of target flow. Present technique utilize multi-time step correlation information, and it is analyzed.

• 한국방송∙미디어공학회:학술대회논문집
• /
• 한국방송공학회 1997년도 Proceedings International Workshop on New Video Media Technology
• /
• pp.61-66
• /
• 1997

For constructing an intelligent multimedia database system for medical diagnosis, we are focusing on two technological points. One is a retrieval algorithm of databases, and the other is a coding algorithm of multimedia contents. For the first, previously we proposed a front-end database preprocessor called“keyword-network”, and in this paper we present its extended model providing an intelligent logical AND searching function especially for medical differential diagnosis. For the second, we present examples of multimedia intellectual coding methods for cardiovascular examination records.

• 대한기계학회논문집
• /
• 제19권4호
• /
• pp.941-949
• /
• 1995

An efficient method based on analytic solutions is applied to solve anti-plane Mode III crack problems. The analytic technique developed earlier by the present authors for Laplace's equation in a simply-connected region is now extended to general Mode III crack problems. Unlike typical numerical methods which require fine meshing near crack tips, the present method divides the cracked bodies, typically non-convex or multiply-connected, into only a few super elements. In each super element, an element stiffness matrix, relating the series coefficients of the traction and displacement, is first formed. Then an assembly algorithm similar to that used in the finite elements, is first formed. Then an assembly algorithm similar to that used in the finite elements, is developed. A big advantage of the present method is that only the boundary conditions are to be satisfied in the solution procedure due to the use of analytic solutions. Several numerical results demonstrate the efficiency and accuracy of the present method.

• 대한수학회보
• /
• 제59권6호
• /
• pp.1523-1537
• /
• 2022

We present a new square root algorithm in finite fields which is a variant of the Pocklington-Peralta algorithm. We give the complexity of the proposed algorithm in terms of the number of operations (multiplications) in finite fields, and compare the result with other square root algorithms, the Tonelli-Shanks algorithm, the Cipolla-Lehmer algorithm, and the original Pocklington-Peralta square root algorithm. Both the theoretical estimation and the implementation result imply that our proposed algorithm performs favorably over other existing algorithms. In particular, for the NIST suggested field P-224, we show that our proposed algorithm is significantly faster than other proposed algorithms.

• 제어로봇시스템학회논문지
• /
• 제2권3호
• /
• pp.242-247
• /
• 1996

In this paper, an optimal coning compensation algorithm for strapdown system is proposed by minimizing the coning error. The proposed algorithm is derived as a generalized form in that it contains the class of the existing coning algorithms and allows the design of optimal algorithm for various combinations of gyro samples. It is shown the magnitude of resulting algorithm errors depends mainly on the total number of gyro samples including present and previous gyro samples. Based on the results, the proposed algorithm enables the algorithm designers to develop the effective coning compensation algorithm according to their attitude computation specifications with ease. In addition, the multirate method which can efficiently implement the algorithm is presented.

• 조명전기설비학회논문지
• /
• 제21권4호
• /
• pp.96-103
• /
• 2007

In this paper, we present a novel and numerically efficient algorithm for high resolution TOA(Time Of Arrival) estimation under indoor radio propagation channels. The proposed algorithm is not dependent on the structure of receivers, i.e, it can be used with either coherent or non-coherent receivers. The TOA estimation algorithm is based on a high resolution frequency estimation algorithm of Minimum-norm. The efficiency of the proposed algorithm relies on numerical analysis techniques in computing signal or noise subspaces. The algorithm is based on the two step procedures, one for transforming input data to frequency domain data and the other for estimating the unknown TOA using the proposed efficient algorithm. The efficiency in number of operations over other algorithms is presented. The performance of the proposed algorithm is investigated by means of computer simulations.. Throughout the analytic and computer simulation results, we show that the proposed algorithm exhibits superior performance in estimating TOA estimation with limited computational cost.

• Journal of applied mathematics & informatics
• /
• 제17권1_2_3호
• /
• pp.93-107
• /
• 2005

Based on the recently developed ABS algorithm for solving linear Diophantine equations, we present a special ABS algorithm for solving such equations which is effective in computation and storage, not requiring the computation of the greatest common divisor. A class of equations always solvable in integers is identified. Using this result, we discuss the ILP problem with upper and lower bounds on the variables.