Sciweavers

159 search results - page 9 / 32
» Consistent Minimization of Clustering Objective Functions
Sort
View
ICIP
2003
IEEE
16 years 1 months ago
Graph-based object tracking
This paper proposes a model-based methodology for recognizing and tracking objects in digital image sequences. Objects are represented by attributed relational graphs (or ARGs), w...
Cristina Gomila, Fernand Meyer
CVPR
2011
IEEE
14 years 3 months ago
Entropy Rate Superpixel Segmentation
We propose a new objective function for superpixel segmentation. This objective function consists of two components: entropy rate of a random walk on a graph and a balancing term....
Ming-Yu Liu, Oncel Tuzel, Srikumar Ramalingam, Ram...
CVPR
2012
IEEE
13 years 2 months ago
Robust late fusion with rank minimization
In this paper, we propose a rank minimization method to fuse the predicted confidence scores of multiple models, each of which is obtained based on a certain kind of feature. Spe...
Guangnan Ye, Dong Liu, I-Hong Jhuo, Shih-Fu Chang
ICCV
1999
IEEE
16 years 1 months ago
Fast Approximate Energy Minimization via Graph Cuts
In this paper we address the problem of minimizing a large class of energy functions that occur in early vision. The major restriction is that the energy function's smoothnes...
Yuri Boykov, Olga Veksler, Ramin Zabih
KDD
2012
ACM
196views Data Mining» more  KDD 2012»
13 years 2 months ago
Chromatic correlation clustering
We study a novel clustering problem in which the pairwise relations between objects are categorical. This problem can be viewed as clustering the vertices of a graph whose edges a...
Francesco Bonchi, Aristides Gionis, Francesco Gull...