Search Results for author:
Found 5 papers, 0 papers with code
Clustering Aggregation as Maximum-Weight Independent Set
Since the clusters of each input clustering form a partition of the dataset, the vertices corresponding to each clustering form a maximal independent set (MIS) in the attributed graph.
Fusion with Diffusion for Robust Visual Tracking
A key feature of our approach is that the time complexity of the dif-fusion on the TPG is the same as the diffusion process on each of the original graphs, Moreover, it is not necessary to explicitly construct the TPG in our frame-work.
Maximal Cliques that Satisfy Hard Constraints with Application to Deformable Object Model Learning
We propose a novel inference framework for finding maximal cliques in a weighted graph that satisfy hard constraints.
Robust Clustering as Ensembles of Affinity Relations
In this paper, we regard clustering as ensembles of k-ary affinity relations and clusters correspond to subsets of objects with maximal average affinity relations.
Multiscale Random Fields with Application to Contour Grouping
It is based on a new operator, called append, that combines sets of random variables (RVs) to single RVs.
