• The Transactions of the Korea Information Processing Society
• /
• v.6 no.2
• /
• pp.543-551
• /
• 1999

The primary purposes in this paper are to analyze the class separation of features in handwritten numeral recognition and to make use of the results in feature selection. Using the Parzen window technique, we compute the class distributions and define the class separation to be the overlapping distance of two class distributions. The dimension of a feature vector is reduced by removing the void or redundant feature cells based on the class separation information. The experiments have been performed on the CENPARMI handwritten numeral database, and partial classification and full classification have been tested. The results show that the class separation is very effective for the feature selection in the 10-class handwritten numeral recognition problem since we could reduce the dimension of the original 256-dimensional feature vector by 22%.

• Journal of Communications and Networks
• /
• v.12 no.5
• /
• pp.459-465
• /
• 2010

A new blind equalization algorithm that is based on maximizing the probability that the constant modulus errors concentrate near zero is proposed. The cost function of the proposed algorithm is to maximize the probability that the equalizer output power is equal to the constant modulus of the transmitted symbols. Two blind information-theoretic learning (ITL) algorithms based on constant modulus error signals are also introduced: One for minimizing the Euclidean probability density function distance and the other for minimizing the constant modulus error entropy. The relations between the algorithms and their characteristics are investigated, and their performance is compared and analyzed through simulations in multi-path channel environments. The proposed algorithm has a lower computational complexity and a faster convergence speed than the other ITL algorithms that are based on a constant modulus error. The error samples of the proposed blind algorithm exhibit more concentrated density functions and superior error rate performance in severe multi-path channel environments when compared with the other algorithms.

• Journal of the Korean earth science society
• /
• v.26 no.2
• /
• pp.114-128
• /
• 2005

Fuzzy information representation of multi-source spatial data is applied to landslide hazard mapping. Information representation based on frequency ratio and non-parametric density estimation is used to construct fuzzy membership functions. Of particular interest is the representation of continuous data for preventing loss of information. The non-parametric density estimation method applied here is a Parzen window estimation that can directly use continuous data without any categorization procedure. The effect of the new continuous data representation method on the final integrated result is evaluated by a validation procedure. To illustrate the proposed scheme, a case study from Jangheung, Korea for landslide hazard mapping is presented. Analysis of the results indicates that the proposed methodology considerably improves prediction capabilities, as compared with the case in traditional continuous data representation.

• International Journal of CAD/CAM
• /
• v.9 no.1
• /
• pp.31-36
• /
• 2010

3D point data acquired from laser scan or stereo vision can be quite noisy. A preprocessing step is often needed before a surface reconstruction algorithm can be applied. In this paper, we propose a nonparametric approach for noisy point data preprocessing. In particular, we proposed an anisotropic kernel based nonparametric density estimation method for outlier removal, and a hill-climbing line search approach for projecting data points onto the real surface boundary. Our approach is simple, robust and efficient. We demonstrate our method on both real and synthetic point datasets.

• The Korean Journal of Applied Statistics
• /
• v.13 no.2
• /
• pp.447-455
• /
• 2000

We propose a weighted kernel pattern recognition method using the K -means clustering algorithm to reduce computation and storage required for the full kernel classifier. This technique finds a set of reference vectors and weights which are used to approximate the kernel classifier. Since the hierarchical clustering method implemented in the 'Weighted Parzen Window (WP\V) classifier is not able to rearrange the proper clusters, we adopt the K -means algorithm to find reference vectors and weights from the more properly rearranged clusters \Ve find that the proposed method outperforms the \VP\V method for the repre~entativeness of the reference vectors and the data reduction.

• Journal of the Semiconductor & Display Technology
• /
• v.22 no.2
• /
• pp.112-119
• /
• 2023

In urban environments, signals of Global Positioning System (GPS) can be blocked and reflected by tall buildings, large vehicles, and complex components of road network. Therefore, the performance of the positioning system using the GPS module in urban areas can be degraded due to the loss of GPS signals necessary for the position estimation. To deal with this issue, various localization schemes using inertial measurement unit (IMU) sensors, such as gyroscope and accelerometer, and Bayesian filters, such as Kalman filter (KF) and particle filter (PF), have been designed to enhance the performance of the GPS-based positioning system. Among Bayesian filters, the PF has been widely used for the target tracking and vehicle navigation, since it can provide superior performance in estimating the state of a dynamic system under nonlinear/non-Gaussian circumstance. This paper presents a positioning system that uses the double-stacked particle filter (DSPF) as well as the accelerometer, gyroscope, and GPS receiver on the smartphone to provide higher pedestrian positioning accuracy in urban environments. The DSPF employs a nonparametric technique (Parzen-window) to create the multimodal target distribution that approximates the posterior distribution. Experimental results show that the DSPF-based positioning system can provide the significant improvement of the pedestrian position estimation in urban environments.

• Journal of the Korean Data and Information Science Society
• /
• v.25 no.5
• /
• pp.1079-1094
• /
• 2014

In this paper, we study efficient gene selection methods by using conditional mutual information. We suggest gene selection methods using conditional mutual information based on semiparametric methods utilizing multivariate normal distribution and Edgeworth approximation. We compare our suggested methods with other methods such as mutual information filter, SVM-RFE, Cai et al. (2009)'s gene selection (MIGS-original) in SVM classification. By these experiments, we show that gene selection methods using conditional mutual information based on semiparametric methods have better performance than mutual information filter. Furthermore, we show that they take far less computing time than Cai et al. (2009)'s gene selection but have similar performance.