Sciweavers

1056 search results - page 42 / 212
» Constraint-Based Graph Matching
Sort
View
CVPR
2011
IEEE
13 years 5 months ago
Graph Embedding Discriminant Analysis on Grassmannian Manifolds for Improved Image Set Matching
A convenient way of dealing with image sets is to represent them as points on Grassmannian manifolds. While several recent studies explored the applicability of discriminant analy...
Mehrtash Harandi, Sareh, Shirazi (National ICT Aus...
IPL
2006
151views more  IPL 2006»
13 years 9 months ago
Approximating weighted matchings in parallel
We present an NC approximation algorithm for the weighted matching problem in graphs with an approximation ratio of (1 - ). This improves the previously best approximation ratio of...
Stefan Hougardy, Doratha E. Drake Vinkemeier
CORR
2011
Springer
256views Education» more  CORR 2011»
13 years 4 months ago
Approximating Graphic TSP by Matchings
We present a framework for approximating the metric TSP based on a novel use of matchings. Traditionally, matchings have been used to add edges in order to make a given graph Eule...
Tobias Mömke, Ola Svensson
ICPR
2006
IEEE
14 years 10 months ago
Bin-Picking based on Harmonic Shape Contexts and Graph-Based Matching
In this work we address the general bin-picking problem where 3D data is available. We apply Harmonic Shape Contexts (HSC) features since these are invariant to translation, scale...
Jakob Kirkegaard, Thomas B. Moeslund