메뉴 건너뛰기




Volumn , Issue , 2006, Pages 348-355

A graph-based approach for modeling and indexing video data

Author keywords

[No Author keywords available]

Indexed keywords

DATA STRUCTURES; FILE ORGANIZATION; GRAPH THEORY; INDEXING (OF INFORMATION); MOTION ESTIMATION; QUERY PROCESSING; SET THEORY; TECHNICAL PRESENTATIONS; TOPOLOGY; VIDEO RECORDING;

EID: 46249085774     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ISM.2006.4     Document Type: Conference Paper
Times cited : (6)

References (18)
  • 1
    • 0031198630 scopus 로고    scopus 로고
    • On a relation between graph edit distance and maximum common subgraph
    • H. Bunke. On a relation between graph edit distance and maximum common subgraph. Pattern Recogn. Lett., 18(9):689-694, 1997.
    • (1997) Pattern Recogn. Lett , vol.18 , Issue.9 , pp. 689-694
    • Bunke, H.1
  • 2
    • 0032024433 scopus 로고    scopus 로고
    • A Graph Distance Metric based on the Maximal Common Subgraph
    • H. Bunke and K. Shearer. A Graph Distance Metric based on the Maximal Common Subgraph. Pattern Recognition Letters 19, pages 255-259, 1998.
    • (1998) Pattern Recognition Letters 19 , pp. 255-259
    • Bunke, H.1    Shearer, K.2
  • 6
    • 85135872226 scopus 로고    scopus 로고
    • On the marriage of lp-norms and edit distance
    • Toronto, Canada
    • L. Chen and R. Ng. On the marriage of lp-norms and edit distance. In The 30th VLDB Conference, pages 1040-1049, Toronto, Canada, 2004.
    • (2004) The 30th VLDB Conference , pp. 1040-1049
    • Chen, L.1    Ng, R.2
  • 7
    • 84993661659 scopus 로고    scopus 로고
    • M-tree: An efficient access method for similarity search in metric spaces
    • P. Ciaccia, M. Patella, and P. Zezula. M-tree: An efficient access method for similarity search in metric spaces. In the VLDB Journal, pages 426-435, 1997.
    • (1997) In the VLDB Journal , pp. 426-435
    • Ciaccia, P.1    Patella, M.2    Zezula, P.3
  • 8
    • 0002629270 scopus 로고
    • Maximum likelihood estimation from incomplete data via the em algorithm (with discussion)
    • A. Dempster, N. Laird, and D. Rubin. Maximum likelihood estimation from incomplete data via the em algorithm (with discussion). J.R. Statist. Soc. B, 39:1-38, 1977.
    • (1977) J.R. Statist. Soc. B , vol.39 , pp. 1-38
    • Dempster, A.1    Laird, N.2    Rubin, D.3
  • 9
    • 0344734551 scopus 로고    scopus 로고
    • Tracking Objects by Graph Matching of Image Partition Sequences
    • C. Gomila and F. Meyer. Tracking Objects by Graph Matching of Image Partition Sequences. Proc. of 3rd IAPR-TC15 Workshop on GRPR, pages 1-11, 2001.
    • (2001) Proc. of 3rd IAPR-TC15 Workshop on GRPR , pp. 1-11
    • Gomila, C.1    Meyer, F.2
  • 10
    • 33750548820 scopus 로고    scopus 로고
    • Clustering of Video Objects by Graph Matching
    • Amsterdam,Netherlands, July
    • J. Lee, J. Oh, and S. Hwang. Clustering of Video Objects by Graph Matching. In Proceeding of the 2005 IEEE ICME, pages 394-397, Amsterdam,Netherlands, July 2005.
    • (2005) Proceeding of the 2005 IEEE ICME , pp. 394-397
    • Lee, J.1    Oh, J.2    Hwang, S.3
  • 11
    • 29844432035 scopus 로고    scopus 로고
    • STRG-Index: Spatio-Temporal Region Graph Indexing for Large Video Databases
    • Baltimore, MD, June
    • J. Lee, J. Oh, and S. Hwang. STRG-Index: Spatio-Temporal Region Graph Indexing for Large Video Databases. In Proceedings of the 2005 ACM SIGMOD, pages 718-729, Baltimore, MD, June 2005.
    • (2005) Proceedings of the 2005 ACM SIGMOD , pp. 718-729
    • Lee, J.1    Oh, J.2    Hwang, S.3
  • 12
    • 51249191195 scopus 로고
    • A Note on the Derivation of Maximal Common Subgraphs of Two Directed or Undirected Graphs
    • G. Levi. A Note on the Derivation of Maximal Common Subgraphs of Two Directed or Undirected Graphs. Calcols 9, pages 341-354, 1972.
    • (1972) Calcols , vol.9 , pp. 341-354
    • Levi, G.1
  • 14
    • 29844445663 scopus 로고    scopus 로고
    • Tracking of moving objects based on graph edges similarity
    • O. Miller, E. Navon, and A. Averbuch. Tracking of moving objects based on graph edges similarity. Proceedings of the ICME '03, pages 73-76, 2003.
    • (2003) Proceedings of the ICME '03 , pp. 73-76
    • Miller, O.1    Navon, E.2    Averbuch, A.3
  • 17
    • 84944319598 scopus 로고    scopus 로고
    • Indexing the Distance: An Efficient Method to KNN Processing
    • C. Yu, B. C. Ooi, K.-L. Tan, and H. V. Jagadish. Indexing the Distance: An Efficient Method to KNN Processing. In VLDB, pages 421-430, 2001.
    • (2001) VLDB , pp. 421-430
    • Yu, C.1    Ooi, B.C.2    Tan, K.-L.3    Jagadish, H.V.4
  • 18
    • 13244274698 scopus 로고    scopus 로고
    • A Graph-Theoretic Approach to Video Object Segmentation in 2D+t Space
    • Technical report, MSR, March 2003
    • C. Yuan, Y.-F. Ma, and H.-J. Zhang. A Graph-Theoretic Approach to Video Object Segmentation in 2D+t Space. Technical report, MSR, March 2003.
    • Yuan, C.1    Ma, Y.-F.2    Zhang, H.-J.3


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.