• Title/Summary/Keyword: Improved entropy

Search Result 123, Processing Time 0.022 seconds

Improving Sample Entropy Based on Nonparametric Quantile Estimation

  • Park, Sang-Un;Park, Dong-Ryeon
    • Communications for Statistical Applications and Methods
    • /
    • v.18 no.4
    • /
    • pp.457-465
    • /
    • 2011
  • Sample entropy (Vasicek, 1976) has poor performance, and several nonparametric entropy estimators have been proposed as alternatives. In this paper, we consider a piecewise uniform density function based on quantiles, which enables us to evaluate entropy in each interval, and study the poor performance of the sample entropy in terms of the poor estimation of lower and upper quantiles. Then we propose some improved entropy estimators by simply modifying the quantile estimators, and compare their performances with some existing estimators.

Vertical Handoff Decision Algorithm combined Improved Entropy Weighting with GRA for Heterogeneous Wireless Networks

  • Zhao, Shasha;Wang, Fei;Ning, Yueqiang;Xiao, Yi;Zhang, Dengying
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.14 no.11
    • /
    • pp.4611-4624
    • /
    • 2020
  • Future network scenario will be a heterogeneous wireless network environment composed of multiple networks and multimode terminals (MMT). Seamless switching and optimal connectivity for MMT among different networks and different services become extremely important. Here, a vertical handoff algorithm combined an improved entropy weighting method based on grey relational analysis (GRA) is proposed. In which, the improved entropy weight method is used to obtain the objective weights of the network attributes, and GRA is done to rank the candidate networks in order to choose the best network. Through simulation and comparing the results with other vertical handoff decision algorithms, the number of handoffs and reversal phenomenon are reduced with the proposed algorithm, which shows a better performance.

An Improved Cross Entropy-Based Frequency-Domain Spectrum Sensing (Cross Entropy 기반의 주파수 영역에서 스펙트럼 센싱 성능 개선)

  • Ahmed, Tasmia;Gu, Junrong;Jang, Sung-Jeen;Kim, Jae-Moung
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.48 no.3
    • /
    • pp.50-59
    • /
    • 2011
  • In this paper, we present a spectrum sensing method by exploiting the relationship of previous and current detected data sets in frequency domain. Most of the traditional spectrum sensing methods only consider the current detected data sets of Primary User (PU). Previous state of PU is a kind of conditional probability that strengthens the reliability of the detector. By considering the relationship of the previous and current spectrum sensing, cross entropy-based spectrum sensing is proposed to detect PU signal more effectively, which has a strengthened performance and is robust. When previous detected signal is noise, the discriminating ability of cross entropy-based spectrum sensing is no better than conventional entropy-based spectrum sensing. To address this problem, we propose an improved cross entropy-based frequency-domain spectrum sensing. Regarding the spectrum sensing scheme, we have derived that the proposed method is superior to the cross entropy-based spectrum sensing. We proceed a comparison of the proposed method with the up-to-date entropy-based spectrum sensing in frequency-domain. The simulation results demonstrate the performance improvement of the proposed spectrum sensing method.

Deriving a New Divergence Measure from Extended Cross-Entropy Error Function

  • Oh, Sang-Hoon;Wakuya, Hiroshi;Park, Sun-Gyu;Noh, Hwang-Woo;Yoo, Jae-Soo;Min, Byung-Won;Oh, Yong-Sun
    • International Journal of Contents
    • /
    • v.11 no.2
    • /
    • pp.57-62
    • /
    • 2015
  • Relative entropy is a divergence measure between two probability density functions of a random variable. Assuming that the random variable has only two alphabets, the relative entropy becomes a cross-entropy error function that can accelerate training convergence of multi-layer perceptron neural networks. Also, the n-th order extension of cross-entropy (nCE) error function exhibits an improved performance in viewpoints of learning convergence and generalization capability. In this paper, we derive a new divergence measure between two probability density functions from the nCE error function. And the new divergence measure is compared with the relative entropy through the use of three-dimensional plots.

An Improved Defect Detection Algorithm of Jean Fabric Based on Optimized Gabor Filter

  • Ma, Shuangbao;Liu, Wen;You, Changli;Jia, Shulin;Wu, Yurong
    • Journal of Information Processing Systems
    • /
    • v.16 no.5
    • /
    • pp.1008-1014
    • /
    • 2020
  • Aiming at the defect detection quality of denim fabric, this paper designs an improved algorithm based on the optimized Gabor filter. Firstly, we propose an improved defect detection algorithm of jean fabric based on the maximum two-dimensional image entropy and the loss evaluation function. Secondly, 24 Gabor filter banks with 4 scales and 6 directions are created and the optimal filter is selected from the filter banks by the one-dimensional image entropy algorithm and the two-dimensional image entropy algorithm respectively. Thirdly, these two optimized Gabor filters are compared to realize the common defect detection of denim fabric, such as normal texture, miss of weft, hole and oil stain. The results show that the improved algorithm has better detection effect on common defects of denim fabrics and the average detection rate is more than 91.25%.

Improved Collaborative Filtering Using Entropy Weighting

  • Kwon, Hyeong-Joon
    • International Journal of Advanced Culture Technology
    • /
    • v.1 no.2
    • /
    • pp.1-6
    • /
    • 2013
  • In this paper, we evaluate performance of existing similarity measurement metric and propose a novel method using user's preferences information entropy to reduce MAE in memory-based collaborative recommender systems. The proposed method applies a similarity of individual inclination to traditional similarity measurement methods. We experiment on various similarity metrics under different conditions, which include an amount of data and significance weighting from n/10 to n/60, to verify the proposed method. As a result, we confirm the proposed method is robust and efficient from the viewpoint of a sparse data set, applying existing various similarity measurement methods and Significance Weighting.

  • PDF

An Improved Entropy Based Sensing by Exploring Phase Information

  • Lee, Haowei;Gu, Junrong;Sohn, Sung-Hwan;Jang, Sung-Jeen;Kim, Jae-Moung
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.35 no.9A
    • /
    • pp.896-905
    • /
    • 2010
  • In this paper, we present a new sensing method based on phase entropy. Entropy is a measurement which quantifies the information content contained in a signal. For the PSK modulation, the information is encoded in the phase of the transmitted signal. By focusing on phase, more information is collected during sensing, which suggests a superior performance. The sensing based on Phase entropy is not limited to PSK signal. We generalize it to PAM signal as well. It is more advantageous to detect the phase. The simulation results have confirmed the excellent performance of this novel sensing algorithm.

Crack identification with parametric optimization of entropy & wavelet transformation

  • Wimarshana, Buddhi;Wu, Nan;Wu, Christine
    • Structural Monitoring and Maintenance
    • /
    • v.4 no.1
    • /
    • pp.33-52
    • /
    • 2017
  • A cantilever beam with a breathing crack is studied to improve the breathing crack identification sensitivity by the parametric optimization of sample entropy and wavelet transformation. Crack breathing is a special bi-linear phenomenon experienced by fatigue cracks which are under dynamic loadings. Entropy is a measure, which can quantify the complexity or irregularity in system dynamics, and hence employed to quantify the bi-linearity/irregularity of the vibration response, which is induced by the breathing phenomenon of a fatigue crack. To improve the sensitivity of entropy measurement for crack identification, wavelet transformation is merged with entropy. The crack identification is studied under different sinusoidal excitation frequencies of the cantilever beam. It is found that, for the excitation frequencies close to the first modal frequency of the beam structure, the method is capable of detecting only 22% of the crack depth percentage ratio with respect to the thickness of the beam. Using parametric optimization of sample entropy and wavelet transformation, this crack identification sensitivity is improved up to 8%. The experimental studies are carried out, and experimental results successfully validate the numerical parametric optimization process.

Practical evaluation of encrypted traffic classification based on a combined method of entropy estimation and neural networks

  • Zhou, Kun;Wang, Wenyong;Wu, Chenhuang;Hu, Teng
    • ETRI Journal
    • /
    • v.42 no.3
    • /
    • pp.311-323
    • /
    • 2020
  • Encrypted traffic classification plays a vital role in cybersecurity as network traffic encryption becomes prevalent. First, we briefly introduce three traffic encryption mechanisms: IPsec, SSL/TLS, and SRTP. After evaluating the performances of support vector machine, random forest, naïve Bayes, and logistic regression for traffic classification, we propose the combined approach of entropy estimation and artificial neural networks. First, network traffic is classified as encrypted or plaintext with entropy estimation. Encrypted traffic is then further classified using neural networks. We propose using traffic packet's sizes, packet's inter-arrival time, and direction as the neural network's input. Our combined approach was evaluated with the dataset obtained from the Canadian Institute for Cybersecurity. Results show an improved precision (from 1 to 7 percentage points), and some application classification metrics improved nearly by 30 percentage points.

Compression and Enhancement of Medical Images Using Opposition Based Harmony Search Algorithm

  • Haridoss, Rekha;Punniyakodi, Samundiswary
    • Journal of Information Processing Systems
    • /
    • v.15 no.2
    • /
    • pp.288-304
    • /
    • 2019
  • The growth of telemedicine-based wireless communication for images-magnetic resonance imaging (MRI) and computed tomography (CT)-leads to the necessity of learning the concept of image compression. Over the years, the transform based and spatial based compression techniques have attracted many types of researches and achieve better results at the cost of high computational complexity. In order to overcome this, the optimization techniques are considered with the existing image compression techniques. However, it fails to preserve the original content of the diagnostic information and cause artifacts at high compression ratio. In this paper, the concept of histogram based multilevel thresholding (HMT) using entropy is appended with the optimization algorithm to compress the medical images effectively. However, the method becomes time consuming during the measurement of the randomness from the image pixel group and not suitable for medical applications. Hence, an attempt has been made in this paper to develop an HMT based image compression by utilizing the opposition based improved harmony search algorithm (OIHSA) as an optimization technique along with the entropy. Further, the enhancement of the significant information present in the medical images are improved by the proper selection of entropy and the number of thresholds chosen to reconstruct the compressed image.