Bayesian mixtures for modelling complex medical data : a case study in Parkinson’s disease

Mixture models are a flexible tool for unsupervised clustering that have found popularity in a vast array of research areas. In studies of medicine, the use of mixtures holds the potential to greatly enhance our understanding of patient responses through the identification of clinically meaningful clusters that, given the complexity of many data sources, may otherwise by intangible. Furthermore, when developed in the Bayesian framework, mixture models provide a natural means for capturing and propagating uncertainty in different aspects of a clustering solution, arguably resulting in richer analyses of the population under study. This thesis aims to investigate the use of Bayesian mixture models in analysing varied and detailed sources of patient information collected in the study of complex disease. The first aim of this thesis is to showcase the flexibility of mixture models in modelling markedly different types of data. In particular, we examine three common variants on the mixture model, namely, finite mixtures, Dirichlet Process mixtures and hidden Markov models. Beyond the development and application of these models to different sources of data, this thesis also focuses on modelling different aspects relating to uncertainty in clustering. Examples of clustering uncertainty considered are uncertainty in a patient’s true cluster membership and accounting for uncertainty in the true number of clusters present. Finally, this thesis aims to address and propose solutions to the task of comparing clustering solutions, whether this be comparing patients or observations assigned to different subgroups or comparing clustering solutions over multiple datasets. To address these aims, we consider a case study in Parkinson’s disease (PD), a complex and commonly diagnosed neurodegenerative disorder. In particular, two commonly collected sources of patient information are considered. The first source of data are on symptoms associated with PD, recorded using the Unified Parkinson’s Disease Rating Scale (UPDRS) and constitutes the first half of this thesis. The second half of this thesis is dedicated to the analysis of microelectrode recordings collected during Deep Brain Stimulation (DBS), a popular palliative treatment for advanced PD. Analysis of this second source of data centers on the problems of unsupervised detection and sorting of action potentials or "spikes" in recordings of multiple cell activity, providing valuable information on real time neural activity in the brain.

Non-invasive, quantitative analysis of drug mixtures in containers using spatially offset Raman spectroscopy (SORS) and multivariate statistical analysis

In this paper, spatially offset Raman spectroscopy (SORS) is demonstrated for non-invasively investigating the composition of drug mixtures inside an opaque plastic container. The mixtures consisted of three components including a target drug (acetaminophen or phenylephrine hydrochloride) and two diluents (glucose and caffeine). The target drug concentrations ranged from 5% to 100%. After conducting SORS analysis to ascertain the Raman spectra of the concealed mixtures, principal component analysis (PCA) was performed on the SORS spectra to reveal trends within the data. Partial least squares (PLS) regression was used to construct models that predicted the concentration of each target drug, in the presence of the other two diluents. The PLS models were able to predict the concentration of acetaminophen in the validation samples with a root-mean-square error of prediction (RMSEP) of 3.8% and the concentration of phenylephrine hydrochloride with an RMSEP of 4.6%. This work demonstrates the potential of SORS, used in conjunction with multivariate statistical techniques, to perform non-invasive, quantitative analysis on mixtures inside opaque containers. This has applications for pharmaceutical analysis, such as monitoring the degradation of pharmaceutical products on the shelf, in forensic investigations of counterfeit drugs, and for the analysis of illicit drug mixtures which may contain multiple components.

Agrobacterium-mediated transformation of indica rice cultivars using binary and superbinary vectors

The Agrobacterium-mediated transformation system was extended to two indica cultivars: a widely cultivated breeding line IR-64 and an elite basmati cultivar Karnal Local. Root tips and shoot tips of seedlings, and scutellar-calli derived from mature seeds showed high-efficiency Agrobacterium tumefaciens infection and stable transformation. In addition to the superbinary vector pTOK233 in Agrobacterium strain LBA4404, almost equally high levels of transformation were achieved with a relatively much smaller (13.1 kb) binary vector (pCAMBIA1301) in a supervirulent host strain AGL1. In both cases, as well as in both cultivars, while 60–90% of the infected explants produced calli resistant to the selectable agent hygromycin, 59–75% of such calli tested positive for GUS. A high level (400 μM) of acetosyringone in the preinduction medium for Agrobacterium and a higher level (500 μM) in the cocultivation medium was necessary for an enhancement in transformation frequency of the binary vector to levels comparable to a superbinary. Hygromycin-resistant calli could be produced from all the explants used. Transformants could be regenerated for both cultivars using the superbinary and binary vector, but only for calli of scutellar origin. In addition to the molecular confirmation of hpt and gus gene transfer and transcription, absence of gene sequences outside the transferred DNA (T-DNA) region confirmed absence of any long T-DNA transfer.

Real, complex, and binary semantic vectors

This paper presents a combined structure for using real, complex, and binary valued vectors for semantic representation. The theory, implementation, and application of this structure are all significant. For the theory underlying quantum interaction, it is important to develop a core set of mathematical operators that describe systems of information, just as core mathematical operators in quantum mechanics are used to describe the behavior of physical systems. The system described in this paper enables us to compare more traditional quantum mechanical models (which use complex state vectors), alongside more generalized quantum models that use real and binary vectors. The implementation of such a system presents fundamental computational challenges. For large and sometimes sparse datasets, the demands on time and space are different for real, complex, and binary vectors. To accommodate these demands, the Semantic Vectors package has been carefully adapted and can now switch between different number types comparatively seamlessly. This paper describes the key abstract operations in our semantic vector models, and describes the implementations for real, complex, and binary vectors. We also discuss some of the key questions that arise in the field of quantum interaction and informatics, explaining how the wide availability of modelling options for different number fields will help to investigate some of these questions.

Optical techniques for real-time binary multiplication

An optical system which performs the multiplication of binary numbers is described and proof-of-principle experiments are performed. The simultaneous generation of all partial products, optical regrouping of bit products, and optical carry look-ahead addition are novel features of the proposed scheme which takes advantage of the parallel operations capability of optical computers. The proposed processor uses liquid crystal light valves (LCLVs). By space-sharing the LCLVs one such system could function as an array of multipliers. Together with the optical carry look-ahead adders described, this would constitute an optical matrix-vector multiplier.

Kinetic energy of He atoms in liquid He-4-He-3 mixtures

Deep inelastic neutron scattering measurements on liquid 3He-4He mixtures in the normal phase have been performed on the VESUVIO spectrometer at the ISIS pulsed neutron source at exchanged wave vectors of about q≃120.0Å-1. The neutron Compton profiles J(y) of the mixtures were measured along the T=1.96K isotherm for 3He concentrations, x, ranging from 0.1 to 1.0 at saturated vapor pressures. Values of kinetic energies 〈T〉 of 3He and 4He atoms as a function of x, 〈T〉(x), were extracted from the second moment of J(y). The present determinations of 〈T〉(x) confirm previous experimental findings for both isotopes and, in the case of 3He, a substantial disagreement with theory is found. In particular 〈T〉(x) for the 3He atoms is found to be independent of concentration yielding a value 〈T〉3(x=0.1)≃12K, much lower than the value suggested by the most recent theoretical estimates of approximately 19 K.

Effect of pretreatment on saccharification of sugarcane bagasse by complex and simple enzyme mixtures

Saccharification of sugarcane bagasse pretreated at the pilot-scale with different processes (in combination with steam-explosion) was evaluated. Maximum glucan conversion with Celluclast 1.5 L (15–25 FPU/g glucan) was in the following order: glycerol/HCl > HCl > H2SO4 > NaOH, with the glycerol system achieving ∼100% conversion. Surprisingly, the NaOH substrate achieved optimum saccharification with only 8 FPU/g glucan. Glucan conversions (3.6–6%) obtained with mixtures of endo-1,4-β-glucanase (EG) and β-glucosidase (βG) for the NaOH substrate were 2–6 times that of acid substrates. However, glucan conversions (15–60%) obtained with mixtures of cellobiohydrolase (CBH I) and βG on acidified glycerol substrate were 10–30% higher than those obtained for NaOH and acid substrates. The susceptibility of the substrates to enzymatic saccharification was explained by their physical and chemical attributes. Acidified glycerol pretreatment offers the opportunity to simplify the complexity of enzyme mixtures required for saccharification of lignocellulosics.

Low temperature pretreatment of sugarcane bagasse at atmospheric pressure using mixtures of ethylene carbonate and ethylene glycol

A low temperature lignocellulose pretreatment process was developed using acid-catalysed mixtures of alkylene carbonate and alkylene glycol. Pretreatment of sugarcane bagasse with mixtures of ethylene carbonate (EC) and ethylene glycol (EG) was more effective than that with mixtures of propylene carbonate (PC) and propylene glycol (PG). These mixtures were more effective than the individual components in making bagasse cellulose more amenable to cellulase digestion. Glucan digestibilities of ≥87% could be achieved with a wide range of EC to EG ratios from 9:1 to 1:1 (w/w). Pretreatment of bagasse by the EC/EG mixture with a ratio of 4:1 in the presence of 1.2% H2SO4 at 90 °C for 30 min led to the highest glucan enzymatic digestibility of 93%. The high glucan digestibilities obtained under these acidic conditions were due to (a) the ability of alkylene carbonate to cause significant biomass size reduction, (b) the ability of alkylene glycol to cause biomass defibrillation, (c) the ability of alkylene carbonate and alkylene glycol to remove xylan and lignin, and (d) the magnified above attributes in the mixtures of alkylene carbonate and alkylene glycol.

Semi-binary based video features for activity representation

Efficient and effective feature detection and representation is an important consideration when processing videos, and a large number of applications such as motion analysis, 3D scene understanding, tracking etc. depend on this. Amongst several feature description methods, local features are becoming increasingly popular for representing videos because of their simplicity and efficiency. While they achieve state-of-the-art performance with low computational complexity, their performance is still too limited for real world applications. Furthermore, rapid increases in the uptake of mobile devices has increased the demand for algorithms that can run with reduced memory and computational requirements. In this paper we propose a semi binary based feature detectordescriptor based on the BRISK detector, which can detect and represent videos with significantly reduced computational requirements, while achieving comparable performance to the state of the art spatio-temporal feature descriptors. First, the BRISK feature detector is applied on a frame by frame basis to detect interest points, then the detected key points are compared against consecutive frames for significant motion. Key points with significant motion are encoded with the BRISK descriptor in the spatial domain and Motion Boundary Histogram in the temporal domain. This descriptor is not only lightweight but also has lower memory requirements because of the binary nature of the BRISK descriptor, allowing the possibility of applications using hand held devices.We evaluate the combination of detectordescriptor performance in the context of action classification with a standard, popular bag-of-features with SVM framework. Experiments are carried out on two popular datasets with varying complexity and we demonstrate comparable performance with other descriptors with reduced computational complexity.

Identifying steganographic payload location in binary image

In this paper, we propose a steganalysis method that is able to identify the locations of stego bearing pixels in the binary image. In order to do that, our proposed method will calculate the residual between a given stego image and its estimated cover image. After that, we will compute the local entropy difference between these two versions of images as well. Finally, we will compute the mean of residual and mean of local entropy difference across multiple stego images. From these two means, the locations of stego bearing pixels can be identified. The presented empirical results demonstrate that our proposed method can identify the stego bearing locations of near perfect accuracy when sufficient stego images are supplied. Hence, our proposed method can be used to reveal which pixels in the binary image have been used to carry the secret message.

Binary image steganographic techniques classification based on multi-class steganalysis

In this paper, we propose a new multi-class steganalysis for binary image. The proposed method can identify the type of steganographic technique used by examining on the given binary image. In addition, our proposed method is also capable of differentiating an image with hidden message from the one without hidden message. In order to do that, we will extract some features from the binary image. The feature extraction method used is a combination of the method extended from our previous work and some new methods proposed in this paper. Based on the extracted feature sets, we construct our multi-class steganalysis from the SVM classifier. We also present the empirical works to demonstrate that the proposed method can effectively identify five different types of steganography.

Blind steganalysis : a countermeasure for binary image steganography

In this paper, we propose a new blind steganalytic method to detect the presence of secret messages embedded in black and white images using the steganographic techniques. We start by extracting several sets of matrix, such as run length matrix, gap length matrix and pixel difference. We also apply characteristic function on these matrices to enhance their discriminative capabilities. Then we calculate the statistics which include mean, variance, kurtosis and skewness to form our feature sets. The presented empirical works demonstrate our proposed method can effectively detect three different types of steganography. This proves the universality of our proposed method as a blind steganalysis. In addition, the experimental results show our proposed method is capable of detecting small amount of the embedded message.

Estimating hidden message length in binary image embedded by using boundary pixels steganography

In this paper, we propose a new steganalytic method to detect the message hidden in a black and white image using the steganographic technique developed by Liang, Wang and Zhang. Our detection method estimates the length of hidden message embedded in a binary image. Although the hidden message embedded is visually imperceptible, it changes some image statistic (such as inter-pixels correlation). Based on this observation, we first derive the 512 patterns histogram from the boundary pixels as the distinguishing statistic, then we compute the histogram difference to determine the changes of the 512 patterns histogram induced by the embedding operation. Finally we propose histogram quotient to estimate the length of the embedded message. Experimental results confirm that the proposed method can effectively and reliably detect the length of the embedded message.