Sciweavers

2988 search results - page 121 / 598
» Experiments with a New Boosting Algorithm
Sort
View
ECCV
2000
Springer
15 years 10 months ago
Measuring the Self-Consistency of Stereo Algorithms
A new approach to characterizing the performance of point-correspondence algorithms is presented. Instead of relying on any \ground truth', it uses the self-consistency of th...
Yvan G. Leclerc, Quang-Tuan Luong, Pascal Fua
NPL
2006
100views more  NPL 2006»
15 years 6 months ago
Constrained Projection Approximation Algorithms for Principal Component Analysis
Abstract. In this paper we introduce a new error measure, integrated reconstruction error (IRE) and show that the minimization of IRE leads to principal eigenvectors (without rotat...
Seungjin Choi, Jong-Hoon Ahn, Andrzej Cichocki
ICPR
2008
IEEE
16 years 25 days ago
Partial closure-based constrained clustering with order ranking
In this paper we propose a new partial closure-based constrained clustering algorithm. We introduce closures into the partial constrained clustering and we propose a new measureme...
Shaohong Zhang, Hau-San Wong
AAECC
2001
Springer
121views Algorithms» more  AAECC 2001»
15 years 11 months ago
Algorithms for Large Integer Matrix Problems
Abstract. New algorithms are described and analysed for solving various problems associated with a large integer matrix: computing the Hermite form, computing a kernel basis, and s...
Mark Giesbrecht, Michael J. Jacobson Jr., Arne Sto...
ICCVW
1999
Springer
15 years 10 months ago
Characterizing the Performance of Multiple-Image Point-Correspondence Algorithms Using Self-Consistency
A new approach to characterizing the performance of point-correspondencealgorithmsis presented. Instead of relyingon any \ground truth', it uses the self-consistency of the o...
Yvan G. Leclerc, Quang-Tuan Luong, Pascal Fua