Sciweavers

1133 search results - page 62 / 227
» Basics of Graph Cuts
Sort
View
ICCV
2009
IEEE
15 years 3 months ago
Extending Continuous Cuts: Anisotropic Metrics and Expansion Moves
The concept of graph cuts is by now a standard method for all sorts of low level vision problems. Its popularity is largely due to the fact that globally or near globally optimal...
Carl Olsson, Martin Byr¨od, Niels Chr. Overgaard,...
CORR
2002
Springer
79views Education» more  CORR 2002»
13 years 10 months ago
Optimally cutting a surface into a disk
We consider the problem of cutting a subset of the edges of a polyhedral manifold surface, possibly with boundary, to obtain a single topological disk, minimizing either the total...
Jeff Erickson, Sariel Har-Peled
ICDM
2008
IEEE
122views Data Mining» more  ICDM 2008»
14 years 4 months ago
Nonnegative Matrix Factorization for Combinatorial Optimization: Spectral Clustering, Graph Matching, and Clique Finding
Nonnegative matrix factorization (NMF) is a versatile model for data clustering. In this paper, we propose several NMF inspired algorithms to solve different data mining problems....
Chris H. Q. Ding, Tao Li, Michael I. Jordan
ACL
2004
13 years 11 months ago
A Sentimental Education: Sentiment Analysis Using Subjectivity Summarization Based on Minimum Cuts
Sentiment analysis seeks to identify the viewpoint(s) underlying a text span; an example application is classifying a movie review as "thumbs up" or "thumbs down&qu...
Bo Pang, Lillian Lee
MM
2006
ACM
103views Multimedia» more  MM 2006»
14 years 4 months ago
Progressive cut
Recently, interactive image cutout technique becomes prevalent for image segmentation problem due to its easy-to-use nature. However, most existing stroke-based interactive object...
Chao Wang, Qiong Yang, Mo Chen, Xiaoou Tang, Zhong...