Sciweavers

565 search results - page 27 / 113
» Colorization by Matrix Completion
Sort
View
ICASSP
2009
IEEE
15 years 1 months ago
Image Recolorization for the Colorblind
In this paper, we propose a new re-coloring algorithm to enhance the accessibility for the color vision deficient (or colorblind). Compared to people with normal color vision, peop...
Jia-Bin Huang, Chu-Song Chen, Tzu-Cheng Jen, and S...
DAM
2006
116views more  DAM 2006»
13 years 7 months ago
Using graphs for some discrete tomography problems
Given a rectangular array where entries represent the pixels of a digitalized image, we consider the problem of reconstructing an image from the number of occurrences of each colo...
Marie-Christine Costa, Dominique de Werra, Christo...
RTA
2010
Springer
13 years 11 months ago
Polynomially Bounded Matrix Interpretations
Matrix interpretations can be used to bound the derivational complexity of rewrite systems. We present a criterion that completely characterizes matrix interpretations that are pol...
Johannes Waldmann
CSR
2007
Springer
14 years 1 months ago
On the Complexity of Matrix Rank and Rigidity
We revisit a well studied linear algebraic problem, computing the rank and determinant of matrices, in order to obtain completeness results for small complexity classes. In partic...
Meena Mahajan, Jayalal M. N. Sarma
CORR
2004
Springer
152views Education» more  CORR 2004»
13 years 7 months ago
Non-negative matrix factorization with sparseness constraints
Non-negative matrix factorization (NMF) is a recently developed technique for finding parts-based, linear representations of non-negative data. Although it has successfully been a...
Patrik O. Hoyer