Sciweavers

450 search results - page 45 / 90
» A new stereo matching algorithm for binocular vision
Sort
View
ISCAS
1994
IEEE
104views Hardware» more  ISCAS 1994»
15 years 3 months ago
Stereo Correspondence with Discrete-Time Cellular Neural Networks
In this paper, we propose a new approach of solving the stereopsis problem with a discrete-time cellular neural network(DTCNN) where each node has connectionsonly with its local n...
Sungjun Park, Seung-Jai Min, Soo-Ik Chae
CVPR
2006
IEEE
16 years 1 months ago
Hierarchical Volumetric Multi-view Stereo Reconstruction of Manifold Surfaces based on Dual Graph Embedding
This paper presents a new volumetric stereo algorithm to reconstruct the 3D shape of an arbitrary object. Our method is based on finding the minimum cut in an octahedral graph str...
Alexander Hornung, Leif Kobbelt
ECCV
2010
Springer
15 years 5 months ago
The Generalized PatchMatch Correspondence Algorithm
Abstract. PatchMatch is a fast algorithm for computing dense approximate nearest neighbor correspondences between patches of two image regions [1]. This paper generalizes PatchMatc...
CVPR
2003
IEEE
16 years 1 months ago
Extracting Dense Features for Visual Correspondence with Graph Cuts
We present a method for extracting dense features from stereo and motion sequences. Our dense feature is defined symmetrically with respect to both images, and it is extracted dur...
Olga Veksler
IJCV
2002
227views more  IJCV 2002»
14 years 11 months ago
Calculating Dense Disparity Maps from Color Stereo Images, an Efficient Implementation
Abstract-- This paper presents an efficient implementation for correlation based stereo. Research in this area can roughly be divided in two classes: improving accuracy regardless ...
Karsten Mühlmann, Dennis Maier, Jürgen H...