Sciweavers

ICASSP
2011
IEEE
13 years 2 months ago
Efficient semidefinite relaxation for robust geolocation of unknown emitter by a satellite cluster using TDOA and FDOA measureme
In this paper, we consider the problem of geolocating an unknown emitter by a satellite cluster. We formulate the problem as the maximum likelihood location estimation by using TD...
Kehu Yang, Lizhong Jiang, Zhi-Quan Luo
ORL
2011
13 years 5 months ago
Convex approximations to sparse PCA via Lagrangian duality
We derive a convex relaxation for cardinality constrained Principal Component Analysis (PCA) by using a simple representation of the L1 unit ball and standard Lagrangian duality. ...
Ronny Luss, Marc Teboulle
TIT
2010
137views Education» more  TIT 2010»
13 years 5 months ago
Average case analysis of multichannel sparse recovery using convex relaxation
This paper considers recovery of jointly sparse multichannel signals from incomplete measurements. Several approaches have been developed to recover the unknown sparse vectors from...
Yonina C. Eldar, Holger Rauhut
ICCV
2009
IEEE
13 years 9 months ago
An algorithm for minimizing the Mumford-Shah functional
In this work we revisit the Mumford-Shah functional, one of the most studied variational approaches to image segmentation. The contribution of this paper is to propose an algorith...
Thomas Pock, Daniel Cremers, Horst Bischof, Antoni...
ICML
2010
IEEE
14 years 8 days ago
Accelerated dual decomposition for MAP inference
Approximate MAP inference in graphical models is an important and challenging problem for many domains including computer vision, computational biology and natural language unders...
Vladimir Jojic, Stephen Gould, Daphne Koller
NIPS
2007
14 years 18 days ago
Convex Relaxations of Latent Variable Training
We investigate a new, convex relaxation of an expectation-maximization (EM) variant that approximates a standard objective while eliminating local minima. First, a cautionary resu...
Yuhong Guo, Dale Schuurmans
ECCV
2010
Springer
14 years 4 months ago
Convex Relaxation for Multilabel Problems with Product Label Spaces
Convex relaxations for continuous multilabel problems have attracted a lot of interest recently [1–5]. Unfortunately, in previous methods, the runtime and memory requirements sca...
CVPR
2009
IEEE
15 years 6 months ago
Continuous Ratio Optimization via Convex Relaxation with Applications to Multiview 3D Reconstruction
We introduce a convex relaxation framework to optimally minimize continuous surface ratios. The key idea is to minimize the continuous surface ratio by solving a sequence of con...
Kalin Kolev (University of Bonn), Daniel Cremers (...