• 제목/요약/키워드: Complex algorithm

검색결과 2,600건 처리시간 0.03초

혼합-교환도 작성을 위한 새 알고리즘 (A New Algorithm for Drawing the Shuffle-Exchange Graph)

  • 이성우;황호정
    • 대한전자공학회논문지
    • /
    • 제23권2호
    • /
    • pp.217-224
    • /
    • 1986
  • In case of VLSI design, the shuffle-exchange graph is useful for optimal layout. HOEY and LEISERSON proposed the method of drawing a N-nodes shuffle-exchange graph on O(N2/log N) layout area by using the complex plane digram. [2] In this paper, a new algorithm for drawing the shuffle-exchange graph is proposed. This algorithm is not by using the complex plane diabram, but the table of e decimal represented nodes of shuffle-edge relations. And the structural properties for optimal layout of the graph are summarized and verified. By using this more simplified algorithm, a FORTRAN program which can be treated faster is written. Aimed near optimal shuffle-exchange graphs are printed out by giving inputs` the number of nodes.

  • PDF

얼굴 특징점 기반의 졸음운전 감지 알고리즘 (Driver Drowsiness Detection Algorithm based on Facial Features)

  • 오미연;정유수;박길흠
    • 한국멀티미디어학회논문지
    • /
    • 제19권11호
    • /
    • pp.1852-1861
    • /
    • 2016
  • Drowsy driving is a significant factor in traffic accidents, so driver drowsiness detection system based on computer vision for convenience and safety has been actively studied. However, it is difficult to accurately detect the driver drowsiness in complex background and environmental change. In this paper, it proposed the driver drowsiness detection algorithm to determine whether the driver is drowsy through the measurement standard of a yawn, eyes drowsy status, and nod based on facial features. The proposed algorithm detect the driver drowsiness in the complex background, and it is robust to changes in the environment. The algorithm can be applied in real time because of the processing speed faster. Throughout the experiment, we confirmed that the algorithm reliably detected driver drowsiness. The processing speed of the proposed algorithm is about 0.084ms. Also, the proposed algorithm can achieve an average detection rate of 98.48% and 97.37% for a yawn, drowsy eyes, and nod in the daytime and nighttime.

HDR-WPAN 시스템을 위한 선형 적응 등화기 성능분석 (Performance Analysis of Liner Adaptive Equalizer for HDR-WPAN System)

  • 박지우;윤한경;정구철;김재영;오창헌
    • 디지털콘텐츠학회 논문지
    • /
    • 제5권4호
    • /
    • pp.295-299
    • /
    • 2004
  • 본 논문에서는 IEEE802.15.3(HDR-WPAN) 시스템에서 LMS 알고리즘과 RLS 알고리즘의 성능을 비교 분석하였다. LMS 알고리즘은 구현하기가 쉽고 계산량이 적은 장점이 있는 반면, 수렴 속도가 느리며, RLS 알고리즘은 계산량이 많으나, 수렴속도가 빠른 장점을 가지고 있다. HDR-WPAM 시스템을 기반으로 같은 환경 하에서 LMS 알고리즘을 사용했을 경우 250 샘플 이후에 채널에 적응된 등화가 이루어졌고 RLS 알고리즘을 사용했을 경우 50 샘플 이후에 등화가 이루어 졌다. 이를 통해, HDR-WPAN 시스템에서 보다 안정적이며, 빠른 등화 처리를 위해서는 LMS 알고리즘보다 RLS 알고리즘을 통한 적응 등화 구현이 효과적임을 시뮬레이션을 통해 확인하였다.

  • PDF

우리나라 의용생체공학의 현황과 전망

  • 이충웅
    • 대한의용생체공학회:의공학회지
    • /
    • 제10권2호
    • /
    • pp.83-88
    • /
    • 1989
  • This paper is a study on the design of adptive filter for QRS complex detection. We propose a simple adaptive algorithm to increase capability of noise cancelation in QRS complex detection with two stage adaptive filter. At the first stage, background noise is removed and at the next stage, only spectrum of QRS complex components is passed. Two adaptive filters can afford to keep track of the changes of both noise and QRS complex. Each adaptive filter consists of prediction error filter and FIR filter The impulse response of FIR filter uses coefficients of prediction error filter. The detection rates for 105 and 108 of MIT/BIH data base were 99.3% and 97.4% respectively.

  • PDF

A RECURSIVE ALGORITHM TO INVERT MULTIBLOCK CIRCULANT MATRICES

  • Baker, J.;Hiergeist, F.;Trapp, G.
    • Kyungpook Mathematical Journal
    • /
    • 제28권1호
    • /
    • pp.45-50
    • /
    • 1988
  • Circulant and multiblock circulant matrices have many important applications, and therefore their inverses are of considerable interest. A simple recursive algorithm is presented to compute the inverse of a multiblock circulant matrix. The algorithm only uses complex variables, roots of unity and normal matrix/vector operations.

  • PDF

프레임 차량의 주행진동 저감을 위한 프레임 부시 복소 동강성 결정에 관한 연구 (A Study on Determination of Complex Stiffness of Frame Bush for Ride-Vibration Improvement of Body-on-Frame Vehicle)

  • 정면규;김기선;김광준;황인진
    • 한국소음진동공학회:학술대회논문집
    • /
    • 한국소음진동공학회 2005년도 추계 학술대회논문집(수송기계편)
    • /
    • pp.194-199
    • /
    • 2005
  • Body-on-frame type vehicle has a set of frame bushes which are installed between body and frame fur vibration Isolation. Such frame bushes are important vibration transmission paths to passenger space. In order to reduce the vibration level of passenger space, therefore, the change of complex stiffness of the frame bushes is more efficient than modification of other parts of the vehicle such as body, frame and suspension. The purpose of this study is to reduce the vibration level for ride comfort by optimization of complex stiffness of frame bushes. In order to do this end, simple finite element vehicle model was constructed and the complex stiffness of frame bushes was set to be design variable. Objective function was defined to reflect passenger ride comfort and genetic algorithm and sub-structure synthesis were applied for minimization of the objective function.

  • PDF

프레임 차량의 주행 진동 저감을 위한 프레임 부시 복소동강성계수 크기 결정에 관한 연구 (A Study on Determination of Complex Stiffness of Frame Bush for Ride-comfort Improvement of Body-on-frame Vehicle)

  • 정면규;김기선;김광준
    • 한국소음진동공학회논문집
    • /
    • 제16권6호
    • /
    • pp.619-626
    • /
    • 2006
  • Body-on-frame type vehicle has a set of frame bushes between body and frame for vibration isolation. Such frame bushes are important vibration transmission paths to passenger space for excitations during driving. In order to reduce the vibration level of passenger space, therefore, change of complex stiffness of the frame bushes is more efficient than modification of other parts of the vehicle such as body, frame and suspension. The purpose of this study is to reduce the vibration level for ride comfort by optimization of complex stiffness of frame bushes. In order to do this, a simple finite element vehicle model was constructed and complex stiffness of the frame bushes was set to be design variables. The objective function was defined to reflect frequency dependence of passenger ride comfort. Genetic algorithm and sub-structure synthesis were applied for minimization of the objective function. After optimization level at a position of interest on the car body was reduced by about 43.7 % in RMS value. Causes for optimization results are discussed.

복소연산이 없는 Polynomial 변환을 이용한 2차원 고속 DCT (Two dimensional Fast DCT using Polynomial Transform without Complex Computations)

  • Park, Hwan-Serk;Kim, Won-Ha
    • 전자공학회논문지CI
    • /
    • 제40권6호
    • /
    • pp.127-140
    • /
    • 2003
  • 본 논문은 2차원 Discrete Cosine Transform (2D-DCT)의 계산을 새로운 Polynomial 변환을 통하여 1차원 DCT의 합으로 변환하여 계산하는 알고리즘을 개발한다. 기존의 2차원 계산방법인 row-column 으로는 N×M 크기의 2D-DCT에서 3/2NMlog₂(NM)-2NM+N+M의 합과 1/2NMlog₂(NM)의 곱셈이 필요한데 비하여 본 논문에서 제시한 알고리즘은 3/2NMlog₂M+NMlog₂N-M-N/2+2의 합과 1/2NMlog₂M의 곱셈 수를 필요로 한다. 또한 기존의 polynomial 변환에 의한 2D DCT는 Euler 공식을 적용하였기 때문에 복소 연산이 필요하지만 본 논문에서 제시한 polynomial 변환은 DCT의 modular 규칙을 이용하여 2D DCT를 ID DCT의 합으로 직접 변환하므로 복소 연산이 필요하지 않다.

복합적 자료-알고리즘 자료처리 방식을 적용한 자료처리 시스템 설계 방안 연구 (Study on Data Control System Design Method with Complex Data-Algorithm Data Processing)

  • 김민욱;박연구;이종혁;이정덕
    • 한국위성정보통신학회논문지
    • /
    • 제10권3호
    • /
    • pp.11-15
    • /
    • 2015
  • 본 연구에서는 수재해 정보 플랫폼 내 자료처리 시스템 설계를 위해 자료처리 과정의 복잡도를 분석하고 이에 따른 설계 방안을 제시하였다. 일반적으로 자료를 수집하고 분석하는 시스템은 자료와 알고리즘의 자료처리 과정이 고정된 고정 자료-알고리즘 자료처리 방식을 사용한다. 하지만 시스템의 복잡도가 증가하면 자료처리 시스템에서 관리해야 하는 자료처리 과정의 수가 급증하는 문제가 발생한다. 이를 해결하기 위해 자료와 알고리즘 사이에 인터페이스가 존재하는 동적 자료-알고리즘 자료처리 방식을 적용할 수 있다. 각 방식의 장단점을 분석한 뒤, 수재해 정보 플랫폼에 최적화된 자료처리 시스템의 설계안을 제시할 수 있었다.

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

  • 송동운;이재봉;이승준
    • 로봇학회논문지
    • /
    • 제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.