We consider the problem of selecting a subset of m most informative features where m is the number of required features. This feature selection problem is essentially a combinator...
Zenglin Xu, Rong Jin, Jieping Ye, Michael R. Lyu, ...
We consider the problem of finding association rules that make nearly optimal binary segmentations of huge categorical databases. The optimality of segmentation is defined by an o...
We address the problem of scale selection in texture analysis. Two di erent scale parameters, feature scale and statistical scale, are dened. Statistical scale is the size of the r...
This paper presents a probabilistic algorithm for segmenting and recognizing text embedded in video sequences. The algorithm approximates the posterior distribution of segmentatio...
Bayesian motion estimation requires two pdf models: observation model and motion field (prior) model. The optimization process for this method uses sequential approach, e.g. simul...
Stephanus Suryadarma Tandjung, Teddy Surya Gunawan...