Sciweavers

393 search results - page 25 / 79
» Convex Programming Methods for Global Optimization
Sort
View
ICIP
2001
IEEE
14 years 9 months ago
Optimal radial contour tracking by dynamic programming
A common problem in most active contour methods is that the recursive searching scheme can only return a local optimal solution. Furthermore, the internal energy of the snake is n...
Yunqiang Chen, Thomas S. Huang, Yong Rui
EMMCVPR
2011
Springer
12 years 7 months ago
Globally Optimal Image Partitioning by Multicuts
Abstract. We introduce an approach to both image labeling and unsupervised image partitioning as different instances of the multicut problem, together with an algorithm returning ...
Jörg H. Kappes, Markus Speth, Björn Andr...
CVPR
2006
IEEE
14 years 9 months ago
Successive Convex Matching for Action Detection
We propose human action detection based on a successive convex matching scheme. Human actions are represented as sequences of postures and specific actions are detected in video b...
Hao Jiang, Mark S. Drew, Ze-Nian Li
ICML
2004
IEEE
14 years 8 months ago
Multiple kernel learning, conic duality, and the SMO algorithm
While classical kernel-based classifiers are based on a single kernel, in practice it is often desirable to base classifiers on combinations of multiple kernels. Lanckriet et al. ...
Francis R. Bach, Gert R. G. Lanckriet, Michael I. ...
CPAIOR
2005
Springer
14 years 1 months ago
A Search-Infer-and-Relax Framework for Integrating Solution Methods
Abstract. We present an algorithmic framework for integrating solution methods that is based on search, inference, and relaxation and their interactions. We show that the following...
John N. Hooker