Sciweavers

117 search results - page 13 / 24
» Sparse reconstruction by separable approximation
Sort
View
IPCO
2008
221views Optimization» more  IPCO 2008»
13 years 9 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...
CVPR
2010
IEEE
1351views Computer Vision» more  CVPR 2010»
14 years 3 months ago
Live Dense Reconstruction with a Single Moving Camera
We present a method which enables rapid and dense reconstruction of scenes browsed by a single live camera. We take point-based real-time structure from motion (SFM) as our starti...
Richard Newcombe, Andrew Davison
IVC
2008
138views more  IVC 2008»
13 years 7 months ago
Reconstructing relief surfaces
This paper generalizes Markov Random Field (MRF) stereo methods to the generation of surface relief (height) fields rather than disparity or depth maps. This generalization enable...
George Vogiatzis, Philip H. S. Torr, Steven M. Sei...
COLT
2010
Springer
13 years 5 months ago
Toward Learning Gaussian Mixtures with Arbitrary Separation
In recent years analysis of complexity of learning Gaussian mixture models from sampled data has received significant attention in computational machine learning and theory commun...
Mikhail Belkin, Kaushik Sinha
NECO
2007
127views more  NECO 2007»
13 years 7 months ago
Visual Recognition and Inference Using Dynamic Overcomplete Sparse Learning
We present a hierarchical architecture and learning algorithm for visual recognition and other visual inference tasks such as imagination, reconstruction of occluded images, and e...
Joseph F. Murray, Kenneth Kreutz-Delgado