Object Recognition in the Dynamic Link Architecture. Yang Ran CMPS 828J. Outline. Background and Introduction System Overview General algorithm in details Implementations of the algorithm Experiment results Further readings and conclusion. Background.
Why use it?
Elastic matching of a model graph M to a target graph I amounts to a search for a set of vertex positions which simultaneously optimizes the matching of vertex labels and edge labels according to:
A heuristic algorism is seek to close the optimum within a reasonable time
As a face data base we used galleries of 111 different persons. Of most persons there is one neutral frontal view, one frontal view of different facial expression, and two views rotated in depth by 15 and 30 degrees respectively.
Recognition results against a gallery of 20, 50, and 111 neutral frontal views