Image categorization: Graph edit distance + edge direction histogram

Pattern Recognition

Volumn 41, Issue 10, 2008, Pages 3179-3191

  Gao, Xinbo ^a   Xiao, Bing ^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

Earth mover's distance (EMD); Edge direction histogram (EDH); Graph edit distance (GED); Image categorization; Inexact graph matching

Indexed keywords

ALGORITHMS; BOOLEAN FUNCTIONS; CLASSIFICATION (OF INFORMATION); CLUSTERING ALGORITHMS; COMPUTATIONAL GEOMETRY; COMPUTATIONAL METHODS; EVOLUTIONARY ALGORITHMS; FLOW OF SOLIDS; FUNCTION EVALUATION; GRAPH THEORY; IMAGE ENHANCEMENT; IMAGING SYSTEMS; IMAGING TECHNIQUES; MICROFLUIDICS; SCHEDULING ALGORITHMS; SET THEORY;

CLASSIFICATION RATES; CONNECTIVITY STRUCTURES; EARTH MOVER DISTANCE (EMD); EDGE DIRECTIONS; ELSEVIER (CO); GRAPH EDIT DISTANCE; IMAGE CATEGORIZATION; NOVEL ALGORITHMS; OF GRAPHS; PLANAR ROTATION; SHAPE FEATURES; STRUCTURE CHANGING;

EDGE DETECTION;

EID: 45549097571     PISSN: 00313203     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.patcog.2008.03.025     Document Type: Article

References (51)

1. Bunke H. Recent developments in graph matching. IEEE International Conference on Pattern Recognition (2000) 117-124
2. Caelli T., and Kosinov S. An eigenspace projection clustering method for inexact graph matching. IEEE Pattern Anal. Mach. Intell. 26 4 (2004) 515-519
3. Cross A.D.J., Wilson R.C., and Hancock E.R. Inexact graph matching using genetic search. Pattern Recognition 30 7 (1997) 953-970
4. Umeyama S. An eigendecomposition approach to weighted graph matching problems. IEEE Pattern Anal. Mach. Intell. 10 5 (1988) 695-703
5. Wagner R.A., and Fischer M.J. The string-to-string correction problem. J. ACM 21 1 (1974) 168-173
6. Sanfeliu A., and Fu K.S. A distance measure between attributed relational graphs for pattern recognition. IEEE Trans. Syst. Man Cybern. 13 3 (1983) 353-362
7. Messmer B.T., and Bunke H. Efficient error-tolerant subgraph isomorphism detection. Shape Struct. Pattern Recognition (1994) 231-240
8. Messmer B.T., and Bunke H. A new algorithm for error-tolerant subgraph isomorphism detection. IEEE Pattern Anal. Mach. Intell. 20 5 (1998) 493-504
9. Bunke H. On a relation between graph edit distance and maximum common subgraph. Pattern Recognition Lett. 18 8 (1997) 689-694
10. Bunke H. Error correcting graph matching: on the influence of the underlying cost function. IEEE Pattern Anal. Mach. Intell. 21 9 (1999) 917-922
11. Levenshtein V. Binary codes capable of correcting deletions, insertions, and reversals. Sov. Phys.-Dokl. 10 8 (1966) 707-710
12. Myers R., Wilson R.C., and Hancock E.R. Bayesian graph edit distance. IEEE Pattern Anal. Mach. Intell. 22 6 (2000) 628-635
13. Shasha D., and Zhang K. Simple fast algorithms for the editing distance between trees and related problems. SIAM J. Comput. 18 6 (1989) 1245-1262
14. Zhang K. A constrained edit distance between unordered labeled trees. Algorithmica 15 3 (1996) 205-222
15. Marzal A., and Vidal E. Computation of normalized edit distance and applications. IEEE Pattern Anal. Mach. Intell. 15 9 (1993) 926-932
16. Myers R., Wilson R.C., and Hancock E.R. Efficient relational matching with local edit distance. IEEE International Conference on Pattern Recognition (1998) 1711-1714
17. Wilson R.C., and Hancock E.R. Structural matching by discrete relaxation. IEEE Pattern Anal. Mach. Intell. 19 6 (1997) 634-648
18. Jain A.K., and Vailaya A. Image retrieval using color and shape. Pattern Recognition 29 8 (1996) 1233-1244
19. Mahmoudi F., and Shanbehzadeh J. Image retrieval based on shape similarity by edge orientation autocorrelogram. Pattern Recognition 36 8 (2003) 1725-1736
20. Tao D., Li X., and Maybank S. Negative samples analysis in relevance feedback. IEEE Trans. Knowl. Data Eng. 19 4 (2007) 568-580
21. Tao D., Tang X., and Li X. Which components are important for interactive image searching?. IEEE Trans. Circuits Syst. Video Technol. 18 1 (2008) 3-11
22. Tao D., Tang X., Li X., and Wu X. Asymmetric bagging and random subspace for support vector machine-based relevance feedback in image retrieval. IEEE Trans. Pattern Anal. Mach. Intell. (T-PAMI) 28 7 (2006) 1088-1099
23. Vailaya A., Jain A., and Zhang H.J. On Image Classification: City vs. Landscape. Workshop in Content-Based Access to Image and Video Libraries (1998) 3-8
24. Chen G.H., Yang C.L., Po L.M., and Xie S.L. Edge-based structural similarity for image quality assessment. IEEE International Conference on Acoustics, Speech, and Signal Processing (2006) 933-936
25. Kim Y.-W., and Oh I.-S. Watermarking text document images using edge direction histograms. Pattern Recognition Lett. 25 11 (2004) 1243-1251
26. L. Zhang, N.M. Allinson, Automatic shoeprint retrieval system for use in forensic investigations, in: 5th Annual UK Workshop on Computer Intelligence, 2005.
27. Rubner Y., Tomasi C., and Guibas L.J. A metric for distributions with applications to image databases. IEEE International Conference on Computer Vision (1998) 59-66
28. Rubner Y., Tomasi C., and Guibas L.J. The earth mover's distance as a metric for image retrieval. Int. J. Comput. Vision 40 2 (2000) 99-121
29. Cabello S., Giannopoulos P., Knauer C., and Rote G. Matching point sets with respect to the Earth Mover's Distance. European Symposium on Algorithms (2005) 520-531
30. Kim D.H., Yun I.D., and Lee S.U. A new attributed relational graph matching algorithm using the nested structure of Earth Mover's distance. The 17th International Conference on Pattern Recognition (2004) 48-51
31. Al-Omari F.A., and Al-Jarrah M.A. Query by image and video content: a colored-based stochastic model approach. Data Knowl. Eng. 52 3 (2005) 313-332
32. Harris C., and Stephens M. A combined corner and edge detector. The 4th Alvey Vision Conference (1988) 147-151
33. Freeman H., and Davis L.S. A corner finding algorithm for chain-coded curves. IEEE Comput. 26 1-6 (1977) 297-303
34. Lee J.S., Sun Y.N., and Chen C.H. Boundary-based corner detection using wavelet transform. IEEE International Conference on Systems, Man and Cybernetics (1993) 513-516
35. Smith S.M., and Brady J.M. SUSAN-a new approach to low level image processing. Int. J. Comput. Vision 23 1 (1997) 45-78
36. H. Moravec, Obstacle avoidance and navigation in the real world by a seeing robot rover, Technical Report CMU-RI-TR-3, Robotics Institute, Carnegie Mellon University and Doctoral Dissertation, Stanford University, 1980.
37. Fortune S. Voronoi{dotless}̈ diagrams and delaunay triangulations. Lecture Notes Series on Computing vol. 1 (1992) 193-233
38. 1 surface interpolation. In: Rive J. (Ed). Mathematical Software III (1977), Academic Press, New York 161-194
39. Tuceryan M., and Chorzempa T. Relative sensitivity of a family of closest-point graphs in computer vision applications. Pattern Recognition 24 5 (1991) 361-373
40. Swain M.J., and Ballard D.H. Color indexing. Int. J. Comput. Vision 7 1 (1991) 11-32
41. Kullback S. Information Theory and Statistics (1968), Dover, New York
42. Robles-Kelly A., and Hancock E.R. Graph edit distance from spectral seriation. IEEE Pattern Anal. Mach. Intell. 27 3 (2005) 365-378
43. Columbia Object Image Library 〈http://www1.cs.columbia.edu/CAVE/software/softlib/coil-20.php〉.
44. Mitchell T.M. Machine Learning (1997), McGraw-Hill, New York
45. Hofmann T., and Buhmann J.M. Multidimensional scaling and data clustering. Neural Inf. Process. Syst. (1994) 459-466
46. Schiffman S.M., Reynolds L., and Young F.W. Introduction to Multidimensional Scaling (1981), Academic Press, New York, USA
47. Goodman L.A., and Kruskal W.H. Measures of Association for Cross Classification (1979), Springer, New York
48. Prim R.C. Shortest connection networks and some generalizations. Bell Syst. Tech. J. 36 6 (1957) 1389-1401
49. Zahn C.T. Graph-theoretical methods for detecting and describing gestalt clusters. IEEE Comput. C-20 1 (1971) 68-86
50. INRIA-MOVI houses 〈http://www.inria.fr/recherche/equipes/movi.en.html〉.
51. Vision and Autonomous Systems Center's Image Database 〈http://vasc.ri.cmu.edu//idb/html/motion/house/index.html〉.