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

• Journal of the Semiconductor & Display Technology
• /
• v.18 no.3
• /
• pp.31-35
• /
• 2019

Human beings have been fascinated by the applicability of the medium of photography since the device was first introduced in the thirteenth century to acquire images by attempting primitive and rudimentary approaches. In the 21st century, it has been developed as a wide range of technology that enables not only the application of artistic expression as a method of replacing the human-hand-painted screen but also the planar recording form in the format of video or image. It is more effective to use the information extracted from the image data rather than to use a randomly given file name in order to provide a variety of services in the offline or online system. When extracting an identifier from a region of an image, high cost cannot be avoided. This paper discusses the image entropy-based approach and proposes a linear methodology to measure the image entropy in an effort to devise a solution to this method.

• Journal of Information Processing Systems
• /
• v.14 no.1
• /
• pp.218-227
• /
• 2018

Vocal effort detection is important for both robust speech recognition and speaker recognition. In this paper, the spectral information entropy feature which contains more salient information regarding the vocal effort level is firstly proposed. Then, the model fusion method based on complementary model is presented to recognize vocal effort level. Experiments are conducted on isolated words test set, and the results show the spectral information entropy has the best performance among the three kinds of features. Meanwhile, the recognition accuracy of all vocal effort levels reaches 81.6%. Thus, potential of the proposed method is demonstrated.

• Journal of Information Processing Systems
• /
• v.20 no.3
• /
• pp.285-295
• /
• 2024

Driven by the vague assessment big data, a product service system (PSS) evaluation method is developed based on a hybrid model of multi-weight combination and improved TOPSIS by relative entropy. The index values of PSS alternatives are solved by the integration of the stakeholders' vague assessment comments presented in the form of trapezoidal fuzzy numbers. Multi-weight combination method is proposed for index weight solving of PSS evaluation decision-making. An improved TOPSIS by relative entropy (RE) is presented to overcome the shortcomings of traditional TOPSIS and related modified TOPSIS and then PSS alternatives are evaluated. A PSS evaluation case in a printer company is given to test and verify the proposed model. The RE closeness of seven PSS alternatives are 0.3940, 0.5147, 0.7913, 0.3719, 0.2403, 0.4959, and 0.6332 and the one with the highest RE closeness is selected as the best alternative. The results of comparison examples show that the presented model can compensate for the shortcomings of existing traditional methods.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.25 no.4B
• /
• pp.755-762
• /
• 2000

Entropy coders as a noiseless compression method are widely used as end-point compression for images so there have been many contributions to increase of entropy coder performance and to reduction of entropy coder complexity. In this paper, we propose some entropy coders based on binary forward classification (BFC). BFC requires overhead of classification but there is no change between the amount of input information and that of classified output information, which we prove this property in this paper. And using the proved property, we propose entropy coders which are Golomb-Rice coder after BFC (BFC+GR) and arithmetic coder with BFC(BFC+A). The proposed entropy decoders do not have further complexity Son BFC. Simulation results also show better performance than other entropy coders which have similar complexity to proposed coders.

• Genomics & Informatics
• /
• v.20 no.2
• /
• pp.17.1-17.11
• /
• 2022

Genetic associations have been quantified using a number of statistical measures. Entropy-based mutual information may be one of the more direct ways of estimating the association, in the sense that it does not depend on the parametrization. For this purpose, both the entropy and conditional entropy of the phenotype distribution should be obtained. Quantitative traits, however, do not usually allow an exact evaluation of entropy. The estimation of entropy needs a probability density function, which can be approximated by kernel density estimation. We have investigated the proper sequence of procedures for combining the kernel density estimation and entropy estimation with a probability density function in order to calculate mutual information. Genotypes and their interactions were constructed to set the conditions for conditional entropy. Extensive simulation data created using three types of generating functions were analyzed using two different kernels as well as two types of multifactor dimensionality reduction and another probability density approximation method called m-spacing. The statistical power in terms of correct detection rates was compared. Using kernels was found to be most useful when the trait distributions were more complex than simple normal or gamma distributions. A full-scale genomic dataset was explored to identify associations using the 2-h oral glucose tolerance test results and γ-glutamyl transpeptidase levels as phenotypes. Clearly distinguishable single-nucleotide polymorphisms (SNPs) and interacting SNP pairs associated with these phenotypes were found and listed with empirical p-values.

• The KIPS Transactions:PartC
• /
• v.16C no.5
• /
• pp.555-562
• /
• 2009

In malware accident investigation, the most important thing is detection of malicious code. Signature based anti-virus softwares have been used in most of the accident. Malware can easily avoid signature based detection by using packing or encryption method. Because of this, packed file detection is also important. Detection methods can be divided into signature based detection and entropy based detection. Signature based detection can not detect new packing. And entropy based detection has a problem with false positive. We provides detection method using entropy statistics of entry point section and 'write' properties of essential characteristic of packed file. And then, we show packing detection tool and evaluate its performance.

• Proceedings of the Korean Society of Precision Engineering Conference
• /
• 2007.11a
• /
• pp.571-572
• /
• 2007

• Journal of Advanced Navigation Technology
• /
• v.18 no.4
• /
• pp.387-392
• /
• 2014

Recently, various research for intelligent video surveillance system have been proposed, but the existing monitoring systems are inefficient because all of situational awareness is judged by the human. In this paper, shadow removal based moving object tracking method is proposed using the chromaticity and entropy image. The background subtraction model, effective in the context awareness environment, has been applied for moving object detection. After detecting the region of moving object, the shadow candidate region has been estimated and removed by RGB based chromaticity and minimum cross entropy images. For the validity of the proposed method, the highway video is used to experiment. Some experiments are conducted so as to verify the proposed method, and as a result, shadow removal and moving object tracking are well performed.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.14 no.4
• /
• pp.991-998
• /
• 2010

In realization of wireless home network system using speech recognition in indoor voice recognition environment, background noise and reverberation are two main causes of digression in voice recognition system. In this study, the home network system resistant to reverberation and background noise using voice section detection method based on spectral entropy in indoor recognition environment is to be realized. Spectral subtraction can reduce the effect of reverberation and remove noise independent from voice signal by eliminating signal distorted by reverberation in spectrum. For effective spectral subtraction, the correct separation of voice section and silent section should be accompanied and for this, improvement of performance needs to be done, applying to voice section detection method based on entropy. In this study, experimental and indoor environment testing is carried out to figure out command recognition rate in indoor recognition environment. The test result shows that command recognition rate improved in static environment and reverberant room condition, using voice section detection method based on spectral entropy.