Sciweavers

449 search results - page 60 / 90
» Measuring the Similarity of Geometric Graphs
Sort
View
ICCV
2009
IEEE
13 years 5 months ago
The Normalized Subspace Inclusion: Robust clustering of motion subspaces
Perceiving dynamic scenes of rigid bodies, through affine projections of moving 3D point clouds, boils down to clustering the rigid motion subspaces supported by the points' ...
Nuno Pinho da Silva, João Paulo Costeira
ICCV
2007
IEEE
14 years 9 months ago
Joint Affinity Propagation for Multiple View Segmentation
A joint segmentation is a simultaneous segmentation of registered 2D images and 3D points reconstructed from the multiple view images. It is fundamental in structuring the data fo...
Jianxiong Xiao, Jingdong Wang, Ping Tan, Long Quan
KDD
2007
ACM
220views Data Mining» more  KDD 2007»
14 years 8 months ago
SCAN: a structural clustering algorithm for networks
Network clustering (or graph partitioning) is an important task for the discovery of underlying structures in networks. Many algorithms find clusters by maximizing the number of i...
Xiaowei Xu, Nurcan Yuruk, Zhidan Feng, Thomas A. J...
IVC
2008
223views more  IVC 2008»
13 years 7 months ago
Euclidean path modeling for video surveillance
In this paper, we address the issue of Euclidean path modeling in a single camera for activity monitoring in a multi-camera video surveillance system. The method consists of a pat...
Imran N. Junejo, Hassan Foroosh
INFOCOM
2011
IEEE
12 years 11 months ago
Network-aware behavior clustering of Internet end hosts
Abstract—This paper explores the behavior similarity of Internet end hosts in the same network prefixes. We use bipartite graphs to model network traffic, and then construct on...
Kuai Xu, Feng Wang 0002, Lin Gu