Sciweavers

15 search results - page 1 / 3
» Linear Complexity Stereo Matching Based on Region Indexing
Sort
View
SIBGRAPI
2005
IEEE
13 years 10 months ago
Linear Complexity Stereo Matching Based on Region Indexing
This paper presents a linear complexity method for real-time stereo matching, in which the processing time is only dependent on the image resolution. Regions along each epipolar l...
Marco Antonio Floriano de Oliveira, Raul Sidnei Wa...
CVPR
2001
IEEE
14 years 6 months ago
Semi-Dense Stereo Correspondence with Dense Features
We present a new feature based algorithm for stereo correspondence. Most of the previous feature based methods match sparse features like edge pixels, producing only sparse dispar...
Olga Veksler
IJCV
2002
157views more  IJCV 2002»
13 years 4 months ago
Dense Features for Semi-Dense Stereo Correspondence
We present a new feature based algorithm for stereo correspondence. Most of the previous feature based methods match sparse features like edge pixels, producing only sparse dispar...
Olga Veksler
ISVC
2010
Springer
13 years 5 months ago
Modified Region Growing for Stereo of Slant and Textureless Surfaces
In this paper, we present an algorithm for estimating disparity for images containing large textureless regions. We propose a fast and efficient region growing algorithm for estima...
Rohith MV, Gowri Somanath, Chandra Kambhamettu, Ca...
SIGMOD
2005
ACM
194views Database» more  SIGMOD 2005»
13 years 10 months ago
STRG-Index: Spatio-Temporal Region Graph Indexing for Large Video Databases
In this paper, we propose new graph-based data structure and indexing to organize and retrieve video data. Several researches have shown that a graph can be a better candidate for...
JeongKyu Lee, Jung-Hwan Oh, Sae Hwang