Demo Data from EDBT 2026 / reviewers in the wild / expert
Aneta Stefanovska
dblp:01/8736
· DBLP profile ↗
3ranked-venue papers
0as first author
0since 2021 · last 2018
0000-0001-6952-8370ORCID · corroborated
Domains — the database's venue-derived domains; a paper can count in several
Security and privacy · 1Graphics, computer vision, multimedia, augmented reality and games · 1Applied, interdisciplinary, general and emerging computing · 1
Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.
| Interdisciplinary, comprehensive, and emerging computing
1 paper |
Computational science and engineering · 50% Medical and health informatics · 50% | |
| Artificial intelligence
1 paper |
Probabilistic and Bayesian machine learning · 100% |
Topics — the 2 heaviest of 4, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Medical and health informatics
biomedical signal processing |
0.2 | 1 | 2016 | Reconstructing Time-Dependent Dynamics · Proc. IEEE 2016 |
Machine learning › Probabilistic and Bayesian machine learning › statistical inference › bayesian inference
dynamic bayesian inference |
0.1 | 1 | 2016 | Reconstructing Time-Dependent Dynamics · Proc. IEEE 2016 |
Methods — techniques the papers use, named apart from their topics
dynamical bayesian inference · 0.8time-frequency analysis · 0.5decomposition · 0.5coherence analysis · 0.5coupling function · 0.3
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2018 | Experimental Realization of the Coupling Function Secure Communications Protocol and Analysis of Its Noise RobustnessabstractThere is an increasing need for everyday communications to be both secure and resistant to external perturbations. We have, therefore, created an experimental implementation of the coupling-function-based secure communication protocol in order to assess its robustness to channel noise. The transmitter and receiver are implemented on single-board computers, thereby facilitating communication of the analog electronic signals. The information signals are encrypted at the transmitter as the time-variability of nonlinear coupling functions between dynamical systems. This results in a complicated nonlinear mixing and scrambling of the information. To replicate the channel noise, analog white noise is added to the encrypted signals. After digitization at the receiver, the decryption is performed with dynamical Bayesian inference to take account of time-varying dynamics in the presence of noise. The dynamical Bayesian approach effectively separates the deterministic information signals from the perturbations of dynamical channel noise. The experimental realization has demonstrated the feasibility, and established the performance, of the protocol for secure, reliable, communication even with high levels of channel noise. Gorjan Nadzinski, Matej Dobrevski, Peter V. E. McClintock, Aneta Stefanovska, Mile J. Stankovski, Tomislav Stankovski |
IEEE Trans. Inf. Forensics Secur. | 5 |
| 2016 | Reconstructing Time-Dependent DynamicsabstractThe usefulness of the information contained in biomedical data relies heavily on the reliability and accuracy of the methods used for its extraction. The conventional assumptions of stationarity and autonomicity break down in the case of living systems because they are thermodynamically open, and thus constantly interacting with their environments. This leads to an inherent time-variability and results in highly nonlinear, time-dependent dynamics. The aim of signal analysis usually is to gain insight into the behavior of the system from which the signal originated. Here, a range of signal analysis methods is presented and applied to extract information about time-varying oscillatory modes and their interactions. Methods are discussed for the characterization of signals and their underlying nonautonomous dynamics, including time-frequency analysis, decomposition, coherence analysis and dynamical Bayesian inference to study interactions and coupling functions. They are illustrated by being applied to cardiovascular and EEG data. The recent introduction of chronotaxic systems provides a theoretical framework within which dynamical systems can have amplitudes and frequencies which are time-varying, yet remain stable, matching well the characteristics of life. We demonstrate that, when applied in the context of chronotaxic systems, the methods presented facilitate the accurate extraction of the system dynamics over many scales of time and space. Philip T. Clemson, Gemma Lancaster, Aneta Stefanovska |
Proc. IEEE | 3 |
| 2016 | Extraction of instantaneous frequencies from ridges in time-frequency representations of signalsabstractIn signal processing applications, it is often necessary to extract oscillatory components and their properties from time–frequency representations, e.g. the windowed Fourier transform or wavelet transform. The first step in this procedure is to find an appropriate ridge curve: a sequence of amplitude peak positions (ridge points), corresponding to the component of interest and providing a measure of its instantaneous frequency. This is not a trivial issue, and the optimal method for extraction is still not settled or agreed. We discuss and develop procedures that can be used for this task and compare their performance on both simulated and real data. In particular, we propose a method which, in contrast to many other approaches, is highly adaptive so that it does not need any parameter adjustment for the signal to be analyzed. Being based on dynamic path optimization and fixed point iteration, the method is very fast, and its superior accuracy is also demonstrated. In addition, we investigate the advantages and drawbacks that synchrosqueezing offers in relation to curve extraction. The codes used in this work are freely available for download. Dmytro Iatsenko, Peter V. E. McClintock, Aneta Stefanovska |
Signal Process. | 3 |