The ENCEVIS algorithm in the EMU and the factors affecting its performance: Our experience

Aleksandre Tsereteli1, Natela Okujava1,2, Nikoloz Malashkhia1

  • 1Epilepsy and Sleep Centre, S. Khechinashvili University Hospital (SKUH), Georgia.

PubMed
Summary

ENCEVIS 1.7 shows reasonable seizure detection performance in epilepsy monitoring, with higher accuracy for focal seizures and longer durations. This automated tool can aid neurophysiologists by identifying seizure recordings, potentially reducing workload.

Related Concept Videos

Mechanistic Models: Compartment Models in Algorithms for Numerical Problem Solving01:29

Mechanistic Models: Compartment Models in Algorithms for Numerical Problem Solving

Mechanistic models play a crucial role in algorithms for numerical problem-solving, particularly in nonlinear mixed effects modeling (NMEM). These models aim to minimize specific objective functions by evaluating various parameter estimates, leading to the development of systematic algorithms. In some cases, linearization techniques approximate the model using linear equations.
In individual population analyses, different algorithms are employed, such as Cauchy's method, which uses a...
53
Cryo-electron Microscopy01:28

Cryo-electron Microscopy

Conventional electron microscopy (EM) involves dehydration, fixation, and staining of biological samples, which distorts the native state of biological molecules and results in several artifacts. Also, the high-energy electron beam damages the sample and makes it difficult to obtain high-resolution images. These issues can be addressed using cryo-EM, which uses frozen samples and gentler electron beams. The technique was developed by Jacques Dubochet, Joachim Frank, and Richard Henderson, for...
3.3K
Fast Fourier Transform01:10

Fast Fourier Transform

The Fast Fourier Transform (FFT) is a computational algorithm designed to compute the Discrete Fourier Transform (DFT) efficiently. By breaking down the calculations into smaller, manageable sections, the FFT significantly reduces the computational complexity involved. Direct computation of an N-point DFT requires N2 complex multiplications, whereas the FFT algorithm needs only (N/2)log⁡2N multiplications, offering a much faster performance.
The computational efficiency of the FFT becomes...
317