263 search results - page 32 / 53 » Minimum Entropy Coloring |
115
Voted
ICPR
2000
IEEE
15 years 6 months ago
2000
IEEE
In this paper we describe a voxel-based 3-D reconstruction technique from multiple calibrated camera views that makes explicit use of the finite size footprint of a voxel when pr...
116
click to vote
NETWORKS
2010
15 years 8 days ago
2010
Let G = (V, E, Q) be a undirected graph, where V is the set of vertices, E is the set of edges, and Q = {Q1, . . . , Qq} is a partition of V into q subsets. We refer to Q1, . . . ...
109
click to vote
CORR
2010
Springer
15 years 13 days ago
2010
Springer
Let G = (V, E) be a graph. Let c : V → N be a vertex-coloring of the vertices of G. For any vertex u, we denote by N[u] its closed neighborhood (u and its adjacent vertices), an...
127
Voted
DPHOTO
2009
14 years 11 months ago
2009
Most digital cameras employ a spatial subsampling process, implemented as a color filter array (CFA), to capture color images. The choice of CFA patterns has a great impact on the...
136
Voted
ICIAR
2010
Springer
15 years 12 days ago
2010
Springer
The paper presents a novel feature extraction technique for face recognition which uses sparse projection axes to compute a lowdimensional representation of face images. The propos...