1352 search results - page 87 / 271 » An algorithm for minimizing the Mumford-Shah functional |
CVIU
2008
2008
Topology cuts: A novel min-cut/max-flow algorithm for topology preserving segmentation in N-D images
13 years 9 months ago
Topology is an important prior in many image segmentation tasks. In this paper, we design and implement a novel graph-based min-cut/max-flow algorithm that incorporates topology p...
ICIP
2007
IEEE
14 years 3 months ago
2007
IEEE
Practical sparse approximation algorithms (particularly greedy algorithms) suffer two significant drawbacks: they are difficult to implement in hardware, and they are inefficie...
ECCC
2006
13 years 8 months ago
2006
We introduce a new algorithm and a new analysis technique that is applicable to a variety of online optimization scenarios, including regret minimization for Lipschitz regret func...
TR
2008
13 years 8 months ago
2008
A custom genetic algorithm was developed and implemented to solve multiple objective multi-state reliability optimization design problems. Many real-world engineering design proble...
APPROX
2005
Springer
14 years 2 months ago
2005
Springer
We study the partial vertex cover problem. Given a graph G = (V, E), a weight function w : V → R+ , and an integer s, our goal is to cover all but s edges, by picking a set of v...