The problem of textured image segmentation upon an unsupervised scheme is addressed. In the past two decades, there has been much interest in segmenting images involving complex random or structural texture patterns. However, most unsupervised segmentation techniques generally suffer from the lack of information about the correct number of texture classes. Therefore, this number is often assume...

We propose a probabilistic framework for interpreting and developing hard thresholding sparse signal reconstruction methods and present several new algorithms based on this framework. The measurements follow an underdetermined linear model, where the regression-coefficient vector is the sum of an unknown deterministic sparse signal component and a zero-mean white Gaussian component with an unkn...

K-means clustering algorithm is a method of cluster analysis which aims to partition n observations into clusters in which each observation belongs to the cluster with the nearest mean. It is one of the simplest unconfirmed learning algorithms that solve the well known clustering problem. It is similar to the hope maximization algorithm for mixtures of Gaussians in that they both attempt to fin...

The paper proposes a Bayesian approach to absolute phase (not simply modulo-2π) estimation in interferometric aperture radar (InSAR). The observation density is 2π-periodic and accounts for the interferometric pair decorrelation and the system noise; the a priori probability of the absolute phase is modeled by a compound Gauss Markov random field (CGMRF). To compute the absolute phase estimate ...

Factor models were first developed and dealt with in the case where observations are assumed to be normally distributed. Estimation is then carried out using the Expectation-Maximization (EM) algorithm based on the fact that the expectation of the completed log-likelihood conditional to the data is available in such a case. More recently, a less restrictive framework has been considered, in whi...

Multivariate nonlinear mixed-effects models (MNLMM) have received increasing use due to their flexibility for analyzing multi-outcome longitudinal data following possibly nonlinear profiles. This paper presents and compares five different iterative algorithms for maximum likelihood estimation of the MNLMM. These algorithmic schemes include the penalized nonlinear least squares coupled to the mu...

K-means clustering algorithm is a method of cluster analysis which aims to partition n observations into clusters in which each observation belongs to the cluster with the nearest mean. It is one of the simplest unconfirmed learning algorithms that solve the well known clustering problem. It is similar to the hope maximization algorithm for mixtures of Gaussians in that they both attempt to fin...

Due to its robustness to outliers, many Pattern Recognition algorithms use the median as a representative of a set of points. A special case arises in Syntactical Pattern Recognition when the points (prototypes) are represented by strings. However, when the edit distance is used, finding the median becomes a NP-Hard problem. Then, either the search is restricted to strings in the data (set-medi...