Discrete Multicolour Random Mosaics with an Application to Network Extraction

We introduce a class of random fields that can be understood as discrete versions of multicolour polygonal fields built on regular linear tessellations. We focus first on a subclass of consistent polygonal fields, for which we show Markovianity and solvability by means of a dynamic representation. This representation is used to design new sampling techniques for Gibbsian modifications of such fields, a class which covers lattice‐based random fields. A flux‐based modification is applied to the extraction of the field tracks network from a Synthetic Aperture Radar image of a rural area.     

LOCAL POLYNOMIAL QUASI-LIKELIHOOD REGRESSION ON RANDOM FIELDS

In this paper, local quasi‐likelihood regression is considered for stationary random fields of dependent variables. In the case of independent data, local polynomial quasi‐likelihood regression is known to have several appealing features such as minimax efficiency, design adaptivity and good boundary behaviour. These properties are shown to carry over to the case of random fields. The asymptotic normality of the regression estimator is established and explicit formulae for its asymptotic bias and variance are derived for strongly mixing stationary random fields. The extension to multi‐dimensional covariates is also provided in full generality. Moreover, evaluation of the finite sample performance is made through a simulation study.     

A simulation comparison on spatial Poisson mixed models

The statistical methods for analyzing spatial count data have often been based on random fields so that a latent variable can be used to specify the spatial dependence. In this article, we introduce two frequentist approaches for estimating the parameters of model-based spatial count variables. The comparison has been carried out by a simulation study. The performance is also evaluated using a real dataset and also by the simulation study. The simulation results show that the maximum likelihood estimator appears to be with the better sampling properties.     

Equivalence of Gaussian measures for some nonstationary random fields

Gaussian random fields whose covariance structures are described by a power law model provide a simple and flexible class of models for isotropic random fields. This class includes fractional Brownian fields as a special case. Because these random fields are nonstationary, the extensive results available on equivalence of Gaussian measures for stationary models do not apply to them. This work shows that results on equivalence for two stationary Gaussian random field models extend in a natural way to the equivalence of a stationary model and a power law model. This result is used to show that if we use a power law model for predicting a random field at unobserved locations when in fact the random field is stationary, we can obtain asymptotically optimal predictions as long as the high frequency behavior of the true spectral density is sufficiently close to the high frequency behavior of the spectral density of the power law model.     

Linear scalar-on-surface random effects regression models

Many research fields increasingly involve analyzing data of a complex structure. Models investigating the dependence of a response on a predictor have moved beyond the ordinary scalar-on-vector regression. We propose a regression model for a scalar response and a surface (or a bivariate function) predictor. The predictor has a random component and the regression model falls in the framework of linear random effects models. We estimate the model parameters via maximizing the log-likelihood with the ECME (Expectation/Conditional Maximization Either) algorithm. We use the approach to analyze a data set where the response is the neuroticism score and the predictor is the resting-state brain function image. In the simulations we tried, the approach has better performance than two other approaches, a functional principal component regression approach and a smooth scalar-on-image regression approach.     

Asymptotic properties of nonparametric regression for long memory random fields

The kernel estimator of spatial regression function is investigated for stationary long memory (long range dependent) random fields observed over a finite set of spatial points. A general result on the strong consistency of the kernel density estimator is first obtained for the long memory random fields, and then, under some mild regularity assumptions, the asymptotic behaviors of the regression estimator are established. For the linear long memory random fields, a weak convergence theorem is also obtained for kernel density estimator. Finally, some related issues on the inference of long memory random fields are discussed through a simulation example.     

On LSE in regression model for long-range dependent random fields on spheres

We study the asymptotic behaviour of least squares estimators (LSE) in regression models for long-range dependent random fields observed on spheres. The LSE can be given as a weighted functional of long-range dependent random fields. It is known that in this scenario the limits can be non-Gaussian. We derive the limit distribution and the corresponding rate of convergence for the estimators. The results were obtained under rather general assumptions on the random fields. Simulation studies were conducted to support theoretical findings.     

Approximation of IMSE-optimal Designs via Quadrature Rules and Spectral Decomposition

We address the problem of computing integrated mean-squared error (IMSE) optimal designs for interpolation of random fields with known mean and covariance. We assume that the mean squared error is integrated through a discrete measure and restrict the design space to its support. We show that the IMSE and its approximation by spectral truncation can be easily evaluated, which makes their global minimization affordable. Numerical experiments are carried out that illustrate the effectiveness of the approach.     

Isotropic Random Fields with the Von Kármán–Whittle Type Correlation Structure

This article proposes a subclass of stationary Gaussian or elliptically contoured random fields whose covariance functions are isotropic and are the linear combination of the von Kármán–Whittle structure. A particular example of this type of random fields is the so-called spartan random field recently appeared in the applied literature.     

Spatial Matérn Fields Driven by Non‐Gaussian Noise

The article studies non‐Gaussian extensions of a recently discovered link between certain Gaussian random fields, expressed as solutions to stochastic partial differential equations (SPDEs), and Gaussian Markov random fields. The focus is on non‐Gaussian random fields with Matérn covariance functions, and in particular, we show how the SPDE formulation of a Laplace moving‐average model can be used to obtain an efficient simulation method as well as an accurate parameter estimation technique for the model. This should be seen as a demonstration of how these techniques can be used, and generalizations to more general SPDEs are readily available.     

Regression analysis of longitudinal data with correlated censoring and observation times

Longitudinal data occur in many fields such as the medical follow-up studies that involve repeated measurements. For their analysis, most existing approaches assume that the observation or follow-up times are independent of the response process either completely or given some covariates. In practice, it is apparent that this may not be true. In this paper, we present a joint analysis approach that allows the possible mutual correlations that can be characterized by time-dependent random effects. Estimating equations are developed for the parameter estimation and the resulted estimators are shown to be consistent and asymptotically normal. The finite sample performance of the proposed estimators is assessed through a simulation study and an illustrative example from a skin cancer study is provided.     

A pseudo-marginal sequential Monte Carlo algorithm for random effects models in Bayesian sequential design

Motivated by the need to sequentially design experiments for the collection of data in batches or blocks, a new pseudo-marginal sequential Monte Carlo algorithm is proposed for random effects models where the likelihood is not analytic, and has to be approximated. This new algorithm is an extension of the idealised sequential Monte Carlo algorithm where we propose to unbiasedly approximate the likelihood to yield an efficient exact-approximate algorithm to perform inference and make decisions within Bayesian sequential design. We propose four approaches to unbiasedly approximate the likelihood: standard Monte Carlo integration; randomised quasi-Monte Carlo integration, Laplace importance sampling and a combination of Laplace importance sampling and randomised quasi-Monte Carlo. These four methods are compared in terms of the estimates of likelihood weights and in the selection of the optimal sequential designs in an important pharmacological study related to the treatment of critically ill patients. As the approaches considered to approximate the likelihood can be computationally expensive, we exploit parallel computational architectures to ensure designs are derived in a timely manner.     

Handling the Label Switching Problem in Latent Class Models Via the ECR Algorithm

Latent class models (LCMs) are specific cases of mixture models. Under a Bayesian setup, the symmetric posterior distribution of these models leads Markov chain Monte Carlo (MCMC) methods to suffer from the so-called label switching problem. In this article, we treat the corresponding MCMC outputs using a recent approach, namely, the Equivalence Classes Representative (ECR) algorithm and conclude that it can effectively solve the label switching problem by considering several examples of LCMs, such as mixtures of regressions, hidden Markov models, and Markov random fields. Moreover, the superiority of this method over other approaches becomes apparent.     

A note on the correlation structure of transformed Gaussian random fields

Transformed Gaussian random fields can be used to model continuous time series and spatial data when the Gaussian assumption is not appropriate. The main features of these random fields are specified in a transformed scale, while for modelling and parameter interpretation it is useful to establish connections between these features and those of the random field in the original scale. This paper provides evidence that for many ‘normalizing’ transformations the correlation function of a transformed Gaussian random field is not very dependent on the transformation that is used. Hence many commonly used transformations of correlated data have little effect on the original correlation structure. The property is shown to hold for some kinds of transformed Gaussian random fields, and a statistical explanation based on the concept of parameter orthogonality is provided. The property is also illustrated using two spatial datasets and several ‘normalizing’ transformations. Some consequences of this property for modelling and inference are also discussed.     

Simulation of Infinitely Divisible Random Fields

Two methods to approximate infinitely divisible random fields are presented. The methods are based on approximating the kernel function in the spectral representation of such fields, leading to numerical integration of the respective integrals. Error bounds for the approximation error are derived and the approximations are used to simulate certain classes of infinitely divisible random fields.     

On the use of Gibbs Markov chain models in the analysis of images based on second-order pairwise interactive distributions

The paper investigates parameter estimation for Markov random fields and for hidden Markov random fields, where noisy data are available. EM algorithms are described and an approximate procedure is developed based on row-by-row relaxation and analysis. Numerical illustrations are provided.     

A random cluster algorithm for some continuous Markov random fields

Based on a random cluster representation, the Swendsen–Wang algorithm for the Ising and Potts distributions is extended to a class of continuous Markov random fields. The algorithm can be described briefly as follows. A given configuration is decomposed into clusters. Probabilities for flipping the values of the random variables in each cluster are calculated. According to these probabilities, values of all the random variables in each cluster will be either updated or kept unchanged and this is done independently across the clusters. A new configuration is then obtained. We will show through a simulation study that, like the Swendsen–Wang algorithm in the case of Ising and Potts distributions, the cluster algorithm here also outperforms the Gibbs sampler in beating the critical slowing down for some strongly correlated Markov random fields.     

Approximate computations for binary Markov random fields and their use in Bayesian models

Discrete Markov random fields form a natural class of models to represent images and spatial datasets. The use of such models is, however, hampered by a computationally intractable normalising constant. This makes parameter estimation and a fully Bayesian treatment of discrete Markov random fields difficult. We apply approximation theory for pseudo-Boolean functions to binary Markov random fields and construct approximations and upper and lower bounds for the associated computationally intractable normalising constant. As a by-product of this process we also get a partially ordered Markov model approximation of the binary Markov random field. We present numerical examples with both the pairwise interaction Ising model and with higher-order interaction models, showing the quality of our approximations and bounds. We also present simulation examples and one real data example demonstrating how the approximations and bounds can be applied for parameter estimation and to handle a fully Bayesian model computationally.     

Anisotropy of Hölder Gaussian random fields: characterization,estimation, and application to image textures

The characterization and estimation of the Hölder regularity of random fields has long been an important topic of Probability theory and Statistics. This notion of regularity has also been widely used in image analysis to measure the roughness of textures. However, such a measure is rarely sufficient to characterize textures as it does not account for their directional properties (e.g., isotropy and anisotropy). In this paper, we present an approach to further characterize directional properties associated with the Hölder regularity of random fields. Using the spectral density, we define a notion of asymptotic topothesy which quantifies directional contributions of field high-frequencies to the Hölder regularity. This notion is related to the topothesy function of the so-called anisotropic fractional Brownian fields, but is defined in a more generic framework of intrinsic random fields. We then propose a method based on multi-oriented quadratic variations to estimate this asymptotic topothesy. Eventually, we evaluate this method on synthetic data and apply it for the characterization of historical photographic papers.     

Improving sample size recalculation in adaptive clinical trials by resampling

Sample size calculations in clinical trials need to be based on profound parameter assumptions. Wrong parameter choices may lead to too small or too high sample sizes and can have severe ethical and economical consequences. Adaptive group sequential study designs are one solution to deal with planning uncertainties. Here, the sample size can be updated during an ongoing trial based on the observed interim effect. However, the observed interim effect is a random variable and thus does not necessarily correspond to the true effect. One way of dealing with the uncertainty related to this random variable is to include resampling elements in the recalculation strategy. In this paper, we focus on clinical trials with a normally distributed endpoint. We consider resampling of the observed interim test statistic and apply this principle to several established sample size recalculation approaches. The resulting recalculation rules are smoother than the original ones and thus the variability in sample size is lower. In particular, we found that some resampling approaches mimic a group sequential design. In general, incorporating resampling of the interim test statistic in existing sample size recalculation rules results in a substantial performance improvement with respect to a recently published conditional performance score.