Sciweavers

299 search results - page 8 / 60
» A Convex Relaxation Approach for Computing Minimal Partition...
Sort
View
ECCV
2008
Springer
14 years 9 months ago
Integration of Multiview Stereo and Silhouettes Via Convex Functionals on Convex Domains
We propose a convex framework for silhouette and stereo fusion in 3D reconstruction from multiple images. The key idea is to show that the reconstruction problem can be cast as one...
Kalin Kolev, Daniel Cremers
ICCV
2005
IEEE
14 years 9 months ago
Globally Optimal Estimates for Geometric Reconstruction Problems
We introduce a framework for computing statistically optimal estimates of geometric reconstruction problems. While traditional algorithms often suffer from either local minima or ...
Fredrik Kahl, Didier Henrion
ISCIS
2003
Springer
14 years 27 days ago
Minimizing Communication Cost in Fine-Grain Partitioning of Sparse Matrices
Abstract. We show a two-phase approach for minimizing various communication-cost metrics in fine-grain partitioning of sparse matrices for parallel processing. In the first phase...
Bora Uçar, Cevdet Aykanat
COR
2008
101views more  COR 2008»
13 years 7 months ago
Stochastic facility location with general long-run costs and convex short-run costs
This paper addresses the problem of minimizing the expected cost of locating a number of single product facilities and allocating uncertain customer demand to these facilities. Th...
Peter Schütz, Leen Stougie, Asgeir Tomasgard

Publication
433views
14 years 4 months ago
Optimal Feature Selection for Subspace Image Matching
Image matching has been a central research topic in computer vision over the last decades. Typical approaches for correspondence involve matching features between images. In this p...
Gemma Roig, Xavier Boix, Fernando De la Torre