Andrii Kravtsiv

Mr. Andrii Kravtsiv

orcid

Research Focus & Metrics

Academic Career Length

11Years (2016-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
21 October 2019 in Entropy
Verified
Journal Article
Open access
PDF file
SBSebastian Berger
Sebastian Berger
AKAndrii Kravtsiv
Andrii Kravtsiv
GSGerhard Schneider
Gerhard Schneider
DJDenis Jordan
Denis Jordan
Ordinal patterns are the common basis of various techniques used in the study of dynamical systems and nonlinear time series analysis. The present article focusses on the computational problem of turning time series into sequences of ordinal patterns. In a first step, a numerical encoding scheme for ordinal patterns is proposed. Utilising the classical Lehmer code, it enumerates ordinal patterns by consecutive non-negative integers, starting from zero. This compact representation considerably simplifies working with ordinal patterns in the digital domain. Subsequently, three algorithms for the efficient extraction of ordinal patterns from time series are discussed, including previously published approaches that can be adapted to the Lehmer code. The respective strengths and weaknesses of those algorithms are discussed, and further substantiated by benchmark results. One of the algorithms stands out in terms of scalability: its run-time increases linearly with both the pattern order and the sequence length, while its memory footprint is practically negligible. These properties enable the study of high-dimensional pattern spaces at low computational cost. In summary, the tools described herein may improve the efficiency of virtually any ordinal pattern-based analysis method, among them quantitative measures like permutation entropy and symbolic transfer entropy, but also techniques like forbidden pattern identification. Moreover, the concepts presented may allow for putting ideas into practice that up to now had been hindered by computational burden. To enable smooth evaluation, a function library written in the C programming language, as well as language bindings and native implementations for various numerical computation environments are provided in the supplements.

22 June 2016 in IEEE Transactions on Medical Imaging
Verified
Journal Article
Closed access
STStratis Tzoumas
Stratis Tzoumas
AKAndrii Kravtsiv
Andrii Kravtsiv
YGYuan Gao
Yuan Gao
ABAndreas Buehler
Andreas Buehler
VNVasilis Ntziachristos
Vasilis Ntziachristos
Statistical sub-pixel detection via the adaptive matched filter (AMF) has been shown to improve the molecular imaging sensitivity and specificity of optoacoustic (photoacoustic) imaging. Applied to multispectral optoacoustic tomography (MSOT), AMF assumes that the spatially-varying tissue spectra follow a multivariate Gaussian distribution, that the spectrum of the target molecule is precisely known and that the molecular target lies in “low probability” within the data. However, when these assumptions are violated, AMF may result in considerable performance degradation. The objective of this work is to develop a robust statistical detection framework that is appropriately suited to the characteristics of MSOT molecular imaging. Using experimental imaging data, we perform a statistical characterization of MSOT tissue images and conclude to a detector that is based on the t-distribution. More importantly, we introduce a method for estimating the covariance matrix of the background-tissue statistical distribution, which enables robust detection performance independently of the molecular target size or intensity. The performance of the statistical detection framework is assessed through simulations and experimental in vivo measurements and compared to previously used methods.