Sciweavers

1390 search results - page 83 / 278
» Computing the depth of a flat
Sort
View
CVPR
2003
IEEE
16 years 6 months ago
Surfaces with Occlusions from Layered Stereo
Although steady progress has been made in recent stereo algorithms, producing accurate results in the neighborhood of depth discontinuities remains a challenge. Moreover, among th...
Michael H. Lin, Carlo Tomasi
ECCV
2002
Springer
16 years 6 months ago
A Layered Motion Representation with Occlusion and Compact Spatial Support
We describe a 2.5D layered representation for visual motion analysis. The representation provides a global interpretation of image motion in terms of several spatially localized fo...
Allan D. Jepson, David J. Fleet, Michael J. Black
ICPR
2008
IEEE
15 years 10 months ago
Direct 3-D shape recovery from image sequence based on multi-scale Bayesian network
We propose a new method for recovering a 3-D object shape from an image sequence. In order to recover high-resolution relative depth without using the complex Markov random field...
Norio Tagawa, Junya Kawaguchi, Shoichi Naganuma, K...
SADM
2011
14 years 11 months ago
Random survival forests for high-dimensional data
: Minimal depth is a dimensionless order statistic that measures the predictiveness of a variable in a survival tree. It can be used to select variables in high-dimensional problem...
Hemant Ishwaran, Udaya B. Kogalur, Xi Chen, Andy J...
ASIACRYPT
2005
Springer
15 years 9 months ago
Gate Evaluation Secret Sharing and Secure One-Round Two-Party Computation
We propose Gate Evaluation Secret Sharing (GESS) – a new kind of secret sharing, designed for use in secure function evaluation (SFE) with minimal interaction. The resulting simp...
Vladimir Kolesnikov