Sciweavers

666 search results - page 94 / 134
» Unbalanced Graph Cuts
Sort
View
BMVC
2010
13 years 8 months ago
Graph-based Analysis of Textured Images for Hierarchical Segmentation
The Texture Fragmentation and Reconstruction (TFR) algorithm has been recently introduced [9] to address the problem of image segmentation by textural properties, based on a suita...
Raffaele Gaetano, Giuseppe Scarpa, Tamás Sz...
KDD
2006
ACM
198views Data Mining» more  KDD 2006»
14 years 10 months ago
Event detection from evolution of click-through data
Previous efforts on event detection from the web have focused primarily on web content and structure data ignoring the rich collection of web log data. In this paper, we propose t...
Qiankun Zhao, Tie-Yan Liu, Sourav S. Bhowmick, Wei...
CVPR
2007
IEEE
15 years 1 days ago
Global Optimization for Shape Fitting
We propose a global optimization framework for 3D shape reconstruction from sparse noisy 3D measurements frequently encountered in range scanning, sparse featurebased stereo, and ...
Victor S. Lempitsky, Yuri Boykov
CVPR
2010
IEEE
14 years 6 months ago
Finding Dots: Segmentation as Popping out Regions from Boundaries
Many applications need to segment out all small round regions in an image. This task of finding dots can be viewed as a region segmentation problem where the dots form one regio...
Elena Bernardis, Stella Yu
WEA
2010
Springer
330views Algorithms» more  WEA 2010»
14 years 4 months ago
Exact Bipartite Crossing Minimization under Tree Constraints
A tanglegram consists of a pair of (not necessarily binary) trees T1, T2 with leaf sets L1, L2. Additional edges, called tangles, may connect nodes in L1 with those in L2. The task...
Frank Baumann, Christoph Buchheim, Frauke Liers