• Title/Summary/Keyword: Algorithm #3

Search Result 15,289, Processing Time 0.038 seconds

Bit-sliced Modular Multiplication Algorithm and Implementation (비트 확장성을 갖는 모듈러 곱셈 알고리즘 및 모듈러 곱셈기 설계)

  • 류동렬
    • Journal of the Korea Institute of Information Security & Cryptology
    • /
    • v.10 no.3
    • /
    • pp.3-10
    • /
    • 2000
  • In this paper we propose a bit-sliced modular multiplication algorithm and a bit-sliced modular multiplier design meeting the increasing crypto-key size for RSA public key cryptosystem. The proposed bit-sliced modular multiplication algorithm was designed by modifying the Montgomery's algorithm. The bit-sliced modular multiplier is easy to expand to process large size operands and can be immediately applied to RSA public key cryptosystem.

Development of an Efficient 3D Object Recognition Algorithm for Robotic Grasping in Cluttered Environments (혼재된 환경에서의 효율적 로봇 파지를 위한 3차원 물체 인식 알고리즘 개발)

  • Song, Dongwoon;Yi, Jae-Bong;Yi, Seung-Joon
    • The Journal of Korea Robotics Society
    • /
    • v.17 no.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.

Triangulation of Voronoi Faces of Sphere Voronoi Diagram using Delaunay Refinement Algorithm (딜러니 개선 알고리듬을 이용한 삼차원 구의 보로노이 곡면 삼각화)

  • Kim, Donguk
    • Journal of Korean Society of Industrial and Systems Engineering
    • /
    • v.41 no.4
    • /
    • pp.123-130
    • /
    • 2018
  • Triangulation is one of the fundamental problems in computational geometry and computer graphics community, and it has huge application areas such as 3D printing, computer-aided engineering, surface reconstruction, surface visualization, and so on. The Delaunay refinement algorithm is a well-known method to generate quality triangular meshes when point cloud and/or constrained edges are given in two- or three-dimensional space. In this paper, we propose a simple but efficient algorithm to triangulate Voronoi surfaces of Voronoi diagram of spheres in 3-dimensional Euclidean space. The proposed algorithm is based on the Ruppert's Delaunay refinement algorithm, and we modified the algorithm to be applied to the triangulation of Voronoi surfaces in two ways. First, a new method to deciding the location of a newly added vertex on the surface in 3-dimensional space is proposed. Second, a new efficient but effective way of estimating approximation error between Voronoi surface and triangulation. Because the proposed algorithm generates a triangular mesh for Voronoi surfaces with guaranteed quality, users can control the level of quality of the resulting triangulation that their application problems require. We have implemented and tested the proposed algorithm for random non-intersecting spheres, and the experimental result shows the proposed algorithm produces quality triangulations on Voronoi surfaces satisfying the quality criterion.

Active Noise Control of 3D Enclosure System using FXLMS Algorithm (FXLMS 알고리즘을 이용한 3 차원 인클로저 시스템의 능동소음제어)

  • Oh, Jae-Eung;Yang, In-Hyung;Yoon, Ji-Hyun;Jung, Jae-Eun;Lee, Jong-Won
    • Proceedings of the Korean Society for Noise and Vibration Engineering Conference
    • /
    • 2009.10a
    • /
    • pp.240-241
    • /
    • 2009
  • The method of the reduction of the duct noise can be classified by the method of passive control and the method of active control. However, the passive control method has a demerit to reduce the effect of noise reduction at low frequency (below 500Hz) range and to be limited by a space. Whereas, the active control method can overcome the demerit of passive control method. The algorithm of active control is mostly used the Least-Mean-Square (LMS) algorithm because the LMS algorithm can easily obtain the complex transfer function in real-time. Especially, When the Filtered-X LMS (FXLMS) algorithm is applied to an ANC system.

  • PDF

Vibration-based damage detection in beams using genetic algorithm

  • Kim, Jeong-Tae;Park, Jae-Hyung;Yoon, Han-Sam;Yi, Jin-Hak
    • Smart Structures and Systems
    • /
    • v.3 no.3
    • /
    • pp.263-280
    • /
    • 2007
  • In this paper, an improved GA-based damage detection algorithm using a set of combined modal features is proposed. Firstly, a new GA-based damage detection algorithm is formulated for beam-type structures. A schematic of the GA-based damage detection algorithm is designed and objective functions using several modal features are selected for the algorithm. Secondly, experimental modal tests are performed on free-free beams. Modal features such as natural frequency, mode shape, and modal strain energy are experimentally measured before and after damage in the test beams. Finally, damage detection exercises are performed on the test beam to evaluate the feasibility of the proposed method. Experimental results show that the damage detection is the most accurate when frequency changes combined with modal strain-energy changes are used as the modal features for the proposed method.

A New Control Algorithm for 3-Phase 4-Wire Series Active Power Filter System (3상 4선식 직렬형 능동전력필터의 새로운 제어법)

  • 김영조;고수현;김영석
    • The Transactions of the Korean Institute of Electrical Engineers B
    • /
    • v.51 no.12
    • /
    • pp.714-722
    • /
    • 2002
  • This paper presents a control algorithm for a 3-phase 4-wire series active Power filter. This control algorithm compensates harmonics, input power factor and neutral line currents which are generated by balanced or unbalanced nonlinear loads. The advantage of this control algorithm is direct extraction of compensation voltage references. Therefore, the calculation time is shortened and the performance of the series active power filter is improved. The compensation principle of the proposed control algorithm is presented in detail. A 3KVA laboratory prototype of the three-phase four-wire series active power filter was built and experiments have been carried out. Experimental results are shown to verify the effectiveness of the proposed control algorithm.

Motion Artifact Reduction Algorithm for Interleaved MRI using Fully Data Adaptive Moving Least Squares Approximation Algorithm (완전 데이터 적응형 MLS 근사 알고리즘을 이용한 Interleaved MRI의 움직임 보정 알고리즘)

  • Nam, Haewon
    • Journal of Biomedical Engineering Research
    • /
    • v.41 no.1
    • /
    • pp.28-34
    • /
    • 2020
  • In this paper, we introduce motion artifact reduction algorithm for interleaved MRI using an advanced 3D approximation algorithm. The motion artifact framework of this paper is data corrected by post-processing with a new 3-D approximation algorithm which uses data structure for each voxel. In this study, we simulate and evaluate our algorithm using Shepp-Logan phantom and T1-MRI template for both scattered dataset and uniform dataset. We generated motion artifact using random generated motion parameters for the interleaved MRI. In simulation, we use image coregistration by SPM12 (https://www.fil.ion.ucl.ac.uk/spm/) to estimate the motion parameters. The motion artifact correction is done with using full dataset with estimated motion parameters, as well as use only one half of the full data which is the case when the half volume is corrupted by severe movement. We evaluate using numerical metrics and visualize error images.

Fast and Scalable Path Re-routing Algorithm Using A Genetic Algorithm (유전자 알고리즘을 이용한 확장성 있고 빠른 경로 재탐색 알고리즘)

  • Lee, Jung-Kyu;Kim, Seon-Ho;Yang, Ji-Hoon
    • The KIPS Transactions:PartB
    • /
    • v.18B no.3
    • /
    • pp.157-164
    • /
    • 2011
  • This paper presents a fast and scalable re-routing algorithm that adapts to dynamically changing networks. The proposed algorithm integrates Dijkstra's shortest path algorithm with the genetic algorithm. Dijkstra's algorithm is used to define the predecessor array that facilitates the initialization process of the genetic algorithm. After that, the genetic algorithm re-searches the optimal path through appropriate genetic operators under dynamic traffic situations. Experimental results demonstrate that the proposed algorithm produces routes with less traveling time and computational overhead than pure genetic algorithm-based approaches as well as the standard Dijkstra's algorithm for large-scale networks.

Decoupled Location Parameter Estimation of 3-D Near-Field Sources in a Uniform Circular Array using the Rank Reduction Algorithm

  • Jung, Tae-Jin;Kwon, Bum-Soo;Lee, Kyun-Kyung
    • The Journal of the Acoustical Society of Korea
    • /
    • v.30 no.3
    • /
    • pp.129-135
    • /
    • 2011
  • An algorithm is presented for estimating the 3-D location (i.e., azimuth angle, elevation angle, and range) of multiple sources with a uniform circular array (UCA) consisting of an even number of sensors. Recently the rank reduction (RARE) algorithm for partly-calibrated sensor arrays was developed. This algorithm is applicable to sensor arrays consisting of several identically oriented and calibrated linear subarrays. Assuming that a UCA consists of M sensors, it can be divided into M/2 identical linear subarrays composed of two facing sensors. Based on the structure of the subarrays, the steering vectors are decomposed into two parts: range-independent 2-D direction-of-arrival (DOA) parameters, and range-relevant 3-D location parameters. Using this property we can estimate range-independent 2-D DOAs by using the RARE algorithm. Once the 2-D DOAs are available, range estimation can be obtained for each source by defining the 1-D MUSIC spectrum. Despite its low computational complexity, the proposed algorithm can provide an estimation performance almost comparable to that of the 3-D MUSIC benchmark estimator.

A Series Active Power Filter For Harmonic Currents And Reactive Power Compensation (고조파 전류와 무효전력보상을 위한 직렬형 능동전력필터)

  • 김진선;고수현;김영석
    • The Transactions of the Korean Institute of Electrical Engineers B
    • /
    • v.52 no.5
    • /
    • pp.221-229
    • /
    • 2003
  • This paper suggests a control algorithm of 3-phase 3-wire series active power filter. This suggested algorithm can compensate source harmonics and reactive power in 3-phase 3-wire power distribution systems. These harmonics are generated by nonlinear loads such as diode rectifiers and thyristor converters. This control algorithm extracts a compensation voltage reference from performance function without phase transformation. Therefore, this control algorithm is simpler than any other conventional control algorithms. 3-phase 3-wire series active power filters which have a harmonic voltage source and a harmonic current source are manufactured and experiments are carried out to verify the effectiveness of suggested control algorithm.