565 search results - page 14 / 113 » Colorization by Matrix Completion |
CC
2006
Springer
13 years 7 months ago
2006
Springer
The sum of a coloring is the sum of the colors assigned to the vertices (assuming that the colors are positive integers). The sum (G) of graph G is the smallest sum that can be ach...
DM
1999
13 years 7 months ago
1999
A defining set (of vertex coloring) of a graph G is a set of vertices S with an assignment of colors to its elements which has a unique completion to a proper coloring of G. We de...
ICASSP
2011
IEEE
12 years 11 months ago
2011
IEEE
Single sensor digital cameras capture one color value for every pixel location. The remaining two color channel values need to be estimated to obtain a complete color image. This ...
SDM
2012
SIAM
11 years 10 months ago
2012
SIAM
We propose a new matrix completion algorithm— Kernelized Probabilistic Matrix Factorization (KPMF), which effectively incorporates external side information into the matrix fac...
ICIP
2007
IEEE
14 years 9 months ago
2007
IEEE
Misregistration between the color separations of a printed image, which is often inevitable, can cause objectionable color shifts in average color. We analyze the impact of inter-...