Sciweavers

689 search results - page 6 / 138
» Optimal Segmentation Using Tree Models
Sort
View
ICIP
2009
IEEE
14 years 8 months ago
Illumination Invariant Unsupervised Segmenter
A novel illumination invariant unsupervised multispectral texture segmentation method with unknown number of classes is presented. Multispectral texture mosaics are locally repres...
DATAMINE
2010
166views more  DATAMINE 2010»
13 years 7 months ago
Optimal constraint-based decision tree induction from itemset lattices
In this article we show that there is a strong connection between decision tree learning and local pattern mining. This connection allows us to solve the computationally hard probl...
Siegfried Nijssen, Élisa Fromont
DAGM
2006
Springer
13 years 11 months ago
Segmentation-Based Motion with Occlusions Using Graph-Cut Optimization
Abstract. We propose to tackle the optical flow problem by a combination of two recent advances in the computation of dense correspondences, namely the incorporation of image segme...
Michael Bleyer, Christoph Rhemann, Margrit Gelautz
SODA
1997
ACM
106views Algorithms» more  SODA 1997»
13 years 8 months ago
Optimal Bounds for Matching Routing on Trees
The permutation routing problem is studied for trees under the matching model. By introducing a novel and useful (so-called) caterpillar tree partition, we prove that any permutati...
Louxin Zhang
ICANNGA
2007
Springer
100views Algorithms» more  ICANNGA 2007»
14 years 1 months ago
Genetic-Greedy Hybrid Approach for Topological Active Nets Optimization
In this paper we propose a genetic and greedy algorithm combination for the optimization of the Topological Active Nets (TAN) model. This is a deformable model used for image segme...
José Santos, Óscar Ibáñ...