• 전기학회논문지
• /
• 제61권8호
• /
• pp.1199-1203
• /
• 2012

H.264 adopted many compression tools to increase image data compression efficiency such as B frame bi-directional predictions, the direct mode coding and so on. Despite its high compression efficiency, H.264 can suffer from its long coding time due to the complicated tools of H.264. To realize a high performance H.264, several fast algorithms were proposed. One of them is adaptive fast direct mode decision algorithm using mode and Lagrangian cost prediction for B frame in H.264/AVC (MLP) algorithm which can determine the direct coding mode for macroblocks without a complex mode decision process. However, in this algorithm, macroblocks not satisfying the conditions of the MLP algorithm are required to process the complex mode decision calculation, yet suffering a long coding time. To overcome the problem, this paper proposes a fast direct mode prediction algorithm. Simulation results show that the proposed algorithm can determine the direct mode coding without a complex mode decision process for 42% more macroblocks and, this algorithm can reduce coding time by up to 23%, compared with Jin's algorithm. This enables to encode B frames fast with a less quality degradation.

• 대한기계학회논문집A
• /
• 제20권11호
• /
• pp.3398-3407
• /
• 1996

In this paper, we derive an algorithm and develope a computer program which analyze rapidly and precisely the inverse kinematics of robotic mechanism with spatial complex chain structure based on the relative coordinates. We represent the inverse kinematic problem as an optimization problem with the kinematic constraint equations. The inverse kinematic analysis algorithm, therefore, consists of two algorithms, the main, an optimization algorithm finding the motion of independent joints from that of an end-effector and the sub, a forward kinematic analysis algorithm computing the motion of dependent joints. We accomplish simulations for the investigation upon the accuracy and efficiency of the algorithm.

• 대한의용생체공학회:학술대회논문집
• /
• 대한의용생체공학회 1995년도 춘계학술대회
• /
• pp.277-280
• /
• 1995

This paper describes a real time QRS detection algorithm. The proposed algorithm detects QRS complex using characteristics of the 2-dimensional phase portrait which is reconstructed from 1-demensional scalar time series. We observe the phase portrait of ECG signal has special trejectory when QRS complex occurs and apply it to detect QRS complexes. In order to evaluate the performance of the proposed algorithm, we use MIT/BIH arrhythmia database. As a result, the proposed algorithm correctly detects 99.3% of the QRS complexes.

• 한국정보전자통신기술학회논문지
• /
• 제7권3호
• /
• pp.126-131
• /
• 2014

본 논문에서는 웨이블릿 변환을 통하며 QRS complex를 검출 하며, 32비트 고정 소수점 연산이 가능한 프로세서에도 동작하도록 알고리즘 최적화 기법을 제시한다. 먼저 입력 ECG 신호를 밴드 패스 필터를 통과 시키고, 3개의 서로 다른 웨이블릿 함수를 하나로 병합한 웨이블릿 함수를 이용하여 웨이블릿 변환을 하며, 다음으로 시간 평균 함수를 뒤에 마지막으로 QRS complex를 검출 한다. 제안 알고리즘은 MIT-BIH arrhythmia database에 적용하여 검증한다. 모든 과정은 32비트 고정 소수점 연산으로 구현되며, 삼각함수 같은 복잡한 연산은 테이블화 하였다. 검출 알고리즘은 컴퓨터 시뮬레이션을 통해 평가 한다.

• 한국통신학회논문지
• /
• 제36권1A호
• /
• pp.35-40
• /
• 2011

랜덤 발생 심볼과 출력 신호에 대해 두 확률 밀도 함수 사이의 유클리드 거리를 최소화하는 복소 채널 등화 알고리듬은 정보 이론적 학습방법의 장점을 살리면서 위상 회전 문제까지 극복할 수 있도록 설계 되었다. 이 논문에서는 이 알고리듬에 대해 확률 밀도 함수 구축에 사용된 커널 사이즈가 성능에 끼치는 영향을 연구하였고 커널 사이즈의 변형에 인한 정보 포텐셜 간의 힘 조절에 변화를 준 Kernel-modified 알고리듬을 제안하였다. 이 제안한 방식은 커널 사이즈 변형이 이루어지지 않은 알고리듬에 대해 약 4 dB 정도의 성능 향상을 만들어 냈다. 성상도 특성에서도 복소 채널에 의한 위상 회전이 완벽하게 극복될 뿐 아니라 보다 집중된 심볼 점을 보였다.

• 한국음향학회지
• /
• 제26권7호
• /
• pp.323-327
• /
• 2007

본 논문에서는 객관적으로 정량화된 복합 신호음의 조화도를 새로운 심리 음향 파라미터로 제안하였다. 사람이 복합신호음을 인지하는 과정에서 발생하는 masking 효과, 등청감 곡선, criticalband 등의 심리음향학적인 모델들을 적용시킨 후, 그 소리가 어느정도의 조화도를 갖는지를 정량화시키는 모델을 제안하였고, 이를 검증하기 위하여 복합음으로 구성된 자동차 Horn 신호로 실험을 수행하였다. 실험 결과, 제안한 알고리즘에 의하여 정량화된 객관적인 조화도와 청취 평가를 통한 주관적인 조화도가 0.95의 cross correlation을 보였다. 현재 객관적인 심리음향학적인 파라미터로는 Zwicker 파라미터 외에는 거의 전무한 상태여서 제안하는 알고리즘을 통하여 소리의 심리음향학적인 효과를 보다 객관적으로 파악하는 데에 도움이 될 것으로 보인다.

• Journal of Information Processing Systems
• /
• 제14권5호
• /
• pp.1237-1253
• /
• 2018

Harmony search algorithm is an emerging meta-heuristic optimization algorithm, which is inspired by the music improvisation process and can solve different optimization problems. In order to further improve the performance of the algorithm, this paper proposes an improved harmony search algorithm. Key parameters including harmonic memory consideration (HMCR), pitch adjustment rate (PAR), and bandwidth (BW) are optimized as the number of iterations increases. Meanwhile, referring to the genetic algorithm, an improved method to generate a new crossover solutions rather than the traditional mechanism of improvisation. Four complex function optimization and pressure vessel optimization problems were simulated using the optimization algorithm of standard harmony search algorithm, improved harmony search algorithm and exploratory harmony search algorithm. The simulation results show that the algorithm improves the ability to find global search and evolutionary speed. Optimization effect simulation results are satisfactory.

• Journal of Electrical Engineering and Technology
• /
• 제6권2호
• /
• pp.154-160
• /
• 2011

A new algorithm for estimating the fundamental frequency of power system signals is presented. The proposed algorithm consists of two stages: orthogonal decomposition and a complex Prony analysis. First, the input signal is decomposed into two orthogonal components using cosine and sine filters, and a variable window is adapted to enhance the performance of eliminating harmonics. Then a complex Prony analysis that is proposed in this paper is used to estimate the fundamental frequency by approximating the cosine-filtered and sine-filtered signals simultaneously. To evaluate the performance of the algorithm, amplitude modulation and harmonic tests were performed using simulated test signals. The performance of the algorithm was also assessed for dynamic conditions on a single-machine power system. The Electromagnetic Transients Program was used to generate voltage signals for a load increase and single phase-to-ground faults. The performance evaluation showed that the proposed algorithm accurately estimated the fundamental frequency of power system signals in the presence of amplitude modulation and harmonics.

• International Journal of Knowledge Content Development & Technology
• /
• 제9권3호
• /
• pp.23-41
• /
• 2019

This study combines the concept of degree centrality in complex network with the Term Frequency $^*$ Proportional Document Frequency ($TF^*PDF$) algorithm; the combined method, called PMCN (PDF-Modified similarity and Complex Network), constructs relationship networks among sentences for writing news summaries. The PMCN method is a multi-document summarization extension of the ideas of Bun and Ishizuka (2002), who first published the $TF^*PDF$ algorithm for detecting hot topics. In their $TF^*PDF$ algorithm, Bun and Ishizuka defined the publisher of a news item as its channel. If the PDF weight of a term is higher than the weights of other terms, then the term is hotter than the other terms. However, this study attempts to develop summaries for news items. Because the $TF^*PDF$ algorithm summarizes daily news, PMCN replaces the concept of "channel" with "the date of the news event", and uses the resulting chronicle ordering for a multi-document summarization algorithm, of which the F-measure scores were 0.042 and 0.051 higher than LexRank for the famous d30001t and d30003t tasks, respectively.

• 한국통신학회논문지
• /
• 제21권9호
• /
• pp.2456-2469
• /
• 1996

A digital satellite communication channel has a nonlinearity with memory due to saturation characeristis of the high poer amplifier in the satellite and transmitter/receiver linear filter used in the overall system. In this paper, we propose a complex radial basis function network(CRBFN) based adaptive equalizer for compensation of nonlinearities in digital satellite communication channels. The proposed CRBFN untilizes a complex-valued hybrid learning algorithm of k-means clustering and LMS(least mean sequare) algorithm that is an extension of Moody Darken's algorithm for real-valued data. We evaluate performance of CRBFN in terms of symbol error rates and mean squared errors nder various noise conditions for 4-PSK(phase shift keying) digital modulation schemes and compare with those of comples pth order inverse adaptive Volterra filter. The computer simulation results show that the proposed CRBFN ehibits good equalization, low computational complexity and fast learning capabilities.