Sciweavers

478 search results - page 21 / 96
» Convexity minimizes pseudo-triangulations
Sort
View
ICCV
2009
IEEE
15 years 26 days ago
An Algorithm for Minimizing the Piecewise Smooth 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 algori...
Thomas Pock, Daniel Cremers, Horst Bischof, Antoni...
ICRA
2010
IEEE
102views Robotics» more  ICRA 2010»
13 years 6 months ago
A fast n-dimensional ray-shooting algorithm for grasping force optimization
We present an efficient algorithm for solving the ray-shooting problem on high dimensional sets. Our algorithm computes the intersection of the boundary of a compact convex set w...
Yu Zheng, Ming C. Lin, Dinesh Manocha
ISAAC
2010
Springer
272views Algorithms» more  ISAAC 2010»
13 years 5 months ago
Neighbor Systems, Jump Systems, and Bisubmodular Polyhedra
The concept of neighbor system, introduced by Hartvigsen (2009), is a set of integral vectors satisfying a certain combinatorial property. In this paper, we reveal the relationship...
Akiyoshi Shioura
JSCIC
2010
231views more  JSCIC 2010»
13 years 2 months ago
Geometric Applications of the Split Bregman Method: Segmentation and Surface Reconstruction
Variational models for image segmentation have many applications, but can be slow to compute. Recently, globally convex segmentation models have been introduced which are very rel...
Tom Goldstein, Xavier Bresson, Stanley Osher
CDC
2009
IEEE
149views Control Systems» more  CDC 2009»
14 years 18 days ago
Solving large-scale linear circuit problems via convex optimization
Abstract— A broad class of problems in circuits, electromagnetics, and optics can be expressed as finding some parameters of a linear system with a specific type. This paper is...
Javad Lavaei, Aydin Babakhani, Ali Hajimiri, John ...