Concept

Approximate entropy

In statistics, an approximate entropy (ApEn) is a technique used to quantify the amount of regularity and the unpredictability of fluctuations over time-series data. For example, consider two series of data: Series A: (0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, ...), which alternates 0 and 1. Series B: (0, 1, 0, 0, 1, 0, 1, 0, 0, 1, 1, 1, 1, 0, 0, 1, ...), which has either a value of 0 or 1, chosen randomly, each with probability 1/2. Moment statistics, such as mean and variance, will not distinguish between these two series. Nor will rank order statistics distinguish between these series. Yet series A is perfectly regular: knowing a term has the value of 1 enables one to predict with certainty that the next term will have the value of 0. In contrast, series B is randomly valued: knowing a term has the value of 1 gives no insight into what value the next term will have. Regularity was originally measured by exact regularity statistics, which has mainly centered on various entropy measures. However, accurate entropy calculation requires vast amounts of data, and the results will be greatly influenced by system noise, therefore it is not practical to apply these methods to experimental data. ApEn was developed by Steve M. Pincus to handle these limitations by modifying an exact regularity statistic, Kolmogorov–Sinai entropy. ApEn was initially developed to analyze medical data, such as heart rate, and later spread its applications in finance, physiology, human factors engineering, and climate sciences. A comprehensive step-by-step tutorial with an explanation of the theoretical foundations of Approximate Entropy is available. The algorithm is: Step 1 Assume a time series of data . These are raw data values from measurements equally spaced in time. Step 2 Let be a positive integer, with , which represents the length of a run of data (essentially a window).Let be a positive real number, which specifies a filtering level.Let . Step 3 Define for each where . In other words, is an -dimensional vector that contains the run of data starting with .

Official source

https://en.wikipedia.org/wiki/Approximate_entropy

About this result

This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.

Related lectures (1)

Harmonic Oscillator: Numerical Stability Analysis

Explores numerical methods for the harmonic oscillator, focusing on stability and convergence in solving oscillatory systems.

Related publications (6)

Applications of the Transfinite Map for Parametrized Domain Decomposition

A big challenge in the last few years is to perform simulations of cardiovascular systems. Since it would be too computational expensive and complicated to simulate an entire blood circuit, an idea is to use a Domain Decomposition (DD) technique and to split it into many little parts. But these basic geometrical shapes can still differ quite a lot in forms and size. Therefore for each type of geometry we can define some very few reference geometries. Those reference geometries can then be deformed by a prop

2012

Spectral Entropy Feature in Multi-stream for Robust ASR

Hervé Bourlard

In recent papers, entropy computed from sub-bands of the spectrum was used as a feature for automatic speech recognition. In the present paper, we further study the sub-band spectral entropy features which can give the flatness/peakiness of the sub-band spectrum and in turn the position of the formants in the spectrum. The sub-band spectral entropy features are used in hybrid hidden Markov model/artificial neural network systems and are found to be noise robust. The spectral entropy features are investigate

IDIAP2005

Spectral Entropy Based Feature for Robust ASR

Hervé Bourlard

In general, entropy gives us a measure of the number of bits required to represent some information. When applied to probability mass function (PMF), entropy can also be used to measure the ``peakiness'' of a distribution. In this paper, we propose using the entropy of short time Fourier transform spectrum, normalised as PMF, as an additional feature for automatic speech recognition (ASR). It is indeed expected that a peaky spectrum, representation of clear formant structure in the case of voiced sounds, wi

2004

Related notebooks (3)

Modeling Epidemics with Signal Processing Techniques

Epidemics and Signal Processing[1]¶

                                      [2]Paolo Prandoni, [3]LCAV, EPFL

In [1]: import matplotlib.pyplot as plt import numpy as np import scipy.signal as sp import seaborn as sns sns.set() In [2]: plt.rcParams["figure.figsize"] = (14,4) The basic reproduction number[4]¶ The propagation mechanism of an epidemic such as the one caused by SARS-CoV-2 virus can be roughly modeled, at least in its inital phase, as a process in which each infected individ

Voice Transformation Techniques Using Digital Signal Processing

A Gallery of Voice Transformers[1]¶

                                      [2]Paolo Prandoni, [3]LCAV, EPFL

In this notebook we will explore various ways to implement a system that changes the voice of a speaker. Typical applications for these techniques, strictly sorted by plausibility, include international spy missions and prank telephone calls, and devices such as the one displayed here can be easily bought on the web... or in a novelty shop. No description has been provided for t

Whistle-Activated Keylock System Implementation

Whistling Keylock[1]¶ In this notebook we will implement a simple "whistle-activated" keylock, that is, an access control system where the password is a pre-defined melody. To program the lock, you record your musical passphrase and then, to open the lock, you whistle it back. Although the implementation will be simple and skip most of the fine details that would be necessary to produce a truly robust system, we need to take into account at least the following points: * The syste

Graph Chat

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.