We describe dynamic programming algorithms that are derived on the basis of symmetrized probabilistic models of the terrain and stereo pair and reconstruct the digital terrain model from the ideal horizontal stereo pair as a bunch of planar epipolar profiles. The algorithms show good performance und
โฆ LIBER โฆ
Experiments with dynamic programming algorithms for nonseparable problems
โ Scribed by Alleli Domingo; Moshe Sniedovich
- Publisher
- Elsevier Science
- Year
- 1993
- Tongue
- English
- Weight
- 870 KB
- Volume
- 67
- Category
- Article
- ISSN
- 0377-2217
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
Experiments with symmetrized intensity-b
โ
G. L. Gimel'Farb; V. M. Krot; M. V. Grigorenko
๐
Article
๐
1992
๐
John Wiley and Sons
๐
English
โ 981 KB
New geometric programming algorithms wit
โ
A.V. Pokatayev
๐
Article
๐
1986
๐
Elsevier Science
๐
English
โ 657 KB
Dynamic programming algorithms for pictu
โ
Michael S Waterman
๐
Article
๐
1985
๐
Elsevier Science
๐
English
โ 300 KB
Quadratic programming algorithms for obs
โ
Doukhovni, Ilia ;Givoli, Dan
๐
Article
๐
1996
๐
John Wiley and Sons
๐
English
โ 446 KB
The numerical solution of problems involving frictionless contact between an elastic body and a rigid obstacle is considered. The elastic body may undergo small or large deformation. Finite element discretization and repetitive linearization lead to a sequence of quadratic programming (QP) problems
A sublinear parallel algorithm for some
โ
Shou-Hsuan Stephen Huang; Hongfei Liu; Venkatraman Viswanathan
๐
Article
๐
1992
๐
Elsevier Science
๐
English
โ 648 KB
A new algorithm for multi-dimensional dy
โ
Mufit Ozden
๐
Article
๐
1983
๐
Elsevier Science
๐
English
โ 597 KB