Objective Support Vector Machines (SVM) have developed into a gold standard for accurate classification in Brain-Computer-Interfaces (BCI). The choice of the most appropriate classifier for a particular application depends on several characteristics in addition to decoding accuracy. Here we investigate the implementation of Hidden Markov Models (HMM)for online BCIs and discuss strategies to improve their performance. Approach We compare the SVM, serving as a reference, and HMMs for classifying discrete finger movements obtained from the Electrocorticograms of four subjects doing a finger tapping experiment. The classifier decisions are based on a subset of low-frequency time domain and high gamma oscillation features. Main results We show that decoding optimization between the two approaches is due to the way features are extracted and selected and less dependent on the classifier. An additional gain in HMM performance of up to 6% was obtained by introducing model constraints. Comparable accuracies of up to 90% were achieved with both SVM and HMM with the high gamma cortical response providing the most important decoding information for both techniques. Significance We discuss technical HMM characteristics and adaptations in the context of the presented data as well as for general BCI applications. Our findings suggest that HMMs and their characteristics are promising for efficient online brain-computer interfaces.

No abstract

For C-arm-based CB-CT, the algorithm presented here provides a solution for resorting to model-based perfusion reconstruction without its connected high computational cost. Thus, this algorithm is potentially able to have recourse to the benefit from model-based perfusion imaging for practical application. This study is a proof of concept.

The polychromatic X-ray spectrum and the energy-dependent attenuation coefficient of materials cause beam hardening artifacts in CT reconstructed volumes. These artifacts appear as cupping and streak artifacts depending on the material composition and the geometry of the imaged object. CT scanners employ projection linearization to transform polychromatic attenuation to monochromatic attenuation using a polynomial model. Polynomial coefficients are computed during calibration or using prior information such as X-ray spectrum and attenuation properties of the materials. In this paper, we are presenting a novel method to correct beam hardening artifacts by enforcing cone beam consistency conditions on the projection data. We used consistency conditions derived from Grangeat's fundamental relation between cone beam projection data and 3-D Radon transform. The optimal polynomial coefficients for artifact reduction are iteratively estimated by minimizing the inconsistency of a set of projection pairs. The results from simulated and real datasets show the visible reduction of artifacts. Our studies also demonstrate the robustness of the algorithm when the projections are perturbed with other physical measurement and geometrical errors. The proposed method requires neither calibration nor prior information like X-ray spectrum, attenuation properties of the materials and detector response. The algorithm can be used for beam hardening correction in clinical, pre-clinical, and industrial CT systems.

Model-based reconstruction employing the time separation technique (TST) was found to improve dynamic perfusion imaging of the liver using C-arm cone-beam computed tomography (CBCT). To apply TST using prior knowledge extracted from CT perfusion data, the liver should be accurately segmented from the CT scans. Reconstructions of primary and model-based CBCT data need to be segmented for proper visualisation and interpretation of perfusion maps. This research proposes Turbolift learning, which trains a modified version of the multi-scale Attention UNet on different liver segmentation tasks serially, following the order of the trainings CT, CBCT, CBCT TST -making the previous trainings act as pre-training stages for the subsequent ones -addressing the problem of limited number of datasets for training. For the final task of liver segmentation from CBCT TST, the proposed method achieved an overall Dice scores of 0.874±0.031 and 0.905±0.007 in 6-fold and 4-fold cross-validation experiments, respectively -securing statistically significant improvements over the model, which was trained only for that task. Experiments revealed that Turbolift not only improves the overall performance of the model but also makes it robust against artefacts originating from the embolisation materials and truncation artefacts. Additionally, in-depth analyses confirmed the order of the segmentation tasks. This paper shows the potential of segmenting the liver from CT, CBCT, and CBCT TST, learning from the available limited training data, which can possibly be used in the future for the visualisation and evaluation of the perfusion maps for the treatment evaluation of liver diseases.

No abstract

Heterogeneity among cells is a common characteristic of living systems. For mathematical modeling of heterogeneous cell populations, one typically has to reconstruct the underlying heterogeneity from measurements on the population level. Based on recent insights into the mathematical nature of this problem as an inverse problem of tomographic type, we evaluate numerical methods to perform such a reconstruction in basic case studies. We compare a kernel density based optimization approach, filtered back projection, and algebraic reconstruction techniques. The latter two are well established methods in computed tomography.

Background: CT perfusion imaging (CTP) is used in the diagnostic workup of acute ischemic stroke (AIS). CTP may be performed within the angio suite using flat detector CT (FDCT) to help reduce patient management time. Purpose: In order to significantly improve FDCT perfusion (FDCTP) imaging, data-processing algorithms need to be able to compensate for the higher levels of noise, slow rotation speed, and a lower frame rate of current FDCT devices. Methods: We performed a realistic simulation of FDCTP acquisition based on CTP data from seven subjects. We used the time separation technique (TST) as a model-based approach for FDCTP data processing. We propose a novel dimension reduction in which we approximate the time attenuation curves by a linear combination of trigonometric functions. Our goal was to show that the TST can be used even without prior assumptions on the shape of the attenuation profiles. Results:We first demonstrated that a trigonometric basis is suitable for dimension reduction of perfusion data. Using simulated FDCTP data, we have shown that a trigonometric basis in the TST provided better results than the classical straightforward processing even with additional noise. Average correlation coefficients of perfusion maps were improved for cerebral blood flow (CBF), cerebral blood volume, mean transit time (MTT) maps. In a moderate noise scenario, the average Pearson's coefficient for the CBF map was improved using the TST from 0.76 to 0.81. For the MTT map, it was improved from 0.37 to 0.45. Furthermore, we achieved a total processing time from the reconstruction of FDCTP data to the generation of perfusion maps of under 5 min. Conclusions: In our study cohort, perfusion maps created from FDCTP data using the TST with a trigonometric basis showed equivalent perfusion deficits to classic CT perfusion maps. It follows, that this novel FDCTP technique has potential to provide fast and accurate FDCTP imaging for AIS patients.