메뉴 건너뛰기




Volumn 9, Issue 1, 2007, Pages 102-118

Hierarchical cellular tree: An efficient indexing scheme for content-based retrieval on multimedia databases

Author keywords

Content based retrieval; Metric access methods; Multimedia databases; Similarity based indexing

Indexed keywords

CONTENT-BASED RETRIEVAL; METRIC ACCESS METHODS; MULTIMEDIA DATABASES; SIMILARITY-BASED INDEXING;

EID: 33846230507     PISSN: 15209210     EISSN: None     Source Type: Journal    
DOI: 10.1109/TMM.2006.886362     Document Type: Article
Times cited : (39)

References (42)
  • 2
    • 0016557674 scopus 로고
    • Multidimensional binary search trees used for associative searching
    • Sep
    • J. L. Bentley, "Multidimensional binary search trees used for associative searching," in Proc. Commun. ACM, Sep. 1975, vol. 18, no. 9, pp. 509-517.
    • (1975) Proc. Commun. ACM , vol.18 , Issue.9 , pp. 509-517
    • Bentley, J.L.1
  • 3
    • 0033897520 scopus 로고    scopus 로고
    • Independent quantization: An index compression technique for high-dimensional data spaces
    • San Diego, CA, Feb
    • S. Berchtold, C. Bohm, H. V. Jagadish, H.-P. Kriegel, and J. Sander, "Independent quantization: An index compression technique for high-dimensional data spaces," in Proc. 16th Int. Conf. Data Engineering, San Diego, CA, Feb. 2000, pp. 577-588.
    • (2000) Proc. 16th Int. Conf. Data Engineering , pp. 577-588
    • Berchtold, S.1    Bohm, C.2    Jagadish, H.V.3    Kriegel, H.-P.4    Sander, J.5
  • 6
    • 0031162001 scopus 로고    scopus 로고
    • Distance-based indexing for high-dimensional metric spaces
    • T. Bozkaya and Z. M. Ozsoyoglu, "Distance-based indexing for high-dimensional metric spaces," in Proc. ACM-SIGMOD, 1997, pp. 357-368.
    • (1997) Proc. ACM-SIGMOD , pp. 357-368
    • Bozkaya, T.1    Ozsoyoglu, Z.M.2
  • 8
    • 0032664793 scopus 로고    scopus 로고
    • The hybrid tree: An index structure for high dimensional feature spaces
    • Feb
    • K. Chakrabarti and S. Mehrotra, "The hybrid tree: An index structure for high dimensional feature spaces," in Proc. Int. Conf. Data Engineering, Feb. 1999, pp. 440-447.
    • (1999) Proc. Int. Conf. Data Engineering , pp. 440-447
    • Chakrabarti, K.1    Mehrotra, S.2
  • 9
    • 0031360887 scopus 로고    scopus 로고
    • VideoQ: An automated content based video search system using visual cues
    • Seattle, WA
    • S. F. Chang, W. Chen, J. Meng, H. Sundaram, and D. Zhong, "VideoQ: An automated content based video search system using visual cues," in Proc. ACM Multimedia, Seattle, WA, 1997.
    • (1997) Proc. ACM Multimedia
    • Chang, S.F.1    Chen, W.2    Meng, J.3    Sundaram, H.4    Zhong, D.5
  • 10
    • 84993661659 scopus 로고    scopus 로고
    • M-tree: An efficient access method for similarity search in metric spaces
    • Athens, Greece, Aug
    • P. Ciaccia, M. Patella, and P. Zezula, "M-tree: An efficient access method for similarity search in metric spaces," in Proc. Int. Conf. Very Large Databases (VLDB), Athens, Greece, Aug. 1997, pp. 426-435.
    • (1997) Proc. Int. Conf. Very Large Databases (VLDB) , pp. 426-435
    • Ciaccia, P.1    Patella, M.2    Zezula, P.3
  • 12
    • 0021615874 scopus 로고
    • R-trees: A dynamic index structure for spatial searching
    • A. Guttman, "R-trees: A dynamic index structure for spatial searching," in Proc. ACM SIGMOD, 1984, pp. 47-57.
    • (1984) Proc. ACM SIGMOD , pp. 47-57
    • Guttman, A.1
  • 13
    • 0242344389 scopus 로고    scopus 로고
    • Optimal algorithms for the single and multiple vertex updating problems of a minimum spanning tree
    • D. B. Johnson and P. T. Metaxas, "Optimal algorithms for the single and multiple vertex updating problems of a minimum spanning tree," Algorithmica, vol. 16, no. 6, pp. 633-648, 1996.
    • (1996) Algorithmica , vol.16 , Issue.6 , pp. 633-648
    • Johnson, D.B.1    Metaxas, P.T.2
  • 14
    • 0031162081 scopus 로고    scopus 로고
    • The SR-tree: An index structure for high-dimensional nearest neighbor queries
    • Tucson, AZ, May 11-15
    • N. Katayama and S. Satoh, "The SR-tree: An index structure for high-dimensional nearest neighbor queries," in Proc. 1997 ACM SIGMOD Int. Conf. Management of data, Tucson, AZ, May 11-15, 1997, pp. 369-380.
    • (1997) Proc. 1997 ACM SIGMOD Int. Conf. Management of data , pp. 369-380
    • Katayama, N.1    Satoh, S.2
  • 15
    • 21244445358 scopus 로고    scopus 로고
    • A novel multimedia retrieval technique: Progressive query (why wait?)
    • May
    • S. Kiranyaz and M. Gabbouj, "A novel multimedia retrieval technique: Progressive query (why wait?)," in Proc. Inst. Elect. Eng., Vis., Image, Signal Process., May 2005, vol. 152, pp. 356-366.
    • (2005) Proc. Inst. Elect. Eng., Vis., Image, Signal Process , vol.152 , pp. 356-366
    • Kiranyaz, S.1    Gabbouj, M.2
  • 16
    • 84863636793 scopus 로고    scopus 로고
    • Hierarchical cellular tree: An efficient indexing method for browsing and navigation in multimedia databases
    • Antalya, Turkey, Sept, Paper ID
    • S. Kiranyaz and M. Gabbouj, "Hierarchical cellular tree: An efficient indexing method for browsing and navigation in multimedia databases," in Proc. Eur. Signal Processing Conference, Eusipco 2005, Antalya, Turkey, Sept. 2005, Paper ID: 1063.
    • (2005) Proc. Eur. Signal Processing Conference, Eusipco 2005 , pp. 1063
    • Kiranyaz, S.1    Gabbouj, M.2
  • 17
    • 33645960515 scopus 로고    scopus 로고
    • A dynamic content-based indexing method for multimedia databases: Hierarchical cellular tree
    • Genova, Italy, Sept, Paper ID
    • S. Kiranyaz and M. Gabbouj, "A dynamic content-based indexing method for multimedia databases: Hierarchical cellular tree," in Proc. IEEE Int. Conf. Image Processing, ICIP 2005, Genova, Italy, Sept. 2005, Paper ID: 2896.
    • (2005) Proc. IEEE Int. Conf. Image Processing, ICIP 2005 , pp. 2896
    • Kiranyaz, S.1    Gabbouj, M.2
  • 21
    • 70350674995 scopus 로고
    • On the shortest spanning subtree of a graph and the traveling salesman problem
    • J. R. Kruskal, "On the shortest spanning subtree of a graph and the traveling salesman problem," in Proc. AMS 71, 1956.
    • (1956) Proc. AMS , vol.71
    • Kruskal, J.R.1
  • 22
    • 0034544567 scopus 로고    scopus 로고
    • PicSOM - content-based image retrieval with self-organizing maps
    • Dec
    • J. T. Laaksonen, J. M. Koskela, S. P. Laakso, and E. Oja, "PicSOM - content-based image retrieval with self-organizing maps," Pattern Recognit. Lett., vol. 21, no. 13-14, pp. 1199-1207, Dec. 2000.
    • (2000) Pattern Recognit. Lett , vol.21 , Issue.13-14 , pp. 1199-1207
    • Laaksonen, J.T.1    Koskela, J.M.2    Laakso, S.P.3    Oja, E.4
  • 24
    • 33846213323 scopus 로고    scopus 로고
    • MUVIS, Online, Available
    • MUVIS, [Online]. Available: http://muvis.cs.tut.fi/
  • 25
    • 34249762939 scopus 로고
    • The TV-tree: An index for high dimensional data
    • K. Lin, H. V. Jagadish, and C. Faloutsos, "The TV-tree: An index for high dimensional data," Very Large Databases (VLDB) J., vol. 3, no. 4, pp. 517-543, 1994.
    • (1994) Very Large Databases (VLDB) J , vol.3 , Issue.4 , pp. 517-543
    • Lin, K.1    Jagadish, H.V.2    Faloutsos, C.3
  • 26
    • 33846209761 scopus 로고    scopus 로고
    • Online, Available
    • Open Video Project, [Online]. Available: http://www.open-video. org/
    • Open Video Project
  • 29
    • 84911584312 scopus 로고
    • Shortest connection matrix network and some generalizations
    • Nov
    • R. C. Prim, "Shortest connection matrix network and some generalizations," Bell Syst. Tech. J., vol. 36, pp. 1389-1401, Nov. 1957.
    • (1957) Bell Syst. Tech. J , vol.36 , pp. 1389-1401
    • Prim, R.C.1
  • 31
    • 0344775426 scopus 로고    scopus 로고
    • The A-tree: An index structure for high-dimensional spaces using relative approximation
    • Sep. 10-14
    • Y. Sakurai, M. Yoshikawa, S. Uemura, and H. Kojima, "The A-tree: An index structure for high-dimensional spaces using relative approximation," in Proc. 26th Int. Conf. Very Large Data Bases, Sep. 10-14, 2000, pp. 516-526.
    • (2000) Proc. 26th Int. Conf. Very Large Data Bases , pp. 516-526
    • Sakurai, Y.1    Yoshikawa, M.2    Uemura, S.3    Kojima, H.4
  • 33
    • 0033220736 scopus 로고    scopus 로고
    • Image retrieval using hierarchical self-organizing feature map
    • I. K. Semi and I. Coman, "Image retrieval using hierarchical self-organizing feature map," Pattern Recognit. Lett., vol. 20, pp. 1337-1345, 1999.
    • (1999) Pattern Recognit. Lett , vol.20 , pp. 1337-1345
    • Semi, I.K.1    Coman, I.2
  • 34
    • 0030389403 scopus 로고    scopus 로고
    • VisualSEEk: A fully automated content-based image query system
    • Boston, MA, Nov
    • J. R. Smith and Chang, "VisualSEEk: A fully automated content-based image query system," in Proc. ACM Multimedia, Boston, MA, Nov. 1996.
    • (1996) Proc. ACM Multimedia
    • Smith, J.R.1    Chang2
  • 35
    • 84937433025 scopus 로고    scopus 로고
    • Slim-trees: High performance metric trees minimizing overlap between nodes
    • Konstanz, Germany, Mar
    • C. Traina, Jr., A. J. M. Traina, B. Seeger, and C. Faloutsos, "Slim-trees: High performance metric trees minimizing overlap between nodes," in Proc. oEDBT 2000, Konstanz, Germany, Mar. 2000, pp. 51-65.
    • (2000) Proc. oEDBT 2000 , pp. 51-65
    • Traina Jr., C.1    Traina, A.J.M.2    Seeger, B.3    Faloutsos, C.4
  • 37
    • 0000681228 scopus 로고    scopus 로고
    • A quantitative analysis and performance study for similarity-search methods in high-dimensional spaces
    • Aug. 24-27
    • R. Weber, H.-J. Schek, and S. Blott, "A quantitative analysis and performance study for similarity-search methods in high-dimensional spaces," in Proc. 24rd Int. Conf. Very Large Databases, Aug. 24-27, 1998, pp. 194-205.
    • (1998) Proc. 24rd Int. Conf. Very Large Databases , pp. 194-205
    • Weber, R.1    Schek, H.-J.2    Blott, S.3
  • 39
    • 33846255194 scopus 로고    scopus 로고
    • Online, Available
    • Virage, [Online]. Available: www.virage.com
    • Virage
  • 40
    • 0027188633 scopus 로고
    • Data structures and algorithms for nearest neighbor search in general metric spaces
    • Austin, TX, Jan. 25-27
    • P. N. Yianilos, "Data structures and algorithms for nearest neighbor search in general metric spaces," in Proc. Fourth Annu. ACM-SIAM Symp. Discrete Algorithms, Austin, TX, Jan. 25-27, 1993, pp. 311-321.
    • (1993) Proc. Fourth Annu. ACM-SIAM Symp. Discrete Algorithms , pp. 311-321
    • Yianilos, P.N.1


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