1390 search results - page 72 / 278 » Computing the depth of a flat |
PAMI
2008
14 years 9 months ago
2008
Traditional stereo matching algorithms are limited in their ability to produce accurate results near depth discontinuities, due to partial occlusions and violation of smoothness co...
125
click to vote
CVPR
2007
IEEE
15 years 8 months ago
2007
IEEE
In this paper, we propose a new algorithm that solves both the stereo matching and the image denoising problem simultaneously for a pair of noisy stereo images. Most stereo algorit...
QSHINE
2005
IEEE
15 years 3 months ago
2005
IEEE
An extended depth-first-search (EDFS) algorithm is proposed to solve the multi-constrained path (MCP) problem in quality-of-service (QoS) routing, which is NP-Complete when the n...
PG
2003
IEEE
15 years 3 months ago
2003
IEEE
We present the concept of volumetric depth-peeling. The proposed method is conceived to render interior and exterior iso-surfaces for a fixed iso-value and to blend them without ...
AAAI
2010
14 years 11 months ago
2010
Depth-first proof-number search (df-pn) is powerful AND/OR tree search to solve positions in games. However, df-pn has a notorious problem of infinite loops when applied to domain...