• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 2002년도 하계종합학술대회 논문집(4)
• /
• pp.295-298
• /
• 2002

This paper presents a fast block-matching algorithm to improve the conventional Three-Step Search (TSS) based method. The proposed Comparison Fast Block Matching Algorithm (CFBMA) begins with DAB for adaptive search range to choose searching method, and searches a part of search window that has high possibility of motion vector like other partial search algorithms. The CFBMA also considers the opposite direction to reduce local minimum, which is ignored in almost conventional based partial search algorithms. CFBMA uses the summation half-stop technique to reduce the computational load. Experimental results show that the proposed algorithm achieves the high computational complexity compression effect and very close or better image quality compared with TSS, SES, NTSS based partial search algorithms.

• 대한안전경영과학회지
• /
• 제14권1호
• /
• pp.87-93
• /
• 2012

The purpose of this study suggests a personalized algorithm of physical activity energy expenditure prediction through comparison and analysis of individual physical activity. The research for a 3-axial accelerometer sensor has increased the role of physical activity in promoting health and preventing chronic disease has long been established. Estimating algorithm of physical activity energy expenditure was implemented by using a tri-axial accelerometer motion detector of the SVM(Signal Vector Magnitude) of 3-axis(x, y, z). A total of 10 participants(5 males and 5 females aged between 20 and 30 years). The activities protocol consisted of three types on treadmill; participants performed three treadmill activity at three speeds(3, 5, 8 km/h). These activities were repeated four weeks.

• 한국공작기계학회:학술대회논문집
• /
• 한국공작기계학회 2004년도 추계학술대회 논문집
• /
• pp.280-285
• /
• 2004

In this study, we made a comparative study of backpropagation neural network and probabilistic neural network and bayesian classifier and perceptron as shape recognition algorithm of welding flaws. For this purpose, variables are applied the same to four algorithms. Here, feature variable is composed of time domain signal itself and frequency domain signal itself. Through this process, we comfirmed advantages/disadvantages of four algorithms and identified application methods of four algorithms.

• 전력전자학회:학술대회논문집
• /
• 전력전자학회 1998년도 전력전자학술대회 논문집
• /
• pp.75-80
• /
• 1998

This paper presents an observer filter algorithm to estimated the load currents in the output voltage control of 3-phase uninterruptible power supply with deadbeat controller. As the result of the proposed algorithm, the sensors to measure the load currents is not required. The comparison of output voltage controls according to the methods of measuring the load currents is also presented in this paper. The results of comparison are shown by the simulation.

• 대한산업공학회지
• /
• 제18권1호
• /
• pp.177-184
• /
• 1992

The control policy algorithm is examined and compared in this study. This research investigates a two state partially observable Markov chain in which only deterioration can occur and for which the only actions possible are to replace or to live alone. The goal of this research is to compare the computational efficiencies of control policy algorithm. One is Sondik's algorithms and the other one is jump algorithm.

• Journal of Electrical Engineering and Technology
• /
• 제10권3호
• /
• pp.944-951
• /
• 2015

Pulse Width Modulation (PWM) techniques are increasingly employed for PWM inverter fed induction motor drive. Among various popular PWM methods used, Selective Harmonic Elimination PWM (SHEPWM) has been widely accepted for its better harmonic elimination capability. In addition, using SHEPWM, it is also possible to maintain better voltage regulation. Hence, in this paper, an attempt has been made to apply Bacterial Foraging Algorithm (BFA) for solving selective harmonic elimination problem. The problem of voltage harmonic elimination together with output voltage regulation is drafted as an optimization task and the solution is sought through proposed method. For performance comparison of BFA, the results obtained are compared with other techniques such as derivative based Newton-Raphson method, and Genetic Algorithm. From the comparison, it can be observed that BFA based approach yields better results. Further, it provides superior convergence, reduced computational burden, and guaranteed global optima. The simulation results are validated through experimental findings.

• 대한의용생체공학회:의공학회지
• /
• 제17권4호
• /
• pp.469-478
• /
• 1996

In the conventional digital ultrasound scanner, the reflected signal is sampled either in polar coordinates of R-$\theta$ method, or in Cartesian coordinates of uniform ladder algorithm (ULA). The R-$\theta$ scan method necessitates a coordinate transform process which makes hardware complex in comparison with ULA scan mrthoA In spite of this complexity, R-$\theta$ method has a good resolution in ultrasonographic (US) image, since scan direction of the US imaging is a radial direction. In this paper, a new digital scan converter is proposed, which is named the radius uniform ladder algorithm (RULA). The RULA has the rome scan direction as the US scanning in the radial direction and as the display space in the $\theta$ direction. In tllis new approach, sampled points we uniformly distributed in each horizontal line i.n well as in each radial ray so that the data are displayed in the Cartesian coordinates by the 1-D interpolation process. The propped algorithm has an uniform resolution in the periphery and the center field in comparison with equi-angle ULA and equi-interval ULA. To extend the scan angle, concentric square raster sampling (CSRS) is adopted with reduction of discontinuities on the junctions between horizontal scan and vertical scan. The discontinuities are reduced by using the hmction filtering along the $\theta$ direction.

• 대한전자공학회논문지SD
• /
• 제44권11호
• /
• pp.82-88
• /
• 2007

본 논문에서는 패턴 비교를 통해 고장 대상 후보를 줄이는 알고리즘을 제안한다. 고장 대상 후보의 개수는 고장 진단을 위한 고장 시뮬레이션 시간을 결정한다. 그렇기 때문에 전체 고장 진단 시간을 줄이기 위해서는 고장 대상 수를 줄이는 것이 필수적이다. 임계 경로 추적은 회로의 최종 출력에서부터 시작해 후방 추적을 통해 고장 대상 후보를 결정한다. 제안하는 알고리즘은 이러한 임계 경로 추적을 하는 동안에 고장이 발견되지 않은 패턴에서와 고장이 발견된 패턴에서의 논리 값을 비교하여 고장 대상 후보를 줄이는 알고리즘이다. 고장 진단을 하는데 있어서 고장 대상 후보를 줄이는 것은 전체 고장 진단 시간에 있어 가장 큰 부분을 차지한다. 때문에 제안하는 알고리즘은 기존의 후방 추적을 이용한 방식보다 고장 진단 시 매우 빠른 성능을 보인다. 또한 조합회로와 순차회로의 모든 경우에 적용이 가능하다. 본 논문에서는 ISCAS#85회로와 ISCAS#89의 회로들을 가지고 실험을 하여 기존의 고장 진단 방식의 경우보다 얼마나 성능이 좋아졌는지 보이도록 하겠다.

• 전자공학회논문지S
• /
• 제34S권12호
• /
• pp.98-105
• /
• 1997

Image transformation ahs been widely used in compuater graphics, computer vision, robot vision, and image processing. Image rotation is one of important part of image transformation. In image rotation, a two-pass algorithm has many advantages over a one-pass algorithm in high speed computation. This paper presents a new two-pass algorithm that overcomes the limitations of previously reported effect of interpolation. A brief comparison of existent techniques and the twp-pass algorithm newly suggeste is presented. This paper also present the hardware structure for the two-pass algorithm suggested.

• 대한전기학회:학술대회논문집
• /
• 대한전기학회 1987년도 전기.전자공학 학술대회 논문집(II)
• /
• pp.1375-1378
• /
• 1987

In this paper, an efficient data compression algorithm for binary image is proposed. This algorithm makes use of the fact that boundaries contain all the information about such images. The compression efficiency is then further increased by efficient coding of Boundary Information Matrix. The comparison of performance with modified Huffman coding was made by a computer simulation with some images. The results of simulation showed that the proposed algorithm was more efficient than modified Huffman code.