Sciweavers

351 search results - page 12 / 71
» An exact method for graph coloring
Sort
View
CPC
2004
136views more  CPC 2004»
13 years 7 months ago
On the Strong Chromatic Number
The strong chromatic number, S(G), of an n-vertex graph G is the smallest number k such that after adding kn/k-n isolated vertices to G and considering any partition of the vertic...
Penny E. Haxell
ICIP
2009
IEEE
14 years 8 months ago
Effective Initialization Of K-means For Color Quantization
Color quantization is an important operation with many applications in graphics and image processing. Most quantization methods are essentially based on data clustering algorithms...
WSCG
2004
153views more  WSCG 2004»
13 years 9 months ago
A New Algorithm for Adding Color to Video or Animation Clips
Colorizing grayscale video is a useful technique in scientific computing visualization and entertainment. In this paper, we introduce a method to transfer color from a reference i...
Zhigeng Pan, Zhaohua Dong, Mingmin Zhang
AISS
2010
169views more  AISS 2010»
13 years 5 months ago
Effective Lane Detection and Tracking Method Using Statistical Modeling of Color and Lane Edge-orientation
This paper proposes an effective lane detection and tracking method using statistical modeling of lane color and edge-orientation in the image sequence. At first, we will address ...
Jin-Wook Lee, Jae-Soo Cho
MTA
2006
156views more  MTA 2006»
13 years 7 months ago
DAG-based visual interfaces for navigation in indexed video content
Indexing and segmenting of video content by motion, color and texture has been intensively explored leading to a usual representation in a storyboard. In this paper, a novel metho...
Maylis Delest, Anthony Don, Jenny Benois-Pineau