Sciweavers

1115 search results - page 29 / 223
» Separating Shape Graphs
Sort
View
WADS
2007
Springer
180views Algorithms» more  WADS 2007»
14 years 2 months ago
Spanners for Geometric Intersection Graphs
A ball graph is an intersection graph of a set of balls with arbitrary radii. Given a real number t > 1, we say that a subgraph G′ of a graph G is a t-spanner of G, if for eve...
Martin Fürer, Shiva Prasad Kasiviswanathan
DISOPT
2008
93views more  DISOPT 2008»
13 years 8 months ago
Exploiting planarity in separation routines for the symmetric traveling salesman problem
At present, the most successful approach to solving large-scale instances of the Symmetric Traveling Salesman Problem to optimality is branch-and-cut. The success of branch-and-cu...
Adam N. Letchford, Nicholas A. Pearson
CVPR
2009
IEEE
1148views Computer Vision» more  CVPR 2009»
15 years 3 months ago
Shape Constrained Figure-Ground Segmentation and Tracking
Global shape information is an effective top-down complement to bottom-up figure-ground segmentation as well as a useful constraint to avoid drift during adaptive tracking. We p...
Zhaozheng Yin, Robert T. Collins
ECCV
2002
Springer
14 years 10 months ago
DEFORMOTION: Deforming Motion, Shape Average and the Joint Registration and Segmentation of Images
What does it mean for a deforming object to be "moving" (see Fig. 1)? How can we separate the overall motion (a finite-dimensional group action) from the more general de...
Stefano Soatto, Anthony J. Yezzi
CAD
2007
Springer
13 years 8 months ago
A spectral approach to shape-based retrieval of articulated 3D models
We present an approach for robust shape retrieval from databases containing articulated 3D models. Each shape is represented by the eigenvectors of an appropriately defined affin...
Varun Jain, Hao Zhang 0002