Sciweavers

393 search results - page 13 / 79
» Convex Programming Methods for Global Optimization
Sort
View
AAAI
2011
12 years 7 months ago
Convex Sparse Coding, Subspace Learning, and Semi-Supervised Extensions
Automated feature discovery is a fundamental problem in machine learning. Although classical feature discovery methods do not guarantee optimal solutions in general, it has been r...
Xinhua Zhang, Yaoliang Yu, Martha White, Ruitong H...
CVPR
2006
IEEE
14 years 9 months ago
The Registration Problem Revisited: Optimal Solutions From Points, Lines and Planes
In this paper we propose a practical and efficient method for finding the globally optimal solution to the problem of pose estimation of a known object. We present a framework tha...
Carl Olsson, Fredrik Kahl, Magnus Oskarsson
CDC
2009
IEEE
137views Control Systems» more  CDC 2009»
14 years 6 days ago
Kernel regression for travel time estimation via convex optimization
—We develop an algorithm aimed at estimating travel time on segments of a road network using a convex optimization framework. Sampled travel time from probe vehicles are assumed ...
Sebastien Blandin, Laurent El Ghaoui, Alexandre M....
DAGM
2009
Springer
14 years 2 months ago
Globally Optimal Finsler Active Contours
We present a continuous and convex formulation for Finsler active contours using seed regions or utilizing a regional bias term. The utilization of general Finsler metrics instead ...
Christopher Zach, Liang Shan, Marc Niethammer
TSP
2010
13 years 2 months ago
Two-channel linear phase FIR QMF bank minimax design via global nonconvex optimization programming
In this correspondence, a two-channel linear phase finite impulse response (FIR) quadrature mirror filter (QMF) bank minimax design problem is formulated as a nonconvex optimizati...
Charlotte Yuk-Fan Ho, Bingo Wing-Kuen Ling, Lamia ...