Sciweavers

242 search results - page 26 / 49
» Compact Fundamental Matrix Computation
Sort
View
ICCV
2003
IEEE
15 years 11 months ago
Globally Convergent Autocalibration
Existing autocalibration techniques use numerical optimization algorithms that are prone to the problem of local minima. To address this problem, we have developed a method where ...
Arrigo Benedetti, Alessandro Busti, Michela Farenz...
ICPR
2000
IEEE
15 years 10 months ago
Robust Dense Matching Using Local and Global Geometric Constraints
A new robust dense matching algorithm is introduced in this paper. The algorithm starts from matching the most textured points, then a match propagation algorithm is developed wit...
Maxime Lhuillier, Long Quan
ICASSP
2008
IEEE
15 years 4 months ago
Maximum kernel density estimator for robust fitting
Robust model fitting plays an important role in many computer vision applications. In this paper, we propose a new robust estimator — Maximum Kernel Density Estimator (MKDE) bas...
Hanzi Wang
CF
2009
ACM
15 years 4 months ago
Space-and-time efficient garbage collectors for parallel systems
As multithreaded server applications and runtime systems prevail, garbage collection is becoming an essential feature to support high performance systems. The fundamental issue of...
Shaoshan Liu, Ligang Wang, Xiao-Feng Li, Jean-Luc ...
ICCV
2003
IEEE
15 years 11 months ago
Two-Frame Wide Baseline Matching
This paper describes a novel approach to automatically recover corresponding feature points and epipolar geometry over two wide baseline frames. Our contributions consist of sever...
Jiangjian Xiao, Mubarak Shah