Object Recognition and Recovery by Skeleton Graph Matching

Author(s):  
Lei He ◽  
Chia Han ◽  
William Wee
2015 ◽  
Vol 46 ◽  
pp. 142-152 ◽  
Author(s):  
Joanna Czajkowska ◽  
C. Feinen ◽  
M. Grzegorzek ◽  
M. Raspe ◽  
R. Wickenhöfer

2004 ◽  
Vol 37 (7) ◽  
pp. 1557-1560 ◽  
Author(s):  
Lei He ◽  
Chia Y. Han ◽  
Bryan Everding ◽  
William G. Wee

Author(s):  
ALIREZA AHMADYFARD ◽  
JOSEF KITTLER

We propose a graph-based representation for the elliptic region shape descriptors introduced by Tuytelaars et al.13 In this representation we use image profiles to describe the relation between a pair of image regions. This new representation and a graph matching technique proposed in Ref. 1 are the basis of an object recognition method. An experimental comparative study between the original method and the new graph-based method is carried out. The results show that the graph-based method is more robust to scaling than the original method. Moreover, the misclassification rate using the graph-based method is considerably lower than that yielded by the original method.


Author(s):  
Xiang Bai ◽  
Chunyuan Li ◽  
Xingwei Yang ◽  
Longin Jan Latecki

Skeleton- is well-known to be superior to contour-based representation when shapes have large nonlinear variability, especially articulation. However, approaches to shape similarity based on skeletons suffer from the instability of skeletons, and matching of skeleton graphs is still an open problem. To deal with this problem for shape retrieval, the authors first propose to match skeleton graphs by comparing the geodesic paths between skeleton endpoints. In contrast to typical tree or graph matching methods, they do not explicitly consider the topological graph structure. Their approach is motivated by the fact that visually similar skeleton graphs may have completely different topological structures, while the paths between their end nodes still remain similar. The proposed comparison of geodesic paths between endpoints of skeleton graphs yields correct matching results in such cases. The experimental results demonstrate that the method is able to produce correct results in the presence of articulations, stretching, and contour deformations. The authors also utilize the geodesic skeleton paths for shape classification. Similar to shape retrieval, direct graph matching algorithms like graph edit distance have great difficulties with the instability of the skeleton graph structure. In contrast, the representation based on skeleton paths remains stable. Therefore, a simple Bayesian classifier is able to obtain excellent shape classification results.


2009 ◽  
Vol 21 (7) ◽  
pp. 1952-1989 ◽  
Author(s):  
Günter Westphal ◽  
Rolf P. Würtz

We present an object recognition system built on a combination of feature- and correspondence-based pattern recognizers. The feature-based part, called preselection network, is a single-layer feedforward network weighted with the amount of information contributed by each feature to the decision at hand. For processing arbitrary objects, we employ small, regular graphs whose nodes are attributed with Gabor amplitudes, termed parquet graphs. The preselection network can quickly rule out most irrelevant matches and leaves only the ambiguous cases, so-called model candidates, to be verified by a rudimentary version of elastic graph matching, a standard correspondence-based technique for face and object recognition. According to the model, graphs are constructed that describe the object in the input image well. We report the results of experiments on standard databases for object recognition. The method achieved high recognition rates on identity and pose. Unlike many other models, it can also cope with varying background, multiple objects, and partial occlusion.


Sign in / Sign up

Export Citation Format

Share Document