2003 | OriginalPaper | Buchkapitel
Graph Edit Distance with Node Splitting and Merging, and Its Application to Diatom Identification
verfasst von : R. Ambauen, S. Fischer, Horst Bunke
Erschienen in: Graph Based Representations in Pattern Recognition
Verlag: Springer Berlin Heidelberg
Enthalten in: Professional Book Archive
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. powered by
A new graph matching scheme based on an extended set of edit operations, which include the splitting and merging of nodes, is proposed in this paper. This scheme is useful in applications where the nodes of the considered graphs represent regions extracted by some segmentation procedure from an image. To demonstrate the feasibility of the proposed method, its application to the automatic identification of diatoms (unicellular algae) is described.