Sciweavers

478 search results - page 4 / 96
» Convexity minimizes pseudo-triangulations
Sort
View
ISVC
2010
Springer
13 years 4 months ago
Split Bregman Method for Minimization of Region-Scalable Fitting Energy for Image Segmentation
Abstract. In this paper, we incorporated the global convex segmentation method and the split Bregman technique into the region-scalable fitting energy model. The new proposed metho...
Yunyun Yang, Chunming Li, Chiu-Yen Kao, Stanley Os...
PAMI
2011
13 years 1 months ago
Multiview Stereo and Silhouette Consistency via Convex Functionals over Convex Domains
—We propose a convex formulation for silhouette and stereo fusion in 3D reconstruction from multiple images. The key idea is to show that the reconstruction problem can be cast a...
Daniel Cremers, Kalin Kolev
MOR
2010
108views more  MOR 2010»
13 years 5 months ago
Accuracy Certificates for Computational Problems with Convex Structure
The goal of the current paper is to introduce the notion of certificates which verify the accuracy of solutions of computational problems with convex structure; such problems inc...
Arkadi Nemirovski, Shmuel Onn, Uriel G. Rothblum
ICIP
2010
IEEE
13 years 5 months ago
Gradient projection for linearly constrained convex optimization in sparse signal recovery
The 2- 1 compressed sensing minimization problem can be solved efficiently by gradient projection. In imaging applications, the signal of interest corresponds to nonnegative pixel...
Zachary T. Harmany, Daniel Thompson, Rebecca Wille...
CORR
2012
Springer
224views Education» more  CORR 2012»
12 years 2 months ago
On the Lagrangian Biduality of Sparsity Minimization Problems
We present a novel primal-dual analysis on a class of NPhard sparsity minimization problems to provide new interpretations for their well known convex relaxations. We show that th...
Dheeraj Singaraju, Ehsan Elhamifar, Roberto Tron, ...