Sciweavers

59 search results - page 2 / 12
» A spectral bundle method with bounds
Sort
View
CVPR
2011
IEEE
12 years 11 months ago
Fusion of GPS and Structure-from-Motion using Constrained Bundle Adjustments
Two problems occur when bundle adjustment (BA) is applied on long image sequences: the large calculation time and the drift (or error accumulation). In recent work, the calculatio...
Maxime Lhuillier
ICCV
2011
IEEE
12 years 7 months ago
Generalized Subgraph Preconditioners for Large-Scale Bundle Adjustment
We present a generalized subgraph preconditioning (GSP) technique to solve large-scale bundle adjustment problems efficiently. In contrast with previous work which uses either di...
Yong-Dian Jian, Doru C. Balcan, Frank Dellaert
IPCO
2008
221views Optimization» more  IPCO 2008»
13 years 8 months ago
A Comparative Study of Linear and Semidefinite Branch-and-Cut Methods for Solving the Minimum Graph Bisection Problem
Abstract. Semidefinite relaxations are known to deliver good approximations for combinatorial optimization problems like graph bisection. Using the spectral bundle method it is pos...
Michael Armbruster, Marzena Fügenschuh, Chris...
ISBI
2011
IEEE
12 years 11 months ago
Sparse Riemannian manifold clustering for HARDI segmentation
We address the problem of segmenting high angular resolution diffusion images of the brain into cerebral regions corresponding to distinct white matter fiber bundles. We cast thi...
Hasan Ertan Çetingül, René Vida...
CORR
2010
Springer
107views Education» more  CORR 2010»
13 years 4 months ago
Metric uniformization and spectral bounds for graphs
We present a method for proving upper bounds on the eigenvalues of the graph Laplacian. A main step involves choosing an appropriate "Riemannian" metric to uniformize th...
Jonathan A. Kelner, James R. Lee, Gregory N. Price...