Sciweavers

5247 search results - page 229 / 1050
» Frequency Optimized Computation Methods
Sort
View
CVPR
2007
IEEE
15 years 23 days ago
Fast, Approximately Optimal Solutions for Single and Dynamic MRFs
A new efficient MRF optimization algorithm, called FastPD, is proposed, which generalizes -expansion. One of its main advantages is that it offers a substantial speedup over that ...
Nikos Komodakis, Georgios Tziritas, Nikos Paragios
CVPR
2007
IEEE
15 years 23 days ago
Global Optimization for Shape Fitting
We propose a global optimization framework for 3D shape reconstruction from sparse noisy 3D measurements frequently encountered in range scanning, sparse featurebased stereo, and ...
Victor S. Lempitsky, Yuri Boykov
ISVC
2009
Springer
14 years 5 months ago
A Novel Method for Enhanced Needle Localization Using Ultrasound-Guidance
Abstract. In this paper, we propose a novel and fast method to localize and track needles during image-guided interventions. Our proposed method is comprised of framework of needle...
Bin Dong, Eric Savitsky, Stanley Osher
ECCV
2006
Springer
15 years 20 days ago
A Comparative Study of Energy Minimization Methods for Markov Random Fields
One of the most exciting advances in early vision has been the development of efficient energy minimization algorithms. Many early vision tasks require labeling each pixel with som...
Richard Szeliski, Ramin Zabih, Daniel Scharstein, ...
COR
2007
81views more  COR 2007»
13 years 10 months ago
Job scheduling methods for reducing waiting time variance
Minimizing Waiting Time Variance (WTV) is a job scheduling problem where we schedule a batch of n jobs, for servicing on a single resource, in such a way that the variance of thei...
Nong Ye, Xueping Li, Toni Farley, Xiaoyun Xu