• Journal of KIISE:Software and Applications
• /
• v.29 no.4
• /
• pp.248-257
• /
• 2002

Clustering is a method for grouping objects with similar properties into a same cluster. SVD(Singular Value Decomposition) is known as an efficient preprocessing method for clustering because of dimension reduction and noise elimination for a high dimensional and sparse data set like E-Commerce data set. However, it is hard to evaluate the worth of original attributes because of information loss of a converted data set by SVD. This research proposes a cluster feature selection method, called ENTROPY-SVD, to find important attributes for each cluster based on entropy weighting and SVD. Using SVD, one can take advantage of the latent structures in the association of attributes with similar objects and, using entropy weighting one can find highly dense attributes for each cluster. This paper also proposes a model-based collaborative filtering recommendation system with ENTROPY-SVD, called CFS-CF and evaluates its efficiency and utilization.

• Korean Journal of Remote Sensing
• /
• v.31 no.4
• /
• pp.337-346
• /
• 2015

Water body extraction based on backscatter information is an essential process to analyze floodaffected areas from Synthetic Aperture Radar (SAR) image. Water body in SAR image tends to have low backscatter values due to homogeneous surface of water, while non-water body has higher backscatter values than water body. Non-water body, however, may also have low backscatter values in high resolution SAR image such as Kompsat-5 image, depending on surface characteristic of the ground. The objective of this paper is to present a method to increase backscatter contrast between water body and non-water body and also to remove efficiently misclassified pixels beyond true water body area. We create an entropy image using a Gray Level Co-occurrence Matrix (GLCM) and classify the entropy image into water body and non-water body pixels by thresholding of the entropy image. In order to reduce the effect of threshold value, we also propose Water Body Texture Index (WBTI), which measures simultaneously the occurrence of repeated water body pixel pair and the uniformity of water body in the binary entropy image. The proposed method produced high overall accuracy of 99.00% and Kappa coefficient of 90.38% in water body extraction using Kompsat-5 image. The accuracy analysis indicates that the proposed WBTI method is less affected by the choice of threshold value and successfully maintains high overall accuracy and Kappa coefficient in wide threshold range.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.35 no.12C
• /
• pp.995-1003
• /
• 2010

The content-based hashing for authentication and copy protection of image, video and 3D model has to satisfy the robustness and the security. For the security analysis of the hash value, the modelling method based on differential entropy had been presented. But this modelling can be only applied to the image hashing. This paper presents the modelling for the security analysis of the hash feature value in 3D model hashing based on differential entropy. The proposed security analysis modeling design the feature extracting methods of two types and then analyze the security of two feature values by using differential entropy modelling. In our experiment, we evaluated the security of feature extracting methods of two types and discussed about the trade-off relation of the security and the robustness of hash value.

• ETRI Journal
• /
• v.17 no.1
• /
• pp.11-22
• /
• 1995

This paper proposes a modified error function to improve the error back-propagation (EBP) algorithm for multi-Layer perceptrons (MLPs) which suffers from slow learning speed. It can also suppress over-specialization for training patterns that occurs in an algorithm based on a cross-entropy cost function which markedly reduces learning time. In the similar way as the cross-entropy function, our new function accelerates the learning speed of the EBP algorithm by allowing the output node of the MLP to generate a strong error signal when the output node is far from the desired value. Moreover, it prevents the overspecialization of learning for training patterns by letting the output node, whose value is close to the desired value, generate a weak error signal. In a simulation study to classify handwritten digits in the CEDAR [1] database, the proposed method attained 100% correct classification for the training patterns after only 50 sweeps of learning, while the original EBP attained only 98.8% after 500 sweeps. Also, our method shows mean-squared error of 0.627 for the test patterns, which is superior to the error 0.667 in the cross-entropy method. These results demonstrate that our new method excels others in learning speed as well as in generalization.

• Journal of KIISE:Information Networking
• /
• v.36 no.3
• /
• pp.173-183
• /
• 2009

We present a real-time monitoring system for detecting anomalous network events using the entropy. The entropy accounts for the effects of disorder in the system. When an abnormal factor arises to agitate the current system the entropy must show an abrupt change. In this paper we deliberately model the Internet to measure the entropy. Packets flowing between these two networks may incur to sustain the current value. In the proposed system we keep track of the value of entropy in time to pinpoint the sudden changes in the value. The time-series data of entropy are transformed into the two-dimensional domains to help visually inspect the activities on the network. We examine the system using network traffic traces containing notorious worms and DoS attacks on the testbed. Furthermore, we compare our proposed system of time series forecasting method, such as EWMA, holt-winters, and PCA in terms of sensitive. The result suggests that our approach be able to detect anomalies with the fairly high accuracy. Our contributions are two folds: (1) highly sensitive detection of anomalies and (2) visualization of network activities to alert anomalies.

• The Journal of Information Technology
• /
• v.2 no.2
• /
• pp.139-144
• /
• 1999

This thesis is a study on using of entropy information about the additional words in the after processing step to promote an accuracy in speech recognition system. The exsisting ratio of Woodo detective method changes the efficiency of speech recognition system according to speech data and increases the probability of producing error recognition because of similarity of value of Woodo in the additional words. But we could obtain the accurate speech recognition system which heightens discrimination becoming independent of speech data by using of after processing method refusing a candidate which entropy price is lower among words except words we could recognize than entropy Price of each additional word. As a result of this experiment when the false alarm is 20 percent, we could put out the maximum 3.6 percent efficiency of recognition system through this after processing method by entropy more than the method by ratio of Woods.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.26 no.2
• /
• pp.55-61
• /
• 2003

The purpose of this paper is to propose a method for selecting the preferred alternatives of Multiple- Attribute Decision-Making(MADM) problem using the Entropy measure. A decision-maker who wants to estimate exactly the weight to be applied to her/his MADM problem is usually confronted with the embarrassing situation where, although there exist a variety of weighting methods, it is hard to find a right procedure to choose a pertinent value To remedy this uncomfortable situation, the Entropy measure commonly used in information theory, Is proposed as a tool that can be used by decision-makers to more efficiently select the preferred alternatives. As a result, the method proposed in the paper can be significant in that relatively easy to understand by decision-makers.

• Journal of Advanced Navigation Technology
• /
• v.20 no.4
• /
• pp.380-385
• /
• 2016

Shadows are common phenomena observed in natural scenes and often bring a major problem that is affected negatively in colour image analysis. It is important to detect the shadow areas and should be considered in the pre-processing of computer vision. In this paper, the method of shadow detection is proposed using cross entropy and intensity image, and is performed in single image based on the satellite images. After converting the color image to a gray level image, the shadow candidate region has been estimated the optimal threshold value by cross entropy, and then the final shadow region has been detected using intensity image. For the validity of the proposed method, the satellite images is used to experiment. Some experiments are conducted so as to verify the proposed method, and as a result, shadow detection is well performed.

• Journal of the Korea Society of Computer and Information
• /
• v.24 no.6
• /
• pp.73-80
• /
• 2019

In this paper, we propose an effective dynamic range compression (DRC) method of infrared images. A histogram of infrared images has narrow dynamic range compared to visible images. Hence, it is important to apply the effective DRC algorithm for high performance of an infrared image analysis. The proposed algorithm for high dynamic range divides an infrared image into the overlapped blocks and calculates Shannon's entropy of overlapped blocks. After that, we classify each block according to the value of entropy and apply adaptive histogram modification method each overlapped block. We make an intensity mapping function through result of the adaptive histogram modification method which is using standard-deviation and maximum value of histogram of classified blocks. Lastly, in order to reduce block artifact, we apply hanning window to the overlapped blocks. In experimental result, the proposed method showed better performance of dynamic range compression compared to previous algorithms.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.12 no.4
• /
• pp.707-715
• /
• 2008

This paper proposes an algorithm for efficient compression gray-level images by entropy encoder. The issue of the proposed method is to replace original data of gray-level images with particular ranked data. For this, first, before encoding a stream of gray-level values in an image, the proposed method counts co-occurrence frequencies for neighboring pixel values. Then, it replaces each pay value with particularly ranked numbers based on the investigated co-occurrence frequencies. Finally, the ranked numbers are transmitted to an entropy encoder. The proposed method improves the performance of existing entropy coding by transforming original gray-level values into rank based images using statistical co-occurrence frequencies of gray-level images. The simulation results, using gray-level images with 8-bits, show that the proposed method can reduce bit rate by up to 37.85% compared to existing conventional entropy coders.