Two-dimensional generalisations of dynamic programming for image analysis

Dynamic programming (DP) is a fast, elegant method for solving many one-dimensional optimisation problems but, unfortunately, most problems in image analysis, such as restoration and warping, are two-dimensional. We consider three generalisations of DP. The first is iterated dynamic programming (IDP), where DP is used to recursively solve each of a sequence of one-dimensional problems in turn, to find a local optimum. A second algorithm is an empirical, stochastic optimiser, which is implemented by adding progressively less noise to IDP. The final approach replaces DP by a more computationally intensive Forward-Backward Gibbs Sampler, and uses a simulated annealing cooling schedule. Results are compared with existing pixel-by-pixel methods of iterated conditional modes (ICM) and simulated annealing in two applications: to restore a synthetic aperture radar (SAR) image, and to warp a pulsed-field electrophoresis gel into alignment with a reference image. We find that IDP and its stochastic variant outperform the remaining algorithms.     

李渔剧论的观众立场及其贡献

本文以为李渔戏剧理论的中心是观众 ,围绕观众来探讨剧本的创作、演出、戏剧的功能及其发展等是李渔剧论的最大特色。文章指出 :李渔从观众立场出发提出了“机趣”的戏剧功能观 ,并揭示了观众对戏剧艺术发展负有不可推卸的责任。     

Covariates and Random Effects in a Gamma Process Model with Application to Degradation and Failure

The gamma process is a natural model for degradation processes in which deterioration is supposed to take place gradually over time in a sequence of tiny increments. When units or individuals are observed over time it is often apparent that they degrade at different rates, even though no differences in treatment or environment are present. Thus, in applying gamma-process models to such data, it is necessary to allow for such unexplained differences. In the present paper this is accomplished by constructing a tractable gamma-process model incorporating a random effect. The model is fitted to some data on crack growth and corresponding goodness-of-fit tests are carried out. Prediction calculations for failure times defined in terms of degradation level passages are developed and illustrated.     

On rates of convergence to infinitely divisible laws for dependent random variables

Large O and small o approximations of the expected value of a class of functions (modified K-functional and Lipschitz class) of the normalized partial sums of dependent random variables by the expectation of the corresponding functions of infinitely divisible random variables have been established. As a special case, we have obtained rates of convergence to the Stable Limit Laws and to the Weak Laws of Large Numbers. The technique used is the conditional version of the operator method of Trotter and the Taylor expansion.     

Perfect simulation for correlated Poisson random variables conditioned to be positive

In this paper we present a perfect simulation method for obtaining perfect samples from collections of correlated Poisson random variables conditioned to be positive. We show how to use this method to produce a perfect sample from a Boolean model conditioned to cover a set of points: in W.S. Kendall and E. Thönnes (Pattern Recognition 32(9): 1569–1586, 1999), this special case was treated in a more complicated way. The method is applied to several simple examples where exact calculations can be made, so as to check correctness of the program using ²-tests, and some small-scale experiments are carried out to explore the behaviour of the conditioned Boolean model.     

Estimation of a Change Point in a Hazard Function Based on Censored Data

The hazard function plays an important role in reliability or survival studies since it describes the instantaneous risk of failure of items at a time point, given that they have not failed before. In some real life applications, abrupt changes in the hazard function are observed due to overhauls, major operations or specific maintenance activities. In such situations it is of interest to detect the location where such a change occurs and estimate the size of the change. In this paper we consider the problem of estimating a single change point in a piecewise constant hazard function when the observed variables are subject to random censoring. We suggest an estimation procedure that is based on certain structural properties and on least squares ideas. A simulation study is carried out to compare the performance of this estimator with two estimators available in the literature: an estimator based on a functional of the Nelson-Aalen estimator and a maximum likelihood estimator. The proposed least squares estimator tums out to be less biased than the other two estimators, but has a larger variance. We illustrate the estimation method on some real data sets.     

Information preserving statistical obfuscation

The problem of limiting the disclosure of information gathered on a set of companies or individuals (the respondents) is considered, the aim being to provide useful information while preserving confidentiality of sensitive information. The paper proposes a method which explicitly preserves certain information contained in the data. The data are assumed to consist of two sets of information on each respondent: public data and specific survey data. It is assumed in this paper that both sets of data are liable to be released for a subset of respondents. However, the public data will be altered in some way to preserve confidentiality whereas the specific survey data is to be disclosed without alteration. The paper proposes a model based approach to this problem by utilizing the information contained in the sufficient statistics obtained from fitting a model to the public data by conditioning on the survey data. Deterministic and stochastic variants of the method are considered.     

Missing at random (MAR) in nonparametric regression - A simulation experiment

The additive model is considered when some observations on x are missing at random but corresponding observations on y are available. Especially for this model, missing at random is an interesting case because the complete case analysis is expected to be no more suitable. A simulation experiment is reported and the different methods are compared based on their superiority with respect to the sample mean squared error. Some focus is also given on the sample variance and the estimated bias. In detail, the complete case analysis, a kind of stochastic mean imputation, a single imputation and the nearest neighbor imputation are discussed.     

The exact solution to the mle of a decreasing density based on arbitrarily right censored data

Nonparametric maximum likelihood estimation of decreasing and unimodal density functions, based on observations subject to arbitrary right censorship, was considered by McNichols and Padgett(1982). In order to compute their estimators, however, nonlinear equations with linear constraints had to be maximized using numerical techniques. The exact solution to this problem can now be found. An example illustrates the simplicity of the method.     

A two- sample partially sequential probability ratio test

A two-sample partially sequential probability ratio test (PSPRT) is considered for the two-sample location problem with one sample fixed and the other sequential. Observations are assumed to come from two normal poptilatlons with equal and known variances. Asymptotically in the fixed-sample size the PSPRT is a truncated Wald one sample sequential probability test. Brownian motion approximations for boundary-crossing probabilities and expected sequential sample size are obtained. These calculations are compared to values obtained by Monte Carlo simulation.