On stochastic dynamic modeling of incidence data

In this paper, a Markov Regime Switching Model of Conditional Mean with covariates, is proposed and investigated for the analysis of incidence rate data. The components of the model are selected by both penalized likelihood techniques in conjunction with the Expectation Maximization algorithm, with the goal of achieving a high level of robustness regarding the modeling of dynamic behaviors of epidemiological data. In addition to statistical inference, Changepoint Detection Analysis is performed for the selection of the number of regimes, which reduces the complexity associated with Likelihood Ratio Tests. Within this framework, a three-phase procedure for modeling incidence data is proposed and tested via real and simulated data.

Spatially-variant image deconvolution for photoacoustic tomography

Photoacoustic tomography (PAT) system can reconstruct images of biological tissues with high resolution and contrast. However, in practice, the PAT images are usually degraded by spatially variant blur and streak artifacts due to the non-ideal imaging conditions and chosen reconstruction algorithms. Therefore, in this paper, we propose a two-phase restoration method to progressively improve the image quality. In the first phase, we design a precise device and measuring method to obtain spatially variant point spread function samples at preset positions of the PAT system in image domain, then we adopt principal component analysis and radial basis function interpolation to model the entire spatially variant point spread function. Afterwards, we propose a sparse logarithmic gradient regularized Richardson-Lucy (SLG-RL) algorithm to deblur the reconstructed PAT images. In the second phase, we present a novel method called deringing which is also based on SLG-RL to remove the streak artifacts. Finally, we evaluate our method with simulation, phantom and in vivo experiments, respectively. All the results show that our method can significantly improve the quality of PAT images.

Dealing with missing values in proteomics data

Proteomics data are often plagued with missingness issues. These missing values (MVs) threaten the integrity of subsequent statistical analyses by reduction of statistical power, introduction of bias, and failure to represent the true sample. Over the years, several categories of missing value imputation (MVI) methods have been developed and adapted for proteomics data. These MVI methods perform their tasks based on different prior assumptions (e.g., data is normally or independently distributed) and operating principles (e.g., the algorithm is built to address random missingness only), resulting in varying levels of performance even when dealing with the same dataset. Thus, to achieve a satisfactory outcome, a suitable MVI method must be selected. To guide decision making on suitable MVI method, we provide a decision chart which facilitates strategic considerations on datasets presenting different characteristics. We also bring attention to other issues that can impact proper MVI such as the presence of confounders (e.g., batch effects) which can influence MVI performance. Thus, these too, should be considered during or before MVI.

Unsupervised collaborative learning based on Optimal Transport theory

Collaborative learning has recently achieved very significant results. It still suffers, however, from several issues, including the type of information that needs to be exchanged, the criteria for stopping and how to choose the right collaborators. We aim in this paper to improve the quality of the collaboration and to resolve these issues via a novel approach inspired by Optimal Transport theory. More specifically, the objective function for the exchange of information is based on the Wasserstein distance, with a bidirectional transport of information between collaborators. This formulation allows to learns a stopping criterion and provide a criterion to choose the best collaborators. Extensive experiments are conducted on multiple data-sets to evaluate the proposed approach.

Two-part quantile regression models for semi-continuous longitudinal data: A finite mixture approach

This article develops a two-part finite mixture quantile regression model for semi-continuous longitudinal data. The proposed methodology allows heterogeneity sources that influence the model for the binary response variable to also influence the distribution of the positive outcomes. As is common in the quantile regression literature, estimation and inference on the model parameters are based on the asymmetric Laplace distribution. Maximum likelihood estimates are obtained through the EM algorithm without parametric assumptions on the random effects distribution. In addition, a penalized version of the EM algorithm is presented to tackle the problem of variable selection. The proposed statistical method is applied to the well-known RAND Health Insurance Experiment dataset which gives further insights on its empirical behaviour.

Penalized model-based clustering of fMRI data

Functional magnetic resonance imaging (fMRI) data have become increasingly available and are useful for describing functional connectivity (FC), the relatedness of neuronal activity in regions of the brain. This FC of the brain provides insight into certain neurodegenerative diseases and psychiatric disorders, and thus is of clinical importance. To help inform physicians regarding patient diagnoses, unsupervised clustering of subjects based on FC is desired, allowing the data to inform us of groupings of patients based on shared features of connectivity. Since heterogeneity in FC is present even between patients within the same group, it is important to allow subject-level differences in connectivity, while still pooling information across patients within each group to describe group-level FC. To this end, we propose a random covariance clustering model (RCCM) to concurrently cluster subjects based on their FC networks, estimate the unique FC networks of each subject, and to infer shared network features. Although current methods exist for estimating FC or clustering subjects using fMRI data, our novel contribution is to cluster or group subjects based on similar FC of the brain while simultaneously providing group- and subject-level FC network estimates. The competitive performance of RCCM relative to other methods is demonstrated through simulations in various settings, achieving both improved clustering of subjects and estimation of FC networks. Utility of the proposed method is demonstrated with application to a resting-state fMRI data set collected on 43 healthy controls and 61 participants diagnosed with schizophrenia.

Blind Deconvolution for Poissonian Blurred Image With Total Variation and L0-Norm Gradient Regularizations

This paper proposes a regularized blind deconvolution method for restoring Poissonian blurred image. The problem is formulated by utilizing the L₀ -norm of image gradients and total variation (TV) to regularize the latent image and point spread function (PSF), respectively, and combining them with the negative logarithmic Poisson log-likelihood. To solve the problem, we propose an approach which combines the methods of variable splitting and Lagrange multiplier to convert the original problem into three sub-problems, and then design an alternating minimization algorithm which incorporates the estimation of PSF and latent image as well as the updation of Lagrange multiplier into account. We also design a non-blind deconvolution method based on TV regularization to further improve the quality of the restored image. Experimental results on both synthetic and real-world Poissonian blurred images show that the proposed method can achieve restored images of very high quality, which is competitive with or even better than some state of the art methods.

Regularized matrix data clustering and its application to image analysis

We propose a novel regularized mixture model for clustering matrix-valued data. The proposed method assumes a separable covariance structure for each cluster and imposes a sparsity structure (eg, low rankness, spatial sparsity) for the mean signal of each cluster. We formulate the problem as a finite mixture model of matrix-normal distributions with regularization terms, and then develop an expectation maximization type of algorithm for efficient computation. In theory, we show that the proposed estimators are strongly consistent for various choices of penalty functions. Simulation and two applications on brain signal studies confirm the excellent performance of the proposed method including a better prediction accuracy than the competitors and the scientific interpretability of the solution.

Model-Based Deep Learning PET Image Reconstruction Using Forward-Backward Splitting Expectation-Maximization

We propose a forward-backward splitting algorithm to integrate deep learning into maximum-a-posteriori (MAP) positron emission tomography (PET) image reconstruction. The MAP reconstruction is split into regularization, expectation-maximization (EM), and a weighted fusion. For regularization, the use of either a Bowsher prior (using Markov-random fields) or a residual learning unit (using convolutional-neural networks) were considered. For the latter, our proposed forward-backward splitting EM (FBSEM), accelerated with ordered subsets (OS), was unrolled into a recurrent-neural network in which network parameters (including regularization strength) are shared across all states and learned during PET reconstruction. Our network was trained and evaluated using PET-only (FBSEM-p) and PET-MR (FBSEM-pm) datasets for low-dose simulations and short-duration in-vivo brain imaging. It was compared to OSEM, Bowsher MAPEM, and a post-reconstruction U-Net denoising trained on the same PET-only (Unet-p) or PET-MR (Unet-pm) datasets. For simulations, FBSEM-p(m) and Unet-p(m) nets achieved a comparable performance, on average, 14.4% and 13.4% normalized root-mean square error (NRMSE), respectively; and both outperformed OSEM and MAPEM methods (with 20.7% and 17.7% NRMSE, respectively). For in-vivo datasets, FBSEM-p(m), Unet-p(m), MAPEM, and OSEM methods achieved average root-sum-of-squared errors of 3.9%, 5.7%, 5.9%, and 7.8% in different brain regions, respectively. In conclusion, the studied U-Net denoising method achieved a comparable performance to a representative implementation of the FBSEM net.

Improved iterative reconstruction method for Compton imaging using median filter

A Compton camera is a device for imaging a radio-source distribution without using a mechanical collimator. Ordered-subset expectation-maximization (OS-EM) is widely used to reconstruct Compton images. However, the OS-EM algorithm tends to over-concentrate and amplify noise in the reconstructed image. It is, thus, necessary to optimize the number of iterations to develop high-quality images, but this has not yet been achieved. In this paper, we apply a median filter to an OS-EM algorithm and introduce a median root prior expectation-maximization (MRP-EM) algorithm to overcome this problem. In MRP-EM, the median filter is used to update the image in each iteration. We evaluated the quality of images reconstructed by our proposed method and compared them with those reconstructed by conventional algorithms using mathematical phantoms. The spatial resolution was estimated using the images of two point sources. Reproducibility was evaluated on an ellipsoidal phantom by calculating the residual sum of squares, zero-mean normalized cross-correlation, and mutual information. In addition, we evaluated the semi-quantitative performance and uniformity on the ellipsoidal phantom. MRP-EM reduces the generated noise and is robust with respect to the number of iterations. An evaluation of the reconstructed image quality using some statistical indices shows that our proposed method delivers better results than conventional techniques.

Benefits of Using a Spatially-Variant Penalty Strength With Anatomical Priors in PET Reconstruction

In this study, we explore the use of a spatially-variant penalty strength in penalized image reconstruction using anatomical priors to reduce the dependence of lesion contrast on surrounding activity and lesion location. This work builds on a previous method to make the local perturbation response (LPR) approximately spatially invariant. While the dependence of lesion contrast on the local properties introduced by the anatomical penalty is intentional, the method aims to reduce the influence from surroundings lying along the lines of response (LORs) but not in the penalty neighborhood structure. The method is evaluated using simulated data, assuming that the anatomical information is absent or well-aligned with the corresponding activity images. Since the parallel level sets (PLS) penalty is convex and has shown promising results in the literature, it is chosen as the representative anatomical penalty and incorporated into the previously proposed preconditioned algorithm (L-BFGS-B-PC) for achieving good image quality and fast convergence rate. A 2D disc phantom with a feature at the center and a 3D XCAT thorax phantom with lesions inserted in different slices are used to study how surrounding activity and lesion location affect the visual appearance and quantitative consistency. A bias and noise analysis is also performed with the 2D disc phantom. The consistency of the algorithm convergence rate with respect to different data noise and background levels is also investigated using the XCAT phantom. Finally, an example of reconstruction for a patient dataset with inserted pseudo lesions is used as a demonstration in a clinical context. We show that applying the spatially-variant penalization with PLS can reduce the dependence of the lesion contrast on the surrounding activity and lesion location. It does not affect the bias and noise trade-off curves for matched local resolution. Moreover, when using the proposed penalization, significant improvement in algorithm convergence rate and convergence consistency is observed.

Extension of emission expectation maximization lookalike algorithms to Bayesian algorithms

We recently developed a family of image reconstruction algorithms that look like the emission maximum-likelihood expectation-maximization (ML-EM) algorithm. In this study, we extend these algorithms to Bayesian algorithms. The family of emission-EM-lookalike algorithms utilizes a multiplicative update scheme. The extension of these algorithms to Bayesian algorithms is achieved by introducing a new simple factor, which contains the Bayesian information. One of the extended algorithms can be applied to emission tomography and another to transmission tomography. Computer simulations are performed and compared with the corresponding un-extended algorithms. The total-variation norm is employed as the Bayesian constraint in the computer simulations. The newly developed algorithms demonstrate a stable performance. A simple Bayesian algorithm can be derived for any noise variance function. The proposed algorithms have properties such as multiplicative updating, non-negativity, faster convergence rates for bright objects, and ease of implementation. Our algorithms are inspired by Green's one-step-late algorithm. If written in additive-update form, Green's algorithm has a step size determined by the future image value, which is an undesirable feature that our algorithms do not have.

Spatially-Compact MR-Guided Kernel EM for PET Image Reconstruction

Positron emission tomography (PET) is a highly sensitive functional and molecular imaging modality which can measure picomolar concentrations of an injected radionuclide. However, the physical sensitivity of PET is limited, and reducing the injected dose leads to low count data and noisy reconstructed images. A highly effective way of reducing noise is to reparameterise the reconstruction in terms of MR-derived spatial basis functions. Spatial basis functions derived using the kernel method have demonstrated excellent noise reduction properties and maintain shared PET-MR detailed structures. However, as previously shown in the literature, the MR-guided kernel method may lead to excessive smoothing of structures that are only present in the PET data. This work makes two main contributions in order to address this problem: first, we exploit the potential of the MR-guided kernel method to form more spatially-compact basis functions which are able to preserve PET-unique structures, and secondly, we consider reconstruction at the native MR resolution. The former contribution notably improves the recovery of structures which are unique to the PET data. These adaptations of the kernel method were compared to the conventional implementation of the MR-guided kernel method and also to MLEM, in terms of ability to recover PET unique structures for both simulated and real data. The spatially-compact kernel method showed clear visual and quantitative improvements in the reconstruction of the PET unique structures, relative to the conventional kernel method for all sizes of PET unique structures investigated, whilst maintaining to a large extent the impressive noise mitigating and detail preserving properties of the conventional MR-guided kernel method. We therefore conclude that a spatially-compact parameterisation of the MR-guided kernel method, should be the preferred implementation strategy in order to obviate unnecessary losses in PET-unique details.

Penalized maximum likelihood simultaneous longitudinal PET image reconstruction with difference-image priors

PURPOSE

Many clinical contexts require the acquisition of multiple positron emission tomography (PET) scans of a single subject, for example, to observe and quantitate changes in functional behaviour in tumors after treatment in oncology. Typically, the datasets from each of these scans are reconstructed individually, without exploiting the similarities between them. We have recently shown that sharing information between longitudinal PET datasets by penalizing voxel-wise differences during image reconstruction can improve reconstructed images by reducing background noise and increasing the contrast-to-noise ratio of high-activity lesions. Here, we present two additional novel longitudinal difference-image priors and evaluate their performance using two-dimesional (2D) simulation studies and a three-dimensional (3D) real dataset case study.

METHODS

We have previously proposed a simultaneous difference-image-based penalized maximum likelihood (PML) longitudinal image reconstruction method that encourages sparse difference images (DS-PML), and in this work we propose two further novel prior terms. The priors are designed to encourage longitudinal images with corresponding differences which have (a) low entropy (DE-PML), and (b) high sparsity in their spatial gradients (DTV-PML). These two new priors and the originally proposed longitudinal prior were applied to 2D-simulated treatment response [¹⁸ F]fluorodeoxyglucose (FDG) brain tumor datasets and compared to standard maximum likelihood expectation-maximization (MLEM) reconstructions. These 2D simulation studies explored the effects of penalty strengths, tumor behaviour, and interscan coupling on reconstructed images. Finally, a real two-scan longitudinal data series acquired from a head and neck cancer patient was reconstructed with the proposed methods and the results compared to standard reconstruction methods.

RESULTS

Using any of the three priors with an appropriate penalty strength produced images with noise levels equivalent to those seen when using standard reconstructions with increased counts levels. In tumor regions, each method produces subtly different results in terms of preservation of tumor quantitation and reconstruction root mean-squared error (RMSE). In particular, in the two-scan simulations, the DE-PML method produced tumor means in close agreement with MLEM reconstructions, while the DTV-PML method produced the lowest errors due to noise reduction within the tumor. Across a range of tumor responses and different numbers of scans, similar results were observed, with DTV-PML producing the lowest errors of the three priors and DE-PML producing the lowest bias. Similar improvements were observed in the reconstructions of the real longitudinal datasets, although imperfect alignment of the two PET images resulted in additional changes in the difference image that affected the performance of the proposed methods.

CONCLUSION

Reconstruction of longitudinal datasets by penalizing difference images between pairs of scans from a data series allows for noise reduction in all reconstructed images. An appropriate choice of penalty term and penalty strength allows for this noise reduction to be achieved while maintaining reconstruction performance in regions of change, either in terms of quantitation of mean intensity via DE-PML, or in terms of tumor RMSE via DTV-PML. Overall, improving the image quality of longitudinal datasets via simultaneous reconstruction has the potential to improve upon currently used methods, allow dose reduction, or reduce scan time while maintaining image quality at current levels.

MR-Guided Kernel EM Reconstruction for Reduced Dose PET Imaging

PET image reconstruction is highly susceptible to the impact of Poisson noise, and if shorter acquisition times or reduced injected doses are used, the noisy PET data become even more limiting. The recent development of kernel expectation maximisation (KEM) is a simple way to reduce noise in PET images, and we show in this work that impressive dose reduction can be achieved when the kernel method is used with MR-derived kernels. The kernel method is shown to surpass maximum likelihood expectation maximisation (MLEM) for the reconstruction of low-count datasets (corresponding to those obtained at reduced injected doses) producing visibly clearer reconstructions for unsmoothed and smoothed images, at all count levels. The kernel EM reconstruction of 10% of the data had comparable whole brain voxel-level error measures to the MLEM reconstruction of 100% of the data (for simulated data, at 100 iterations). For regional metrics, the kernel method at reduced dose levels attained a reduced coefficient of variation and more accurate mean values compared to MLEM. However, the advances provided by the kernel method are at the expense of possible over-smoothing of features unique to the PET data. Further assessment on clinical data is required to determine the level of dose reduction that can be routinely achieved using the kernel method, whilst maintaining the diagnostic utility of the scan.

Fast Quasi-Newton Algorithms for Penalized Reconstruction in Emission Tomography and Further Improvements via Preconditioning

This paper reports on the feasibility of using a quasi-Newton optimization algorithm, limited-memory Broyden-Fletcher-Goldfarb-Shanno with boundary constraints (L-BFGS-B), for penalized image reconstruction problems in emission tomography (ET). For further acceleration, an additional preconditioning technique based on a diagonal approximation of the Hessian was introduced. The convergence rate of L-BFGS-B and the proposed preconditioned algorithm (L-BFGS-B-PC) was evaluated with simulated data with various factors, such as the noise level, penalty type, penalty strength and background level. Data of three ¹⁸F-FDG patient acquisitions were also reconstructed. Results showed that the proposed L-BFGS-B-PC outperforms L-BFGS-B in convergence rate for all simulated conditions and the patient data. Based on these results, L-BFGS-B-PC shows promise for clinical application.

Impact of motion compensation and partial volume correction for 18F-NaF PET/CT imaging of coronary plaque

Recent studies have suggested that ¹⁸F-NaF-PET enables visualization and quantification of plaque micro-calcification in the coronary tree. However, PET imaging of plaque calcification in the coronary arteries is challenging because of the respiratory and cardiac motion as well as partial volume effects. The objective of this work is to implement an image reconstruction framework, which incorporates compensation for respiratory as well as cardiac motion (MoCo) and partial volume correction (PVC), for cardiac ¹⁸F-NaF PET imaging in PET/CT. We evaluated the effect of MoCo and PVC on the quantification of vulnerable plaques in the coronary arteries. Realistic simulations (Biograph TPTV, Biograph mCT) and phantom acquisitions (Biograph mCT) were used for these evaluations. Different uptake values in the calcified plaques were evaluated in the simulations, while three 'plaque-type' lesions of 36, 31 and 18 mm³ were included in the phantom experiments. After validation, the MoCo and PVC methods were applied in four pilot NaF-PET patient studies. In all cases, the MoCo-based image reconstruction was performed using the STIR software. The PVC was obtained from a local projection (LP) method, previously evaluated in preclinical and clinical PET. The results obtained show a significant increase of the measured lesion-to-background ratios (LBR) in the MoCo  +  PVC images. These ratios were further enhanced when using directly the tissue-activities from the LP method, making this approach more suitable for the quantitative evaluation of coronary plaques. When using the LP method on the MoCo images, LBR increased between 200% and 1119% in the simulated data, between 212% and 614% in the phantom experiments and between 46% and 373% in the plaques with positive uptake observed in the pilot patients. In conclusion, we have built and validated a STIR framework incorporating MoCo and PVC for ¹⁸F-NaF PET imaging of coronary plaques. First results indicate an improved quantification of plaque-type lesions.

Simultaneous maximum a posteriori longitudinal PET image reconstruction

Positron emission tomography (PET) is frequently used to monitor functional changes that occur over extended time scales, for example in longitudinal oncology PET protocols that include routine clinical follow-up scans to assess the efficacy of a course of treatment. In these contexts PET datasets are currently reconstructed into images using single-dataset reconstruction methods. Inspired by recently proposed joint PET-MR reconstruction methods, we propose to reconstruct longitudinal datasets simultaneously by using a joint penalty term in order to exploit the high degree of similarity between longitudinal images. We achieved this by penalising voxel-wise differences between pairs of longitudinal PET images in a one-step-late maximum a posteriori (MAP) fashion, resulting in the MAP simultaneous longitudinal reconstruction (SLR) method. The proposed method reduced reconstruction errors and visually improved images relative to standard maximum likelihood expectation-maximisation (ML-EM) in simulated 2D longitudinal brain tumour scans. In reconstructions of split real 3D data with inserted simulated tumours, noise across images reconstructed with MAP-SLR was reduced to levels equivalent to doubling the number of detected counts when using ML-EM. Furthermore, quantification of tumour activities was largely preserved over a variety of longitudinal tumour changes, including changes in size and activity, with larger changes inducing larger biases relative to standard ML-EM reconstructions. Similar improvements were observed for a range of counts levels, demonstrating the robustness of the method when used with a single penalty strength. The results suggest that longitudinal regularisation is a simple but effective method of improving reconstructed PET images without using resolution degrading priors.

Factors affecting the ERP implementation in Indian retail sector

Purpose

– The purpose of this paper is to make an effort in identifying and exploring the factors which may affect the success of ERP implementation in Indian retail sector. This paper also analyses the between the factors and their impact on the successful implementation of ERP using the structured equation modeling (SEM) approach. “Organizational,” “Technological,” “People” and “Project Management” are the examined factors.

Design/methodology/approach

– A theoretical model is created that explains the factors which may affect the success of ERP implementation. Hypotheses were also developed to evaluate the interrelationship between affecting factors and success of ERP implementation. Empirical data is collected through survey questionnaire from practitioner like project sponsors, project managers, implementation consultants and team members who are involved in ERP implementation in retail sector to test the theoretical model.

Findings

– Using SEM, it is found that 62.7 percent of the variations of ERP implementation success can be explained with the help of the model suggested in the research study. The finding also confirms that there is significant positive interrelationship between “Organizational,” “Technological,” “People,” “Project Management” and success of ERP implementation in Indian retail sector.

Research limitations/implications

– The research is subject to the normal limitations of survey research. The study is using perceptual data provided by project sponsors, project managers, implementation consultants and team members who are involved in ERP implementation in retail sector, which may not provide clear measures of performance. However, this can be overcome using multiple methods to collect data in future studies.

Practical implications

– Findings from this paper can provide greater understanding in the area of ERP implementation. This study will provide valuable insights to researchers, practicing managers and those who are planning to implement ERP in retail sector.

Originality/value

– The study integrates the affecting factor with success of ERP implementation, i.e. “Organizational,” “Technological,” “People” and “Project Management” are the key drivers for the effectiveness and success of ERP implementation in Indian retail sector. Very few studies have been performed to investigate and understand this issue. Therefore, the research can make a useful contribution.

BAYESIAN SHRINKAGE METHODS FOR PARTIALLY OBSERVED DATA WITH MANY PREDICTORS

Motivated by the increasing use of and rapid changes in array technologies, we consider the prediction problem of fitting a linear regression relating a continuous outcome Y to a large number of covariates X , eg measurements from current, state-of-the-art technology. For most of the samples, only the outcome Y and surrogate covariates, W , are available. These surrogates may be data from prior studies using older technologies. Owing to the dimension of the problem and the large fraction of missing information, a critical issue is appropriate shrinkage of model parameters for an optimal bias-variance tradeoff. We discuss a variety of fully Bayesian and Empirical Bayes algorithms which account for uncertainty in the missing data and adaptively shrink parameter estimates for superior prediction. These methods are evaluated via a comprehensive simulation study. In addition, we apply our methods to a lung cancer dataset, predicting survival time (Y) using qRT-PCR ( X ) and microarray ( W ) measurements.

Noise propagation for iterative penalized-likelihood image reconstruction based on Fisher information

Iterative reconstruction algorithms have been widely used in PET and SPECT emission tomography. Accurate modeling of photon noise propagation is crucial for quantitative tomography applications. Iteration-based noise propagation methods have been developed for only a few algorithms that have explicit multiplicative update equations. And there are discrepancies between the iteration-based methods and Fessler's fixed-point method because of improper approximations. In this paper, we present a unified theoretical prediction of noise propagation for any penalized expectation maximization (EM) algorithm where the EM approach incorporates a penalty term. The proposed method does not require an explicit update equation. The update equation is assumed to be implicitly defined by a differential equation of a surrogate function. We derive the expressions using the implicit function theorem, Taylor series and the chain rule from vector calculus. We also derive the fixed-point expressions when iterative algorithms converge and show the consistency between the proposed method and the fixed-point method. These expressions are solely defined in terms of the partial derivatives of the surrogate function and the Fisher information matrices. We also apply the theoretical noise predictions for iterative reconstruction algorithms in emission tomography. Finally, we validate the theoretical predictions for MAP-EM and OSEM algorithms using Monte Carlo simulations with Jaszczak-like and XCAT phantoms, respectively.

Setting priors and enforcing constraints on matches for nonlinear registration of meshes

We show that a simple probabilistic modelling of the registration problem for surfaces allows to solve it by using standard clustering techniques. In this framework, point-to-point correspondences are hypothesized between the two free-form surfaces, and we show how to specify priors and to enforce global constraints on these matches with only minor changes to the optimisation algorithm. The purpose of these two modifications is to increase its capture range and to obtain more realistic geometrical transformations between the surfaces. We conclude with some validation experiments and results on synthetic and real data.

TRANSPOSABLE REGULARIZED COVARIANCE MODELS WITH AN APPLICATION TO MISSING DATA IMPUTATION

Missing data estimation is an important challenge with high-dimensional data arranged in the form of a matrix. Typically this data matrix is transposable, meaning that either the rows, columns or both can be treated as features. To model transposable data, we present a modification of the matrix-variate normal, the mean-restricted matrix-variate normal, in which the rows and columns each have a separate mean vector and covariance matrix. By placing additive penalties on the inverse covariance matrices of the rows and columns, these so called transposable regularized covariance models allow for maximum likelihood estimation of the mean and non-singular covariance matrices. Using these models, we formulate EM-type algorithms for missing data imputation in both the multivariate and transposable frameworks. We present theoretical results exploiting the structure of our transposable models that allow these models and imputation methods to be applied to high-dimensional data. Simulations and results on microarray data and the Netflix data show that these imputation techniques often outperform existing methods and offer a greater degree of flexibility.

Accelerated median root prior reconstruction for pinhole single-photon emission tomography (SPET)

Pinhole collimation can be used to improve spatial resolution in SPET. However, the resolution improvement is achieved at the cost of reduced sensitivity, which leads to projection images with poor statistics. Images reconstructed from these projections using the maximum likelihood expectation maximization (ML-EM) algorithms, which have been used to reduce the artefacts generated by the filtered backprojection (FBP) based reconstruction, suffer from noise/bias trade-off: noise contaminates the images at high iteration numbers, whereas early abortion of the algorithm produces images that are excessively smooth and biased towards the initial estimate of the algorithm. To limit the noise accumulation we propose the use of the pinhole median root prior (PH-MRP) reconstruction algorithm. MRP is a Bayesian reconstruction method that has already been used in PET imaging and shown to possess good noise reduction and edge preservation properties. In this study the PH-MRP algorithm was accelerated with the ordered subsets (OS) procedure and compared to the FBP, OS-EM and conventional Bayesian reconstruction methods in terms of noise reduction, quantitative accuracy, edge preservation and visual quality. The results showed that the accelerated PH-MRP algorithm was very robust. It provided visually pleasing images with lower noise level than the FBP or OS-EM and with smaller bias and sharper edges than the conventional Bayesian methods.

Noise analysis of MAP-EM algorithms for emission tomography

The ability to theoretically model the propagation of photon noise through PET and SPECT tomographic reconstruction algorithms is crucial in evaluating the reconstructed image quality as a function of parameters of the algorithm. In a previous approach for the important case of the iterative ML-EM (maximum-likelihood-expectation-maximization) algorithm, judicious linearizations were used to model theoretically the propagation of a mean image and a covariance matrix from one iteration to the next. Our analysis extends this approach to the case of MAP (maximum a posteriori)-EM algorithms, where the EM approach incorporates prior terms. We analyse in detail two cases: a MAP-EM algorithm incorporating an independent gamma prior, and a one-step-late (OSL) version of a MAP-EM algorithm incorporating a multivariate Gaussian prior, for which familiar smoothing priors are special cases. To validate our theoretical analyses, we use a Monte Carlo methodology to compare, at each iteration, theoretical estimates of mean and covariance with sample estimates, and show that the theory works well in practical situations where the noise and bias in the reconstructed images do not assume extreme values.