Sciweavers

666 search results - page 68 / 134
» Unbalanced Graph Cuts
Sort
View
102
Voted
JGAA
2007
124views more  JGAA 2007»
15 years 2 months ago
Energy Models for Graph Clustering
The cluster structure of many real-world graphs is of great interest, as the clusters may correspond e.g. to communities in social networks or to cohesive modules in software syst...
Andreas Noack
116
Voted
ICCV
2003
IEEE
16 years 4 months ago
Visual Correspondence Using Energy Minimization and Mutual Information
We address visual correspondence problems without assuming that scene points have similar intensities in different views.This situation is common, usually due to non-lambertian sc...
Junhwan Kim, Vladimir Kolmogorov, Ramin Zabih
138
Voted
SMI
2006
IEEE
108views Image Analysis» more  SMI 2006»
15 years 8 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...
163
Voted
ECCV
2010
Springer
15 years 2 months ago
Superpixels and Supervoxels in an Energy Optimization Framework
Many methods for object recognition, segmentation, etc., rely on tessellation of an image into "superpixels". A superpixel is an image patch which is better aligned with ...
Olga Veksler, Yuri Boykov, Paria Mehrani
126
Voted
SIGSOFT
2010
ACM
15 years 15 days 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...