Sciweavers

263 search results - page 19 / 53
» Minimum Entropy Coloring
Sort
View
ICIP
2001
IEEE
16 years 1 months ago
Scale space segmentation of color images using watersheds and fuzzy region merging
A multi-resolution segmentation approach for color images is proposed. The scale space is generated using the Perona-Malik diffusion approach and the watershed algorithm is employ...
S. Makrogiannis, Iris Vanhamel, Hichem Sahli, Spir...
SIAMDM
2010
96views more  SIAMDM 2010»
14 years 10 months ago
Note on Bipartite Graph Tilings
Let s < t be two fixed positive integers. We study what are the minimum degree conditions for a bipartite graph G, with both color classes of size n = k(s + t), which ensure t...
Jan Hladký, Mathias Schacht
EAAI
2006
157views more  EAAI 2006»
14 years 11 months ago
Color reduction and estimation of the number of dominant colors by using a self-growing and self-organized neural gas
A new method for color reduction in a digital image is proposed, which is based on the development of a new neural network classifier and on a new method for Estimation of the Mos...
Antonios Atsalakis, Nikos Papamarkos
CORR
2010
Springer
158views Education» more  CORR 2010»
14 years 8 months ago
Counting in Graph Covers: A Combinatorial Characterization of the Bethe Entropy Function
We present a combinatorial characterization of the Bethe entropy function of a factor graph, such a characterization being in contrast to the original, analytical, definition of th...
Pascal O. Vontobel
COCOON
2004
Springer
15 years 5 months ago
Coloring Octrees
An octree is a recursive partition of the unit cube, such that in each step a cube is subdivided into eight smaller cubes. Those cubes that are not further subdivided are the leave...
Udo Adamy, Michael Hoffmann, József Solymos...