• Title/Summary/Keyword: 평균자승신호

Search Result 77, Processing Time 0.027 seconds

Iterative Reduction of Blocking Artifact in Block Transform-Coded Images Using Wavelet Transform (웨이브렛 변환을 이용한 블록기반 변환 부호화 영상에서의 반복적 블록화 현상 제거)

  • 장익훈;김남철
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.24 no.12B
    • /
    • pp.2369-2381
    • /
    • 1999
  • In this paper, we propose an iterative algorithm for reducing the blocking artifact in block transform-coded images by using a wavelet transform. In the proposed method, an image is considered as a set of one-dimensional horizontal and vertical signals and one-dimensional wavelet transform is utilized in which the mother wavelet is the first order derivative of a Gaussian like function. The blocking artifact is reduced by removing the blocking component, that causes the variance at the block boundary position in the first scale wavelet domain to be abnormally higher than those at the other positions, using a minimum mean square error (MMSE) filter in the wavelet domain. This filter minimizes the MSE between the ideal blocking component-free signal and the restored signal in the neighborhood of block boundaries in the wavelet domain. It also uses local variance in the wavelet domain for pixel adaptive processing. The filtering and the projection onto a convex set of quantization constraint are iteratively performed in alternating fashion. Experimental results show that the proposed method yields not only a PSNR improvement of about 0.56-1.07 dB, but also subjective quality nearly free of the blocking artifact and edge blur.

  • PDF

Design of a neural network based adaptive noise canceler for broadband noise rejection (광대역 잡음제거를 위한 신경망 적응잡음제거기 설계)

  • 곽우혁;최한고
    • Journal of the Institute of Convergence Signal Processing
    • /
    • v.3 no.2
    • /
    • pp.30-36
    • /
    • 2002
  • This paper describes a nonlinear adaptive noise canceler(ANC) using neural networks(NN) based on filter to make up for the drawback of the conventional ANC with the linear adaptive filter. The proposed ANC was tested its noise rejection performance using broadband time-varying noise signal and compared with the ANC of TDL linear filter. Experimental results show that in cases of nonlinear correlations between the noise of primary input and reference input, the neural network based ANC outperforms the linear ANC with respect to mean square error It is also verified that the recurrent NN adaptive filter is superior to the feedforward NN filter. Thus, we identify that the NN adaptive filter is more effective than the linear adaptive filter for rejection of broadband time-varying noise in the ANC.

  • PDF

Distance Estimation Using Convolutional Neural Network in UWB Systems (UWB 시스템에서 합성곱 신경망을 이용한 거리 추정)

  • Nam, Gyeong-Mo;Jung, Tae-Yun;Jung, Sunghun;Jeong, Eui-Rim
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.23 no.10
    • /
    • pp.1290-1297
    • /
    • 2019
  • The paper proposes a distance estimation technique for ultra-wideband (UWB) systems using convolutional neural network (CNN). To estimate the distance from the transmitter and the receiver in the proposed method, 1 dimensional vector consisted of the magnitudes of the received samples is reshaped into a 2 dimensional matrix, and by using this matrix, the distance is estimated through the CNN regressor. The received signal for CNN training is generated by the UWB channel model in the IEEE 802.15.4a, and the CNN model is trained. Next, the received signal for CNN test is generated by filed experiments in indoor environments, and the distance estimation performance is verified. The proposed technique is also compared with the existing threshold based method. According to the results, the proposed CNN based technique is superior to the conventional method and specifically, the proposed method shows 0.6 m root mean square error (RMSE) at distance 10 m while the conventional technique shows much worse 1.6 m RMSE.

Optimal Variable Step Size for Simplified SAP Algorithm with Critical Polyphase Decomposition (임계 다위상 분해기법이 적용된 SAP 알고리즘을 위한 최적 가변 스텝사이즈)

  • Heo, Gyeongyong;Choi, Hun
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.25 no.11
    • /
    • pp.1545-1550
    • /
    • 2021
  • We propose an optimal variable step size adjustment method for the simplified subband affine projection algorithm (Simplified SAP; SSAP) in a subband structure based on a polyphase decomposition technique. The proposed method provides an optimal step size derived to minimize the mean square deviation(MSD) at the time of updating the coefficients of the subband adaptive filter. Application of the proposed optimal step size in the SSAP algorithm using colored input signals ensures fast convergence speed and small steady-state error. The results of computer simulations performed using AR(2) signals and real voices as input signals prove the validity of the proposed optimal step size for the SSAP algorithm. Also, the simulation results show that the proposed algorithm has a faster convergence rate and good steady-state error compared to the existing other adaptive algorithms.

Identification of Nonstationary Time Varying EMG Signal in the DCT Domain and a Real Time Implementation Using Parallel Processing Computer (DCT 평면에서의 비정상 시변 근전도 신호의 인식과 병렬처리컴퓨터를 이용한 실시간 구현)

  • Lee, Young-Seock;Lee, Jin;Kim, Sung-Hwan
    • Journal of Biomedical Engineering Research
    • /
    • v.16 no.4
    • /
    • pp.507-516
    • /
    • 1995
  • The nonstationary identifier in the DCT domain is suggested in this study for the identification of AR parameters of above-lesion upper-trunk electromyographic (EMG) signals as a means of developing a reliable real time signal to control functional electrical stimulation (FES) in paraplegics to enable primitive walking. As paraplegic shifts his posture from one attitude to another, there is transition period where the signal is clearly nonstationary. Also as muscle fatigues, nonstationarities become more prevalent even during stable postures. So, it requires a develpment of time varying nonstationary EMG signal identifier. In this paper, time varying nonstationary EMG signals are transformed into DCT domain and the transformed EMG signals are modeled and analyzed in the transform domain. In the DCT domain, we verified reduction of condition number and increment of the smallest eigenvalue of input correlation matrix that influences numerical properties and mean square error were compared with SLS algorithm, and the proposed algorithm is implemented using IMS T-805 parallel processing computer for real time application.

  • PDF

Blind adaptive equalization using the multi-stage decision-directed algorithm in QAM data communications (QAM 시스템에서 다단계 결정-지향 알고리듬을 이용한 블라인드 적응 등화)

  • 이영조;조형래;강창언
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.22 no.11
    • /
    • pp.2451-2458
    • /
    • 1997
  • Adaptive channel equalization complished without resorting to a training sequence is known as blind equalization. In this paper, in order to increase the speed of the convergence and to reduce the steady-state mean squared error simulatneously, we propose the multi-stage DD(decision-direct) algorithm derived from the combination of the Sato algorithm and the decision-directed algorithm. In the starting stage, the multi-stage DD algorithm is identical to the Sato algorithm which guarantees the convergence of the equalizer. As the blind equalizer converges, the number of the level of the quantizers is increased gradally, so that the proposed algorithm operates identical to the decision-directed algorithm which leads to the low error power after the convergence. Therefore, the multi-stage DD algorithm obtains fast convergence rate and low steady state mean squared error.

  • PDF

Adaptive Spatial Domain FB-Predictors for Bearing Estimation (입사각 추정을 위한 적응 공간영역 FB-예측기)

  • Lee, Won-Cheol;Park, Sang-Taick;Cha, Il-Whan;Youn, Dae-Hee
    • Journal of the Korean Institute of Telematics and Electronics
    • /
    • v.26 no.3
    • /
    • pp.160-166
    • /
    • 1989
  • We propose adaptive algorithms computing the coefficients of spatial domain predictors. The method uses the LMS approach to compute the coefficients of the predictors realized by using the TDL(tapped-delay-line) and the ESC (escalator) structures. The predictors to be presented differ from the conventional ones in the sense that the relevant weights are updated such that the sum of the mean squared values of the forward and the backward prediction errors is minimized. Using the coefficients of such spatial domain predictors yields improved linear predictive spatial spectrums. The algorithms are applied to the problems of estimating incident angles of multiple narrow-band signals received by a linear array of sensors. Simulation results demonstrating the performances of the proposed methods are presented.

  • PDF

Research on the Least Mean Square Algorithm Based on Equivalent Wiener-Hopf Equation (등가의 Wiener-Hopf 방정식을 이용한 LMS 알고리즘에 관한 연구)

  • Ahn, Bong-Man;Hwang, Jee-Won;Cho, Ju-Phil
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.33 no.5C
    • /
    • pp.403-412
    • /
    • 2008
  • This paper presents the methods which obtain the solution of Wiener-Hopf equation by LMS algorithm and get the coefficient of TDL filter in lattice filter directly. For this result, we apply an orthogonal input signal generated by lattice filter into an equivalent Wiener-Hopf equation and shows the scheme that can obtain the solution by using the MMSE algorithm. Conventionally, the method like aforementioned scheme can get an error and regression coefficient recursively. However, in this paper, we can obtain an error and the coefficients of TDL filter recursively. And, we make an theoretical analysis on the convergence characteristics of the proposed algorithm. Then we can see that the result is similar to conventional analysis. Also, by computer simulation, we can make sure that the proposed algorithm has an excellent performance.

Step Size Normalization for Maximum Cross-Correntropy Algorithms (최대 상호코렌트로피 알고리듬을 위한 스텝사이즈 정규화)

  • Kim, Namyong
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.41 no.9
    • /
    • pp.995-1000
    • /
    • 2016
  • The maximum cross-correntropy (MCC) algorithm with a set of random symbols keeps its optimum weights undisturbed from impulsive noise unlike MSE-based algorithms and its main factor has been known to be the input magnitude controller (IMC) that adjusts the input intensity according to error power. In this paper, a normalization of the step size of the MCC algorithm by the power of IMC output is proposed. The IMC output power is tracked recursively through a single-pole low-pass filter. In the simulation under impulsive noise with two different multipath channels, the steady state MSE and convergence speed of the proposed algorithm is found to be enhanced by about 1 dB and 500 samples, respectively, compared to the conventional MCC algorithm.

A New Constant Modulus Algorithm based on Minimum Euclidian Distance Criterion for Blind Channel Equalization (블라인드 등화에서 유클리드 거리 최소화에 근거한 새로운 CMA 알고리듬)

  • Kim, Nam-Yong
    • Journal of Internet Computing and Services
    • /
    • v.10 no.6
    • /
    • pp.19-26
    • /
    • 2009
  • In this paper, a minimum Euclidian distance criterion between error PDF and Dirac delta function is introduced and a constant modulus type blind equalizer algorithm based on the criterion is proposed. The proposed algorithm using constant modulus error in place of actual error term of the criterion has superior convergence and steady state MSE performance, and the error signal of the proposed algorithm exhibits more concentrated density function in blind equalization environments. Simulation results indicate that the proposed method can be a reliable candidate for blind equalizer algorithms for multipoint communications.

  • PDF