Sciweavers

343 search results - page 33 / 69
» Geodesic Methods in Computer Vision and Graphics
Sort
View
JMLR
2006
125views more  JMLR 2006»
14 years 10 months ago
Linear Programming Relaxations and Belief Propagation - An Empirical Study
The problem of finding the most probable (MAP) configuration in graphical models comes up in a wide range of applications. In a general graphical model this problem is NP hard, bu...
Chen Yanover, Talya Meltzer, Yair Weiss
ICPR
2000
IEEE
15 years 11 months ago
A Quick 3D-2D Registration Method for a Wide-Range of Applications
Amethod for quick determination of the position and pose of a 3D free-form object with respect to its 2D projective image(s) is proposed. It is a precondition of the method that a...
Yasuyo Kita, Nobuyuki Kita, Dale L. Wilson, J. Ali...
ICPR
2004
IEEE
15 years 11 months ago
BTF Image Space Utmost Compression and Modelling Method
The bidirectional texture function (BTF) describes texture appearance variations due to varying illumination and viewing conditions. This function is acquired by large number of m...
Jirí Filip, Michael Arnold, Michal Haindl
ICVS
2009
Springer
15 years 4 months ago
GPU-Accelerated Nearest Neighbor Search for 3D Registration
Abstract. Nearest Neighbor Search (NNS) is employed by many computer vision algorithms. The computational complexity is large and constitutes a challenge for real-time capability. ...
Deyuan Qiu, Stefan May, Andreas Nüchter
ECCV
2008
Springer
15 years 12 months ago
Surface Visibility Probabilities in 3D Cluttered Scenes
Many methods for 3D reconstruction in computer vision rely on probability models, for example, Bayesian reasoning. Here we introduce a probability model of surface visibilities in ...
Michael S. Langer