565 search results - page 3 / 113 » Colorization by Matrix Completion |
114
Voted
ICASSP
2011
IEEE
14 years 1 months ago
2011
IEEE
—The low-rank matrix completion problem can be stated as follows: given a subset of the entries of a matrix, find a low-rank matrix consistent with the observations. There exist...
PRL
2007
14 years 9 months ago
2007
The paper presents a novel approach for representing color and intensity of pixel neighborhoods in an image using a co-occurrence matrix. After analyzing the properties of the HSV...
88
Voted
JGT
2006
14 years 9 months ago
2006
An edge-colored graph H is properly colored if no two adjacent edges of H have the same color. In 1997, J. Bang-Jensen and G. Gutin conjectured that an edgecolored complete graph ...
ICIP
2003
IEEE
15 years 11 months ago
2003
IEEE
In this paper, we first discuss the singular value decomposition (SVD) of a quaternion matrix and propose an algorithm to calculate the SVD of a quaternion matrix using its equiva...
96
Voted
JMLR
2012
12 years 12 months ago
2012
This paper considers the problem of completing a matrix with many missing entries under the assumption that the columns of the matrix belong to a union of multiple low-rank subspa...