Sciweavers

441 search results - page 29 / 89
» Convex Graph Invariants
Sort
View
EMMCVPR
2005
Springer
14 years 1 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
SIAMDM
2008
119views more  SIAMDM 2008»
13 years 7 months ago
On the Graph Bisection Cut Polytope
Given a graph G = (V, E) with node weights v N {0}, v V , and some number F N{0}, the convex hull of the incidence vectors of all cuts (S), S V with (S) F and (V \ S) F is ...
Michael Armbruster, Christoph Helmberg, Marzena F&...
CCCG
2009
13 years 8 months ago
On the Dilation of Delaunay Triangulations of Points in Convex Position
Let S be a finite set of points in the Euclidean plane, and let E be the complete graph whose point-set is S. Chew, in 1986, proved a lower bound of /2 on the stretch factor of th...
Shiliang Cui, Iyad A. Kanj, Ge Xia
CVPR
2008
IEEE
14 years 9 months ago
Enforcing convexity for improved alignment with constrained local models
Constrained local models (CLMs) have recently demonstrated good performance in non-rigid object alignment/tracking in comparison to leading holistic approaches (e.g., AAMs). A maj...
Yang Wang, Simon Lucey, Jeffrey F. Cohn
ICMCS
2005
IEEE
136views Multimedia» more  ICMCS 2005»
14 years 1 months ago
Human Posture Recognition with Convex Programming
We present a novel human posture recognition method using convex programming based matching schemes. Instead of trying to segment the object from the background, we develop a nove...
Hao Jiang, Ze-Nian Li, Mark S. Drew