Stereo matching is a useful method to obtain the 3-dimensional (3-D) depth information from a pair of images. In this paper, we first transform the stereo matching problem into a banded cyclic string-to-string correction (BCSTSC) problem. Then a brute-force algorithm, which runs in O(nmd) time, is d
β¦ LIBER β¦
A fast algorithm for matching remote scene images
β Scribed by Jin Liu; Li Yan
- Book ID
- 107513449
- Publisher
- Springer
- Year
- 2008
- Tongue
- English
- Weight
- 522 KB
- Volume
- 11
- Category
- Article
- ISSN
- 1009-5020
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
A fast algorithm for stereo matching
β
Kuo-Liang Chung
π
Article
π
1997
π
Elsevier Science
π
English
β 426 KB
A fast technique for recursive scene mat
β
V.V Alexandrov; N.D Gorsky; S.N Mysko
π
Article
π
1985
π
Elsevier Science
π
English
β 554 KB
A fast algorithm for string matching wit
β
A Dermouche
π
Article
π
1995
π
Elsevier Science
π
English
β 423 KB
A fast automatic extraction algorithm of
β
Changren Zhu; Runsheng Wang
π
Article
π
2004
π
Elsevier Science
π
English
β 561 KB
A fast BNM (Best Neighborhood Matching):
β
Wen Li; David Zhang; Zhiyong Liu; Xiangzhen Qiao
π
Article
π
2003
π
John Wiley and Sons
π
English
β 744 KB
## Abstract Best Neighborhood Matching (BNM) algorithm is a good approach of error concealment in terms of restored image quality. However, this kind of error concealment algorithm is commonly computationβintensive, which restricts their real applications on largeβscale image or video sequence rest
A fast and efficient NC algorithm for ma
β
Zhi-Zhong Chen
π
Article
π
1995
π
Elsevier Science
π
English
β 415 KB