The problem addressed is to reverse the degradation which occurs when images are digitised: they are blurred, subjected to noise and rounding error, and sampled only at a lattice of points. Inference is considered for the fundamental case of binary scenes, binary data and isotropic blur. The inferential process is separable into two stages: first from the lattice points to a binary image in continuous space and then the reversal of thresholding and blur. Methods are motivated by, and illustrated using, an electron micrograph of an immunogold-labelled section of tulip virus.

In machine vision, objects are observed subject to an unknown projective transformation, and it is usual to use projective invariants for either testing for a false alarm or for classifying an object. For four collinear points, the cross-ratio is the simplest statistic which is invariant under projective transformations. We obtain the distribution of the cross-ratio under the Gaussian error model with different means. The case of identical means, which has appeared previously in the literature, is derived as a particular case. Various alternative forms of the cross-ratio density are obtained, e.g. under the Casey arccos transformation, and under an arctan transformation from the real projective line of cross-ratios to the unit circle. The cross-ratio distributions are novel to the probability literature; surprisingly various types of Cauchy distribution appear. To gain some analytical insight into the distribution, a simple linear-ratio is also introduced. We also give some results for the projective invariants of five coplanar points. We discuss the general moment properties of the cross-ratio, and consider some inference problems, including maximum likelihood estimation of the parameters.

Families of Poisson processes defined on general state spaces and with the intensity measure scaled by a positive parameter are investigated. In particular, mean value relations with respect to the scale parameter are established and used to derive various Gamma-type results for certain geometric characteristics determined by finite subprocesses. In particular, we deduce Miles' complementary theorem. Applications of the results within stochastic geometry and particularly for random tessellations are discussed.

Denote by A(x) = {a: |aτx| ≦ h} a circle zone on the three-dimensional sphere surface for each given h > 0. For a given integer m, we investigate how many zones chosen randomly are needed to contain at least one of the points on the sphere surface m times. As an application, the lifetime of a sphere roller is investigated. We present empirical formulas for the mean, standard deviation and distribution of the lifetime of the sphere roller. Furthermore, some limit behaviors of the above stopping time are obtained, such as the limit distribution, the law of the iterated logarithm, and the upper and lower bounds of the tail probability with the same convergent order.

We establish a necessary condition for any importance sampling scheme to give bounded relative error when estimating a performance measure of a highly reliable Markovian system. Also, a class of importance sampling methods is defined for which we prove a necessary and sufficient condition for bounded relative error for the performance measure estimator. This class of probability measures includes all of the currently existing failure biasing methods in the literature. Similar conditions for derivative estimators are established.

A threshold AR(1) process with boundary width 2δ > 0 was defined by Brockwell and Hyndman [5] in terms of the unique strong solution of a stochastic differential equation whose coefficients are piecewise linear and Lipschitz. The positive boundary-width is a convenient mathematical device to smooth out the coefficient changes at the boundary and hence to ensure the existence and uniqueness of the strong solution of the stochastic differential equation from which the process is derived. In this paper we give a direct definition of a threshold AR(1) process with δ = 0 in terms of the weak solution of a certain stochastic differential equation. Two characterizations of the distributions of the process are investigated. Both express the characteristic function of the transition probability distribution as an explicit functional of standard Brownian motion. It is shown that the joint distributions of this solution with δ = 0 are the weak limits as δ ↓ 0 of the distributions of the solution with δ > 0. The sense in which an approximating sequence of processes used by Brockwell and Hyndman [5] converges to this weak solution is also investigated. Some numerical examples illustrate the value of the latter approximation in comparison with the more direct representation of the process obtained from the Cameron–Martin–Girsanov formula and results of Engelbert and Schmidt [9]. We also derive the stationary distribution (under appropriate assumptions) and investigate stability of these processes.

We give criteria for the finiteness or infiniteness of the passage-time moments for continuous non-negative stochastic processes in terms of sub/supermartingale inequalities for powers of these processes. We apply these results to one-dimensional diffusions and also reflected Brownian motion in a wedge. The discrete-time analogue of this problem was studied previously by Lamperti and more recently by Aspandiiarov, Iasnogorodski and Menshikov [2]. Our results are continuous analogues of those in [2], but our proofs are direct and do not rely on approximation by discrete-time processes.

The ‘Mabinogion sheep’ problem, originally due to D. Williams, is a nice illustration in discrete time of the martingale optimality principle and the use of local time in stochastic control. The use of singular controls involving local time is even more strikingly highlighted in the context of continuous time. This paper considers a class of diffusion versions of the discrete-time Mabinogion sheep problem. The stochastic version of the Bellman dynamic programming approach leads to a free boundary problem in each case. The most surprising feature in the continuous-time context is the existence of diffusion versions of the original discrete-time problem for which the optimal boundary is different from that in the discrete-time case; even when the optimal boundary is the same, the value functions can be very different.

We consider stochastic approximation algorithms on a general Hilbert space, and study four conditions on noise sequences for their analysis: Kushner and Clark's condition, Chen's condition, a decomposition condition, and Kulkarni and Horn's condition. We discuss various properties of these conditions. In our main result we show that the four conditions are all equivalent, and are both necessary and sufficient for convergence of stochastic approximation algorithms under appropriate assumptions.

Let ?(u) be the probability of eventual ruin in the classical Sparre Andersen model of risk theory if the initial risk reserve is u. For a large class of such models ?(u) behaves asymptotically like a multiple of exp (–Ru) where R is the adjustment coefficient; R depends on the premium income rate, the claim size distribution and the distribution of the time between claim arrivals. Estimation of R has been considered by many authors. In the present paper we deal with confidence bounds for R. A variety of methods is used, including jackknife estimation of asymptotic variances and the bootstrap. We show that, under certain assumptions, these procedures result in interval estimates that have asymptotically the correct coverage probabilities. We also give the results of a simulation study that compares the different techniques in some particular cases.

n candidates, represented by n i.i.d. continuous random variables X1, …, Xn with known distribution arrive sequentially, and one of them must be chosen, using a non-anticipating stopping rule. The objective is to minimize the expected rank (among the ranks of X1, …, Xn) of the candidate chosen, where the best candidate, i.e. the one with smallest X-value, has rank one, etc. Let the value of the optimal rule be Vn, and lim Vn = V. We prove that V > 1.85. Limiting consideration to the class of threshold rules of the form tn = min {k: Xk ≦ ak for some constants ak, let Wn be the value of the expected rank for the optimal threshold rule, and lim Wn = W. We show 2.295 < W < 2.327.

The paper is concerned with the distribution of the level N of the first crossing of a counting process trajectory with a lower boundary. Compound and simple Poisson or binomial processes, gamma renewal processes, and finally birth processes are considered. In the simple Poisson case, expressing the exact distribution of N requires the use of a classical family of Abel–Gontcharoff polynomials. For other cases convenient extensions of these polynomials into pseudopolynomials with a similar structure are necessary. Such extensions being applicable to other fields of applied probability, the central part of the present paper has been devoted to the building of these pseudopolynomials in a rather general framework.

This paper is concerned with the study of death processes with time-homogeneous non-linear death rates. An explicit formula is obtained for the joint distribution of the state XT and the variable ∫T0g(Xt), where g is any given real function and T corresponds to some appropriate stopping time. This is achieved by constructing a family of martingales and then by using a particular family of Abel–Gontcharoff pseudopolynomials (the theory of which has been introduced in a companion paper) and related Abelian-type expansions. Moreover, the distribution of the first crossing level of such a death process through a general upper boundary is also evaluated in terms of pseudopolynomials of that kind. The flexibility of the methods developed makes easy the extension to multidimensional death processes.

The quasi-stationary distribution of the closed stochastic SIS model changes drastically as the basic reproduction ratio R0 passes the deterministic threshold value 1. Approximations are derived that describe these changes. The quasi-stationary distribution is approximated by a geometric distribution (discrete!) for R0 distinctly below 1 and by a normal distribution (continuous!) for R0 distinctly above 1. Uniformity of the approximation with respect to R0 allows one to study the transition between these two extreme distributions. We also study the time to extinction and the invasion and persistence thresholds of the model.

We consider a model in which players must divide a fixed amount of resource between a number of trials of an underlying contest, with the underlying contest based on the War of Attrition. We are able to find the unique ES set (a simple generalisation of the idea of an evolutionarily stable strategy) in certain circumstances: in particular we find the conditions under which the ES set may contain a pure strategy.