• Title/Summary/Keyword: Gaussian weights

Search Result 79, Processing Time 0.021 seconds

Performance Improvement on MFCM for Nonlinear Blind Channel Equalization Using Gaussian Weights (가우시안 가중치를 이용한 비선형 블라인드 채널등화를 위한 MFCM의 성능개선)

  • Han, Soo-Whan;Park, Sung-Dae;Woo, Young-Woon
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2007.10a
    • /
    • pp.407-412
    • /
    • 2007
  • 본 논문에서는 비선형 블라인드 채널등화기의 구현을 위하여 가우시안 가중치(gaussian weights)를 이용한 개선된 퍼지 클러스터(Modified Fuzzy C-Means with Gaussian Weights: MFCM_GW) 알고리즘을 제안한다. 제안된 알고리즘은 기존 FCM 알고리즘의 유클리디언 거리(Euclidean distance) 값 대신 Bayesian Likelihood 목적함수(fitness function)와 가우시안 가중치가 적용된 멤버쉽 매트릭스(partition matrix)를 이용하여, 비선형 채널의 출력으로 수신된 데이터들로부터 최적의 채널 출력 상태 값(optimal channel output states)들을 직접 추정한다. 이렇게 추정된 채널 출력 상태 값들로 비선형 채널의 이상적 채널 상태(desired channel states) 벡터들을 구성하고, 이를 Radial Basis Function(RBF) 등화기의 중심(center)으로 활용함으로써 송신된 데이터 심볼을 찾아낸다. 실험에서는 무작위 이진 신호에 가우시안 잡음이 추가된 데이터를 사용하여 기존의 Simplex Genetic Algorithm(GA), 하이브리드 형태의 GASA(GA merged with simulated annealing (SA)), 그리고 과거에 발표되었던 MFCM 등과 그 성능을 비교 분석하였으며, 가우시안 가중치가 적용된 MFCM_GW를 이용한 채널등화기가 상대적으로 정확도와 속도 면에서 우수함을 보였다.

  • PDF

Blind Nonlinear Channel Equalization by Performance Improvement on MFCM (MFCM의 성능개선을 통한 블라인드 비선형 채널 등화)

  • Park, Sung-Dae;Woo, Young-Woon;Han, Soo-Whan
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.11 no.11
    • /
    • pp.2158-2165
    • /
    • 2007
  • In this paper, a Modified Fuzzy C-Means algorithm with Gaussian Weights(MFCM_GW) is presented for nonlinear blind channel equalization. The proposed algorithm searches the optimal channel output states of a nonlinear channel from the received symbols, based on the Bayesian likelihood fitness function and Gaussian weighted partition matrix instead of a conventional Euclidean distance measure. Next, the desired channel states of a nonlinear channel are constructed with the elements of estimated channel output states, and placed at the center of a Radial Basis Function(RBF) equalizer to reconstruct transmitted symbols. In the simulations, binary signals are generated at random with Gaussian noise. The performance of the proposed method is compared with those of a simplex genetic algorithm(GA), a hybrid genetic algorithm(GA merged with simulated annealing(SA): GASA), and a previously developed version of MFCM. It is shown that a relatively high accuracy and fast search speed has been achieved.

CONSTRUCTIVE APPROXIMATION BY GAUSSIAN NEURAL NETWORKS

  • Hahm, Nahm-Woo;Hong, Bum-Il
    • Honam Mathematical Journal
    • /
    • v.34 no.3
    • /
    • pp.341-349
    • /
    • 2012
  • In this paper, we discuss a constructive approximation by Gaussian neural networks. We show that it is possible to construct Gaussian neural networks with integer weights that approximate arbitrarily well for functions in $C_c(\mathbb{R}^s)$. We demonstrate numerical experiments to support our theoretical results.

Bayesian Nonlinear Blind Channel Equalizer based on Gaussian Weighted MFCM

  • Han, Soo-Whan;Park, Sung-Dae;Lee, Jong-Keuk
    • Journal of Korea Multimedia Society
    • /
    • v.11 no.12
    • /
    • pp.1625-1634
    • /
    • 2008
  • In this study, a modified Fuzzy C-Means algorithm with Gaussian weights (MFCM_GW) is presented for the problem of nonlinear blind channel equalization. The proposed algorithm searches for the optimal channel output states of a nonlinear channel based on received symbols. In contrast to conventional Euclidean distance in Fuzzy C-Means (FCM), the use of the Bayesian likelihood fitness function and the Gaussian weighted partition matrix is exploited in this method. In the search procedure, all possible sets of desired channel states are constructed by considering the combinations of estimated channel output states. The set of desired states characterized by the maxima] value of the Bayesian fitness is selected and updated by using the Gaussian weights. After this procedure, the Bayesian equalizer with the final desired states is implemented to reconstruct transmitted symbols. The performance of the proposed method is compared with those of a simplex genetic algorithm (GA), a hybrid genetic algorithm (GA merged with simulated annealing (SA):GASA), and a previously developed version of MFCM. In particular, a relative]y high accuracy and a fast search speed have been observed.

  • PDF

Switching Filter Algorithm using Fuzzy Weights based on Gaussian Distribution in AWGN Environment (AWGN 환경에서 가우시안 분포 기반의 퍼지 가중치를 사용한 스위칭 필터 알고리즘)

  • Cheon, Bong-Won;Kim, Nam-Ho
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.26 no.2
    • /
    • pp.207-213
    • /
    • 2022
  • Recently, with the improvement of the performance of IoT technology and AI, automation and unmanned work are progressing in a wide range of fields, and interest in image processing, which is the basis of automation such as object recognition and object classification, is increasing. Image noise removal is an important process used as a preprocessing step in an image processing system, and various studies have been conducted. However, in most cases, it is difficult to preserve detailed information due to the smoothing effect in high-frequency components such as edges. In this paper, we propose an algorithm to restore damaged images in AWGN(additive white Gaussian noise) using fuzzy weights based on Gaussian distribution. The proposed algorithm switched the filtering process by comparing the filtering mask and the noise estimate with each other, and reconstructed the image by calculating the fuzzy weights according to the low-frequency and high-frequency components of the image.

Gaussian Selection in HMM Speech Recognizer with PTM Model for Efficient Decoding (PTM 모델을 사용한 HMM 음성인식기에서 효율적인 디코딩을 위한 가우시안 선택기법)

  • 손종목;정성윤;배건성
    • The Journal of the Acoustical Society of Korea
    • /
    • v.23 no.1
    • /
    • pp.75-81
    • /
    • 2004
  • Gaussian selection (GS) is a popular approach in the continuous density hidden Markov model for fast decoding. It enables fast likelihood computation by reducing the number of Gaussian components calculated. In this paper, we propose a new GS method for the phonetic tied-mixture (PTM) hidden Markov models. The PTM model can represent each state of the same topological location with a shared set of Gaussian mixture components and contort dependent weights. Thus the proposed method imposes constraint on the weights as well as the number of Gaussian components to reduce the computational load. Experimental results show that the proposed method reduces the percentage of Gaussian computation to 16.41%, compared with 20-30% for the conventional GS methods, with little degradation in recognition.

Lane Detection Using Gaussian Function Based RANSAC (가우시안 함수기반 RANSAC을 이용한 차선검출 기법)

  • Choi, Yeongyu;Seo, Eunyoung;Suk, Soo-Young;Park, Ju H.;Jung, Ho-Youl
    • IEMEK Journal of Embedded Systems and Applications
    • /
    • v.13 no.4
    • /
    • pp.195-204
    • /
    • 2018
  • Lane keeping assist and departure prevention system are the key functions of ADAS. In this paper, we propose lane detection method which uses Gaussian function based RANSAC. The proposed method consists mainly of IPM (inverse perspective mapping), Canny edge detector, and Gaussian function based RANSAC (Random Sample Consensus). The RANSAC uses Gaussian function to extract the parameters of straight or curved lane. The proposed RANSAC is different from the conventional one, in the following two aspects. One is the selection of sample with different probability depending on the distance between sample and camera. Another is the inlier sample score that assigns higher weights to samples near to camera. Through simulations, we show that the proposed method can achieve good performance in various of environments.

Blind linear/nonlinear equalization for heavy noise-corrupted channels

  • Han, Soo- Whan;Park, Sung-Dae
    • Journal of information and communication convergence engineering
    • /
    • v.7 no.3
    • /
    • pp.383-391
    • /
    • 2009
  • In this paper, blind equalization using a modified Fuzzy C-Means algorithm with Gaussian Weights (MFCM_GW) is attempted to the heavy noise-corrupted channels. The proposed algorithm can deal with both of linear and nonlinear channels, because it searches for the optimal channel output states of a channel instead of estimating the channel parameters in a direct manner. In contrast to the common Euclidean distance in Fuzzy C-Means (FCM), the use of the Bayesian likelihood fitness function and the Gaussian weighted partition matrix is exploited in its search procedure. The selected channel states by MFCM_GW are always close to the optimal set of a channel even the additive white Gaussian noise (AWGN) is heavily corrupted in it. Simulation studies demonstrate that the performance of the proposed method is relatively superior to existing genetic algorithm (GA) and conventional FCM based methods in terms of accuracy and speed.

Gaussian Weighted CFCM for Blind Equalization of Linear/Nonlinear Channel

  • Han, Soo-Whan
    • Journal of the Institute of Convergence Signal Processing
    • /
    • v.14 no.3
    • /
    • pp.169-180
    • /
    • 2013
  • The modification of conditional Fuzzy C-Means (CFCM) with Gaussian weights (CFCM_GW) is accomplished for blind equalization of channels in this paper. The proposed CFCM_GW can deal with both of linear and nonlinear channels, because it searches for the optimal desired states of an unknown channel in a direct manner, which is not dependent on the type of channel structure. In the search procedure of CFCM_GW, the Bayesian likelihood fitness function, the Gaussian weighted partition matrix and the conditional constraint are exploited. Especially, in contrast to the common Euclidean distance in conventional Fuzzy C-Means(FCM), the Gaussian weighted partition matrix and the conditional constraint in the proposed CFCM_GW make it more robust to the heavy noise communication environment. The selected channel states by CFCM_GW are always close to the optimal set of a channel even when the additive white Gaussian noise (AWGN) is heavily corrupted. These given channel states are utilized as the input of the Bayesian equalizer to reconstruct transmitted symbols. The simulation studies demonstrate that the performance of the proposed method is relatively superior to those of the existing conventional FCM based approaches in terms of accuracy and speed.

Highlight based Lyrics Search Considering the Characteristics of Query (사용자 질의어 특징을 반영한 하이라이트 기반 노래 가사 검색)

  • Kim, Kweon Yang
    • Journal of the Korean Institute of Intelligent Systems
    • /
    • v.26 no.4
    • /
    • pp.301-307
    • /
    • 2016
  • This paper proposes a lyric search method to consider the characteristics of the user query. According to the fact that queries for the lyric search are derived from highlight parts of the music, this paper uses the hierarchical agglomerative clustering to find the highlight and proposes a Gaussian weighting to consider the neighbor of the highlight as well as highlight. By setting the mean of a Gaussian weighting at the highlight, this weighting function has higher weights near the highlight and the lower weights far from the highlight. Then, this paper constructs a index of lyrics with the gaussian weighting. According to the experimental results on a data set obtained from 5 real users, the proposed method is proved to be effective.