513 search results - page 19 / 103 » Soft Edge Coloring |
100
Voted
CGVR
2006
15 years 1 months ago
2006
We present Penumbra Limit Maps, a technique for rendering soft shadows from a modified shadow map. The shadow representation used by our method has excellent interpolation propert...
100
Voted
COMGEO
2008
ACM
15 years 1 days ago
2008
ACM
Consider a planar straight line graph (PSLG), G, with k connected components, k 2. We show that if no component is a singleton, we can always find a vertex in one component that s...
105
Voted
ECCV
1998
Springer
16 years 2 months ago
1998
Springer
Abstract. A simplified color image formation model is used to construct an algorithm for image reconstruction from CCD sensors samples. The proposed method involves two successive ...
100
click to vote
ISTCS
1993
Springer
15 years 4 months ago
1993
Springer
This thesis introduces a model of a random walk on a colored undirected graph. Such a graph has a single vertex set and distinct sets of edges, each of which has a color. A par...
123
Voted
TIP
2008
15 years 10 days ago
2008
In this paper, we propose a hierarchical color correction algorithm for enhancing the color of digital images obtained from low quality digital image capture devices such as cell ...