513 search results - page 7 / 103 » Soft Edge Coloring |
187
Voted
CVPR
2009
IEEE
16 years 7 months ago
2009
IEEE
Given a single image of an arbitrary road, that may not
be well-paved, or have clearly delineated edges, or some
a priori known color or texture distribution, is it possible
for...
108
click to vote
ICDAR
2005
IEEE
15 years 6 months ago
2005
IEEE
This paper addresses the problem of text extraction from name card images with fanciful design containing complicated color background and reverse contrast regions. The proposed m...
97
Voted
ESANN
2001
15 years 1 months ago
2001
Abstract. An approach to symbolic contour extraction will be described that consists of three stages: enhancement, detection, and extraction of edges and corners. Edges and corners...
APPROX
2006
Springer
15 years 4 months ago
2006
Springer
Consider the following problem: For given graphs G and F1, . . . , Fk, find a coloring of the edges of G with k colors such that G does not contain Fi in color i. For example, if e...
DM
1998
15 years 2 days ago
1998
The total chromatic number zt(G) of a graph G is the least number of colors needed to color the vertices and edges of G so that no adjacent vertices or edges receive the same colo...