Sciweavers

4 search results - page 1 / 1
» Finding the Largest Unambiguous Component of Stereo Matching
Sort
View
ECCV
2002
Springer
14 years 6 months ago
Finding the Largest Unambiguous Component of Stereo Matching
Abstract. Stereo matching is an ill-posed problem for at least two principal reasons: (1) because of the random nature of match similarity measure and (2) because of structural amb...
Radim Sára
ICCV
2001
IEEE
14 years 6 months ago
Stereo Matching by Compact Windows via Minimum Ratio Cycle
Window size and shape selection is a difficult problem in area based stereo. We propose an algorithm which chooses an appropriate window shape by optimizing over a large class of ...
Olga Veksler
CIKM
2001
Springer
13 years 9 months ago
Improved String Matching Under Noisy Channel Conditions
Many document-based applications, including popular Web browsers, email viewers, and word processors, have a ‘Find on this Page’ feature that allows a user to find every occur...
Kevyn Collins-Thompson, Charles Schweizer, Susan T...

Book
34534views
15 years 3 months ago
OpenCV - Open Source Computer Vision Reference Manual
OpenCV is a C/C++ computer vision library originally developed by Intel. It is free for commercial and research use under a BSD license. The library is cross-platform. It is highl...
Intel