메뉴 건너뛰기




Volumn 6, Issue 3, 1998, Pages 263-288

A new indexing scheme for content-based image retrieval

Author keywords

Content based retrieval; Image database; Indexing scheme; Multidimensional index; Nearest neighbor query; Range query

Indexed keywords

ALGORITHMS; COMPUTER ARCHITECTURE; DATA STRUCTURES; DISTRIBUTED DATABASE SYSTEMS; IMAGE PROCESSING; INDEXING (OF INFORMATION); QUERY LANGUAGES; STORAGE ALLOCATION (COMPUTER); TREES (MATHEMATICS);

EID: 0032073113     PISSN: 13807501     EISSN: None     Source Type: Journal    
DOI: 10.1023/A:1009608331551     Document Type: Article
Times cited : (15)

References (33)
  • 2
    • 0014600391 scopus 로고
    • Space-filling curves: Their generation and their application to bandwidth reduction
    • Nov.
    • T. Bially, "Space-filling curves: Their generation and their application to bandwidth reduction," IEEE Trans. Information Theory, pp. 658-664, Nov. 1969.
    • (1969) IEEE Trans. Information Theory , pp. 658-664
    • Bially, T.1
  • 3
    • 0015050308 scopus 로고
    • Alternative algorithm for Hilbert's space-filling curve
    • April
    • A.R. Butz, "Alternative algorithm for Hilbert's space-filling curve," IEEE Trans. Computers, pp. 424-426, April 1971.
    • (1971) IEEE Trans. Computers , pp. 424-426
    • Butz, A.R.1
  • 4
    • 0018480749 scopus 로고
    • The ubiquitous B-tree
    • D. Comer, "The ubiquitous B-tree," ACM Computing Surveys, Vol. 11, No. 2, pp. 121-137, 1979.
    • (1979) ACM Computing Surveys , vol.11 , Issue.2 , pp. 121-137
    • Comer, D.1
  • 5
    • 0024089394 scopus 로고
    • Gray codes for partial match and range queries
    • C. Faloutsos, "Gray codes for partial match and range queries," IEEE Trans. Software Engineering, Vol. 14, No. 10, pp. 1381-1393, 1988.
    • (1988) IEEE Trans. Software Engineering , vol.14 , Issue.10 , pp. 1381-1393
    • Faloutsos, C.1
  • 12
    • 33846316938 scopus 로고
    • Über die stetige abbildung einer linie auf ein flachenstuck
    • D. Hubert, "Über die stetige abbildung einer linie auf ein flachenstuck," Math. Annalen, Vol. 38, 1891.
    • (1891) Math. Annalen , vol.38
    • Hubert, D.1
  • 14
    • 0002842113 scopus 로고
    • Hubert R-tree: An improved R-tree using fractals
    • I. Kamel and C. Faloutsos, "Hubert R-tree: An improved R-tree using fractals," in Proc. of the 20th VLDB Conf, 1994, pp. 500-509.
    • (1994) Proc. of the 20th VLDB Conf , pp. 500-509
    • Kamel, I.1    Faloutsos, C.2
  • 15
    • 0028405250 scopus 로고
    • G-tree: A new data structure for organizing multidimensional data
    • A. Kumar, "G-tree: A new data structure for organizing multidimensional data," IEEE Trans. Knowledge and Data Engineering, Vol. 6, No. 2, pp. 341-347, 1994.
    • (1994) IEEE Trans. Knowledge and Data Engineering , vol.6 , Issue.2 , pp. 341-347
    • Kumar, A.1
  • 16
    • 0025625409 scopus 로고
    • The hB-tree: A robust multi-attribute indexing method
    • D.B. Lomet and B. Salzberg, "The hB-tree: A robust multi-attribute indexing method," ACM Trans. Database Systems, Vol. 15, No. 4, pp. 625-658, 1990.
    • (1990) ACM Trans. Database Systems , vol.15 , Issue.4 , pp. 625-658
    • Lomet, D.B.1    Salzberg, B.2
  • 17
    • 0029377921 scopus 로고
    • Similar-shape retrieval in shape data management
    • Sept.
    • R. Mehrotra and J.E. Gary, "Similar-shape retrieval in shape data management," IEEE Computer, pp. 57-62, Sept. 1995.
    • (1995) IEEE Computer , pp. 57-62
    • Mehrotra, R.1    Gary, J.E.2
  • 19
    • 0021392590 scopus 로고
    • The grid file: An adaptable, symmetric multikey file structure
    • J. Nievergelt, H. Hinterberger, and K.C. Sevcik, "The grid file: An adaptable, symmetric multikey file structure," ACM Trans. Database Systems, Vol. 9, No. 1, pp. 38-71, 1984.
    • (1984) ACM Trans. Database Systems , vol.9 , Issue.1 , pp. 38-71
    • Nievergelt, J.1    Hinterberger, H.2    Sevcik, K.C.3
  • 23
    • 0005083863 scopus 로고
    • Sur une courbe qui remplit toute une aire plane
    • G. Peano, "Sur une courbe qui remplit toute une aire plane," Math. Annalen, Vol. 36, pp. 157-160, 1890.
    • (1890) Math. Annalen , vol.36 , pp. 157-160
    • Peano, G.1
  • 25
  • 26
    • 0019541551 scopus 로고
    • Time- and space-optimality in B-trees
    • A.L. Rosenberg and L. Snyder, "Time- and space-optimality in B-trees," ACM Trans. Database Systems, Vol. 6, No. 1, pp. 174-183, 1981.
    • (1981) ACM Trans. Database Systems , vol.6 , Issue.1 , pp. 174-183
    • Rosenberg, A.L.1    Snyder, L.2
  • 28
    • 0001978055 scopus 로고
    • The buddy-tree: An efficient and robust access method for spatial database systems
    • B. Seeger and H.-P. Kriegel, "The buddy-tree: An efficient and robust access method for spatial database systems," in Proc. of the 16th VLDB Conf, 1990, pp. 590-601.
    • (1990) Proc. of the 16th VLDB Conf , pp. 590-601
    • Seeger, B.1    Kriegel, H.-P.2
  • 29
    • 0001997121 scopus 로고
    • Dynamic maintenance of data distribution for selectivity estimation
    • K.-Y. Whang, S.-W. Kim, and G. Wiederhold, "Dynamic maintenance of data distribution for selectivity estimation," VLDB Journal, Vol. 3, No. 1, pp. 29-51, 1994.
    • (1994) VLDB Journal , vol.3 , Issue.1 , pp. 29-51
    • Whang, K.-Y.1    Kim, S.-W.2    Wiederhold, G.3
  • 31
    • 34249758096 scopus 로고
    • CORE: A content-based retrieval engine for multimedia information systems
    • J.K. Wu, A.D. Narasimhalu, B.M. Mehtre, C.P. Lam, and Y.J. Gao, "CORE: A content-based retrieval engine for multimedia information systems," Multimedia Systems, Vol. 3, No. 1, pp. 25-41, 1995.
    • (1995) Multimedia Systems , vol.3 , Issue.1 , pp. 25-41
    • Wu, J.K.1    Narasimhalu, A.D.2    Mehtre, B.M.3    Lam, C.P.4    Gao, Y.J.5


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