394 search results - page 22 / 79 » Computing Minimal Polynomials of Matrices |
106
Voted
ICCV
2007
IEEE
16 years 2 months ago
2007
IEEE
Epipolar geometry and relative camera pose computation for uncalibrated cameras with radial distortion has recently been formulated as a minimal problem and successfully solved in...
104
click to vote
EMMCVPR
2001
Springer
15 years 5 months ago
2001
Springer
After [15, 31, 19, 8, 25, 5] minimum cut/maximum flow algorithms on graphs emerged as an increasingly useful tool for exact or approximate energy minimization in low-level vision...
129
click to vote
CVPR
2004
IEEE
16 years 2 months ago
2004
IEEE
We consider the problem of clustering data lying on multiple subspaces of unknown and possibly different dimensions. We show that one can represent the subspaces with a set of pol...
175
click to vote
ECCV
2010
Springer
14 years 9 months ago
2010
Springer
Abstract. Graph cuts has emerged as a preferred method to solve a class of energy minimization problems in computer vision. It has been shown that graph cut algorithms designed kee...
104
click to vote
SODA
2003
ACM
15 years 1 months ago
2003
ACM
This work examines algebraic techniques for comparing quadratic algebraic numbers, thus yielding methods for deciding key predicates in various geometric constructions. Our motiva...