Sciweavers

165 search results - page 5 / 33
» Stereo Matching as a Nearest-Neighbor Problem
Sort
View
CSB
2004
IEEE
149views Bioinformatics» more  CSB 2004»
14 years 9 days ago
Weighting Features to Recognize 3D Patterns of Electron Density in X-Ray Protein Crystallography
Feature selection and weighting are central problems in pattern recognition and instance-based learning. In this work, we discuss the challenges of constructing and weighting feat...
Kreshna Gopal, Tod D. Romo, James C. Sacchettini, ...
ICPR
2000
IEEE
14 years 9 months ago
Using Geometric Constraints for Matching Disparate Stereo Views of 3D Scenes Containing Planes
Several vision tasks rely upon the availability of sets of corresponding features among images. This paper presents a method which, given some corresponding features in two stereo...
Manolis I. A. Lourakis, Stavros V. Tzurbakis, Anto...
ESA
2010
Springer
140views Algorithms» more  ESA 2010»
13 years 9 months ago
A Unified Approach to Approximate Proximity Searching
The inability to answer proximity queries efficiently for spaces of dimension d > 2 has led to the study of approximation to proximity problems. Several techniques have been pro...
Sunil Arya, Guilherme Dias da Fonseca, David M. Mo...
CRYPTO
2005
Springer
106views Cryptology» more  CRYPTO 2005»
14 years 2 months ago
Secure Computation of Constant-Depth Circuits with Applications to Database Search Problems
Motivated by database search problems such as partial match or nearest neighbor, we present secure multiparty computation protocols for constant-depth circuits. Specifically, for ...
Omer Barkol, Yuval Ishai
CVPR
2004
IEEE
14 years 10 months ago
Segment-Based Stereo Matching Using Graph Cuts
In this paper, we present a new segment-based stereo matching algorithm using graph cuts. In our approach, the reference image is divided into non-overlapping homogeneous segments...
Li Hong, George Chen