Sciweavers

138 search results - page 17 / 28
» Efficient Planar Graph Cuts with Applications in Computer Vi...
Sort
View
EMMCVPR
2009
Springer
14 years 2 months ago
Multi-label Moves for MRFs with Truncated Convex Priors
Optimization with graph cuts became very popular in recent years. As more applications rely on graph cuts, different energy functions are being employed. Recent evaluation of optim...
Olga Veksler
STOC
2006
ACM
125views Algorithms» more  STOC 2006»
14 years 8 months ago
On earthmover distance, metric labeling, and 0-extension
We study the fundamental classification problems 0-Extension and Metric Labeling. A generalization of Multiway Cut, 0-Extension is closely related to partitioning problems in grap...
Howard J. Karloff, Subhash Khot, Aranyak Mehta, Yu...
CVPR
2000
IEEE
14 years 8 days ago
Perceptual Grouping and Segmentation by Stochastic Clustering
We use cluster analysis as a unifying principle for problems from low, middle and high level vision. The clustering problem is viewed as graph partitioning, where nodes represent ...
Yoram Gdalyahu, Noam Shental, Daphna Weinshall
EDBT
2006
ACM
174views Database» more  EDBT 2006»
14 years 8 months ago
Fast Computation of Reachability Labeling for Large Graphs
The need of processing graph reachability queries stems from many applications that manage complex data as graphs. The applications include transportation network, Internet traffic...
Jiefeng Cheng, Jeffrey Xu Yu, Xuemin Lin, Haixun W...
CVPR
2010
IEEE
14 years 6 days ago
Efficient Hierarchical Graph-Based Video Segmentation
We present an efficient and scalable technique for spatiotemporal segmentation of long video sequences using a hierarchical graph-based algorithm. We begin by oversegmenting a vol...
Matthias Grundmann, Vivek Kwatra, Mei Han, Irfan E...