Novel approaches in modelling dynamics of networked surveillance environment

Proceedings of the 6th International Conference on Information Fusion, FUSION 2003

Volumn 1, Issue , 2003, Pages 302-309

  Dickinson, Peter J ^a   Kraetzl, Miro ^a  

^a DEFENCE SCIENCE AND TECHNOLOGY ORGANISATION   (Australia)

Author keywords

Dynamic graph modelling; Graph distances; Integrated network sensors; Sensor network management; Time series of networks

Indexed keywords

INFORMATION FUSION; SENSOR NETWORKS; TIME SERIES;

DYNAMIC GRAPH; GRAPH DISTANCES; INTEGRATED NETWORKS; NETWORKED SENSORS; NOVEL APPLICATIONS; PERFORMANCE MANAGEMENT; SPECIFIC PROBLEMS; SURVEILLANCE SENSORS;

GRAPH THEORY;

EID: 84901687582     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICIF.2003.177461     Document Type: Conference Paper

References (34)

1. J.T. Astola and T.G. Campbell. On computation of the running median. IEEE Trans. Acoustics, Speech, and Signal Processing, 37(4) :572- 574, April 1989.
2. K. Baxter and J. Glasgow. Protein structure determination: combinnig inexact graph matching and deformable templates. Proc. Vision Interface 2000, pages 179-186, 2000.
3. K. Borner, E. Pippig, E. Tammer, and C. Coulon. Structural similarity and adaption. In I. Smith and B. Faltings, editors, Advances in Case-based Reasoning, pages 58-75. LNCS 1168, Springer,
4. H. Bunke, M. Kraetzl, P.J. Shoubridge, and W.D. Wallis. Abnormal change detection in dynamic telecommunications networks. Submitted for publication.
5. H. Bunke, M. Kraetzl, P.J. Shoubridge, and W.D. Wallis. Measuring abnormal change in large data networks. In Proc. IDC'02, pages 53-58, Adelaide, 2002.
6. H. Bunke and B.T. Messmer. Recent advances in graph matching. International J. Pattern Recognition and Artificial Intelligence, ll(l):169-203,
7. H. Bunke, A. Muenger, and X. Jiang. Combinatorial search versus genetic algorithms; A case study based on the generalized mean graph problem. Pattern Recognition Lett., 20:1271-1277, 1999.
8. D.M. Cvetkovic, M. Doob, and H. Sachs. Spectra of Graphs. Academic Press, New York, 1980.
9. P. Dickinson, H. Bunke, A. Dadej, and M. Kraetzl. Application of median graphs in detection of anomalous change in time series of networks. Submitted for publication.
10. P. Dickinson, H. Bunke, A. Dadej, and M. Kraetzl. Application of median graphs in detection of anomalous change in communication networks. In Proc. 5th World Multiconference on Systemics, Cybernetics and Informatics, volume 5, pages 194-197. Orlando, 2001.
11. P. Dickinson, H. Bunke, A. Dadej, and M. Kraetzl. Median graphs and anomalous change detection in communications networks. In Proc. IDC'02, pages 59-64, Adelaide, 2002.
12. P. Dickinson, H. Bunke, A. Dadej, and M. Kraetzl. Similarity measure for hierarchical graph representation and its application to computer network monitoring. In Proc. 6th World Multi conference on Systemics, Cybernetics and Informatics, volume 4, pages 457-462, Orlando, Florida, 2002.
13. S. Djoko, D.J. Cook, and L.B. Holder. An empirical study of domain knowledge and its benefits to substructure discovery. IEEE Trans. Knowledge and Data Engineering, 9:575-586, 1997.
14. H. Ehrig. Introduction to graph grammars with applications to semantic networks. Computers and Mathematics with Applications, 23:557-572, 1992.
15. D.H. Fisher. Knowledge acquisition via incremental conceptual clustering. In J.W. Shavlik and T.G. Dietterich, editors, Readings in Machine Learning, pages 267-283. Morgan Kauf- mann, 1990.
16. C.S. Hood and C. Ji. Beyond thresholds: An alternative method for extracting information from network measurements. In Proc. IEEE Global Telecommunications Conference, GLOBE- COM '97, volume 1, pages 487-491, 1997.
17. X. Jiang and H. Bunke. On median graphs: Properties, algorithms, and applications. IEEE Trans. Pattern Anal, and Machine Intell., 23(10):1144- 1151.
18. J. Kittler and A. Ahmadyfard. On matching algorithms for the recogniton of objects in clut-tered background. In C. Arcelli, L. Cordelia, and G. Sanniti di Baja, editors, Visual Form 2001, pages 51-66. Springer Verlag, LNCS 2059, 2001.
19. J. Llados, E. Marti, and J.J. Villanueva. Symbol recognition by error-tolerant subgraph match-ing between region adjacency graphs. IEEE Trans. Pattern Analysis and Machine Intelligence, 23:1144-1151, 2001.
20. S.W. Lu, Y. Ren, and C.Y. Suen. Hierarchical attributed graph representation and recognition of handwritten Chinese characters. Pattern Recognition, 24:617-632, 1991.
21. B.T. Messmer and H. Bunke. A new algorithm for error-tolerant subgraph isomorphism detection. IEEE Trans. Pattern Anal, and Machine Intell., 20:493-504, 1998.
22. B. Mohar. Laplace eigenvalues of graphs -A survey. Discrete Math., 109:171-183, 1992.
23. P.J. Rodgers and P.J.H. King. A graph-rewriting visual language for database programming. Journal of Visual Languages and Computing, 8:641674, 1997.
24. D.H. Rouvray and A.T. Balaban. Chemical applications of graph theory. In R.J. Wilson and L.W. Beineke, editors, Applications of Graph Theory, pages 177-221. Academic Press, 1979.
25. K. Sanders, B. Kettler, and J. Hendler. The case for graph-structured representations. In D. Leake and E. Plaza, editors, Case-Base Reasoning Research and Development, volume 1266 of Lec-ture Notes in Computer Science, pages 245-254. Springer, 1997.
26. A. Sanfeliu and K.S. Fu. A distance measure between attributed relational graphs for pattern recognition. IEEE Transactions on Systems Management and Cybernetics, 13(3):353-362, 1983.
27. S. Sarkar and K.L. Boyer. Quantitative measures of change based on feature organization: Eigenvalues and eigenvectors. Computer Vision and Image Understanding, 71:110-136, 1998.
28. K. Shearer, H. Bunke, and S. Venkatesh. Video indexing and similarity retrieval by largest common subgraph detection using decision trees. Pattern Recognition, 34:1075-1091, 2001.
29. A. Shokonfandeh and S. Dickinson. A unified framework for indexing and matching hierarchical shape structures. In C. Arcelli, L. Cordelia, and Sanniti di Baja, editors, Visual Form 2001, pages 67-84. Springer Verlag, LNCS 2059, 2001.
30. P. Shoubridge, M. Kraetzl, and D. Ray. Detection of abnormal change in dynamic networks. In Proc. IEEE Information, Decision and Control, IDC' 99 Conference, Adelaide, Australia, pages 557-562, 1999.
31. P.J. Shoubridge, M. Kraetzl, W.D. Wallis, and H. Bunke. Detection of abnormal change in a time series of graphs. Journal of Interconnection Networks, 3:85-101, 2002.
32. S. Umeyama. An eigendecomposition approach to weighted graph matching problems. IEEE Trans. Pattern Anal, and Machine Intell., 10(5):695-703, 1988.
33. W.D. Wallis, P.J. Shoubridge, M. Kraetzl, and D. Ray. Graph distances using graph union. Pat-tern Recognition Letters, 22:701-704, 2001.
34. D.B. West. Introduction to Graph Theory. Prentice Hall, New Jersey, 1996.