Sciweavers

1093 search results - page 21 / 219
» Clustering from Constraint Graphs
Sort
View
ICCV
2009
IEEE
15 years 2 months ago
Optimal Correspondences from Pairwise Constraints
Correspondence problems are of great importance in computer vision. They appear as subtasks in many applications such as object recognition, merging partial 3D reconstructions a...
Olof Enqvist, Klas Josephson, Fredrik Kahl
ICAPR
2005
Springer
14 years 3 months ago
Hierarchical Clustering of Dynamical Systems Based on Eigenvalue Constraints
Abstract. This paper addresses the clustering problem of hidden dynamical systems behind observed multivariate sequences by assuming an interval-based temporal structure in the seq...
Hiroaki Kawashima, Takashi Matsuyama
KDD
2004
ACM
145views Data Mining» more  KDD 2004»
14 years 3 months ago
A graph-theoretic approach to extract storylines from search results
We present a graph-theoretic approach to discover storylines from search results. Storylines are windows that offer glimpses into interesting themes latent among the top search re...
Ravi Kumar, Uma Mahadevan, D. Sivakumar
CVPR
2012
IEEE
12 years 8 days ago
Discovering discriminative action parts from mid-level video representations
We describe a mid-level approach for action recognition. From an input video, we extract salient spatio-temporal structures by forming clusters of trajectories that serve as candi...
Michalis Raptis, Iasonas Kokkinos, Stefano Soatto
ICDM
2009
IEEE
153views Data Mining» more  ICDM 2009»
13 years 7 months ago
A New Clustering Algorithm Based on Regions of Influence with Self-Detection of the Best Number of Clusters
Clustering methods usually require to know the best number of clusters, or another parameter, e.g. a threshold, which is not ever easy to provide. This paper proposes a new graph-b...
Fabrice Muhlenbach, Stéphane Lallich