Sciweavers

2498 search results - page 380 / 500
» Algorithms for the Topological Watershed
Sort
View
CVPR
2011
IEEE
14 years 10 months ago
Entropy Rate Superpixel Segmentation
We propose a new objective function for superpixel segmentation. This objective function consists of two components: entropy rate of a random walk on a graph and a balancing term....
Ming-Yu Liu, Oncel Tuzel, Srikumar Ramalingam, Ram...
ICC
2011
IEEE
257views Communications» more  ICC 2011»
14 years 6 months ago
Increasing the Lifetime of Roadside Sensor Networks Using Edge-Betweenness Clustering
Abstract—Wireless Sensor Networks are proven highly successful in many areas, including military and security monitoring. In this paper, we propose a method to use the edge–bet...
Joakim Flathagen, Ovidiu Valentin Drugan, Paal E. ...
TVCG
2012
181views Hardware» more  TVCG 2012»
13 years 9 months ago
Interactive Image Segmentation Based on Level Sets of Probabilities
—In this paper, we present a robust and accurate algorithm for interactive image segmentation. The level set method is clearly advantageous for image objects with a complex topol...
Yugang Liu, Yizhou Yu
ICPR
2000
IEEE
16 years 7 months ago
Piecewise Linear Skeletonization Using Principal Curves
We propose an algorithm to find piecewise linear skeletons of hand-written characters by using principal curves. The development of the method was inspired by the apparent similar...
Adam Krzyzak, Balázs Kégl
PODC
2009
ACM
16 years 1 months ago
Fast scalable deterministic consensus for crash failures
We study communication complexity of consensus in synchronous message-passing systems with processes prone to crashes. The goal in the consensus problem is to have all the nonfaul...
Bogdan S. Chlebus, Dariusz R. Kowalski, Michal Str...