Sciweavers

2157 search results - page 221 / 432
» Binary ant algorithm
Sort
View
CORR
2007
Springer
128views Education» more  CORR 2007»
15 years 6 months ago
Model Selection Through Sparse Maximum Likelihood Estimation
We consider the problem of estimating the parameters of a Gaussian or binary distribution in such a way that the resulting undirected graphical model is sparse. Our approach is to...
Onureena Banerjee, Laurent El Ghaoui, Alexandre d'...
ICIP
2005
IEEE
16 years 8 months ago
Locally adaptable mathematical morphology
We investigate how common binary mathematical morphology operators can be adapted so that the size of the structuring element (SE) can vary across the image. We show that when the...
Olivier Cuisenaire
ICIP
2001
IEEE
16 years 8 months ago
Fast computation of morphological area pattern spectra
An area based counterpart of the binary structural opening spectra is developed. It is shown that these area opening and closing spectra can be computed using an adaptation of Tar...
Arnold Meijster, Michael H. F. Wilkinson
ICPR
2010
IEEE
16 years 1 months ago
Fast and Accurate Approximation of the Euclidean Opening Function in Arbitrary Dimension
In this paper, we present a fast and accurate approximation of the Euclidean opening function which is a wide-used tool in morphological mathematics to analyze binary shapes since...
David Coeurjolly
SAC
2009
ACM
16 years 1 months ago
The sum-of-increments constraint in the consecutive-ones matrix decomposition problem
The combinatorial problem of decomposing an integer matrix into a small positive linear combination of binary matrices that have the consecutive-ones property arises in cancer rad...
Sebastian Brand