513 search results - page 47 / 103 » Soft Edge Coloring |
EOR
2010
15 years 18 days ago
2010
Given an undirected graph G = (V, E) with a set V of vertices and a set E of edges, the graph coloring problem consists of partitioning all vertices into k independent sets and th...
87
Voted
CVPR
1997
IEEE
16 years 2 months ago
1997
IEEE
In this contribution we present an algorithm for tracking non-rigid, moving objects in a sequence of colored images, which were recorded by a non-stationary camera. The applicatio...
89
Voted
ACIVS
2005
Springer
15 years 6 months ago
2005
Springer
This paper proposes a hybrid foreground object detection method suitable for the marine surveillance applications. Our approach combines an existing foreground object detection met...
92
Voted
DAM
2008
15 years 18 days ago
2008
We consider the vertex coloring problem, which may be stated as the problem of minimizing the number of labels that can be assigned to the vertices of a graph G such that each ver...
122
Voted
ICMCS
2009
IEEE
14 years 10 months ago
2009
IEEE
Bilateral filter has shown its outstanding performance in image denoising and other multimedia applications. In this paper, a new color interpolation technique named joint bilater...