Sciweavers

396 search results - page 40 / 80
» A Graph Cut Algorithm for Generalized Image Deconvolution
Sort
View
KDD
2012
ACM
200views Data Mining» more  KDD 2012»
11 years 11 months ago
Vertex neighborhoods, low conductance cuts, and good seeds for local community methods
The communities of a social network are sets of vertices with more connections inside the set than outside. We theoretically demonstrate that two commonly observed properties of s...
David F. Gleich, C. Seshadhri
ICIP
2010
IEEE
13 years 6 months ago
Multi-label propagation for coherent video segmentation and artistic stylization
We present a new algorithm for segmenting video frames into temporally stable colored regions, applying our technique to create artistic stylizations (e.g. cartoons and paintings)...
Tinghuai Wang, Jean-Yves Guillemaut, John P. Collo...
IPMI
2011
Springer
13 years 2 days ago
Globally Optimal Tumor Segmentation in PET-CT Images: A Graph-Based Co-segmentation Method
Tumor segmentation in PET and CT images is notoriously challenging due to the low spatial resolution in PET and low contrast in CT images. In this paper, we proposed a general fram...
Dongfeng Han, John E. Bayouth, Qi Song, Aakant Tau...
CIVR
2005
Springer
133views Image Analysis» more  CIVR 2005»
14 years 2 months ago
Hot Event Detection and Summarization by Graph Modeling and Matching
This paper proposes a new approach for hot event detection and summarization of news videos. The approach is mainly based on two graph algorithms: optimal matching (OM) and normali...
Yuxin Peng, Chong-Wah Ngo
STOC
2003
ACM
133views Algorithms» more  STOC 2003»
14 years 9 months ago
A fast algorithm for computing steiner edge connectivity
Given an undirected graph or an Eulerian directed graph G and a subset S of its vertices, we show how to determine the edge connectivity C of the vertices in S in time O(C3 n log ...
Richard Cole, Ramesh Hariharan