B. Hunyadi
Please Note
30 records found
1
Speckle noise occurs due to the coherent imaging of many microbubbles in one resolution cell. In existing methods, a low-rank matrix decomposition is applied to the DCEUS acquisitions using singular value decomposition, and the despeckling is done by keeping the highest few singular vectors and values. The DCEUS acquisitions come in a tensor format, rich with higher-order structure. The application of the matrixbased denoising technique does not utilize the original tensor structure. This dissertation focuses on despeckling through higher-order tensor decomposition methods. We tackle the following research question: "How can low-rank tensor decomposition methods be leveraged to effectively denoise DCEUS acquisitions of the prostate for improved prostate cancer detection?" We apply tensor decomposition methods that utilize orthogonal factors. In the spatial domain, the orthogonality allows the separation of the malignant and benign regions and the separation of the tissue and the vasculature. In the time domain, the orthogonality allows for capturing the components that correspond with the bubble movement and rejects the components related to the noise.
Despeckling of DCEUS through low-rank tensor decomposition has not been conducted before, and we propose tensor estimation algorithms for this application by utilizing established tensor decomposition frameworks. We start our research by modeling speckle noise as white Gaussian noise (WGN) with sparse outliers. We assess the performance of convex tensor estimation algorithms through simulation. We propose a novel weighting scheme for the soft-thresholding of the singular values. Instead of iterative thresholding, we can truncate the tensor and deviispeckle the DCEUS acquisitions. We propose a rank estimation method for DCEUS acquisitions. Instead of modeling speckle noise as WGN with sparse outliers, we minimize its negative log-likelihood and propose a gradient-based denoising algorithm.
Next, we investigate the classification performance of prostate cancer by comparing the proposed algorithms with the literature. We use the area under the receiver-operator characteristic curve (ROC-AUC) metric to assess the classification performance. For the voxel-based cancer diagnosis of 94 prostate cancer patients, truncated multilinear singular value decomposition has a better performance for the majority of the prostate cancer markers when the ROC-AUC metric is used. A rank estimation technique incorporating WGN with sparse outliers, followed by truncated multilinear singular value decomposition (tr-MLSVD), is the best-performing denoising method for DCEUS. In the context of the main research question, the cancer diagnosis performance of DCEUS acquisitions improves the majority of the time when a tensor-based denoising technique is used. On average, the tensor-based denoising techniques yield approximately a 1.6% relative improvement in the ROC-AUC metric compared to the literature. This translates to billions of additional correct voxel-level malignancy discriminations in our clinical study, which may significantly impact downstream classification and localization performance.
We conclude with a theoretical study on the lower bound of the tensor decomposition method that performs the best for despeckling DCEUS. We calculate a lower bound for estimating the components of MLSVD when the ranks are known. In general, the CCRB that lower bounds the variance of the unbiased estimates of the components of MLSVD does not exist due to the non-uniqueness of the decomposition. However, when the mode-n singular values are unique, the CCRB exists. Additionally, when the multilinear ranks are high and modal singular values are well-separated, it is a tight bound. Such cases do not typically occur with real data such as DCEUS, highlighting the limited modeling capability of the CCRB.
...
Speckle noise occurs due to the coherent imaging of many microbubbles in one resolution cell. In existing methods, a low-rank matrix decomposition is applied to the DCEUS acquisitions using singular value decomposition, and the despeckling is done by keeping the highest few singular vectors and values. The DCEUS acquisitions come in a tensor format, rich with higher-order structure. The application of the matrixbased denoising technique does not utilize the original tensor structure. This dissertation focuses on despeckling through higher-order tensor decomposition methods. We tackle the following research question: "How can low-rank tensor decomposition methods be leveraged to effectively denoise DCEUS acquisitions of the prostate for improved prostate cancer detection?" We apply tensor decomposition methods that utilize orthogonal factors. In the spatial domain, the orthogonality allows the separation of the malignant and benign regions and the separation of the tissue and the vasculature. In the time domain, the orthogonality allows for capturing the components that correspond with the bubble movement and rejects the components related to the noise.
Despeckling of DCEUS through low-rank tensor decomposition has not been conducted before, and we propose tensor estimation algorithms for this application by utilizing established tensor decomposition frameworks. We start our research by modeling speckle noise as white Gaussian noise (WGN) with sparse outliers. We assess the performance of convex tensor estimation algorithms through simulation. We propose a novel weighting scheme for the soft-thresholding of the singular values. Instead of iterative thresholding, we can truncate the tensor and deviispeckle the DCEUS acquisitions. We propose a rank estimation method for DCEUS acquisitions. Instead of modeling speckle noise as WGN with sparse outliers, we minimize its negative log-likelihood and propose a gradient-based denoising algorithm.
Next, we investigate the classification performance of prostate cancer by comparing the proposed algorithms with the literature. We use the area under the receiver-operator characteristic curve (ROC-AUC) metric to assess the classification performance. For the voxel-based cancer diagnosis of 94 prostate cancer patients, truncated multilinear singular value decomposition has a better performance for the majority of the prostate cancer markers when the ROC-AUC metric is used. A rank estimation technique incorporating WGN with sparse outliers, followed by truncated multilinear singular value decomposition (tr-MLSVD), is the best-performing denoising method for DCEUS. In the context of the main research question, the cancer diagnosis performance of DCEUS acquisitions improves the majority of the time when a tensor-based denoising technique is used. On average, the tensor-based denoising techniques yield approximately a 1.6% relative improvement in the ROC-AUC metric compared to the literature. This translates to billions of additional correct voxel-level malignancy discriminations in our clinical study, which may significantly impact downstream classification and localization performance.
We conclude with a theoretical study on the lower bound of the tensor decomposition method that performs the best for despeckling DCEUS. We calculate a lower bound for estimating the components of MLSVD when the ranks are known. In general, the CCRB that lower bounds the variance of the unbiased estimates of the components of MLSVD does not exist due to the non-uniqueness of the decomposition. However, when the mode-n singular values are unique, the CCRB exists. Additionally, when the multilinear ranks are high and modal singular values are well-separated, it is a tight bound. Such cases do not typically occur with real data such as DCEUS, highlighting the limited modeling capability of the CCRB.
Identifying Neural Signatures of Learning in Functional Ultrasound via Tensor Decomposition
Assessing Robustness to Data Quality Issues in Functional Ultrasound
A Novel Multivariate Hidden Markov Model Learning method using Coupled Canonical Polyadic Decomposition
Applied on the Sleep Physionet dataset to uncover sleep stages
HMMs represent the probability of transitions between different states of a system, which operates as a discrete Markov chain and is not directly observable. Additionally, they describe the probability of observing specific measurements based on the current state of the model. These probabilities are characterized by a state transition matrix (T), an emission matrix (O), and an initial state distribution (π).
The current methods for fitting HMMs to data primarily utilize the Baum-Welch algorithm, which is a specific type of Expectation Maximization (EM). One of the advantages of Baum-Welch is its ability to be extended to continuous observations or multivariate data. However, the algorithm involves a forward-backward pass during each iteration, which makes it increasingly slow as the size of the dataset grows. Moreover, it can easily become trapped in local minima.
An alternative approach is to use Canonical Polyadic Decomposition (CPD) to decompose a Joint Probability Tensor (JPT). This decomposition allows for the extraction of factor matrices that can be used to calculate the HMM matrices (T, O, π). Compared to the Baum-Welch algorithm, CPD and other JPT decomposition methods tend to be faster. However, they are often sensitive and may suffer from instability if the data does not fully capture the statistical behavior of the underlying HMM. Additionally, methods for JPT decomposition in HMM learning have not yet been extended to multivariate datasets or continuous settings.
To enhance stability and accommodate multivariate data, we propose a novel method that extends JPT decomposition HMM learning to a multivariate setting. This involves using a coupled CPD problem, where each observational sequence has a separate emission matrix (O) but shares a common state transition matrix (T). By transitioning from Baum-Welch to CPD, the process of learning HMMs can be significantly accelerated. Coupled CPD makes HMM learning more robust than Uncoupled CPD by relating the multivariate data through a common transition matrix T and initial distribution π. This improvement should enhance the iterability of HMM methods and make them more suitable for rapid prototyping in scientific research and the aforementioned fields.
We show in the results that Coupled CPD indeed outperforms both Uncoupled CPD and the industry-standard Baum-Welch, in most cases. It has improved stability over both methods, as well as significantly improving the calculation time, and results in higher accuracy when it comes to estimating the HMM matrices. Finally, more future improvements are suggested concerning calculation time and extensions.
...
HMMs represent the probability of transitions between different states of a system, which operates as a discrete Markov chain and is not directly observable. Additionally, they describe the probability of observing specific measurements based on the current state of the model. These probabilities are characterized by a state transition matrix (T), an emission matrix (O), and an initial state distribution (π).
The current methods for fitting HMMs to data primarily utilize the Baum-Welch algorithm, which is a specific type of Expectation Maximization (EM). One of the advantages of Baum-Welch is its ability to be extended to continuous observations or multivariate data. However, the algorithm involves a forward-backward pass during each iteration, which makes it increasingly slow as the size of the dataset grows. Moreover, it can easily become trapped in local minima.
An alternative approach is to use Canonical Polyadic Decomposition (CPD) to decompose a Joint Probability Tensor (JPT). This decomposition allows for the extraction of factor matrices that can be used to calculate the HMM matrices (T, O, π). Compared to the Baum-Welch algorithm, CPD and other JPT decomposition methods tend to be faster. However, they are often sensitive and may suffer from instability if the data does not fully capture the statistical behavior of the underlying HMM. Additionally, methods for JPT decomposition in HMM learning have not yet been extended to multivariate datasets or continuous settings.
To enhance stability and accommodate multivariate data, we propose a novel method that extends JPT decomposition HMM learning to a multivariate setting. This involves using a coupled CPD problem, where each observational sequence has a separate emission matrix (O) but shares a common state transition matrix (T). By transitioning from Baum-Welch to CPD, the process of learning HMMs can be significantly accelerated. Coupled CPD makes HMM learning more robust than Uncoupled CPD by relating the multivariate data through a common transition matrix T and initial distribution π. This improvement should enhance the iterability of HMM methods and make them more suitable for rapid prototyping in scientific research and the aforementioned fields.
We show in the results that Coupled CPD indeed outperforms both Uncoupled CPD and the industry-standard Baum-Welch, in most cases. It has improved stability over both methods, as well as significantly improving the calculation time, and results in higher accuracy when it comes to estimating the HMM matrices. Finally, more future improvements are suggested concerning calculation time and extensions.
In fUS, the increase in blood volume is measured by the intensity of the Doppler signal caused by the Doppler effect. To obtain relevant information from functional neuroimaging data, blind source separation (BSS) is often used. BSS is the separation of a set of source signals from a set of mixed signals, without the aid of information about the source signals or the mixing process. A commonly used BSS method for identifying brain networks and artifacts in functional neuroimaging techniques like fMRI is independent component analysis, which is a low-rank matrix decomposition. This work explores the use of canonical polyadic decomposition (CPD), a low-rank tensor decomposition, for BSS of fUS data. The CPD approximates a 3rd-order tensor, consisting of a space, frequency, and time dimension, by a sum of rank-1 tensors. The proposed method offers three key advantages that make it highly relevant to the field of fUS signal processing: 1) Tensor-based BSS by CPD allows for frequency as a third dimension to complement the spatial and temporal dimensions; 2) Tensor-based BSS by CPD allows for the use of all raw fUS data (compound images) rather than only power doppler images, exploiting more available information; and 3) Tensor-based BSS by CPD allows for a BSS method without strong constraints such as the case with matrix-based methods like independent component analysis. The full processing pipeline developed in this work consists of four distinct stages. In stage one, pre-processing is carried out through SVD filtering, temporal demeaning, and pixel-based normalization. During the SVD filtering, normalization of the singular values is performed, which is novel. In stage two, compression is performed using truncated multilinear singular value decomposition. In stage three, BSS is carried out using CPD on the compressed data. In stage four, stable components are extracted by running the CPD 100 times and clustering the resulting components. These clusters were then averaged to create mean components. The CPD rank was estimated based on two quantifiable aspects: 1) Correlation between mean components and 2) Frequency of occurrence of mean components. The method is entirely data-driven, can be applied to entire raw fUS datasets, and can run on a laptop with standard RAM. Application to task experiment data of a mouse verified that activity that is temporally correlated with the stimulus can be extracted in expected regions. The components also indicate expected functional connectivity, which is often not the case for matrix-based methods. Moreover, frequency spectra showed different characteristics for different types of components, which displays the relevance of this dimension for BSS, especially for nuisance components. In conclusion, the proposed tensor-based blind source separation pipeline for raw fUS data was able to identify artifacts and meaningful neurological components based on distinctive characteristics in the temporal, spatial, and spectral domains. This work serves as a starting point for more advanced denoising, the identification of novel brain networks, and the comparison of brain networks across healthy and pathological conditions. Nevertheless, further research is necessary to ensure the utility of the method. ...
In fUS, the increase in blood volume is measured by the intensity of the Doppler signal caused by the Doppler effect. To obtain relevant information from functional neuroimaging data, blind source separation (BSS) is often used. BSS is the separation of a set of source signals from a set of mixed signals, without the aid of information about the source signals or the mixing process. A commonly used BSS method for identifying brain networks and artifacts in functional neuroimaging techniques like fMRI is independent component analysis, which is a low-rank matrix decomposition. This work explores the use of canonical polyadic decomposition (CPD), a low-rank tensor decomposition, for BSS of fUS data. The CPD approximates a 3rd-order tensor, consisting of a space, frequency, and time dimension, by a sum of rank-1 tensors. The proposed method offers three key advantages that make it highly relevant to the field of fUS signal processing: 1) Tensor-based BSS by CPD allows for frequency as a third dimension to complement the spatial and temporal dimensions; 2) Tensor-based BSS by CPD allows for the use of all raw fUS data (compound images) rather than only power doppler images, exploiting more available information; and 3) Tensor-based BSS by CPD allows for a BSS method without strong constraints such as the case with matrix-based methods like independent component analysis. The full processing pipeline developed in this work consists of four distinct stages. In stage one, pre-processing is carried out through SVD filtering, temporal demeaning, and pixel-based normalization. During the SVD filtering, normalization of the singular values is performed, which is novel. In stage two, compression is performed using truncated multilinear singular value decomposition. In stage three, BSS is carried out using CPD on the compressed data. In stage four, stable components are extracted by running the CPD 100 times and clustering the resulting components. These clusters were then averaged to create mean components. The CPD rank was estimated based on two quantifiable aspects: 1) Correlation between mean components and 2) Frequency of occurrence of mean components. The method is entirely data-driven, can be applied to entire raw fUS datasets, and can run on a laptop with standard RAM. Application to task experiment data of a mouse verified that activity that is temporally correlated with the stimulus can be extracted in expected regions. The components also indicate expected functional connectivity, which is often not the case for matrix-based methods. Moreover, frequency spectra showed different characteristics for different types of components, which displays the relevance of this dimension for BSS, especially for nuisance components. In conclusion, the proposed tensor-based blind source separation pipeline for raw fUS data was able to identify artifacts and meaningful neurological components based on distinctive characteristics in the temporal, spatial, and spectral domains. This work serves as a starting point for more advanced denoising, the identification of novel brain networks, and the comparison of brain networks across healthy and pathological conditions. Nevertheless, further research is necessary to ensure the utility of the method.
We propose that TNs, with their ability to represent high-dimensional data through low-rank structures, can effectively alleviate the limitations of kernel machines. Our research is structured around three central inquiries: first, we examine how TNs can accelerate kernel machine scalability while accurately approximating kernel functions; second, we elucidate the theoretical links between TN-constrained kernel machines and Gaussian processes, providing insights into convergence and generalization; finally, we introduce a novel optimization framework characterizing a specific TN, the multi-linear singular value decomposition (MLSVD), in terms of primal and dual problems. ...
We propose that TNs, with their ability to represent high-dimensional data through low-rank structures, can effectively alleviate the limitations of kernel machines. Our research is structured around three central inquiries: first, we examine how TNs can accelerate kernel machine scalability while accurately approximating kernel functions; second, we elucidate the theoretical links between TN-constrained kernel machines and Gaussian processes, providing insights into convergence and generalization; finally, we introduce a novel optimization framework characterizing a specific TN, the multi-linear singular value decomposition (MLSVD), in terms of primal and dual problems.
Implementing brain-computer interfaces (BCIs) for neuromodulation presents significant challenges, particularly in terms of power consumption, area constraints, and computational complexity. The use of machine learning (ML), especially lightweight classifiers, is critical for overcoming these challenges. ML models can be trained to identify complex seizure patterns with high sensitivity and specificity, but their deployment in implantable devices requires careful consideration of hardware limitations.
This thesis addresses these challenges by employing an oblique tree estimator to develop a low-power, low-area seizure detection classifier that relies solely on temporal features to minimize hardware costs. Specifically, the Sparse Projection Oblique Randomer Forest (SPORF) variant is utilized, to enable multiplier-less classifications, along with a multi-path inference approach thereby reducing memory requirements. The proposed model achieves state-of-the-art performance in both patient-specific (98.78%/ 99.89% and 98.52%/99.91% sensitivity/specificity in the CHB-MIT and ETHZ databases, respectively) and patient-independent (92.26%/98.29% in the CHB-MIT database) seizure detection frameworks. Additionally, post-layout simulations of the synthesized design reveal a power consumption of 1.22 µW and an area of 0.0076 mm2, with an energy consumption of 7.58 nJ per classification using 40 nm CMOS technology.
...
Implementing brain-computer interfaces (BCIs) for neuromodulation presents significant challenges, particularly in terms of power consumption, area constraints, and computational complexity. The use of machine learning (ML), especially lightweight classifiers, is critical for overcoming these challenges. ML models can be trained to identify complex seizure patterns with high sensitivity and specificity, but their deployment in implantable devices requires careful consideration of hardware limitations.
This thesis addresses these challenges by employing an oblique tree estimator to develop a low-power, low-area seizure detection classifier that relies solely on temporal features to minimize hardware costs. Specifically, the Sparse Projection Oblique Randomer Forest (SPORF) variant is utilized, to enable multiplier-less classifications, along with a multi-path inference approach thereby reducing memory requirements. The proposed model achieves state-of-the-art performance in both patient-specific (98.78%/ 99.89% and 98.52%/99.91% sensitivity/specificity in the CHB-MIT and ETHZ databases, respectively) and patient-independent (92.26%/98.29% in the CHB-MIT database) seizure detection frameworks. Additionally, post-layout simulations of the synthesized design reveal a power consumption of 1.22 µW and an area of 0.0076 mm2, with an energy consumption of 7.58 nJ per classification using 40 nm CMOS technology.
However, applying subgroup analysis showed that the mice could not be clustered based on their response to the stimuli. Still, spectral clustering is more accurate in the simulations making it a promising alternative for automatic subgroup identification. Furthermore, combining spectral clustering with acIVA makes the results more interpretable due to constrained components not being subject to permutation ambiguity. ...
However, applying subgroup analysis showed that the mice could not be clustered based on their response to the stimuli. Still, spectral clustering is more accurate in the simulations making it a promising alternative for automatic subgroup identification. Furthermore, combining spectral clustering with acIVA makes the results more interpretable due to constrained components not being subject to permutation ambiguity.
Brain Disorder Analysis and Classification Using Tensor Representation of EEG Signals
By applying higher order extensions of linear discriminant analysis and regression
These waveforms are measured for each subject, EEG electrode, and in the case of MMN, for different stimuli, which naturally results in a tensor data structure. Algorithms for discriminant analysis and regression that are developed to be applied to tensors are described and altered to take into account the properties of the EEG data. Discriminant analysis can be used to improve classification algorithms that distinguish disorders, while regression can be used to predict variables such as test scores based on the measured data. The algorithms are first tested on simulated data, which shows they can have some merit. Classification rates improve in most simulated cases when the discriminant analysis is applied to the data. Regression can also reliably predict variables when strong correlations are present between the input tensor and output variable. Based on the data from the child brain facility, the discriminant analysis still improves classification rates in some cases, but not as significantly as on the simulated data. Regression using the algorithms described in this thesis is not useful in predicting test scores from other experiments done with the subjects. \newline
The algorithms are also dissected to discover which specific features in the data tensor are weighted heavier by the algorithms. This is done to gain new insights into the differences between the disorders. When comparing the weights that are used for the simulated data with the features that are of importance, there is some relation, but not a very strong one. When the input tensor is however segmented in the time mode, the times of interest can be identified. The regression algorithm also resulted in weights that can be analysed to look at when and where the measurements relate to the output, but this did not show any interesting results. For real data, the segmented tensor resulted in some interesting insights about the differences between the various disorders.\newline
For the current dataset, the discriminant analysis algorithms do improve classification rates, but not by much. The features weighted the most by this algorithm in combination with a segmented tensor might give some insight into the disorders. The tensor regression methods do not work to predict a test score and do not give new insights into the disorders. ...
These waveforms are measured for each subject, EEG electrode, and in the case of MMN, for different stimuli, which naturally results in a tensor data structure. Algorithms for discriminant analysis and regression that are developed to be applied to tensors are described and altered to take into account the properties of the EEG data. Discriminant analysis can be used to improve classification algorithms that distinguish disorders, while regression can be used to predict variables such as test scores based on the measured data. The algorithms are first tested on simulated data, which shows they can have some merit. Classification rates improve in most simulated cases when the discriminant analysis is applied to the data. Regression can also reliably predict variables when strong correlations are present between the input tensor and output variable. Based on the data from the child brain facility, the discriminant analysis still improves classification rates in some cases, but not as significantly as on the simulated data. Regression using the algorithms described in this thesis is not useful in predicting test scores from other experiments done with the subjects. \newline
The algorithms are also dissected to discover which specific features in the data tensor are weighted heavier by the algorithms. This is done to gain new insights into the differences between the disorders. When comparing the weights that are used for the simulated data with the features that are of importance, there is some relation, but not a very strong one. When the input tensor is however segmented in the time mode, the times of interest can be identified. The regression algorithm also resulted in weights that can be analysed to look at when and where the measurements relate to the output, but this did not show any interesting results. For real data, the segmented tensor resulted in some interesting insights about the differences between the various disorders.\newline
For the current dataset, the discriminant analysis algorithms do improve classification rates, but not by much. The features weighted the most by this algorithm in combination with a segmented tensor might give some insight into the disorders. The tensor regression methods do not work to predict a test score and do not give new insights into the disorders.
EEG-Based Brain Computer Interface
Measurement and Data Collection
...
EEG-Based Brain Computer Interface
Decoding: A Deep Learning Approach
On publicly available datasets, the classification model produced promising performance, achieving 55% on the BCI Competition IV-2a (4 class) dataset and 78% on the BCI IV-2a (2 class) dataset. The model has not yet been tested on self-collected data. ...
On publicly available datasets, the classification model produced promising performance, achieving 55% on the BCI Competition IV-2a (4 class) dataset and 78% on the BCI IV-2a (2 class) dataset. The model has not yet been tested on self-collected data.
EEG-MI-CNN-LSTM-Transformer demonstrated promising results in capturing temporal dependencies, with an accuracy of 80% for all subjects and 92% for a single subject on average. Future work includes enhancing user-specific model implementation, applying Independent Component Analysis (ICA) for cleaner data, and improving data pre-processing to minimize noise. ...
EEG-MI-CNN-LSTM-Transformer demonstrated promising results in capturing temporal dependencies, with an accuracy of 80% for all subjects and 92% for a single subject on average. Future work includes enhancing user-specific model implementation, applying Independent Component Analysis (ICA) for cleaner data, and improving data pre-processing to minimize noise.
The Ultracortex and relevant software were used to determine the sensor layout, with the placement of the sensors focused on areas which exhibited high cortical activity during motor execution. Experiments were strategically designed to optimize our chance of successful readings and OpenVIBE was used in conjecture with preprocessing filters to save the raw and filtered data which was further sent to the Machine Learning group.
The collected data was analyzed through Spectrograms, Power Spectral Density(PSD) and Event-Related Desynchronization/Synchronization(ERDS) plots. The analysis aimed to confirm whether the desired activity occurred and whether the observed patterns resemble those documented in other research papers.
The data from the headset is live-streamed to the interface via Lab Streaming Layer(LSL) where it undergoes further filtering before being sent to the Machine learning group. This process was done through python libraries which then allowed for efficient and effective communication between the other groups. ...
The Ultracortex and relevant software were used to determine the sensor layout, with the placement of the sensors focused on areas which exhibited high cortical activity during motor execution. Experiments were strategically designed to optimize our chance of successful readings and OpenVIBE was used in conjecture with preprocessing filters to save the raw and filtered data which was further sent to the Machine Learning group.
The collected data was analyzed through Spectrograms, Power Spectral Density(PSD) and Event-Related Desynchronization/Synchronization(ERDS) plots. The analysis aimed to confirm whether the desired activity occurred and whether the observed patterns resemble those documented in other research papers.
The data from the headset is live-streamed to the interface via Lab Streaming Layer(LSL) where it undergoes further filtering before being sent to the Machine learning group. This process was done through python libraries which then allowed for efficient and effective communication between the other groups.
Functional ultrasound is a neuroimaging technique that has emerged in the last decade, and has gained remarkable attention since then. The popularity of this technique stems from its portability, high resolution and affordability. Functional ultrasound can detect subtle fluctuations in local blood dynamics, which serve as delayed indicators of the underlying changes in neuronal activity. The goal of this thesis is to develop novel signal models and processing algorithms that can reveal the spatial and temporal characteristics of hemodynamic activity induced by external stimuli using functional ultrasound.
Existing techniques that explore how the brain reacts in response to stimuli model the design variables using a linear time-invariant system with binarized input representations, marking when a stimulus is on or off. However, experimental evidence suggests that the brain reacts in a more intricate manner. While some regions exhibit consistent responses to repeated stimuli, others can show substantial variation even when exposed to the same stimulus seconds apart. In our in-vivo experiments, we particularly focus on key regions within the mouse visual processing pathway, which are analogous to those in the human brain. We track how visual information flows across these areas, and propose methods that can incorporate the spatiotemporal variability of brain responses when identifying evoked activity. Using these methods, we show that functional ultrasound can capture the dynamic nature of brain responses with high spatial and temporal resolution, and provide us with further insights into the functional organization of the brain. Future directions of this dissertation include multimodal processing of the functional ultrasound signal together with neuronal activity, aiming to enhance our understanding of neurovascular coupling. ...
Functional ultrasound is a neuroimaging technique that has emerged in the last decade, and has gained remarkable attention since then. The popularity of this technique stems from its portability, high resolution and affordability. Functional ultrasound can detect subtle fluctuations in local blood dynamics, which serve as delayed indicators of the underlying changes in neuronal activity. The goal of this thesis is to develop novel signal models and processing algorithms that can reveal the spatial and temporal characteristics of hemodynamic activity induced by external stimuli using functional ultrasound.
Existing techniques that explore how the brain reacts in response to stimuli model the design variables using a linear time-invariant system with binarized input representations, marking when a stimulus is on or off. However, experimental evidence suggests that the brain reacts in a more intricate manner. While some regions exhibit consistent responses to repeated stimuli, others can show substantial variation even when exposed to the same stimulus seconds apart. In our in-vivo experiments, we particularly focus on key regions within the mouse visual processing pathway, which are analogous to those in the human brain. We track how visual information flows across these areas, and propose methods that can incorporate the spatiotemporal variability of brain responses when identifying evoked activity. Using these methods, we show that functional ultrasound can capture the dynamic nature of brain responses with high spatial and temporal resolution, and provide us with further insights into the functional organization of the brain. Future directions of this dissertation include multimodal processing of the functional ultrasound signal together with neuronal activity, aiming to enhance our understanding of neurovascular coupling.
The Otolaryngology department at the Child Brain Lab focuses on auditory-related potentials (ERPs) obtained from EEG measurements to predict the future development of children with brain disorders. Analyzing ERP data from experiments like Mismatch Negativity (MMN) and Acoustic Change Complex (ACC) yields insights into developmental trajectories and connections between hearing, language, and brain development.
This thesis aims to explore alternative methodologies for extracting comprehensive information from ERPs, overcoming limitations of the commonly used peak amplitude and latency analysis. Tensor decompositions are employed to exploit structural information present in the data, using data fusion methods to combine multiple datasets for improved classification and deeper insights into group differences.
Simulations on artificial ERP data demonstrate that data fusion methods perform better on two ERP tensors compared to single tensor decomposition when group differences are shared between datasets. On a real dataset, tensor decompositions show promise for classifying subjects based on auditory event-related potentials while giving more insights into the neurological sources.
This report proposes an alternative method for analyzing ERP data, highlighting the potential of tensor decompositions and data fusion techniques. ...
The Otolaryngology department at the Child Brain Lab focuses on auditory-related potentials (ERPs) obtained from EEG measurements to predict the future development of children with brain disorders. Analyzing ERP data from experiments like Mismatch Negativity (MMN) and Acoustic Change Complex (ACC) yields insights into developmental trajectories and connections between hearing, language, and brain development.
This thesis aims to explore alternative methodologies for extracting comprehensive information from ERPs, overcoming limitations of the commonly used peak amplitude and latency analysis. Tensor decompositions are employed to exploit structural information present in the data, using data fusion methods to combine multiple datasets for improved classification and deeper insights into group differences.
Simulations on artificial ERP data demonstrate that data fusion methods perform better on two ERP tensors compared to single tensor decomposition when group differences are shared between datasets. On a real dataset, tensor decompositions show promise for classifying subjects based on auditory event-related potentials while giving more insights into the neurological sources.
This report proposes an alternative method for analyzing ERP data, highlighting the potential of tensor decompositions and data fusion techniques.
This thesis explores and compares different state-of-art clutter filtering techniques on freehand in-vivo µDoppler imaging of the human brain. Specifically, Singular Value Decomposition (SVD), Robust Principle Component Analysis (Robust PCA), and Independent Component Analysis (ICA) clutter filtering techniques have been investigated. The aim is to test and compare their performance on in-vivo µDoppler ultrasound data with freehand probe movement and understand how freehand motion affects the threshold selection criteria. Besides that, a newly proposed method that combines ICA clutter filtering and clustering is included in this thesis to bring another perspective for sorting independent components corresponding to blood flow and rejecting unwanted ones consisting mostly of tissue clutter signals. ...
This thesis explores and compares different state-of-art clutter filtering techniques on freehand in-vivo µDoppler imaging of the human brain. Specifically, Singular Value Decomposition (SVD), Robust Principle Component Analysis (Robust PCA), and Independent Component Analysis (ICA) clutter filtering techniques have been investigated. The aim is to test and compare their performance on in-vivo µDoppler ultrasound data with freehand probe movement and understand how freehand motion affects the threshold selection criteria. Besides that, a newly proposed method that combines ICA clutter filtering and clustering is included in this thesis to bring another perspective for sorting independent components corresponding to blood flow and rejecting unwanted ones consisting mostly of tissue clutter signals.
The main purpose of this report is to find out whether the OpenBCI "Ultracortex Mark IV" Electroencephalogram (EEG) headset is capable of differentiating EEG-signals of motor execution from neutral state with recorded data and to find out whether it can differ motor executions between left and right hand. Next to that, it is to be determined whether the OpenBCI headset was the optimal one for this purpose.
Method
First, the specifications of different headsets were compared. Afterwards, a montage of the electrodes was designed to detect motor execution and motor imagery, mainly centered around the locations C3, Cz and C4, on the top of the scalp. The software "Openvibe" was used to extract data from the headset during experiments and to record it in a csv file. A subject was asked to follow a video with a sound cue followed by a visual cue instructing to move either its left hand or right hand.
Result
Merging the left and right hand trial data together, the result is that the headset shows in the alpha band (7-12 Hz) mostly a decrease (ERD) in magnitude around the visual cue, sometimes followed by a bigger increase in magnitude (ERS). Looking at the extremes after the cue, it is seen that mostly the difference in magnitude is around a factor 1.5 compared to the average magnitude of before the visual cue. Splitting the trial data between left and right hand, similar results can be seen, but one hand produces slightly more ERD or ERS than the other hand depending on the position of the electrode on the left or right hemisphere of the brain.
Conclusion
The OpenBCI headset can in fact detect a difference between movement of the hands and the neutral state. Differentiating between the movements of left and right hands seems possible from the results, but the difference in the signal of left and right hand is minimal. It is recommended to repeat the experiment with more trials and different subjects to get a more solid conclusion. ...
The main purpose of this report is to find out whether the OpenBCI "Ultracortex Mark IV" Electroencephalogram (EEG) headset is capable of differentiating EEG-signals of motor execution from neutral state with recorded data and to find out whether it can differ motor executions between left and right hand. Next to that, it is to be determined whether the OpenBCI headset was the optimal one for this purpose.
Method
First, the specifications of different headsets were compared. Afterwards, a montage of the electrodes was designed to detect motor execution and motor imagery, mainly centered around the locations C3, Cz and C4, on the top of the scalp. The software "Openvibe" was used to extract data from the headset during experiments and to record it in a csv file. A subject was asked to follow a video with a sound cue followed by a visual cue instructing to move either its left hand or right hand.
Result
Merging the left and right hand trial data together, the result is that the headset shows in the alpha band (7-12 Hz) mostly a decrease (ERD) in magnitude around the visual cue, sometimes followed by a bigger increase in magnitude (ERS). Looking at the extremes after the cue, it is seen that mostly the difference in magnitude is around a factor 1.5 compared to the average magnitude of before the visual cue. Splitting the trial data between left and right hand, similar results can be seen, but one hand produces slightly more ERD or ERS than the other hand depending on the position of the electrode on the left or right hemisphere of the brain.
Conclusion
The OpenBCI headset can in fact detect a difference between movement of the hands and the neutral state. Differentiating between the movements of left and right hands seems possible from the results, but the difference in the signal of left and right hand is minimal. It is recommended to repeat the experiment with more trials and different subjects to get a more solid conclusion.