What people are saying - Write a review
We haven't found any reviews in the usual places.
Matching based on Graph Theory
Chamfering based Matching
9 other sections not shown
Abstand Anzahl ASCII ASCII file Bharathanatyam Bharathanatyam Postures Bild branch and bound Chamfering colony communication complexity Computer Vision cost function Cray T3E database defined distance transformation edges efficient ENDIF Eventhough Figure final position fscanf fuer Fusion Architecture given global update graph isomorphism Graph Matching graph theory Hausdorff distance Hausdorff method Hausdorff Verfahren heuristic Identified Human Image Matching image processing Images from Moehringen input integer iteration koennen Lemma lower bound solution Menschen minimal minimum mobile robot Moehringen Tram station multiprocessor scheduling neighbour isomorphic group node number of models number of processors number of vertices object obstacles occlusion Okklusionen optimal path optimal solution parallel algorithm Parallel Implementation Paul Levi person pheromone pixel polygons problem Rechenzeit Recognized Human search efforts segments sensors Sequential shortest path static levels strategy symmetry line Table task techniques threshold tion upper bound vertex visibility graph