Sciweavers

263 search results - page 28 / 53
» Minimum Entropy Coloring
Sort
View
CVPR
2010
IEEE
14 years 8 months ago
Curious snakes: A minimum latency solution to the cluttered background problem in active contours
We present a region-based active contour detection algorithm for objects that exhibit relatively homogeneous photometric characteristics (e.g. smooth color or gray levels), embedd...
Ganesh Sundaramoorthi, Stefano Soatto, Anthony J. ...
ALGORITHMICA
2006
138views more  ALGORITHMICA 2006»
14 years 11 months ago
Planar Graph Coloring Avoiding Monochromatic Subgraphs: Trees and Paths Make It Difficult
We consider the problem of coloring a planar graph with the minimum number of colors so that each color class avoids one or more forbidden graphs as subgraphs. We perform a detail...
Hajo Broersma, Fedor V. Fomin, Jan Kratochví...
CCIW
2009
Springer
15 years 6 months ago
An Improved Image Re-indexing Technique by Self Organizing Motor Maps
The paper presents a novel Motor Map neural network for re-indexing color mapped images. The overall learning process is able to smooth the local spatial redundancy of the indexes ...
Sebastiano Battiato, Francesco Rundo, Filippo Stan...
DCC
2007
IEEE
15 years 11 months ago
Distributed Functional Compression through Graph Coloring
We consider the distributed computation of a function of random sources with minimal communication. Specifically, given two discrete memoryless sources, X and Y , a receiver wishe...
Devavrat Shah, Muriel Médard, Sidharth Jagg...
SODA
2004
ACM
160views Algorithms» more  SODA 2004»
15 years 1 months ago
On colorings of squares of outerplanar graphs
We study vertex colorings of the square G2 of an outerplanar graph G. We find the optimal bound of the inductiveness, chromatic number and the clique number of G2 as a function of...
Geir Agnarsson, Magnús M. Halldórsso...