HMM-based graph edit distance for image indexing

International Journal of Imaging Systems and Technology

Volumn 18, Issue 2-3, 2008, Pages 209-218

  Xiao, Bing ^a   Gao, Xinbo ^a   Tao, Dacheng ^b   Li, Xuelong ^c  

^a XIDIAN UNIVERSITY   (China)

^b HONG KONG POLYTECHNIC UNIVERSITY   (Hong Kong)

^c UNIVERSITY OF LONDON   (United Kingdom)

Author keywords

Graph edit distance; Hidden Markov model; Inexact graph matching; Kullback leibler distance

Indexed keywords

CLUSTERING ALGORITHMS; COMPUTATIONAL GEOMETRY; COST FUNCTIONS; GRAPH THEORY; HIDDEN MARKOV MODELS; INDEXING (OF INFORMATION); MARKOV PROCESSES; PROBABILITY DISTRIBUTIONS; RISK ASSESSMENT;

DISSIMILARITY MEASURES; FAST ALGORITHMS; FEATURE POINTS; GRAPH EDIT DISTANCE; HIDDEN MARKOV MODEL; IMAGE INDEXING; INEXACT GRAPH MATCHING; KULLBACK-LEIBLER DISTANCE; OF GRAPHS; PROBABILITY MODELING;

EDGE DETECTION;

EID: 50249095697     PISSN: 08999457     EISSN: 10981098     Source Type: Journal    
DOI: 10.1002/ima.20146     Document Type: Article

References (28)

1. H. Bunke, On a relation between graph edit distance and maximum common subgraph, Pattern Recognition Lett 18 (1997), 689-694.
2. H. Bunke, Recent developments in graph matching, Proc IEEE Int Conf on Pattern Recognition, 2000, pp. 117-124.
3. M.N. Do, Fast approximation of kullback-leibler distance for dependence trees and hidden markov models, IEEE Signal Process Lett 10 (2003), 115-118.
4. FERET Database. http://www.nist.gov/srd/.
5. M.A.T. Figueiredo and A.K. Jain, Unsupervised learning of finite mixture models, IEEE Trans Pattern Analysis Machine Intelligence 24 (2002), 381-396.
6. C. Harris and M. Stephens, A combined corner and edge detector, Proc of the 4th Alvey Vision Conference, 1988, pp. 147-151.
7. S.C. Johnson, Hierarchical clustering schemes, Psychometrika, 32 (1967), 241-254.
8. V. Levenshtein, Binary codes capable of correcting deletions, insertions, and reversals, Soviet Physics-Doklady 10 (1966), 707-710.
9. J.B. MacQueen, Some methods for classification and analysis of multivariate observations, Proc 5th Berkeley Symposium on Mathematical Statistics and Probability, University of California Press, 1967, pp. 281-297.
10. A. Marzal and E. Vidal, Computation of normalized edit distance and applications, IEEE Trans Pattern Analysis and Machine Intelligence 15 (1993), 926-932.
11. B.T. Messmer and H. Bunke, A new algorithm for error-tolerant subgraph isomorphism detection, IEEE Trans Pattern Analysis and Machine Intelligence 20 (1998), 493-504.
12. H. Moravec, Obstacle avoidance and navigation in the real world by a seeing robot rover, Tech Report CMU-RI-TR-3, Doctoral Dissertation, Robotics Institute, Carnegie Mellon University, Stanford University, U.S.A, 1980.
13. INRIA-MOVI houses. http://www.inria.fr/recherche/equipes/movi.en.html.
14. R. Myers, R.C. Wilson, and E.R. Hancock, Bayesian graph edit distance, IEEE Trans Pattern Analysis and Machine Intelligence 22 (2000), 628-635.
15. M. Neuhaus and H. Bunke, A probabilistic approach to learning costs for graph edit distance, Proc IEEE Int Conf Pattern Recognition, 2004, pp. 389-393.
16. J.J. Oliver and R.A. Baxter, Mml and bayesianism: Similarities and differences, Tech. Rep. TR 206, Department of Computer Science, Monash University, Melbourne, Australia, 1994.
17. H. Qian, Relative entropy: Free energy associated with equilibrium fluctuations and nonequilibrium deviations, Phys Rev E 63 (2001), 042103/ 042101-042103/042104.
18. L.R. Rabiner, A tutorial on hidden markov models and selected applications in speech recognition, Proc IEEE 77 (1989), 257-286.
19. A. Robles-Kelly and E.R. Hancock, Graph edit distance from spectral seriation, IEEE Trans Pattern Analysis and Machine Intelligence 27 (2005), 365-378.
20. F.S. Samaria, Face recognition using hidden markov models, PhD. Thesis, Engineering Department, University of Cambridge, 1994.
21. A. Sanfeliu and K.S. Fu, A distance measure between attributed relational graphs for pattern recognition, IEEE Trans Syst Man Cybernetics 13 (1983), 353-362.
22. S.M. Smith and J.M. Brady, Susan-a new approach to low level image processing, Int J Comput Vision 23 (1997), 45-78.
23. D. Tao, X. Li, X. Wu, and S. Maybank, General tensor discriminant analysis and gabor features for gait recognition, IEEE Trans Pattern Analysis Machine Intelligence 29 ( 2007), 1700-1715.
24. D. Tao, X. Li, X. Wu, and S. Maybank, Geometry mean for subspace selection in multiclass classification, IEEE Trans Pattern Analysis Machine Intelligence 30 (2008), 1-15.
25. Vision and Autonomous Systems Center's Image Database. http://vasc.ri. cmu.edu/idb/html/- motion/house/index.html.
26. R.A. Wagner and M.J. Fischer, The string-to-string correction problem, J ACM 21 (1974), 168-173.
27. R.C. Wilson and E.R. Hancock, Structural matching by discrete relaxation, IEEE Trans Pattern Analysis Machine Intelligence 19 (1997), 634-648.
28. K. Zhang, A constrained edit distance between unordered labeled trees, Algorithmica 15 (1996), 205-222.