108 search results - page 12 / 22 » Pixel Approximation Errors in Common Watershed Algorithms |
MST
2007
13 years 7 months ago
2007
In 1996, Khanna and Motwani [KM96] proposed three logic-based optimization problems constrained by planar structure, and offered the hypothesis that these putatively fundamental ...
SIGGRAPH
1994
ACM
13 years 11 months ago
1994
ACM
In this paper we discuss the efficient and accurate incorporation of texture maps into a hierarchical Galerkin radiosity algorithm. This extension of the standard algorithm allows...
ICASSP
2008
IEEE
14 years 1 months ago
2008
IEEE
Finding sparse approximate solutions to large underdetermined linear systems of equations is a common problem in signal/image processing and statistics. Basis pursuit, the least a...
CGF
2008
13 years 7 months ago
2008
This paper introduces a framebuffer level of detail algorithm for controlling the pixel workload in an interactive rendering application. Our basic strategy is to evaluate the sha...
ICCV
2005
IEEE
14 years 9 months ago
2005
IEEE
Geometric reconstruction problems in computer vision are often solved by minimizing a cost function that combines the reprojection errors in the 2D images. In this paper, we show t...