• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 1998년도 추계종합학술대회 논문집
• /
• pp.1183-1186
• /
• 1998

Adaptive nois canceller can extract the noiseremoved spech in noisy speech signal by adapting the filter-coefficients to the background noise environment. A kind of LMS algorithm is one of the most popular adaptive algorithm for noise cancellation due to low complexity, good numerical property and the merit of easy implementation. However there is the matter of increasing misadjustment at voiced speech signal. Therefore the demanded speech signal may be extracted. In this paper, we propose a fast and noise robust wavelet packet adaptive noise canceller with NLMS-SUM method LMS combined algorithm. That is, we decompose the frequency of noisy speech signal at the base of the proposed analysis tree structure. NLMS algorithm in low frequency band can efficiently dliminate the effect of the low frequency noise and SUM method LMS algorithm at each high frequency band can remove the high frequency nosie. The proposed wavelet packet adaptive noise canceller is enhanced the more in SNR and according to Itakura-Satio(IS) distance, it is closer to the clean speech signal than any other previous adaptive noise canceller.

• 대한전기학회논문지
• /
• 제39권8호
• /
• pp.868-874
• /
• 1990

A singular value approach is presented in order to determine the number of multiple sinusoids from the finite noisy data. Simulations are conducted for Akaike's information criterion (AIC), Rissanen's shortest data description (MDL) and a singular value approach, for various examples with different SNR's and methods of estimating frequencies. And then the performances are compared. Simulation results that the singular value approach is superior to AIC and MDL for FBLP, HOYW and covariance matrix based methods are investigated. The approach with contribute to the frequency estimation of multiple sinusoids from the finite noisy data. Furthermore, this will be applied to the DSPs of communication and bio-medical engineering.

• 응용통계연구
• /
• 제25권3호
• /
• pp.471-483
• /
• 2012

One of the most important problems in cluster analysis is the selection of variables that truly define cluster structure, while eliminating noisy variables that mask such structure. Brusco and Cradit (2001) present VS-KM(variable-selection heuristic for K-means clustering) procedure for selecting true variables for K-means clustering based on adjusted Rand index. This procedure starts with the fixed number of clusters in K-means and adds variables sequentially based on an adjusted Rand index. This paper presents an updated procedure combining the VS-KM with the automated K-means procedure provided by Kim (2009). This automated variable selection procedure for K-means clustering calculates the cluster number and initial cluster center whenever new variable is added and adds a variable based on adjusted Rand index. Simulation result indicates that the proposed procedure is very effective at selecting true variables and at eliminating noisy variables. Implemented program using R can be obtained on the website "http://faculty.knou.ac.kr/sskim/nvarkm.r and vnvarkm.r".

• 대한전자공학회논문지
• /
• 제26권8호
• /
• pp.1238-1246
• /
• 1989

In this paper, a texture synthesis technique based on the NCAR(non-causal auto-regressive) model and the pyramid structure is proposed. In order to estimate the NCAR model parameters accurately from a noisy texture, the MAP(maximum a posteriori) estimation technique is also employed. In our approach, since the input texture is decomposed into the Laplacian oyramid planes first and then the NCAR model is applied to each plane, we are able to obtain a good synthesized texture even if the texture exhibits some non-random local structure or non-homogenity. The usrfulness of the proposed method is demonstrated with seveal real textures in the Brodatz album. Finally, the 2-dimensional MAP estimation technique can be used to the image restoration for noisy images as well as a texture image synthesis.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 1999년도 하계종합학술대회 논문집
• /
• pp.605-608
• /
• 1999

A conventional image coder, such as JPEG, requires not only DCT and quantization but also additional pre-filtering under noisy environment. Since the pre-filtering removes camera noise and improves coding efficiency dramatically, its efficient implementation has been an important issue. Based on well-known noise removal techniques in image processing fields, this paper introduces an efficient scheme by adapting a noise removal procedure to block-based image coders. By using two-dimensional DCT factorization, the proposed image coder has only a modified DCT and a VLC, and performs pre-filtering and quantization simultaneously in the modified DCT operation.

• 전자공학회논문지B
• /
• 제31B권4호
• /
• pp.97-105
• /
• 1994

Transform image coding using DCT is proved to be efficient in the absence of channel error but its performance degrades rapidly over noisy channel. In this paper, in the case of appling bit selcetive error correction coding that protects some significant bits in a codeword, an efficient allocation method of imformation bits and additive redundancy bits used for quantization and error correction coding respectively under constant transmission bit rate is proposed, and its performance is analyzed. As a result, without increasing trasmission bit rate, PSNR can be improved up to 7~8 [dB] below bit error rate $10^2$ and the image without blocking effect caused by bit error resulted from channel noise can be recostructed.

• 음성과학
• /
• 제10권3호
• /
• pp.263-277
• /
• 2003

One of major problems in speech recognition is performance degradation due to the mismatch between the training and test environments. Recently, Stereo-based Piecewise LInear Compensation for Environments (SPLICE), which is frame-based bias removal algorithm for cepstral enhancement using stereo training data and noisy speech model as a mixture of Gaussians, was proposed and showed good performance in noisy environments. In this paper, we propose several methods to improve the conventional SPLICE. First we apply Cepstral Mean Subtraction (CMS) as a preprocessor to SPLICE, instead of applying it as a postprocessor. Secondly, to compensate residual distortion after SPLICE processing, two-stage SPLICE is proposed. Thirdly we employ phonetic information for training SPLICE model. According to experiments on the Aurora 2 database, proposed method outperformed the conventional SPLICE and we achieved a 50% decrease in word error rate over the Aurora baseline system.

• 제어로봇시스템학회논문지
• /
• 제4권1호
• /
• pp.76-81
• /
• 1998

This paper presents an on-line scheme for parameter estimation of continuous-time systems, based on the model adjustment technique and the genetic algorithm technique. To deal with the initialisation and unmeasurable signal problems in on-line parameter estimation of continuous-time systems, a discrete-time model is obtained for the linear differential equation model and approximations of unmeasurable states with the observable output and its time-delayed values are obtained for the nonlinear state space model. Noisy observations may affect these approximation processes and degrade the estimation performance. A digital prefilter is therefore incorporated to avoid direct approximations of system derivatives from possible noisy observations. The parameters of both the model and the designed filter are adjusted on-line by a genetic algorithm, A set of simulation works for linear and nonlinear systems is carried out to demonstrate the effectiveness of the proposed method.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 2007년도 하계종합학술대회 논문집
• /
• pp.413-414
• /
• 2007

Successful speech recognition in noisy environments for intelligent robots depends on the performance of preprocessing elements employed. We propose an architecture that effectively combines adaptive beamforming (ABF) and blind source separation (BSS) algorithms in the spatial domain to avoid permutation ambiguity and heavy computational complexity. We evaluated the structure and assessed its performance with a DSP module. The experimental results of speech recognition test shows that the proposed combined system guarantees high speech recognition rate in the noisy environment and better performance than the ABF and BSS system.

• 전자공학회논문지S
• /
• 제34S권3호
• /
• pp.97-107
• /
• 1997

Image segmentation is teh important step in image infromation extraction for computer vison sytems. Fuzzy clustering methods have been used extensively in color image segmentation. Most analytic fuzzy clustering approaches are derived from the fuzzy c-means (FCM) algorithm. The FCM algorithm uses th eprobabilistic constraint that the memberships of a data point across classes sum to 1. However, the memberships resulting from the FCM do not always correspond to the intuitive concept of degree of belongingor compatibility. moreover, the FCM algorithm has considerable trouble above under noisy environments in the feature space. Recently, the possibilistic C-mean (PCM) for solving growing for color image segmentation. In the PCM, the membersip values may be interpreted as degrees of possibility of the data points belonging to the classes. So, the problems in the FCM can be solved by the PCM. The clustering results by just PCM are not smoothly bounded, and they often have holes. So, the region growing was used as a postprocessing. In our experiments, we illustrated that the proposed method is reasonable than the FCM in noisy enviironments.