513 search results - page 42 / 103 » Soft Edge Coloring |
ICDAR
2003
IEEE
15 years 5 months ago
2003
IEEE
This paper describes a new approach to restoring scanned color document images where the backside image shows through the paper sheet. A new framework is presented for correcting ...
97
Voted
ICIP
1999
IEEE
16 years 2 months ago
1999
IEEE
A new general-purpose color image segmentation editor (CISE) for the purpose of extracting a semantic object is designed, implemented and tested on a number of various natural sce...
93
Voted
DAM
2008
15 years 18 days ago
2008
Let G = (V, E) be a graph with vertex set V and edge set E. The k-coloring problem is to assign a color (a number chosen in {1, . . . , k}) to each vertex of G so that no edge has...
95
Voted
CORR
2010
Springer
14 years 11 months ago
2010
Springer
Let G = (V, E) be a graph. Let c : V → N be a vertex-coloring of the vertices of G. For any vertex u, we denote by N[u] its closed neighborhood (u and its adjacent vertices), an...
106
click to vote
ICPR
2004
IEEE
16 years 1 months ago
2004
IEEE
In this article, we present an unsupervised segmentation algorithm through a multiresolution approach which uses both color and edge information with a quadtree structure, through...