Sciweavers

34 search results - page 3 / 7
» An analysis of graph cut size for transductive learning
Sort
View
ICIP
2007
IEEE
14 years 1 months ago
Graph Cut Segmentation with Nonlinear Shape Priors
Graph cut image segmentation with intensity information alone is prone to fail for objects with weak edges, in clutter, or under occlusion. Existing methods to incorporate shape a...
James G. Malcolm, Yogesh Rathi, Allen Tannenbaum
TCC
2012
Springer
218views Cryptology» more  TCC 2012»
12 years 3 months ago
Iterative Constructions and Private Data Release
In this paper we study the problem of approximately releasing the cut function of a graph while preserving differential privacy, and give new algorithms (and new analyses of exis...
Anupam Gupta, Aaron Roth, Jonathan Ullman
SMI
2006
IEEE
108views Image Analysis» more  SMI 2006»
14 years 1 months ago
Segmenting Point Sets
There is a growing need to extract features from point sets for purposes like model classification, matching, and exploration. We introduce a technique for segmenting a point-sam...
Ichitaro Yamazaki, Vijay Natarajan, Zhaojun Bai, B...
SIGSOFT
2010
ACM
13 years 5 months ago
Language-based replay via data flow cut
A replay tool aiming to reproduce a program's execution interposes itself at an appropriate replay interface between the program and the environment. During recording, it log...
Ming Wu, Fan Long, Xi Wang, Zhilei Xu, Haoxiang Li...
CIVR
2005
Springer
133views Image Analysis» more  CIVR 2005»
14 years 1 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