• Title/Summary/Keyword: entropy measure

Search Result 203, Processing Time 0.039 seconds

Noise Source Localization by Applying MUSIC with Wavelet Transformation (웨이블렛 변환과 MUSIC 기법을 이용한 소음원 추적)

  • Cho, Tae-Hwan;Ko, Byeong-Sik;Lim, Jong-Myung
    • Transactions of the Korean Society of Automotive Engineers
    • /
    • v.16 no.2
    • /
    • pp.18-28
    • /
    • 2008
  • In inverse acoustic problem with nearfield sources, it is important to separate multiple acoustic sources and to measure the position of each target. This paper proposes a new algorithm by applying MUSIC(Multiple Signal Classification) to the outputs of discrete wavelet transformation with sub-band selection based on the entropy threshold, Some numerical experiments show that the proposed method can estimate the more precise positions than a conventional MUSIC algorithm under moderately correlated signal and relatively low signal-to-noise ratio case.

Dynamic Compressed Representation of Texts with Rank/Select

  • Lee, Sun-Ho;Park, Kun-Soo
    • Journal of Computing Science and Engineering
    • /
    • v.3 no.1
    • /
    • pp.15-26
    • /
    • 2009
  • Given an n-length text T over a $\sigma$-size alphabet, we present a compressed representation of T which supports retrieving queries of rank/select/access and updating queries of insert/delete. For a measure of compression, we use the empirical entropy H(T), which defines a lower bound nH(T) bits for any algorithm to compress T of n log $\sigma$ bits. Our representation takes this entropy bound of T, i.e., nH(T) $\leq$ n log $\sigma$ bits, and an additional bits less than the text size, i.e., o(n log $\sigma$) + O(n) bits. In compressed space of nH(T) + o(n log $\sigma$) + O(n) bits, our representation supports O(log n) time queries for a log n-size alphabet and its extension provides O(($1+\frac{{\log}\;{\sigma}}{{\log}\;{\log}\;n}$) log n) time queries for a $\sigma$-size alphabet.

Measurement of Discharge Using the Entropy Concept (엔트로피 개념에 의한 유량측정 기법)

  • Choo, Tai-Ho;Lee, Seung-Kwan
    • Proceedings of the Korea Contents Association Conference
    • /
    • 2006.05a
    • /
    • pp.342-346
    • /
    • 2006
  • The method presented is also efficient and applicable in estimating the discharge in high flows that are very difficult or impossible to measure before, due to technical or theoretical reasons. The method can drastically reduce the time and cost of measurement, regardless of the irregularity in the geometrical shape. With Microwave Water Surface Velocity Meter, An entropy based method for determining the discharge in the rivers can be used to develop real-time discharge measurement system (RDMS) which can carry out the real-time inflow hydrograph.

  • PDF

Information Theoretic Standardized Logistic Regression Coefficients with Various Coefficients of Determination

  • Hong Chong-Sun;Ryu Hyeon-Sang
    • Communications for Statistical Applications and Methods
    • /
    • v.13 no.1
    • /
    • pp.49-60
    • /
    • 2006
  • There are six approaches to constructing standardized coefficient for logistic regression. The standardized coefficient based on Kruskal's information theory is known to be the best from a conceptual standpoint. In order to calculate this standardized coefficient, the coefficient of determination based on entropy loss is used among many kinds of coefficients of determination for logistic regression. In this paper, this standardized coefficient is obtained by using four kinds of coefficients of determination which have the most intuitively reasonable interpretation as a proportional reduction in error measure for logistic regression. These four kinds of the sixth standardized coefficient are compared with other kinds of standardized coefficients.

Mutual Information and Redundancy for Categorical Data

  • Hong, Chong-Sun;Kim, Beom-Jun
    • Communications for Statistical Applications and Methods
    • /
    • v.13 no.2
    • /
    • pp.297-307
    • /
    • 2006
  • Most methods for describing the relationship among random variables require specific probability distributions and some assumptions of random variables. The mutual information based on the entropy to measure the dependency among random variables does not need any specific assumptions. And the redundancy which is a analogous version of the mutual information was also proposed. In this paper, the redundancy and mutual information are explored to multi-dimensional categorical data. It is found that the redundancy for categorical data could be expressed as the function of the generalized likelihood ratio statistic under several kinds of independent log-linear models, so that the redundancy could also be used to analyze contingency tables. Whereas the generalized likelihood ratio statistic to test the goodness-of-fit of the log-linear models is sensitive to the sample size, the redundancy for categorical data does not depend on sample size but its cell probabilities itself.

An Implementation of the Olfactory Recognition Contents for Ubiquitous (유비쿼터스를 위한 후각 인식 컨텐츠 구현)

  • Lee, Hyeon Gu;Rho, Yong Wan
    • Journal of Korea Society of Digital Industry and Information Management
    • /
    • v.4 no.3
    • /
    • pp.85-90
    • /
    • 2008
  • Recently, with the sensor technology, research about the electronic nose system which imitated the olfactory organ are being pushed actively. But, in case of general electronic nose system, an aroma is measured at the laboratory space where blocked external environment and is analyzed a part of measured data. In this paper, we propose the system which can measure and recognize an aroma in natural environment. We propose the Entropy algorithm which can detect the sensor reaction section among the continuous detection processing about an aroma. And we implement the aroma recognition system using the PCA(Principal Components Analysis) and K-NN(K-Nearest Neighbor) about the detected aroma. In order to evaluate the performance, we measured the aroma pattern, about 9 aroma oil, 50 times respectively. And we experimented the aroma detection and recognition using this. There was an error of 0.2s in the aroma detection and we get 84.3% recognition rate of the aroma recognition.

Efficient Clustering Algorithm based on Data Entropy for Changing Environment (상황변화에 따른 엔트로피 기반의 클러스터 구성 알고리즘)

  • Choi, Yun-Jeong
    • Journal of the Korea Academia-Industrial cooperation Society
    • /
    • v.10 no.12
    • /
    • pp.3675-3681
    • /
    • 2009
  • One of the most important factors in the lifetime of WSN(Wireless Sensor Network) is the limited resources and static control problem of the sensor nodes. In order to achieve energy efficiency and network utilities, sensor nodes can be well organized into one cluster and selected head node and normal node by dynamic conditions. Various clustering algorithms have been proposed as an efficient way to organize method based on LEACH algorithm. In this paper, we propose an efficient clustering algorithm using information entropy theory based on LEACH algorithm, which is able to recognize environmental differences according to changes from data of sensor nodes. To measure and analyze the changes of clusters, we simply compute the entropy of sensor data and applied it to probability based clustering algorithm. In experiments, we simulate the proposed method and LEACH algorithm. We have shown that our data balanced and energy efficient scheme, has high energy efficiency and network lifetime in two conditions.

Information entropy based algorithm of sensor placement optimization for structural damage detection

  • Ye, S.Q.;Ni, Y.Q.
    • Smart Structures and Systems
    • /
    • v.10 no.4_5
    • /
    • pp.443-458
    • /
    • 2012
  • The structural health monitoring (SHM) benchmark study on optimal sensor placement problem for the instrumented Canton Tower has been launched. It follows the success of the modal identification and model updating for the Canton Tower in the previous benchmark study, and focuses on the optimal placement of vibration sensors (accelerometers) in the interest of bettering the SHM system. In this paper, the sensor placement problem for the Canton Tower and the benchmark model for this study are first detailed. Then an information entropy based sensor placement method with the purpose of damage detection is proposed and applied to the benchmark problem. The procedure that will be implemented for structural damage detection using the data obtained from the optimal sensor placement strategy is introduced and the information on structural damage is specified. The information entropy based method is applied to measure the uncertainties throughout the damage detection process with the use of the obtained data. Accordingly, a multi-objective optimal problem in terms of sensor placement is formulated. The optimal solution is determined as the one that provides equally most informative data for all objectives, and thus the data obtained is most informative for structural damage detection. To validate the effectiveness of the optimally determined sensor placement, damage detection is performed on different damage scenarios of the benchmark model using the noise-free and noise-corrupted measured information, respectively. The results show that in comparison with the existing in-service sensor deployment on the structure, the optimally determined one is capable of further enhancing the capability of damage detection.

A Method of Finding Hidden Key Users Based on Transfer Entropy in Microblog Network

  • Yin, Meijuan;Liu, Xiaonan;He, Gongzhen;Chen, Jing;Tang, Ziqi;Zhao, Bo
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.14 no.8
    • /
    • pp.3187-3200
    • /
    • 2020
  • Finding key users in microblog has been a research hotspot in recent years. There are two kinds of key users: obvious and hidden ones. Influence of the former is direct while that of the latter is indirect. Most of existing methods evaluate user's direct influence, so key users they can find usually obvious ones, and their ability to identify hidden key users is very low as hidden ones exert influence in a very covert way. Consequently, the algorithm of finding hidden key users based on topic transfer entropy, called TTE, is proposed. TTE algorithm believes that hidden key users are those normal users possessing a high covert influence on obvious ones. Firstly, obvious key users are discovered based on microblog propagation scale. Then, based on microblogs' topic similarity and time correlation, the transfer entropy from ordinary users' blogs to obvious key users is calculated and used to measure the covert influence. Finally, hidden influence degrees of ordinary users are comprehensively evaluated by combining above indicators with the influence of both ordinary users and obvious ones. We conducted experiments on Sina Weibo, and the results showed that TTE algorithm had a good ability to identify hidden key users.

State detection of explosive welding structure by dual-tree complex wavelet transform based permutation entropy

  • Si, Yue;Zhang, ZhouSuo;Cheng, Wei;Yuan, FeiChen
    • Steel and Composite Structures
    • /
    • v.19 no.3
    • /
    • pp.569-583
    • /
    • 2015
  • Recent years, explosive welding structures have been widely used in many engineering fields. The bonding state detection of explosive welding structures is significant to prevent unscheduled failures and even catastrophic accidents. However, this task still faces challenges due to the complexity of the bonding interface. In this paper, a new method called dual-tree complex wavelet transform based permutation entropy (DTCWT-PE) is proposed to detect bonding state of such structures. Benefiting from the complex analytical wavelet function, the dual-tree complex wavelet transform (DTCWT) has better shift invariance and reduced spectral aliasing compared with the traditional wavelet transform. All those characters are good for characterizing the vibration response signals. Furthermore, as a statistical measure, permutation entropy (PE) quantifies the complexity of non-stationary signals through phase space reconstruction, and thus it can be used as a viable tool to detect the change of bonding state. In order to more accurate identification and detection of bonding state, PE values derived from DTCWT coefficients are proposed to extract the state information from the vibration response signal of explosive welding structure, and then the extracted PE values serve as input vectors of support vector machine (SVM) to identify the bonding state of the structure. The experiments on bonding state detection of explosive welding pipes are presented to illustrate the feasibility and effectiveness of the proposed method.