On the public citation graph

HMM‐based graph edit distance for image indexing

https://doi.org/10.1002/ima.20146
0 signed · 31 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1007/bf01975866openalex-snapshot
A Constrained Edit Distance Between Unordered Labeled Trees
inferredcites →https://doi.org/10.1007/bf02289588openalex-snapshot
Hierarchical Clustering Schemes
inferredcites →https://doi.org/10.1016/s0167-8655(97)00060-3openalex-snapshot
On a relation between graph edit distance and maximum common subgraph
inferredcites →https://doi.org/10.1023/a:1007963824710openalex-snapshot
SUSAN—A New Approach to Low Level Image Processing
inferredcites →https://doi.org/10.1103/physreve.63.042103openalex-snapshot
Relative entropy: Free energy associated with equilibrium fluctuations and nonequilibrium deviations
inferredcites →https://doi.org/10.1109/34.232078openalex-snapshot
Computation of normalized edit distance and applications
inferredcites →https://doi.org/10.1109/34.601251openalex-snapshot
Structural matching by discrete relaxation
inferredcites →https://doi.org/10.1109/34.682179openalex-snapshot
A new algorithm for error-tolerant subgraph isomorphism detection
inferredcites →https://doi.org/10.1109/34.862201openalex-snapshot
Bayesian graph edit distance
inferredcites →https://doi.org/10.1109/34.990138openalex-snapshot
Unsupervised learning of finite mixture models
inferredcites →https://doi.org/10.1109/5.18626openalex-snapshot
A tutorial on hidden Markov models and selected applications in speech recognition
inferredcites →https://doi.org/10.1109/icpr.2000.906030openalex-snapshot
Recent developments in graph matching
inferredcites →https://doi.org/10.1109/icpr.2004.1334548openalex-snapshot
A probabilistic approach to learning costs for graph edit distance
inferredcites →https://doi.org/10.1109/lsp.2003.809034openalex-snapshot
Fast approximation of Kullback-Leibler distance for dependence trees and hidden Markov models
inferredcites →https://doi.org/10.1109/tpami.2005.56openalex-snapshot
Graph edit distance from spectral seriation
inferredcites →https://doi.org/10.1109/tpami.2007.1096openalex-snapshot
General Tensor Discriminant Analysis and Gabor Features for Gait Recognition
inferredcites →https://doi.org/10.1109/tsmc.1983.6313167openalex-snapshot
A distance measure between attributed relational graphs for pattern recognition
inferredcites →https://doi.org/10.1145/321796.321811openalex-snapshot
The String-to-String Correction Problem
inferredcites →https://doi.org/10.5244/c.2.23openalex-snapshot
A Combined Corner and Edge Detector

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1007/978-3-642-01536-6_10openalex-snapshot
A Comparative Study of Three Graph Edit Distance Algorithms
inferred← citeshttps://doi.org/10.1007/s00500-013-1065-zopenalex-snapshot
A Granular Computing approach to the design of optimized graph classification systems
inferred← citeshttps://doi.org/10.1007/s10044-008-0141-yopenalex-snapshot
A survey of graph edit distance
inferred← citeshttps://doi.org/10.1007/s10044-012-0284-8openalex-snapshot
The graph matching problem
inferred← citeshttps://doi.org/10.1016/j.fss.2013.01.001openalex-snapshot
Graph ambiguity
inferred← citeshttps://doi.org/10.1016/j.ins.2014.01.005openalex-snapshot
Optimized dissimilarity space embedding for labeled graphs
inferred← citeshttps://doi.org/10.1016/j.patcog.2012.12.009openalex-snapshot
Biview face recognition in the shape–texture domain
inferred← citeshttps://doi.org/10.1016/j.patcog.2014.04.022openalex-snapshot
Inexact Bayesian point pattern matching for linear transformations
inferred← citeshttps://doi.org/10.1016/j.patrec.2011.04.017openalex-snapshot
Towards the unification of structural and statistical pattern recognition
inferred← citeshttps://doi.org/10.1109/tip.2021.3093387openalex-snapshot
Learning Efficient Hash Codes for Fast Graph-Based Data Similarity Retrieval
inferred← citeshttps://doi.org/10.1145/3709673openalex-snapshot
Computing Approximate Graph Edit Distance via Optimal Transport
inferred← citeshttps://doi.org/10.70675/96a7814czced9z4f31z9551zdf399ba8b52fopenalex-snapshot
Deep learning onto graph space : application to image-based insect recognition
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.