We develop an expectation-maximization algorithm with local adaptivity for image segmentation and classification. The key idea of our approach is to combine global statistics extracted from the Gaussian mixture model or other proper statistical models with local statistics and geometrical information, such as local probability distribution, orientation, and anisotropy. The combined information is used to design an adaptive local classification strategy that improves the robustness of the algorithm and also keeps fine features in the image. The proposed methodology is flexible and can be easily generalized to deal with other inferred information/quantities and statistical methods/models.

We provide a new insight of the difficulty of nonparametric estimation of a whole function. A new method is invented for finding a minimax lower bound of globally estimating a function. The idea is to adjust automatically the direction to the nearly hardest I-dimensional subproblem at each location, and to use locally the difficulty of I-dimensional subproblem. In a variety of contexts, our method can give not only attainable global rates, but also constant factors. Comparing with the existing techniques, our method has the advantages of being easily implemented and understood, and can give constant factors as well.

We discuss the difficulties of estimating quadratic functionals based on observations Y (t) from the white noise model Y (t) where Y (t) is a standard Wiener process on Y (t) . The optimal rates of convergence (as Y (t) ) for estimating quadratic functionals under certain geometric constraints are found. Specifically, the optimal rates of estimating Y (t) under hyperrectangular constraints Y (t) and weighted Y (t) -body constraints Y (t) are computed explicitly, where Y (t) is the Y (t) th Fourier-Bessel coefficient of the unknown function Y (t) . We develop lower bounds based on testing two highly composite hypercubes and address their advantages. The attainable lower bounds are found by applying the hardest one-dimensional approach as well as the hypercube method. We demonstrate that for estimating regular quadratic functionals [ie, the functionals which can be estimated

Many data mining and statistical machine learning algorithms have been developed to select a subset of covariates to associate with a response variable. Spurious discoveries can easily arise in high-dimensional data analysis due to enormous possibilities of such selections. How can we know statistically our discoveries better than those by chance? In this paper, we define a measure of goodness of spurious fit, which shows how good a response variable can be fitted by an optimally selected subset of covariates under the null model, and propose a simple and effective LAMM algorithm to compute it. It coincides with the maximum spurious correlation for linear models and can be regarded as a generalized maximum spurious correlation. We derive the asymptotic distribution of such goodness of spurious fit for generalized linear models and L1 regression. Such an asymptotic distribution depends on the sample size, ambient dimension, the number of variables used in the fit, and the covariance information. It can be consistently estimated by multiplier bootstrapping and used as a benchmark to guard against spurious discoveries. It can also be applied to model selection, which considers only candidate models with goodness of fits better than those by spurious fits. The theory and method are convincingly illustrated by simulated examples and an application to the binary outcomes from German Neuroblastoma Trials.

We study the estimation of the additive components in additive regression models, based on the weighted sample average of regression surface, for stationary <i></i>-mixing processes. Explicit expression of this method makes possible a fast computation and allows an asymptotic analysis. The estimation procedure is especially useful for additive modeling. In this paper, it is shown that the average surface estimator shares the same optimality as the ideal estimator and has the same ability to estimate the additive component as the ideal case where other components are known. Formulas for the asymptotic bias and normality of the estimator are established. A small simulation study is carried out to illustrate the performance of the estimation and a real example is also used to demonstrate our methodology.