메뉴 건너뛰기




Volumn 1, Issue , 2005, Pages 629-634

Ad hoc image retrieval using hierarchical semantic-based index

Author keywords

[No Author keywords available]

Indexed keywords

FIRST-ORDER LOGIC EXPRESSIONS; MOBILE NODES; NODE MOBILITY; SEMANTIC AD HOC IMAGE RETRIEVAL (SAIR);

EID: 33744476730     PISSN: 1550445X     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/AINA.2005.75     Document Type: Conference Paper
Times cited : (14)

References (10)
  • 2
    • 85106319926 scopus 로고    scopus 로고
    • A performance comparison of multi-hop wireless ad hoc network routing protocols
    • J. Broch, D. Maltz, D. Johnson, Y. Hu, and J. Jetcheva. A performance comparison of multi-hop wireless ad hoc network routing protocols. ACM Mobicom, 1998: 85-97.
    • (1998) ACM Mobicom , pp. 85-97
    • Broch, J.1    Maltz, D.2    Johnson, D.3    Hu, Y.4    Jetcheva, J.5
  • 3
    • 0036452436 scopus 로고    scopus 로고
    • SPIN-IT: A data centric routing protocol for image retrieval in wireless networks
    • E. Woodrow and W. Heinzelman. SPIN-IT: a data centric routing protocol for image retrieval in wireless networks. International Conference on Image Processing, 2002(3):913-916.
    • (2002) International Conference on Image Processing , Issue.3 , pp. 913-916
    • Woodrow, E.1    Heinzelman, W.2
  • 4
    • 3142769270 scopus 로고    scopus 로고
    • Parameterized neighborhood based flooding for ad hoc wireless networks
    • V. Dheap, M. Munawar, S. Ward. Parameterized neighborhood based flooding for ad hoc wireless networks. IEEE Milcom, 2003: 1048-1053.
    • (2003) IEEE Milcom , pp. 1048-1053
    • Dheap, V.1    Munawar, M.2    Ward, S.3
  • 5
    • 0021644214 scopus 로고
    • The Quadtree and related hierarchical data structures
    • H. Samet. The Quadtree and related hierarchical data structures. ACM computing surveys, 1984, 16(2): 187-260.
    • (1984) ACM Computing Surveys , vol.16 , Issue.2 , pp. 187-260
    • Samet, H.1
  • 6
    • 0034215869 scopus 로고    scopus 로고
    • Dynamic VP-tree indexing for n-nearest neighbor search given pair-wise distances
    • A. W. Fu, P. M. Chan, Y. Cheung, and Y. S. Moon. Dynamic VP-tree indexing for n-nearest neighbor search given pair-wise distances. VLDB Journal, 2000, 9(2): 154-173.
    • (2000) VLDB Journal , vol.9 , Issue.2 , pp. 154-173
    • Fu, A.W.1    Chan, P.M.2    Cheung, Y.3    Moon, Y.S.4
  • 7
    • 0031162081 scopus 로고    scopus 로고
    • The SR-tree: An index structure for high-dimensional nearest neighbor queries
    • N. Katayama, S. Satoh. The SR-tree: An Index Structure for High-dimensional Nearest Neighbor Queries, conference on Management of data, 1997, 26(2): 369-380.
    • (1997) Conference on Management of Data , vol.26 , Issue.2 , pp. 369-380
    • Katayama, N.1    Satoh, S.2
  • 9
    • 20844439573 scopus 로고    scopus 로고
    • An extendible semantic-based content representation method for distributed image databases
    • B. Yang and A. R. Hurson. An extendible semantic-based content representation method for distributed image databases, IEEE Symposium on Multimedia Software Engineering, 2004.
    • (2004) IEEE Symposium on Multimedia Software Engineering
    • Yang, B.1    Hurson, A.R.2
  • 10
    • 0033886791 scopus 로고    scopus 로고
    • Binary partition tree as an efficient representation for image processing, segmentation, and information retrieval
    • Philippe Salembier and Luis Garrido. Binary partition tree as an efficient representation for image processing, segmentation, and information retrieval. IEEE Transaction on Image Processing, 2000, 9(4): 561-576.
    • (2000) IEEE Transaction on Image Processing , vol.9 , Issue.4 , pp. 561-576
    • Salembier, P.1    Garrido, L.2


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