2.5D Elastic graph matching

2011 ◽  
Vol 115 (7) ◽  
pp. 1062-1072 ◽  
Author(s):  
Stefanos Zafeiriou ◽  
Maria Petrou
2006 ◽  
Vol 18 (6) ◽  
pp. 1441-1471 ◽  
Author(s):  
Christian Eckes ◽  
Jochen Triesch ◽  
Christoph von der Malsburg

We present a system for the automatic interpretation of cluttered scenes containing multiple partly occluded objects in front of unknown, complex backgrounds. The system is based on an extended elastic graph matching algorithm that allows the explicit modeling of partial occlusions. Our approach extends an earlier system in two ways. First, we use elastic graph matching in stereo image pairs to increase matching robustness and disambiguate occlusion relations. Second, we use richer feature descriptions in the object models by integrating shape and texture with color features. We demonstrate that the combination of both extensions substantially increases recognition performance. The system learns about new objects in a simple one-shot learning approach. Despite the lack of statistical information in the object models and the lack of an explicit background model, our system performs surprisingly well for this very difficult task. Our results underscore the advantages of view-based feature constellation representations for difficult object recognition problems.


2002 ◽  
Vol 82 (6) ◽  
pp. 833-851 ◽  
Author(s):  
Anastasios Tefas ◽  
Constantine Kotropoulos ◽  
Ioannis Pitas

2002 ◽  
Vol 20 (13-14) ◽  
pp. 937-943 ◽  
Author(s):  
Jochen Triesch ◽  
Christoph von der Malsburg

Author(s):  
R. Herpers ◽  
G. Sommer

The application of an elastic graph-matching approach to discriminate facial image regions is presented. In contrast to the dynamic link architecture introduced by the Malsburg group, our application is not an identification task but a classification task. Therefore, our approach differs in several important aspects: (1) the choice of the filter set, (2) the selection of the positions of the nodes of the graph to represent the characteristic image information, (3) the generation of a representative reference pattern needed for the calculation of the classifications, and (4) a new two-step graph-matching approach based on the simulated annealing technique. The approach was tested on facial regions taking the eye region as an example target. A classification performance for the verification of eye regions of more than 93% was achieved.


Sign in / Sign up

Export Citation Format

Share Document