Sciweavers

829 search results - page 49 / 166
» Distance domination-critical graphs
Sort
View
ACCV
2009
Springer
15 years 4 months ago
Video Segmentation Using Iterated Graph Cuts Based on Spatio-temporal Volumes
Abstract. We present a novel approach to segmenting video using iterated graph cuts based on spatio-temporal volumes. We use the mean shift clustering algorithm to build the spatio...
Tomoyuki Nagahashi, Hironobu Fujiyoshi, Takeo Kana...
ECCV
2004
Springer
16 years 1 months ago
Many-to-Many Feature Matching Using Spherical Coding of Directed Graphs
In recent work, we presented a framework for many-to-many matching of multi-scale feature hierarchies, in which features and their relations were captured in a vertex-labeled, edge...
M. Fatih Demirci, Ali Shokoufandeh, Sven J. Dickin...
IJIG
2002
117views more  IJIG 2002»
14 years 11 months ago
Eigenspaces for Graphs
In this paper, we investigate the feasibility of using graph-based descriptions to learn the view structure of 3D objects. The graphs used in our study are constructed from the De...
Bin Luo, Edwin R. Hancock, Richard C. Wilson
ICALP
2007
Springer
15 years 6 months ago
Low Distortion Spanners
A spanner of an undirected unweighted graph is a subgraph that approximates the distance metric of the original graph with some specified accuracy. Specifically, we say H ⊆ G i...
Seth Pettie
SSPR
2004
Springer
15 years 5 months ago
An Optimal Probabilistic Graphical Model for Point Set Matching
We present a probabilistic graphical model for point set matching. By using a result about the redundancy of the pairwise distances in a point set, we represent the binary relation...
Tibério S. Caetano, Terry Caelli, Dante Aug...