Video indexing and similarity retrieval by largest common subgraph detection using decision trees

DOI10.1016/S0031-3203(00)00048-0zbMath1006.68857WikidataQ60491375 ScholiaQ60491375MaRDI QIDQ1860118

Horst Bunke, Svetha Venkatesh, Kim Shearer

Publication date: 20 February 2003

Published in: Pattern Recognition (Search for Journal in Brave)

zbMATH Keywords

decision treevideo indexinggraph matchingsimilarity retrieval

Mathematics Subject Classification ID

Pattern recognition, speech recognition (68T10) Computing methodologies and applications (68U99)

Related Items (11)

Contains and inside relationships within combinatorial pyramids ⋮ Finding the maximum common subgraph of a partial \(k\)-tree and a graph with a polynomially bounded number of spanning trees ⋮ Heuristics for the generalized median graph problem ⋮ Two approaches to determining similarity of two digraphs ⋮ A fast projected fixed-point algorithm for large graph matching ⋮ Kronecker product graph matching. ⋮ A polynomial-time algorithm for computing the maximum common connected edge subgraph of outerplanar graphs of bounded degree ⋮ A polynomial-time maximum common subgraph algorithm for outerplanar graphs and its application to chemoinformatics ⋮ Polyhedral study of the maximum common induced subgraph problem ⋮ A survey of graph edit distance ⋮ Improved Hardness of Maximum Common Subgraph Problems on Labeled Graphs of Bounded Treewidth and Bounded Degree

Cites Work

• Unnamed Item
• Maintaining knowledge about temporal intervals
• A note on the derivation of maximal common subgraphs of two directed or undirected graphs
• An Algorithm for Subgraph Isomorphism

This page was built for publication: Video indexing and similarity retrieval by largest common subgraph detection using decision trees