Sciweavers

565 search results - page 8 / 113
» Colorization by Matrix Completion
Sort
View
TIT
2010
93views Education» more  TIT 2010»
13 years 2 months ago
Matrix completion from a few entries
Raghunandan H. Keshavan, Andrea Montanari, Sewoong...
COMPGEOM
2006
ACM
14 years 1 months ago
Colored intersection searching via sparse rectangular matrix multiplication
In a Batched Colored Intersection Searching Problem (CI), one is given a set of n geometric objects (of a certain class). Each object is colored by one of c colors, and the goal i...
Haim Kaplan, Micha Sharir, Elad Verbin
ISM
2006
IEEE
130views Multimedia» more  ISM 2006»
14 years 1 months ago
Accelerating Color Space Conversion Using Extended Subwords and the Matrix Register File
Color space conversion is an important kernel in multimedia codecs such as JPEG and MPEG. When implemented using SIMD instructions, however, the performance improvement is often l...
Asadollah Shahbahrami, Ben H. H. Juurlink, Stamati...
COMBINATORICA
2008
78views more  COMBINATORICA 2008»
13 years 7 months ago
Optimal strong parity edge-coloring of complete graphs
A parity walk in an edge-coloring of a graph is a walk along which each color is used an even number of times. Let p(G) be the least number of colors in an edge-coloring of G havi...
David P. Bunde, Kevin Milans, Douglas B. West, Heh...
CVPR
2008
IEEE
14 years 1 months ago
Stereoscopic inpainting: Joint color and depth completion from stereo images
We present a novel algorithm for simultaneous color and depth inpainting. The algorithm takes stereo images and estimated disparity maps as input and fills in missing color and d...
Liang Wang, Hailin Jin, Ruigang Yang, Minglun Gong