Image categorization: Graph edit distance \(+\) edge direction histogram
From MaRDI portal
Publication:936445
DOI10.1016/j.patcog.2008.03.025zbMath1147.68797OpenAlexW1514406729WikidataQ62795597 ScholiaQ62795597MaRDI QIDQ936445
Bing Xiao, Dacheng Tao, Xuelong Li, XinBo Gao
Publication date: 13 August 2008
Published in: Pattern Recognition (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.patcog.2008.03.025
graph edit distanceearth mover's distanceinexact graph matchingedge direction histogramimage categorization
Computing methodologies for image processing (68U10) Pattern recognition, speech recognition (68T10)
Related Items
The graph matching problem ⋮ A survey of graph edit distance ⋮ Transfer latent variable model based on divergence analysis ⋮ Steganalysis and payload estimation of embedding in pixel differences using neural networks
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Measures of association for cross classifications
- The earth mover's distance as a metric for image retrieval
- A constrained edit distance between unordered labeled trees
- Simple Fast Algorithms for the Editing Distance between Trees and Related Problems
- An eigendecomposition approach to weighted graph matching problems
- The String-to-String Correction Problem
- A distance measure between attributed relational graphs for pattern recognition
- Algorithms – ESA 2005
- Graph-Theoretical Methods for Detecting and Describing Gestalt Clusters
This page was built for publication: Image categorization: Graph edit distance \(+\) edge direction histogram