Sciweavers

2333 search results - page 13 / 467
» Recursive Computational Depth
Sort
View
JEI
2007
79views more  JEI 2007»
14 years 9 months ago
Stereo matching via selective multiple windows
Window-based correlation algorithms are widely used for stereo matching due to their computational efficiency as compared to global algorithms. In this paper, a multiple window co...
Satyajit Anil Adhyapak, Nasser D. Kehtarnavaz, Mih...
ICIP
2001
IEEE
15 years 11 months ago
Robust estimation of depth and motion using stochastic approximation
The problemof structurefrom motion (SFM)is to extract the three-dimensionalmodel of a moving scene from a sequence of images. Though two images are sufficient to produce a 3D reco...
Rama Chellappa, Amit K. Roy Chowdhury
AAECC
2007
Springer
148views Algorithms» more  AAECC 2007»
14 years 9 months ago
Enhancing dependency pair method using strong computability in simply-typed term rewriting
We enhance the dependency pair method in order to prove termination using recursive structure analysis in simply-typed term rewriting systems, which is one of the computational mod...
Keiichirou Kusakari, Masahiko Sakai
68
Voted
CGI
2006
IEEE
15 years 3 months ago
Subdivision Depth Computation for Extra-Ordinary Catmull-Clark Subdivision Surface Patches
A second order forward differences based subdivision depth computation technique for extra-ordinary Catmull-Clark subdivision surface (CCSS) patches is presented. The new techniqu...
Fuhua (Frank) Cheng, Gang Chen, Jun-Hai Yong
SODA
2001
ACM
94views Algorithms» more  SODA 2001»
14 years 11 months ago
Computing the depth of a flat
We compute the regression depth of a k-flat in a set of n points in Rd, in time O(nd-2 + n log n) for 1 k d - 2. This contrasts with a bound of O(nd-1 + n log n) when k = 0 or
Marshall W. Bern