Sciweavers

41 search results - page 4 / 9
» Unsupervised Cosegmentation based on Global Graph Matching
Sort
View
EMMCVPR
2005
Springer
13 years 11 months ago
Probabilistic Subgraph Matching Based on Convex Relaxation
We present a novel approach to the matching of subgraphs for object recognition in computer vision. Feature similarities between object model and scene graph are complemented with ...
Christian Schellewald, Christoph Schnörr
CLEAR
2006
Springer
133views Biometrics» more  CLEAR 2006»
13 years 9 months ago
Multi-feature Graph-Based Object Tracking
We present an object detection and tracking algorithm that addresses the problem of multiple simultaneous targets tracking in realworld surveillance scenarios. The algorithm is bas...
Murtaza Taj, Emilio Maggio, Andrea Cavallaro
SIAMDM
2000
103views more  SIAMDM 2000»
13 years 5 months ago
Directional Routing via Generalized st-Numberings
We present a mathematical model for network routing based on generating paths in a consistent direction. Our development is based on an algebraic and geometric framework for defini...
Fred S. Annexstein, Kenneth A. Berman
GIS
2009
ACM
14 years 6 months ago
Map-Matching for Low-Sampling-Rate GPS Trajectories
Map-matching is the process of aligning a sequence of observed user positions with the road network on a digital map. It is a fundamental pre-processing step for many applications...
Yin Lou, Chengyang Zhang, Yu Zheng, Xing Xie, Wei ...
WWW
2010
ACM
14 years 15 days ago
The paths more taken: matching DOM trees to search logs for accurate webpage clustering
An unsupervised clustering of the webpages on a website is a primary requirement for most wrapper induction and automated data extraction methods. Since page content can vary dras...
Deepayan Chakrabarti, Rupesh R. Mehta