Abstract
The paper describes a graph matching technique for recognising line pattern shapes in large image databases. We use a Bayesian matching algorithm that draws on edge consistency and node attribute similarity. This information is used to determine the a posteriori probability of a query graph for each of the candidate matches in the database. The node feature vectors are constructed by computing normalised histograms of pairwise geometric attributes. Attribute similarity is assessed by computing the Bhattacharyya distance between the histograms. Recognition is realised by selecting the candidate from the database which has the largest a posteriori probability.
Cite
CITATION STYLE
Huet, B., & Hancock, E. R. (1999). Inexact graph retrieval. In Proceedings - IEEE Workshop on Content-Based Access of Image and Video Libraries, CBAIVL 1999 - In conjunction with IEEE CVPR 1999 (pp. 40–44). Institute of Electrical and Electronics Engineers Inc. https://doi.org/10.1109/IVL.1999.781121
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
