• Journal of the Korean Society of Manufacturing Process Engineers
• /
• v.15 no.2
• /
• pp.131-138
• /
• 2016

In order to improve the performance of an extended Kalman filter, a simplified indirect inference method (SIIM) fuzzy logic system (FLS) is proposed. The proposed FLS is composed of two fuzzy input variables, four fuzzy rules and one fuzzy output. Two normalized fuzzy input variables are the variance between the trace of a prior and a posterior covariance matrix, and the residual error of a Kalman algorithm. One fuzzy output variable is the weighting factor to adjust for the Kalman gain. There is no need to decide the number and the membership function of input variables, because we employ the normalized monotone increasing/decreasing function. The single parameter to be determined is the magnitude of a universe of discourse in the output variable. The structure of the proposed FLS is simple and easy to apply to various nonlinear state estimation problems. The simulation results show that the proposed FLS has strong adaptability to estimate the states of the incoming/outgoing moving objects, and outperforms the conventional extended Kalman filter algorithm by providing solutions that are more accurate.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.41 no.5
• /
• pp.33-40
• /
• 2004

In this paper, we constructs face database by using wavelet comparison, and compare face recognition rate by using principle component analysis (Principal Component Analysis : PCA) algorithm. General face recognition method constructs database, and do face recognition by using normalized size. Proposed method changes image of normalized size (92${\times}$112) to 1 step, 2 step, 3 steps to wavelet compression and construct database. Input image did compression by wavelet and a face recognition experiment by PCA algorithm. As well as method that is proposed through an experiment reduces existing face image's information, the processing speed improved. Also, original image of proposed method showed recognition rate about 99.05%, 1 step 99.05%, 2 step 98.93%, 3 steps 98.54%, and showed that is possible to do face recognition constructing face database of large quantity.

• Journal of Satellite, Information and Communications
• /
• v.9 no.4
• /
• pp.104-110
• /
• 2014

This paper considers two reconstruction schemes of structured-sparse signals, turbo inference and Markov chain Monte Carlo (MCMC) inference, in compressed sensing(CS) technique that is recently getting an important issue for an efficient video wireless transmission system using multi-copter as an unmanned aerial vehicle. Proposed reconstruction algorithms are setting importance on reduction of image data sizes, fast reconstruction speed and errorless reconstruction. As a result of experimentation with twenty kinds of images, we can find turbo reconstruction algorithm based on loopy belief propagation(BP) has more excellent performances than MCMC algorithm based on Gibbs sampling as aspects of average reconstruction computation time, normalized mean squared error(NMSE) values.

• ETRI Journal
• /
• v.41 no.3
• /
• pp.358-370
• /
• 2019

The main aim of this study is to select the optimal set of genes from microarray cancer datasets that contribute to the prediction of specific cancer types. This study proposes the enhancement of the feature selection filter algorithm based on Joe's normalized mutual information and its use for gene selection. The proposed algorithm is implemented and evaluated on seven benchmark microarray cancer datasets, namely, central nervous system, leukemia (binary), leukemia (3 class), leukemia (4 class), lymphoma, mixed lineage leukemia, and small round blue cell tumor, using five well-known classifiers, including the naive Bayes, radial basis function network, instance-based classifier, decision-based table, and decision tree. An average increase in the prediction accuracy of 5.1% is observed on all seven datasets averaged over all five classifiers. The average reduction in training time is 2.86 seconds. The performance of the proposed method is also compared with those of three other popular mutual information-based feature selection filters, namely, information gain, gain ratio, and symmetric uncertainty. The results are impressive when all five classifiers are used on all the datasets.

• Journal of Electrical Engineering and Technology
• /
• v.11 no.2
• /
• pp.519-528
• /
• 2016

In order to achieve fast computational speed with good visual quality of output video, we propose a frequency domain based new fractal video compression scheme. Normalized cross correlation is used to find the structural self similar domain block for the input range block. To increase the searching speed, cross correlation is implemented in the frequency domain using FFT with one computational operation for all the domain blocks instead of individual block wise calculations. The encoding time is further minimized by applying rotation and reflection DFT properties to the IFFT of zero padded range blocks. The energy of overlap small size domain blocks is pre-computed for the entire reference frame and retaining the energies of the overlapped search window portion of previous adjacent block. Quadtree decompositions are obtained by using domain block motion compensated prediction error as a threshold to control the further partitions of the block. It provides a better level of adaption to the scene contents than fixed block size approach. The result shows that, on average, the proposed method can raise the encoding speed by 48.8 % and 90 % higher than NHEXS and CPM/NCIM algorithms respectively. The compression ratio and PSNR of the proposed method is increased by 15.41 and 0.89 dB higher than that of NHEXS on average. For low bit rate videos, the proposed algorithm achieve the high compression ratio above 120 with more than 31 dB PSNR.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.51 no.9
• /
• pp.165-170
• /
• 2014

Speech enhancement techniques that remove surrounding noise are stressed to preprocessor of speech recognition. Among the various speech enhancement techniques, Codebook-based Speech Enhancement (CBSE) operates efficiently in non-stationary noise environments. But, CBSE has some problems that inaccurate gains can be estimated if mismatch occur between input noisy signal and trained speech/noise codevectors. In this paper, the Normalized Weighting Factor (NWF) is calculated by long-term noise estimation algorithm based on Signal-to-Noise Ratio, compensated to the conventional inaccurate gains. The proposed CBSE shows better performance than conventional CBSE.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.38B no.2
• /
• pp.140-145
• /
• 2013

This paper proposes the high speed LDPC decoder structure base on the DVB-S2. Firstly, We study the solution to avoid the memory conflict. For the high speed decoding process the decoder adapts the HSS(Horizontal Shuffle Scheduling) scheme. Secondly, for the high speed decoding algorithm normalized Min-Sum algorithm is adapted instead of Sum-Product algorithm. And the self corrected is a variant of the LDPC decoding that sets the reliability of a Mc${\rightarrow}$v message to 0 if there is an inconsistency between the signs of the current incoming messages Mv'${\rightarrow}$c and the sign of the previous incoming messages Moldv'${\rightarrow}$c This self-corrected algorithm avoids the propagation on unreliable information in the Tanner graph and thus, helps the convergence of the decoder.Start after striking space key 2 times. Lastly, and this paper propose the optimal hardware architecture supporting the high speed throughput.

• The Journal of the Acoustical Society of Korea
• /
• v.39 no.6
• /
• pp.559-567
• /
• 2020

This paper proposes a noise cancelling algorithm to remove own-ship noise for a towed array sonar. Extra beamforming is performed using partial channels of the acoustic array to get a reference beam signal robust to the noise bearing. Frequency domain Adaptive Noise Cancelling (ANC) is applied based on Normalized Least Mean Square (NLMS) algorithm using the reference beam. The bearing of own-ship noise is estimated from the coherence between the reference beam and input beam signals. Own-ship noise level is calculated using a beampattern of the noise with estimated steering angle, which prevents loss of a target signal by determining whether to update a filter so that removed signal level does not exceed the estimated noise level. Simulation results show the proposed algorithm maintains its performance when the own-ship gets out off its bearing 40 % more than the conventional algorithm's limit and detects the target even when the frequency of the target signal is same with the frequency of the own-ship signal.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.29 no.2C
• /
• pp.222-228
• /
• 2004

This paper describes a new adaptive algorithm which can reduce the required computation quantities in the adaptive filter. The proposed adaptive algorithm uses only the signs of the normalized input signal rather than the input signals when coefficients of the filter are adapted. By doing so, there is no need for the multiplications and divisions which are mostly responsible for the computation quantities. To analyze the convergence characteristics of the proposed algorithm, the condition and speed of the convergence are derived mathematically. Also, we simulate an echo canceller adopting this algorithm and compare the performances of convergence for this algorithm with the ones for the other algorithm. As the results of simulations, it is proved that the echo canceller adopting this algorithm shows almost the same performances of convergence as the echo canceller adopting the SIA algorithm.

• Journal of Institute of Control, Robotics and Systems
• /
• v.10 no.7
• /
• pp.597-603
• /
• 2004

In retrieving large database of image data, the clustering is essential for fast retrieval. However, it is difficult to cluster a number of image data adequately. Moreover, current retrieval methods using similarities are uncertain of retrieval accuracy and take much retrieving time. In this paper, a suggested image retrieval system combines Fuzzy ART neural network algorithm to reinforce defects and to support them efficiently. This image retrieval system takes color and texture as specific feature required in retrieval system and normalizes each of them. We adapt Fuzzy ART algorithm as neural network which receive normalized input-vector and propose improved Fuzzy ART algorithm. The result of implementation with 200 image data shows approximately retrieval ratio of 83%.