• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.36 no.1A
• /
• pp.35-40
• /
• 2011

The complex-valued blind algorithm based on a set of randomly generated symbols and Euclidean distance can take advantage of information theoretic learning and cope with the channel phase rotation problems. On the algorithm, in this paper, the effect of kernel size has been studied and a kernel-modified version of the algorithm that rearranges the forces between the information potentials by kernel-modification has been proposed. In simulation results for 16 QAM and complex-channel models, the proposed algorithm show significantly enhanced performance of symbol-point concentration and no phase rotation problems caused by the complex channel models.

• The KIPS Transactions:PartB
• /
• v.13B no.1 s.104
• /
• pp.27-34
• /
• 2006

In this study, we propose this new algorithm that generates score function in ICA(Independent Component Analysis) using entropy theory. To generate score function, estimation of probability density function about original signals are certainly necessary and density function should be differentiated. Therefore, we used kernel density estimation method in order to derive differential equation of score function by original signal. After changing formula to convolution form to increase speed of density estimation, we used FFT algorithm that can calculate convolution faster. Proposed score function generation method reduces the errors, it is density difference of recovered signals and originals signals. In the result of computer simulation, we estimate density function more similar to original signals compared with Extended Infomax and Fixed Point ICA in blind source separation problem and get improved performance at the SNR(Signal to Noise Ratio) between recovered signals and original signal.

• Journal of IKEEE
• /
• v.13 no.4
• /
• pp.1-7
• /
• 2009

A video segmentation algorithm, which can extract objects even with non-stationary backgrounds, is proposed in this work. The proposed algorithm is composed of three steps. First, we perform an initial segmentation interactively to build the probability density functions of colors per each macro block via kernel density estimation. Then, for each subsequent frame, we construct a coherence strip, which is likely to contain the object contour, by exploiting spatio-temporal correlations. Finally, we perform the segmentation by minimizing an energy function composed of color, coherence, and smoothness terms. Experimental results on various test sequences show that the proposed algorithm provides accurate segmentation results.

• Journal of the Korean Data and Information Science Society
• /
• v.14 no.2
• /
• pp.247-255
• /
• 2003

Hypothesis testing for the equality of two distributions were considered. Nonparametric kernel density estimates were used for testing equality of distributions. Cross-validatory choice of bandwidth was used in the kernel density estimation. Sampling distribution of considered test statistic were developed by resampling method, called the bootstrap. Small sample Monte Carlo simulation were conducted. Empirical power of considered tests were compared for variety distributions.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.8 no.4
• /
• pp.75-88
• /
• 2008

This paper presents a spatial-level nonparametric multi-focus image fusion technique based on kernel estimates of input image blocks' underlying class-conditional probability density functions. Image fusion is approached as a classification task whose posterior class probabilities, P($wi{\mid}Bikl$), are calculated with likelihood density functions that are estimated from the training patterns. For each of the C input images Ii, the proposed method defines i classes wi and forms the fused image Z(k,l) from a decision map represented by a set of $P{\times}Q$ blocks Bikl whose features maximize the discriminant function based on the Bayesian decision principle. Performance of the proposed technique is evaluated in terms of RMSE and Mutual Information (MI) as the output quality measures. The width of the kernel functions, ${\sigma}$, were made to vary, and different kernels and block sizes were applied in performance evaluation. The proposed scheme is tested with C=2 and C=3 input images and results exhibited good performance.

• Journal of the Korean Geographical Society
• /
• v.34 no.5
• /
• pp.473-491
• /
• 1999

세균성 이질은 국내 제1종 법정 전염병으로 분류되어 관리되고 있는 질환으로서 1998년 이후 그 발병 사례가 급속히 증가하고 있다. 본 연구는 1999년 3월 부산시 사상구에서 집단 발병한 세균성 이질을 대상으로 하여, 각 환자들의 발병 시점과 장소의 분포패턴에 대한 지리학적 고찰을 목적으로 한다. 환자분포의 특징적 공간패턴과 그들의 시계열적 확산 양상 등을 탐색하기 위한 방법론은 보건지리학과 지도학 및 공간통계학에 기반을 둔 공간분석기법을 중심으로 설정하였다. 분석자료는 해당 지역의 수치지형도, 지적도, 인구 센서스 자료를 포함한 GIS 데이터베이스로 구축되었다. 인구분포를 감안한 밀도구분도를 바탕으로 개별환자의 위치자료와 동 단위로 집계된 자료를 자료의 형태에 따라 분석기법을 달리하였으며, 환자 발생 밀도, 상대적 위험지수 등을 지도화하여 역학자료의 시각적 통계적 분석을 수행하였다. 환자분포의 공간적 중심위치와 분산의 변화 등 기술적 통계분석과 함께 제1차 공간속성을 커널추정법으로 찾아보았다. 이와 더불어 ‘공간적 의존성’과 관련된 제2차 공간속성은 K-함수와 시뮬레이션을 통해 분석하여 군집성 등이 통계적으로 확인되었다. 본 연구를 통해 역학조사시 GIS의 활용사례가 제시되었으며, 모집단 인구를 고려한 확률지도 작성 기법과 다양한 데이터 가시화 방법, 그리고 시계열별 발생 환자들의 지리적 변이를 분석 하는데 따르는 문제들이 논의되었다.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.39A no.3
• /
• pp.149-154
• /
• 2014

The cross-correntropy concept can be expressed with inner products of two different probability density functions constructed by Gaussian-kernel density estimation methods. Blind algorithms based on the maximization of the cross-correntropy (MCC) and a symbol set of randomly generated N samples yield superior learning performance, but have a huge computational complexity in the update process at the aim of weight adjustment based on the MCC. In this paper, a method of reducing the computational complexity of the MCC algorithm that calculates recursively the gradient of the cross-correntropy is proposed. The proposed method has only O(N) operations per iteration while the conventional MCC algorithms that calculate its gradients by a block processing method has $O(N^2)$. In the simulation results, the proposed method shows the same learning performance while reducing its heavy calculation burden significantly.

• Journal of Digital Contents Society
• /
• v.18 no.3
• /
• pp.525-534
• /
• 2017

The open set recognition method should be used for the cases that the classes of test data are not known completely in the training phase. So it is required to include two processes of classification and the validation test. This kind of research is very necessary for commercialization of face recognition modules, but few domestic researches results about it have been published. In this paper, we propose an open set face recognition method that includes two sequential validation phases. In the first phase, with dummy classes we perform classification based on sparse representation. Here, when the test data is classified into a dummy class, we conclude that the data is invalid. If the data is classified into one of the regular training classes, for second validation test we extract four features and apply them for the proposed decision function. In experiments, we proposed a simulation method for open set recognition and showed that the proposed validation test outperform SCI of the well-known validation method