Sciweavers

80 search results - page 7 / 16
» A fast cost scaling algorithm for submodular flow
Sort
View

Publication
173views
13 years 10 months ago
Max-Flow Segmentation of the Left Ventricle by Recovering Subject-Specific Distributions via a Bound of the Bhattacharyya Measur
This study investigates fast detection of the left ventricle (LV) endo- and epicardium boundaries in a cardiac magnetic resonance (MR) sequence following the optimization of two or...
Ismail Ben Ayed, Hua-mei Chen, Kumaradevan Punitha...
CVPR
2010
IEEE
15 years 8 months ago
Fast Globally Optimal 2D Human Detection with Loopy Graph Models
This paper presents an algorithm for recovering the globally optimal 2D human figure detection using a loopy graph model. This is computationally challenging because the time comp...
Tai-Peng Tian, Stan Sclaroff
ASPDAC
2004
ACM
118views Hardware» more  ASPDAC 2004»
15 years 5 months ago
Fast and efficient voltage scheduling by evolutionary slack distribution
- To minimize energy consumption by voltage scaling in design of heterogeneousreal-time embeddedsystems, it is necessary to perfom two distinct tasks: task scheduling (TS) and volt...
Bita Gorjiara, Pai H. Chou, Nader Bagherzadeh, Meh...
CVPR
2007
IEEE
16 years 1 months ago
A Multi-Scale Tikhonov Regularization Scheme for Implicit Surface Modelling
Kernel machines have recently been considered as a promising solution for implicit surface modelling. A key challenge of machine learning solutions is how to fit implicit shape mo...
Jianke Zhu, Steven C. H. Hoi, Michael R. Lyu
JMLR
2012
13 years 2 months ago
Fast interior-point inference in high-dimensional sparse, penalized state-space models
We present an algorithm for fast posterior inference in penalized high-dimensional state-space models, suitable in the case where a few measurements are taken in each time step. W...
Eftychios A. Pnevmatikakis, Liam Paninski