Functional and dynamic magnetic resonance imaging using vector adaptive weights smoothing

We consider the problem of statistical inference for functional and dynamic magnetic resonance imaging (MRI). A new approach is proposed which extends the adaptive weights smoothing procedure of Polzehl and Spokoiny that was originally designed for image denoising. We demonstrate how the adaptive weights smoothing method can be applied to time series of images, which typically occur in functional and dynamic MRI. It is shown how signal detection in functional MRI and the analysis of dynamic MRI can benefit from spatially adaptive smoothing. The performance of the procedure is illustrated by using real and simulated data.     

Estimation and selection procedures in regression: An L1 approach

The authors consider the problem of estimating a regression function go involving several variables by the closest functional element of a prescribed class _G that is closest to it in the L₁ norm. They propose a new estimator ? based on independent observations and give explicit finite sample bounds for the L₁distance between ?g and go. They apply their estimation procedure to the problem of selecting the smoothing parameter in nonparametric regression.     

Break point detection for functional covariance

Many neuroscience experiments record sequential trajectories where each trajectory consists of oscillations and fluctuations around zero. Such trajectories can be viewed as zero-mean functional data. When there are structural breaks in higher-order moments, it is not always easy to spot these by mere visual inspection. Motivated by this challenging problem in brain signal analysis, we propose a detection and testing procedure to find the change point in functional covariance. The detection procedure is based on the cumulative sum statistics (CUSUM). The fully functional testing procedure relies on a null distribution which depends on infinitely many unknown parameters, though in practice only a finite number of these parameters can be included for the hypothesis test of the existence of change point. This paper provides some theoretical insights on the influence of the number of parameters. Meanwhile, the asymptotic properties of the estimated change point are developed. The effectiveness of the proposed method is numerically validated in simulation studies and an application to investigate changes in rat brain signals following an experimentally-induced stroke.     

Image reconstruction by adaptive bayesian classification with a locally proportional prior

This paper concerns the problem of reconstructing images from noisy data by means of Bayesian classification methods. In Klein and Press, 1992, the authors presented a method for reconstructing images called Adaptive Bayesian Classification (ABC). The ABC procedure was shown to preform very well in simulation experiments. The ABC procedure was multistaged; moreover, it involved selecting a prior at Stage n that was the posterior at Stage n - 1. In this paper the authors show that we can improve upon ABC for some problems by modifying the way we take the prior at each stage. The new proposal is to take the prior for the pixel label at each stage as proportional to the number of pixels with that label in a small neighborhood of the pixel. The ABC procedure with a locally proportional prior (ABC/LPP) tends to improve upon the ABC procedure for some problems because the prior in the iterative portion of ABC/LPP is contextual, while that in ABC in non- contextual.     

Linear functional regression: The case of fixed design and functional response

The authors consider the problem of simple linear regression when the exogenous and endogenous variables are functional and the design is fixed. They propose an estimator for the underlying linear operator and prove its consistency under some conditions which ensure that the design is sufficiently informative. They consider the classical calibration (or inverse regression) problem and analyze a consistent estimator. They also give a simulation study. The proposed method is not hard to implement in practice.     

Efficient Confidence Interval Methodologies for the Non Centrality Parameter of a Non Central t Distribution

This article considers the problem of constructing a confidence interval for the non centrality parameter of a non central t distribution. This has applications to the signal to noise ratio in regression problems and to the coefficient of variation for normally distributed data. A new procedure is developed that provides shorter confidence intervals than the standard procedure, and a program is available for its implementation. This new procedure will be useful for practitioners, and its development also provides some interesting theoretical results.     

Optimization of problems with multivariate multiple functional responses: A case study in air quality

Optimization of multi-response problems is a popular subject in the literature. However, the problem becomes complicated when the responses are functional due to the existence of signal factors. In this article, we have proposed a combined index to optimize multivariate multiple functional responses by considering functional specification limits and a target. The relation among the responses and controllable factors is characterized by polynomial equations to consider the curvature of the response functions. The validity of the proposed method is checked by a simulation example. To show the applicability of the proposed method, a real case about Tehran air quality is analyzed. Latitude and longitude are considered to be signal factors, and different pollutant values are responses of the experiment. Government policies in each time interval are considered as controllable factors. Finally, an optimization algorithm is used to find the best decisions for government policies.     

Bayesian estimation in Kibble's bivariate gamma distribution

The authors describe Bayesian estimation for the parameters of the bivariate gamma distribution due to Kibble (1941). The density of this distribution can be written as a mixture, which allows for a simple data augmentation scheme. The authors propose a Markov chain Monte Carlo algorithm to facilitate estimation. They show that the resulting chain is geometrically ergodic, and thus a regenerative sampling procedure is applicable, which allows for estimation of the standard errors of the ergodic means. They develop Bayesian hypothesis testing procedures to test both the dependence hypothesis of the two variables and the hypothesis of equal means. They also propose a reversible jump Markov chain Monte Carlo algorithm to carry out the model selection problem. Finally, they use sets of real and simulated data to illustrate their methodology.     

A fast wavelet approach for recovering damaged images

A wavelet method is proposed for recovering damaged images. The proposed method combines wavelet shrinkage with preprocessing based on a binning process and an imputation procedure that is designed to extend the scope of wavelet shrinkage to data with missing values and perturbed locations. The proposed algorithm, termed as the BTW algorithm is simple to implement and efficient for recovering an image. Furthermore, this algorithm can be easily applied to wavelet regression for one-dimensional (1-D) signal estimation with irregularly spaced data. Simulation studies and real examples show that the proposed method can produce substantially effective results.     

Multilayer Perceptron with Functional Inputs: an Inverse Regression Approach

Abstract.  Functional data analysis is a growing research field as more and more practical applications involve functional data. In this paper, we focus on the problem of regression and classification with functional predictors: the model suggested combines an efficient dimension reduction procedure [functional sliced inverse regression, first introduced by Ferré & Yao ( Statistics , 37, 2003 , 475)], for which we give a regularized version, with the accuracy of a neural network. Some consistency results are given and the method is successfully confronted to real-life data.     

Markov random field-based image subsampling method

The use of Bayesian models for the reconstruction of images degraded by both some blurring function H and the presence of noise has become popular in recent years. Making an analogy between classical degradation processes and resampling, we propose a Bayesian model for generating finer resolution images. The approach involves defining resampling, or aggregation, as a linear operator applied to an original picture to produce derived lower resolution data which represent our available experimental infor-mation. Within this framework, the operation of making inference on the orginal data can be viewed as an inverse linear transformation problem. This problem, formalized through Bayes' theorem, can be solved by the classical maximum a posteriori estimation procedure. Image local characteristics are assumed to follow a Gaussian Markov random field. Under some mild assumptions, simple, iterative and local operations are involved, making parallel 'relaxation' processing feasible. experimental results are shown on some images, for which good subsampling estimates are obtained.     

Hidden Markov mesh random field models in image analysis

This paper addresses the image modeling problem under the assumption that images can be represented by third-order, hidden Markov mesh random field models. The range of applications of the techniques described hereafter comprises the restoration of binary images, the modeling and compression of image data, as well as the segmentation of gray-level or multi-spectral images, and image sequences under the short-range motion hypothesis. We outline coherent approaches to both the problems of image modeling (pixel labeling) and estimation of model parameters (learning). We derive a real-time labeling algorithm-based on a maximum, marginal a posteriori probability criterion-for a hidden third-order Markov mesh random field model. Our algorithm achieves minimum time and space complexities simultaneously, and we describe what we believe to be the most appropriate data structures to implement it. Critical aspects of the computer simulation of a real-time implementation are discussed, down to the computer code level. We develop an (unsupervised) learning technique by which the model parameters can be estimated without ground truth information. We lay bare the conditions under which our approach can be made time-adaptive in order to be able to cope with short-range motion in dynamic image sequences. We present extensive experimental results for both static and dynamic images from a wide variety of sources. They comprise standard, infra-red and aerial images, as well as a sequence of ultrasound images of a fetus and a series of frames from a motion picture sequence. These experiments demonstrate that the method is subjectively relevant to the problems of image restoration, segmentation and modeling.     

Comparison of three estimators of the number of species

We consider estimation of the number of cells in a multinomial distribution. This is one version of the species problem: there are many applications, such as the estimation of the number of unobserved species of animals; estimation of vocabulary size, etc. We describe the results of a simulation comparison of three principal frequent-ist' procedures for estimating the number of cells (or species). The first procedure postulates a functional form for the cell probabilities; the second procedure approxi mates the distribution of the probabilities by a parametric probability density function; and the third procedure is based on an estimate of the sample coverage, i.e. the sum of the probabilities of the observed cells. Among the procedures studied, we find that the third (non-parametric) method is globally preferable; the second (functional parametric) method cannot be recommended; and that, when based on the inverse Gaussian density, the first method is competitive in some cases with the third method. We also discuss Sichel's recent generalized inverse Gaussian-based procedure which, with some refine ment, promises to perform at least as well as the non-parametric method in all cases.     

Estimation and Classification of BOLD Responses Over Multiple Trials

In this article, we model functional magnetic resonance imaging (fMRI) data for event-related experiment data using a fourth degree spline to fit voxel specific blood oxygenation level-dependent (BOLD) responses. The data are preprocessed for removing long term temporal components such as drifts using wavelet approximations. The spatial dependence is incorporated in the data by the application of 3D Gaussian spatial filter. The methodology assigns an activation score to each trial based on the voxel specific characteristics of the response curve. The proposed procedure has a capability of being fully automated and it produces activation images based on overall scores assigned to each voxel. The methodology is illustrated on real data from an event-related design experiment of visually guided saccades (VGS).     

Data-driven stochastic inversion via functional quantization

In this paper, we propose a new methodology for solving stochastic inversion problems through computer experiments, the stochasticity being driven by a functional random variables. This study is motivated by an automotive application. In this context, the simulator code takes a double set of simulation inputs: deterministic control variables and functional uncertain variables. This framework is characterized by two features. The first one is the high computational cost of simulations. The second is that the probability distribution of the functional input is only known through a finite set of realizations. In our context, the inversion problem is formulated by considering the expectation over the functional random variable. We aim at solving this problem by evaluating the model on a design, whose adaptive construction combines the so-called stepwise uncertainty reduction methodology with a strategy for an efficient expectation estimation. Two greedy strategies are introduced to sequentially estimate the expectation over the functional uncertain variable by adaptively selecting curves from the initial set of realizations. Both of these strategies consider functional principal component analysis as a dimensionality reduction technique assuming that the realizations of the functional input are independent realizations of the same continuous stochastic process. The first strategy is based on a greedy approach for functional data-driven quantization, while the second one is linked to the notion of space-filling design. Functional PCA is used as an intermediate step. For each point of the design built in the reduced space, we select the corresponding curve from the sample of available curves, thus guaranteeing the robustness of the procedure to dimension reduction. The whole methodology is illustrated and calibrated on an analytical example. It is then applied on the automotive industrial test case where we aim at identifying the set of control parameters leading to meet the pollutant emission standards of a vehicle.     

Simultaneous estimation of number of signals and signal parameters of superimposed sinusoidal model: A robust sequential bivariate M-periodogram approach

Accurate estimation of the parameters of superimposed sinusoidal signals is an important problem in digital signal processing and time series analysis. In this article, we propose a simultaneous estimation procedure for estimation of the number of signals and signal parameters. The proposed sequential method is based on a robust bivariate M-periodogram and uses the orthogonal structure of the superimposed sinusoidal model for sequential estimation. Extensive simulations and data analysis show that the proposed method has a high degree of frequency resolution capability and can provide robust and efficient estimates of the number of signals and signal parameters.     

Improving prediction performance of stellar parameters using functional models

This paper investigates the problem of prediction of stellar parameters, based on the star's electromagnetic spectrum. The knowledge of these parameters permits to infer on the evolutionary state of the star. From a statistical point of view, the spectra of different stars can be represented as functional data. Therefore, a two-step procedure decomposing the spectra in a functional basis combined with a regression method of prediction is proposed. We also use a bootstrap methodology to build prediction intervals for the stellar parameters. A practical application is also provided to illustrate the numerical performance of our approach.     

The historical functional linear model

The authors develop a functional linear model in which the values at time t of a sample of curves yi (t) are explained in a feed‐forward sense by the values of covariate curves xi(s) observed at times s ±.t. They give special attention to the case s ± [t — δ, t], where the lag parameter δ is estimated from the data. They use the finite element method to estimate the bivariate parameter regression function β(s, t), which is defined on the triangular domain s ± t. They apply their model to the problem of predicting the acceleration of the lower lip during speech on the basis of electromyographical recordings from a muscle depressing the lip. They also provide simulation results to guide the calibration of the fitting process.     

Sampling from a Max‐Stable Process Conditional on a Homogeneous Functional with an Application for Downscaling Climate Data

Conditional simulation of max‐stable processes allows for the analysis of spatial extremes taking into account additional information provided by the conditions. Instead of observations at given sites as usually done, we consider a single condition given by a more general functional of the process as may occur in the context of climate models. As the problem turns out to be intractable analytically, we make use of Markov chain Monte Carlo methods to sample from the conditional distribution. Simulation studies indicate fast convergence of the Markov chains involved. In an application to precipitation data, the utility of the procedure as a tool to downscale climate data is demonstrated.