• Title/Summary/Keyword: SP Algorithm

Search Result 687, Processing Time 0.019 seconds

Improved Multiplication Free Adaptive Digital Filter with the Fractionally-Spaced Equalizer (분할등화기를 이용한 개선된 비적적응필터)

  • Yoon, Dal-Hwan
    • Journal of the Institute of Electronics Engineers of Korea SP
    • /
    • v.39 no.2
    • /
    • pp.137-146
    • /
    • 2002
  • In order to remove the intersymbol interference(ISI) phenomenon in data transmission channel, the structure and convergence analysis of the improved multiplication free adaptive digital filter(IMADF) is presented. Under conditions of zero-mean, wide-sense stationary and white Gaussian noise, it is shown that this paper analyze the convergence characteristics of the IMADF with a fractionally-spaced equalizer(FSE). In the experimental results, the convergence characteristics of the IMADF algorithm is almost same as the sign algorithm, but is better than the MADF algorithm. Here, this algorithm has useful characteristics when the correlation of the input signal is highly.

Detection of Premature Ventricular Contraction Using Discrete Wavelet Transform and Fuzzy Neural Network (이산 웨이블릿 변환과 퍼지 신경망을 이용한 조기심실수축 추출)

  • Jang, Hyoung-Jong;Lim, Joon-Shik
    • Journal of Korea Multimedia Society
    • /
    • v.12 no.3
    • /
    • pp.451-459
    • /
    • 2009
  • This paper presents an approach to detect premature ventricular contraction(PVC) using discrete wavelet transform and fuzzy neural network. As the input of the algorithm, we use 14 coefficients of d3, d4, and d5, which are transformed by a discrete wavelet transform(DWT). This paper uses a neural network with weighted fuzzy membership functions(NEWFM) to diagnose PVC. The NEWFM discussed in this paper classifies a normal beat and a PVC beat. The size of the window of DWT is $-31/360{\sim}+32/360$ second(64 samples) whose center is the R wave. Using the seven records of the MIT-BIH arrhythmia database used in Shyu's paper, the classification performance of the proposed algorithm is 99.91%, which outperforms the 97.04% of Shyu's analysis. Using the forty records of the M1T-BIH arrhythmia database used in Inan's paper, the classification performance of the proposed algorithm is 98.01%, which outperforms 96.85% of Inan's one. The SE and SP of the proposed algorithm are 84.67% and 99.39%, which outperforms the 82.57% and 98.33%, respectively, of Inan's study.

  • PDF

Edge Compensation Algorithm by Extracting the Skeletons from the Uplifted Image (융기된 영상의 골격선 추출에 의한 에지 보정 알고리듬)

  • Park, Mi-Jin;Yang, Yeong-Il;Park, Jung-Jo
    • Journal of the Institute of Electronics Engineers of Korea SP
    • /
    • v.38 no.6
    • /
    • pp.675-683
    • /
    • 2001
  • In this paper, we propose the edge compensation algorithm which connects the adjacent edges without losing the information of the skeletons on the edge image. The proposed edge compensation algorithm is composed of succeeding two steps. In the first step, the uplifted image is obtained by uplifting the edge image repeatedly. The next step is to extract the edge image from the uplifted image using the skeleton extraction algorithm. Experimental results show that the proposed method connects the adjacent edges without the distortion of the original edge information compared to the traditional method.

  • PDF

Reconstruction and Elimination of Optical Microscopic Background Using Surface Fitting Method

  • Kim Hak-Kyeong;Kim Dong-Kyu;Jeong Nam-Soo;Lee Myung-Suk;Kim Sang-Bong
    • Fisheries and Aquatic Sciences
    • /
    • v.4 no.1
    • /
    • pp.10-17
    • /
    • 2001
  • One serious problem among the troubles to identify objects in an optical microscopic image is contour background due to non-uniform light source and various transparency of samples. To solve this problem, this paper proposed an elimination method of the contour background and compensation technique as follows. First, Otsu's optimal thresholding method extracts pixels representing background. Second, bilinear interpolation finds non-deterministic background pixels among the sampled pixels. Third, the 2D cubic fitting method composes surface function from pivoted background pixels. Fourth, reconstruction procedure makes a contour image from the surface function. Finally, elimination procedure subtracts the approximated background from the original image. To prove the effectiveness of the proposed algorithm, this algorithm is applied to the yeast Zygosaccharomyces rouxii and ammonia-oxidizing bacteria Acinetobacter sp. Labeling by this proposed method can remove some noise and is more exact than labeling by only Otsu's method. Futhermore, we show that it is more effective for the reduction of noise.

  • PDF

A Transcoding Algorithm between EVRC and G.729A (EVRC와 G.729A 간의 상호부호화)

  • Kwon Goo-Rak;Ko Sung-Jea
    • Journal of the Institute of Electronics Engineers of Korea SP
    • /
    • v.43 no.3 s.309
    • /
    • pp.54-60
    • /
    • 2006
  • This paper presents an effective algorithm for transcoding between the Enhanced Variable Rate Codec(EVRC) and G.729A. The simplest way to communicate between heterogeneous speech networks is the cascade connection of two different codecs, called tandem coding. However, tandem coding not only produces high computational loads, but also makes long delay, These problems can be solved by using the transcoding algorithm. The proposed algorithm consists of LSP (Line Spectral Pair) conversion, pitch delay conversion and algorithm for reduction of delay. Experimental results show the proposed algorithm produces lower computational complexity, shorter algorithm delay, and similar speech quality when compared with the tandem algorithm.

Genetic Algorithm-Based Watermarking in Discrete Wavelet Transform Domain (유전자 알고리듬을 사용한 웨이블릿 기반 워터마킹)

  • Lee Dong-Eun;Kim Tae-Kyung;Lee Seong-Won;Paik Joon-Ki
    • Journal of the Institute of Electronics Engineers of Korea SP
    • /
    • v.43 no.4 s.310
    • /
    • pp.108-115
    • /
    • 2006
  • This paper presents a watermarking algorithm in the discrete wavelet transform domain using evolutionary algorithm. The proposed algorithm consists of wavelet-domain watermark insertion and genetic algorithm-based watermark extraction. More specifically watermark is inserted to the low-frequency region of wavelet transform domain, and watermark extraction is efficiently performed by using the evolutionary algorithm. The proposed watermarking algorithm is robust against various attacks such as JPEG and JPEG2000 image compression and geometric transformations.

Design of CPR Artifact Removal Algorithm Based on Orthogonal Function using LMS Adaptive Filter (LMS 적응필터를 이용한 직교 함수 기반의CPR 잡음 제거 알고리즘 설계)

  • Lim, Eunho;Nam, Dong-Hoon;Myoung, Hyoun-seok;Kang, Dong-Won;Jeon, Dae-Keun;Yoon, Young-Ro;Lee, Kyoung-Joung
    • Journal of Biomedical Engineering Research
    • /
    • v.37 no.5
    • /
    • pp.153-160
    • /
    • 2016
  • This study proposes an algorithm for removal of CPR artifact in order that automated external defibrillator (AED) can effectively diagnose ECG rhythm during cardiopulmonary resuscitation (CPR). Current AED required to interrupt chest compression for reliable rhythm analysis to avoid the effect of artifacts produced by CPR. However even temporarily interruption of chest compression during CPR adversely affects the probability of restoration of spontaneous circulation (ROSC) and survival after the delivery of the shock. Therefore, we proposed a method for removal of CPR artifacts using least mean square (LMS) filter. The removal of the CPR artifacts would enable compressions to continue during AED rhythm analysis, thereby increasing the likelihood of resuscitation success. It was tested on 31 segments of shockable and 300 segments of non-shockable ECG signals recorded from three pigs during CPR. In the result, sensitivity (Se) and specificity (Sp) analysis on the test segments showed values of Se = 3.2%, Sp = 66.0% and Se = 96.8%, Sp = 98.7% in the case of unfiltered and filtered signals during CPR. In conclusion, it was shown that the proposed method can be a useful tool to exactly diagnose the ECG rhythm during the CPR.

Square Wave Voltage Injection Starting Method of SP-PMSM Considering Nonlinearity of Full-bridge Inverter (풀 브릿지 인버터의 비선형성을 고려한 단상 영구자석 동기 전동기의 구형파 전압 주입 기동 기법)

  • Yoo, Sang-Min;Hwang, Seon-Hwan;Lee, Ki-Chang
    • Journal of Aerospace System Engineering
    • /
    • v.16 no.3
    • /
    • pp.93-98
    • /
    • 2022
  • The purpose of this paper was to propose a method for improving the performance of the open-loop control of single-phase permanent magnet synchronous motor (SP-PMSM), based on a square wave voltage injection. Generally, the SP-PMSM driving systems cmprise a full-bridge inverter and asymmetric air-gap structure of magnetic circuit, because a zero torque occurs on the symmetrical air-gap. As a result, it cannot be started at a specific rotor position. Thus, it is possible to cause the start-up failure at an open-loop control for sensorless operation of SP-PMSM. In this paper, the method with square wave voltage injection considering the nonlinearity of the inverter is presented to resolve the problem. The effectiveness of the proposed algorithm is verified through several experiments.

Obtaining 1-pixel Width Line Using an Enhanced Parallel Thinning Algorithm (병렬 세선화 알고리즘을 이용한 1-화소 굵기의 선 구하기)

  • Kwon, Jun-Sik
    • Journal of the Institute of Electronics Engineers of Korea SP
    • /
    • v.46 no.1
    • /
    • pp.1-6
    • /
    • 2009
  • A Thinning algorithm is a very Important factor in order to recognize the character, figure, and drawing. Until comparatively lately, the thinning algorithm was proposed by various methods. In this paper, we ascertain the point at issue of ZS(Zhang and Suen), LW(Lu and Wang) and WHF(Wang, Hui and Fleming) algorithms that are the parallel thinning algorithms. The parallel thinning algorithm means the first processing doesn't have to influence to the second processing. ZS algorithm has a problem which loses pixels in slanting lines and LW algorithm doesn't have one pixel width in slanting lines. So I propose an advanced parallel thinning algorithm that connects the pixels each other and preserve the end point.

On the Spatial Registration Considering Image Exposure Compensation (영상의 노출 보정을 고려한 공간 정합 알고리듬 연구)

  • Kim, Dong-Sik;Lee, Ki-Ryung
    • Journal of the Institute of Electronics Engineers of Korea SP
    • /
    • v.44 no.2 s.314
    • /
    • pp.93-101
    • /
    • 2007
  • To jointly optimize the spatial registration and the exposure compensation, an iterative registration algorithm, the Lucas-Kanade algorithm, is combined with an exposure compensation algorithm, which is based on the histogram transformation function. Based on a simple regression model, a nonparametric estimator, the empirical conditional mean, and its polynomial fitting are used as histogram transformation functions for the exposure compensation. Since the proposed algorithm is composed of separable optimization phases, the proposed algorithm is more advantageous than the joint approaches of Mann and Candocia in the aspect of implementation flexibility. The proposed algorithm performs a better registration for real images than the case of registration that does not consider the exposure difference.