• Journal of information and communication convergence engineering
• /
• v.13 no.2
• /
• pp.113-122
• /
• 2015

Feature subset selection is as a pre-processing step in learning algorithms. In this paper, we propose an efficient algorithm, ModifiedFAST, for feature subset selection. This algorithm is suitable for text datasets, and uses the concept of information gain to remove irrelevant and redundant features. A new optimal value of the threshold for symmetric uncertainty, used to identify relevant features, is found. The thresholds used by previous feature selection algorithms such as FAST, Relief, and CFS were not optimal. It has been proven that the threshold value greatly affects the percentage of selected features and the classification accuracy. A new performance unified metric that combines accuracy and the number of features selected has been proposed and applied in the proposed algorithm. It was experimentally shown that the percentage of selected features obtained by the proposed algorithm was lower than that obtained using existing algorithms in most of the datasets. The effectiveness of our algorithm on the optimal threshold was statistically validated with other algorithms.

• Proceedings of the KSRS Conference
• /
• 2004.10a
• /
• pp.613-616
• /
• 2004

To find the best way to distinguish sand dunes from urban building and rural patches, textural analysis has been performed in Kimnyeong sand dune, Jeju. An aerial photo was re-sampled into one-meter. Homomorphic filters were applied to the original sub-scene and then high-pass filtered one. The entropy filtered one proves to be the best extraction method after high pass filtered-homomorphic filters in urban areas. The spectral values of sand dune area were similar to open land in rural area. In contrast, the texture values of sand dune area are more homogeneous than those of open land in rural area.

• Journal of Ocean Engineering and Technology
• /
• v.28 no.6
• /
• pp.552-559
• /
• 2014

In general, the number of underwater transient signals is very limited for research on automatic recognition. Data-dependent feature extraction is one of the most effective methods in this case. Therefore, we suggest WPCC (Wavelet packet ceptsral coefficient) as a feature extraction method. A wavelet packet best tree for each data set is formed using an entropy-based cost function. Then, every terminal node of the best trees is counted to build a common wavelet best tree. It corresponds to flexible and non-uniform filter bank reflecting characteristics for the data set. A GMM (Gaussian mixture model) is used to classify five classes of underwater transient data sets. The error rate of the WPCC is compared using MFCC (Mel-frequency ceptsral coefficients). The error rates of WPCC-db20, db40, and MFCC are 0.4%, 0%, and 0.4%, respectively, when the training data consist of six out of the nine pieces of data in each class. However, WPCC-db20 and db40 show rates of 2.98% and 1.20%, respectively, while MFCC shows a rate of 7.14% when the training data consists of only three pieces. This shows that WPCC is less sensitive to the number of training data pieces than MFCC. Thus, it could be a more appropriate method for underwater transient recognition. These results may be helpful to develop an automatic recognition system for an underwater transient signal.

• Journal of the Korea Society of Computer and Information
• /
• v.11 no.1 s.39
• /
• pp.139-145
• /
• 2006

Feature extraction technique in digital images has many applications such as robot vision, medical diagnostic system, and motion video transmission, etc. There are several methods for extracting features in digital images for example nonlinear gradient, nonlinear laplacian, and entropy convolutional filter. However, conventional convolutional filters are usually not efficient to extract features in an image because image feature formation in eyes is more sensitive to dark regions than to bright regions. A few nonlinear filters using difference between arithmetic mean and harmonic mean in a window for extracting sketch features are described in this paper They have some advantages, for example simple computation, dependence on local intensities and less sensitive to small intensity changes in very dark regions. Experimental results demonstrate more successful features extraction than other conventional filters over a wide variety of intensity variations.

• 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.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.32 no.5C
• /
• pp.520-529
• /
• 2007

In this paper, we study the characteristics of parameters which are related to performance of MCTF which is a key technique for wavelet-based scalable video coding, and propose an improved MCTF method. The proposed MCTF method adopts the motion estimation of which motion vector field is distributed more uniformly using variable block sizes. By using the proposed method, the decomposition performance of temporal filter is improved, and the energy in high-frequency frames is reduced. It can help the entropy coder to generate lower bitrate. From simulation results, we verify the decomposed energy on high-frequency frame using the proposed method is reduced by 25.86% at the most in terms of variance of the high-frequency frame.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.13 no.2
• /
• pp.99-106
• /
• 2003

Intrusions pose a serious security risk in a network environment. For detecting the intrusion effectively, many researches have developed data mining framework for constructing intrusion detection modules. Traditional anomaly detection techniques focus on detecting anomalies in new data after training on normal data. To detect anomalous behavior, Precise normal Pattern is necessary. This training data is typically expensive to produce. For this, the understanding of the characteristics of data on network is inevitable. In this paper, we propose to use clustering and association rules as the basis for guiding anomaly detection. For applying entropy to filter noisy data, we present a technique for detecting anomalies without training on normal data. We present dynamic transaction for generating more effectively detection patterns.

• Journal of Information Processing Systems
• /
• v.19 no.4
• /
• pp.417-426
• /
• 2023

To improve the effect of image restoration and solve the image detail loss, an image dehazing enhancement algorithm based on mean guided filtering is proposed. The superpixel calculation method is used to pre-segment the original foggy image to obtain different sub-regions. The Ncut algorithm is used to segment the original image, and it outputs the segmented image until there is no more region merging in the image. By means of the mean-guided filtering method, the minimum value is selected as the value of the current pixel point in the local small block of the dark image, and the dark primary color image is obtained, and its transmittance is calculated to obtain the image edge detection result. According to the prior law of dark channel, a classic image dehazing enhancement model is established, and the model is combined with a median filter with low computational complexity to denoise the image in real time and maintain the jump of the mutation area to achieve image dehazing enhancement. The experimental results show that the image dehazing and enhancement effect of the proposed algorithm has obvious advantages, can retain a large amount of image detail information, and the values of information entropy, peak signal-to-noise ratio, and structural similarity are high. The research innovatively combines a variety of methods to achieve image dehazing and improve the quality effect. Through segmentation, filtering, denoising and other operations, the image quality is effectively improved, which provides an important reference for the improvement of image processing technology.

• Economic and Environmental Geology
• /
• v.52 no.4
• /
• pp.313-322
• /
• 2019

SAR (Synthetic Aperture Radar) remote sensing data is a very useful tool for near-real-time identification of landslide affected areas that can occur over a large area due to heavy rains or typhoons. This study aims to develop an effective algorithm for automatically delineating landslide areas from the polarimetric SAR data acquired after the landslide event. To detect landslides from SAR observations, reduction of the speckle effects in the estimation of polarimetric SAR parameters and the orthorectification of geometric distortions on sloping terrain are essential processing steps. Based on the experimental analysis, it was found that the IDAN filter can provide a better estimation of the polarimetric parameters. In addition, it was appropriate to apply orthorectification process after estimating polarimetric parameters in the slant range domain. Furthermore, it was found that the polarimetric entropy is the most appropriate parameters among various polarimetric parameters. Based on those analyses, we proposed an automatic landslide detection algorithm using the histogram thresholding of the polarimetric parameters with the aid of terrain slope information. The landslide detection algorithm was applied to the ALOS-2 PALSAR-2 data which observed landslide areas in Japan triggered by Typhoon in September 2011. Experimental results showed that the landslide areas were successfully identified by using the proposed algorithm with a detection rate of about 82% and a false alarm rate of about 3%.

• Journal of Broadcast Engineering
• /
• v.1 no.2
• /
• pp.118-132
• /
• 1996

This paper proposes a wavelet transform- based image compression method using the energy distribution. The proposed method Involves two steps. First, we use a wavelet transform for the subband decomposition. The original image Is decomposed into one low resolution subimage and three high frequency subimages. Each high frequency subimages have horizontal, vertical, and diagonal directional edges. The wavelet transform is luther applied to these high frequency subimages. Resultant transformed subimages have different energy distributions corresponding to different orientation of the high pass filter. Second, for higer compression ratio and computational effciency, we discard some subimages with small energy. The remaining subimages are encoded using either DPCM or quantization followed by entropy coding. Experimental results show that the proposed coding scheme has better performance in the peak signal to noise ratio(PSNR) and higher compression ratio than conventional image coding method using the wavelet transform followed by the straightforward vector quantization.