• Title/Summary/Keyword: Entropy difference

Search Result 122, Processing Time 0.022 seconds

Voice Activity Detection Based on Signal Energy and Entropy-difference in Noisy Environments (엔트로피 차와 신호의 에너지에 기반한 잡음환경에서의 음성검출)

  • Ha, Dong-Gyung;Cho, Seok-Je;Jin, Gang-Gyoo;Shin, Ok-Keun
    • Journal of Advanced Marine Engineering and Technology
    • /
    • v.32 no.5
    • /
    • pp.768-774
    • /
    • 2008
  • In many areas of speech signal processing such as automatic speech recognition and packet based voice communication technique, VAD (voice activity detection) plays an important role in the performance of the overall system. In this paper, we present a new feature parameter for VAD which is the product of energy of the signal and the difference of two types of entropies. For this end, we first define a Mel filter-bank based entropy and calculate its difference from the conventional entropy in frequency domain. The difference is then multiplied by the spectral energy of the signal to yield the final feature parameter which we call PEED (product of energy and entropy difference). Through experiments. we could verify that the proposed VAD parameter is more efficient than the conventional spectral entropy based parameter in various SNRs and noisy environments.

A Modi ed Entropy-Based Goodness-of-Fit Tes for Inverse Gaussian Distribution (역가우스분포에 대한 변형된 엔트로피 기반 적합도 검정)

  • Choi, Byung-Jin
    • The Korean Journal of Applied Statistics
    • /
    • v.24 no.2
    • /
    • pp.383-391
    • /
    • 2011
  • This paper presents a modified entropy-based test of fit for the inverse Gaussian distribution. The test is based on the entropy difference of the unknown data-generating distribution and the inverse Gaussian distribution. The entropy difference estimator used as the test statistic is obtained by employing Vasicek's sample entropy as an entropy estimator for the data-generating distribution and the uniformly minimum variance unbiased estimator as an entropy estimator for the inverse Gaussian distribution. The critical values of the test statistic empirically determined are provided in a tabular form. Monte Carlo simulations are performed to compare the proposed test with the previous entropy-based test in terms of power.

An Implementation of Gaze Direction Recognition System using Difference Image Entropy (차영상 엔트로피를 이용한 시선 인식 시스템의 구현)

  • Lee, Kue-Bum;Chung, Dong-Keun;Hong, Kwang-Seok
    • The KIPS Transactions:PartB
    • /
    • v.16B no.2
    • /
    • pp.93-100
    • /
    • 2009
  • In this paper, we propose a Difference Image Entropy based gaze direction recognition system. The Difference Image Entropy is computed by histogram levels using the acquired difference image of current image and reference images or average images that have peak positions from $-255{\sim}+255$ to prevent information omission. There are two methods about the Difference Image Entropy based gaze direction. 1) The first method is to compute the Difference Image Entropy between an input image and average images of 45 images in each location of gaze, and to recognize the directions of user's gaze. 2) The second method is to compute the Difference Image Entropy between an input image and each 45 reference images, and to recognize the directions of user's gaze. The reference image is created by average image of 45 images in each location of gaze after receiving images of 4 directions. In order to evaluate the performance of the proposed system, we conduct comparison experiment with PCA based gaze direction system. The directions of recognition left-top, right-top, left-bottom, right-bottom, and we make an experiment on that, as changing the part of recognition about 45 reference images or average image. The experimental result shows that the recognition rate of Difference Image Entropy is 97.00% and PCA is 95.50%, so the recognition rate of Difference Image Entropy based system is 1.50% higher than PCA based system.

An Adaptive Data Compression Algorithm for Video Data (사진데이타를 위한 한 Adaptive Data Compression 방법)

  • 김재균
    • Journal of the Korean Institute of Telematics and Electronics
    • /
    • v.12 no.2
    • /
    • pp.1-10
    • /
    • 1975
  • This paper presents an adaptive data compression algorithm for video data. The coling complexity due to the high correlation in the given data sequence is alleviated by coding the difference data, sequence rather than the data sequence itself. The adaptation to the nonstationary statistics of the data is confined within a code set, which consists of two constant length cades and six modified Shannon.Fano codes. lt is assumed that the probability distributions of tile difference data sequence and of the data entropy are Laplacian and Gaussion, respectively. The adaptive coding performance is compared for two code selection criteria: entropy and $P_r$[difference value=0]=$P_0$. It is shown that data compression ratio 2 : 1 is achievable with the adaptive coding. The gain by the adaptive coding over the fixed coding is shown to be about 10% in compression ratio and 15% in code efficiency. In addition, $P_0$ is found to he not only a convenient criterion for code selection, but also such efficient a parameter as to perform almost like entropy.

  • PDF

Reliability evaluation of water distribution network considering mechanical characteristics using informational entropy

  • Kashani, Mostafa Ghanbari;Hosseini, Mahmood;Aziminejad, Armin
    • Structural Engineering and Mechanics
    • /
    • v.58 no.1
    • /
    • pp.21-38
    • /
    • 2016
  • Many studies have been carried out to investigate the important factors in calculating the realistic entropy amount of water distribution networks, but none of them have considered both mechanical and hydraulic characteristics of the networks. Also, the entropy difference in various networks has not been calculated exactly. Therefore, this study suggested a modified entropy function to calculate the informational entropy of water distribution networks so that the order of demand nodes and entropy difference among various networks could be calculated by taking into account both mechanical and hydraulic characteristics of the network. This modification was performed through defining a coefficient in the entropy function as the amount of outflow at each node to all dissipated power in the network. Hence, a more realistic method for calculating entropy was presented by considering both mechanical and hydraulic characteristics of network while keeping simplicity. The efficiency of the suggested method was evaluated by calculating the entropy of some sample water networks using the modified function.

THE UNIFORM CLT FOR MARTINGALE DIFFERENCE ARRAYS UNDER THE UNIFORMLY INTEGRABLE ENTROPY

  • Bae, Jong-Sig;Jun, Doo-Bae;Levental, Shlomo
    • Bulletin of the Korean Mathematical Society
    • /
    • v.47 no.1
    • /
    • pp.39-51
    • /
    • 2010
  • In this paper we consider the uniform central limit theorem for a martingale-difference array of a function-indexed stochastic process under the uniformly integrable entropy condition. We prove a maximal inequality for martingale-difference arrays of process indexed by a class of measurable functions by a method as Ziegler [19] did for triangular arrays of row wise independent process. The main tools are the Freedman inequality for the martingale-difference and a sub-Gaussian inequality based on the restricted chaining. The results of present paper generalizes those of Ziegler [19] and other results of independent problems. The results also generalizes those of Bae and Choi [3] to martingale-difference array of a function-indexed stochastic process. Finally, an application to classes of functions changing with n is given.

Entropy Generation Minimization in MHD Boundary Layer Flow over a Slendering Stretching Sheet in the Presence of Frictional and Joule Heating

  • Afridi, Muhammad Idrees;Qasim, Muhammad;Khan, Ilyas
    • Journal of the Korean Physical Society
    • /
    • v.73 no.9
    • /
    • pp.1303-1309
    • /
    • 2018
  • In the present paper, we study the entropy analysis of boundary layer flow over a slender stretching sheet under the action of a non uniform magnetic field that is acting perpendicular to the flow direction. The effects of viscous dissipation and Joule heating are included in the energy equation. Using similarity transformation technique the momentum and thermal boundary layer equations to a system of nonlinear differential equations. Numerical solutions are obtained using the shooting and fourth-order Runge-Kutta method. The expressions for the entropy generation number and Bejan number are also obtained using a suggested similarity transformation. The main objective of this article is to investigate the effects of different governing parameters such as the magnetic parameter ($M^2$), Prandtl number (Pr), Eckert number (Ec), velocity index parameter (m), wall thickness parameter (${\alpha}$), temperature difference parameter (${\Omega}$), entropy generation number (Ns) and Bejan number (Be). All these effects are portrayed graphically and discussed in detail. The analysis reveals that entropy generation reduces with decreasing wall thickness parameter and increasing temperature difference between the stretching sheet and the fluid outside the boundary layer. The viscous and magnetic irreversibilities are dominant in the vicinity of the stretching surface.

Entropy-based Similarity Measures for Memory-based Collaborative Filtering

  • Kwon, Hyeong-Joon;Latchman, Haniph
    • International Journal of Internet, Broadcasting and Communication
    • /
    • v.5 no.2
    • /
    • pp.5-10
    • /
    • 2013
  • We proposed a novel similarity measure using weighted difference entropy (WDE) to improve the performance of the CF system. The proposed similarity metric evaluates the entropy with a preference score difference between the common rated items of two users, and normalizes it based on the Gaussian, tanh and sigmoid function. We showed significant improvement of experimental results and environments. These experiments involved changing the number of nearest neighborhoods, and we presented experimental results for two data sets with different characteristics, and results for the quality of recommendation.

THE SECOND CENTRAL LIMIT THEOREM FOR MARTINGALE DIFFERENCE ARRAYS

  • Bae, Jongsig;Jun, Doobae;Levental, Shlomo
    • Bulletin of the Korean Mathematical Society
    • /
    • v.51 no.2
    • /
    • pp.317-328
    • /
    • 2014
  • In Bae et al. [2], we have considered the uniform CLT for the martingale difference arrays under the uniformly integrable entropy. In this paper, we prove the same problem under the bracketing entropy condition. The proofs are based on Freedman inequality combined with a chaining argument that utilizes majorizing measures. The results of present paper generalize those for a sequence of stationary martingale differences. The results also generalize independent problems.