Comparison of the most typical probability distributions with respect to spread
Critical values of Fisher's and Siegel's test
Editorial
Detekce změn v časových řadách a její aplikace v ekologii
Bayesian like R- and M- estimators of change points
The purpose of this paper is to study Bayesian like R- and M-estimators of change point(s). These estimators have smaller variance than the related argmax type estimators. Confidence intervals for the change point based on the exchangeability arguments are constructed. Finally, theoretical results are illustrated on the real data set.
Large sample behaviour of the -transformation of two-sample rank statistics
On Bartlett's test for correlation between time series
An explicit formula for the correlation coefficient in a two-dimensional AR(1) process is derived. Approximate critical values for the correlation coefficient between two one-dimensional AR(1) processes are tabulated. They are based on Bartlett’s approximation and on an asymptotic distribution derived by McGregor. The results are compared with critical values obtained from a simulation study.
Testing a homogeneity of stochastic processes
The paper concentrates on modeling the data that can be described by a homogeneous or non-homogeneous Poisson process. The goal is to decide whether the intensity of the process is constant or not. In technical practice, e.g., it means to decide whether the reliability of the system remains the same or if it is improving or deteriorating. We assume two situations. First, when only the counts of events are known and, second, when the times between the events are available. Several statistical tests...
Application of MCMC to change point detection
A nonstandard approach to change point estimation is presented in this paper. Three models with random coefficients and Bayesian approach are used for modelling the year average temperatures measured in Prague Klementinum. The posterior distribution of the change point and other parameters are estimated from the random samples generated by the combination of the Metropolis-Hastings algorithm and the Gibbs sampler.
Classification of Images Background Subtraction in Image Segmentation
Many image segmentation algorithms have been proposed to partition an image into foreground regions of interest and background regions to be ignored. These algorithms use pixel intensities to partition the image, so it should be good practice to choose an appropriate background color as different as possible from the foreground one. In the case of a unique digitizing operation the user can make the choice of background color by himself in order to obtain a good result in the segmentation process,...
Page 1