Sciweavers

441 search results - page 49 / 89
» Convex Graph Invariants
Sort
View
ICCV
2009
IEEE
13 years 5 months ago
Building recognition using sketch-based representations and spectral graph matching
In this work, we address the problem of building recognition across two camera views with large changes in scales and viewpoints. The main idea is to construct a semantically rich...
Yu-Chia Chung, Tony X. Han, Zhihai He
SIAMAM
2010
119views more  SIAMAM 2010»
13 years 6 months ago
The Dynamics of Weakly Reversible Population Processes near Facets
This paper concerns the dynamical behavior of weakly reversible, deterministically modeled population processes near the facets (codimension-one faces) of their invariant manifolds...
David F. Anderson, Anne Shiu
ECCV
2008
Springer
14 years 9 months ago
Star Shape Prior for Graph-Cut Image Segmentation
In recent years, segmentation with graph cuts is increasingly used for a variety of applications, such as photo/video editing, medical image processing, etc. One of the most common...
Olga Veksler
COMPGEOM
2003
ACM
14 years 27 days ago
Planar minimally rigid graphs and pseudo-triangulations
Pointed pseudo-triangulations are planar minimally rigid graphs embedded in the plane with pointed vertices (adjacent to an angle larger than π). In this paper we prove that the ...
Ruth Haas, David Orden, Günter Rote, Francisc...
WG
2010
Springer
13 years 6 months ago
Graphs with Large Obstacle Numbers
Motivated by questions in computer vision and sensor networks, Alpert et al. [3] introduced the following definitions. Given a graph G, an obstacle representation of G is a set of...
Padmini Mukkamala, János Pach, Deniz Sari&o...