메뉴 건너뛰기




Volumn 57, Issue 12, 2006, Pages 1694-1707

A cluster-based approach for efficient content-based image retrieval using a similarity-preserving space transformation method

Author keywords

[No Author keywords available]

Indexed keywords

HIGHLEVEL VECTOR SPACE; QUERY PROCESSING; SPACE TRANSFORMATIONS;

EID: 33749375181     PISSN: 15322882     EISSN: 15322890     Source Type: Journal    
DOI: 10.1002/asi.20357     Document Type: Article
Times cited : (5)

References (46)
  • 4
    • 0031333710 scopus 로고    scopus 로고
    • Dimensionality reduction using multidimensional scaling for image search
    • I. Torwick (Ed.). Piscataway, NJ: IEEE Press
    • Beatty, M., & Manjunath, B. (1997). Dimensionality reduction using multidimensional scaling for image search. In I. Torwick (Ed.). Proceedings of the IEEE International Conference on Image Processing (pp. 835-838). Piscataway, NJ: IEEE Press.
    • (1997) Proceedings of the IEEE International Conference on Image Processing , pp. 835-838
    • Beatty, M.1    Manjunath, B.2
  • 5
    • 0025447750 scopus 로고
    • The R*-tree: An efficient and robust access method for points and rectangles
    • H. Garcia-Molina & H.V. Jagadish (Eds.). New York: ACM Press
    • Beckman, N. (1990). The R*-tree: An efficient and robust access method for points and rectangles. In H. Garcia-Molina & H.V. Jagadish (Eds.). Proceedings of ACM SIGMOD Conference (pp. 322-331). New York: ACM Press.
    • (1990) Proceedings of ACM SIGMOD Conference , pp. 322-331
    • Beckman, N.1
  • 6
    • 0001802606 scopus 로고    scopus 로고
    • The X-tree: An index structure for high-dimensional data
    • T. Vijayaraman, C. Mohan, & N. Sarda (Eds.). San Francisco: Morgan Kaufmann
    • Berchtold, S.. Keim, D., & Kriegel, H. (1996). The X-tree: An index structure for high-dimensional data. In T. Vijayaraman, C. Mohan, & N. Sarda (Eds.), Proceedings of the 22nd VLDB Conference (pp. 28-39). San Francisco: Morgan Kaufmann.
    • (1996) Proceedings of the 22nd VLDB Conference , pp. 28-39
    • Berchtold, S.1    Keim, D.2    Kriegel, H.3
  • 9
    • 26944451842 scopus 로고    scopus 로고
    • Clustering of texture features for content-based image retrieval
    • Celebi, E., & Alpkocak, A. (2000). Clustering of texture features for content-based image retrieval. Lecture Notes in Computer Science, 1909, 216-225.
    • (2000) Lecture Notes in Computer Science , vol.1909 , pp. 216-225
    • Celebi, E.1    Alpkocak, A.2
  • 12
    • 0031275916 scopus 로고    scopus 로고
    • Generic and fully automatic contentbased image retrieval using color
    • Choubey, S., & Raghavan, V. (1997). Generic and fully automatic contentbased image retrieval using color. Pattern Recognition Letters, 18, 1233-1240.
    • (1997) Pattern Recognition Letters , vol.18 , pp. 1233-1240
    • Choubey, S.1    Raghavan, V.2
  • 13
    • 0028062199 scopus 로고
    • A concept-based image retrieval system
    • J. Nunamekar & R. Sprague (Eds.). Piscataway, NJ: IEEE Press
    • Chua, T. ( 1994). A concept-based image retrieval system. In J. Nunamekar & R. Sprague (Eds.), Proceedings of 27th Annual Hawaii International Conference on System Science (pp. 590-598). Piscataway, NJ: IEEE Press.
    • (1994) Proceedings of 27th Annual Hawaii International Conference on System Science , pp. 590-598
    • Chua, T.1
  • 14
  • 15
    • 0033897023 scopus 로고    scopus 로고
    • The Bayesian image retrieval system, PicHunter: Theory, implementation, and psychophysical experiments
    • Cox, I., Miller, M., Minka, T., Papathomas, T., & Yianilos, P. (2000). The Bayesian image retrieval system, PicHunter: Theory, implementation, and psychophysical experiments. IEEE Transactions on Image Processing, 9, 20-37.
    • (2000) IEEE Transactions on Image Processing , vol.9 , pp. 20-37
    • Cox, I.1    Miller, M.2    Minka, T.3    Papathomas, T.4    Yianilos, P.5
  • 17
    • 84976803260 scopus 로고
    • Fastmap: A fast algorithm for indexing, data-mining and visualization of traditional and multimedia datasets
    • M. Carey & D. Schneider (Eds.). New York: ACM Press
    • Faloutsos, C., & Lin, K. (1995). Fastmap: A fast algorithm for indexing, data-mining and visualization of traditional and multimedia datasets. In M. Carey & D. Schneider (Eds.), Proceedings of ACM SIGMOD (pp. 163-174). New York: ACM Press.
    • (1995) Proceedings of ACM SIGMOD , pp. 163-174
    • Faloutsos, C.1    Lin, K.2
  • 19
    • 0002080181 scopus 로고
    • A new approach to pattern recognition
    • L. Kanal & A. Rosenfeld (Eds.) Amsterdam: North-Holland Publishing
    • Goldfarb, L. (1985). A new approach to pattern recognition. In L. Kanal & A. Rosenfeld (Eds.), Progress in machine intelligence and pattern recognition (pp. 1-156). Amsterdam: North-Holland Publishing.
    • (1985) Progress in Machine Intelligence and Pattern Recognition , pp. 1-156
    • Goldfarb, L.1
  • 20
    • 0004236492 scopus 로고
    • Baltimore, MD: Johns Hopkins University Press
    • Golub, G., & Van Loan, C. (1983). Matrix computations. Baltimore, MD: Johns Hopkins University Press.
    • (1983) Matrix Computations
    • Golub, G.1    Van Loan, C.2
  • 21
    • 0031143421 scopus 로고    scopus 로고
    • Visual information retrieval
    • Gupta, A., & Jain, R. (1997). Visual information retrieval. Communications of the ACM, 40(5), 70-79.
    • (1997) Communications of the ACM , vol.40 , Issue.5 , pp. 70-79
    • Gupta, A.1    Jain, R.2
  • 22
    • 0020153694 scopus 로고
    • Color image quantization for frame-buffer display
    • Heckbert, P. (1980). Color image quantization for frame-buffer display. Computer Graphics, 16,297-307.
    • (1980) Computer Graphics , vol.16 , pp. 297-307
    • Heckbert, P.1
  • 24
    • 0031162081 scopus 로고    scopus 로고
    • The SR-tree: An index structure for high-dimensional nearest neighbor queries
    • J. Peckham Ed. New York: ACM Press
    • Katayama, N., & Satoh, S. ( 1997). The SR-tree: An index structure for high-dimensional nearest neighbor queries. In J. Peckham (Ed.), Proceedings of ACM SIGMOD (pp. 369-380). New York: ACM Press.
    • (1997) Proceedings of ACM SIGMOD , pp. 369-380
    • Katayama, N.1    Satoh, S.2
  • 27
    • 0032655357 scopus 로고    scopus 로고
    • Netra: A toolbox for navigating large image databases
    • Ma, W., & Manjunath, B. (1999). Netra: A toolbox for navigating large image databases. Multimedia Systems, 7, 184-198.
    • (1999) Multimedia Systems , vol.7 , pp. 184-198
    • Ma, W.1    Manjunath, B.2
  • 29
    • 0029754085 scopus 로고    scopus 로고
    • Evaluating multi-dimensional indexing structures for images transformed by principal component analysis
    • L. E. Berman & J. Arthur (Eds.). East Stroudsburg, PA: SPIE
    • Ng, R., & Sedighian, A. (1996). Evaluating multi-dimensional indexing structures for images transformed by principal component analysis. In L. E. Berman & J. Arthur (Eds.), Proceedings of Storage and Retrieval for Image and Video Databases (pp. 50-61). East Stroudsburg, PA: SPIE.
    • (1996) Proceedings of Storage and Retrieval for Image and Video Databases , pp. 50-61
    • Ng, R.1    Sedighian, A.2
  • 32
    • 85010847034 scopus 로고
    • The K-D-B-tree: A search structure for large multidimensional dynamic indexes
    • E. Lien (Ed.). New York: ACM Press
    • Robinson, J. (1981). The K-D-B-tree: A search structure for large multidimensional dynamic indexes. In E. Lien (Ed.), Proceedings of the ACM SIGMOD Conference (pp. 10-18). New York: ACM Press.
    • (1981) Proceedings of the ACM SIGMOD Conference , pp. 10-18
    • Robinson, J.1
  • 33
    • 0344775426 scopus 로고    scopus 로고
    • The A-tree: An index structure for high-dimensional spaces using relative approximation
    • M. Bone, S. Chakravarthi, & U. Dayal (Eds.). San Francisco: Morgan Kaufmann
    • Sakurai, Y., Yoshikawa, M., Uemura, S., & Kojima, H. (2000). The A-tree: An index structure for high-dimensional spaces using relative approximation. In M. Bone, S. Chakravarthi, & U. Dayal (Eds.), Proceedings of the 26th VLDB Conference (pp. 516-526). San Francisco: Morgan Kaufmann.
    • (2000) Proceedings of the 26th VLDB Conference , pp. 516-526
    • Sakurai, Y.1    Yoshikawa, M.2    Uemura, S.3    Kojima, H.4
  • 34
  • 35
    • 33749411453 scopus 로고    scopus 로고
    • An approach to content-based image retrieval using clustering and space transformation
    • S. Adali, Y. Nakamura, & U. Srinivas (Eds.) New York: ACM Press
    • Shah, B., & Raghavan, V. (2002). An approach to content-based image retrieval using clustering and space transformation. In S. Adali, Y. Nakamura, & U. Srinivas (Eds.), Proceedings of the International Workshop on Multimedia Information Retrieval. New York: ACM Press.
    • (2002) Proceedings of the International Workshop on Multimedia Information Retrieval
    • Shah, B.1    Raghavan, V.2
  • 36
    • 3042836715 scopus 로고    scopus 로고
    • Efficient and effective content-based image retrieval using space transformation
    • Y. Chen (Ed.). Piscataway, NJ: IEEE Press
    • Shah, B., Raghavan, V., & Dhatric, P. (2004). Efficient and effective content-based image retrieval using space transformation. In Y. Chen (Ed.), Proceedings of the International Conference on Multimedia Modeling (pp. 279-284). Piscataway, NJ: IEEE Press.
    • (2004) Proceedings of the International Conference on Multimedia Modeling , pp. 279-284
    • Shah, B.1    Raghavan, V.2    Dhatric, P.3
  • 37
  • 41
    • 0030702963 scopus 로고    scopus 로고
    • Color clustering techniques for color-content-based image retrieval from image databases
    • N. Georganas (Ed.). Piscataway, NJ: IEEE Press
    • Wang, J., Yang, W., & Acharya, R. (1997). Color clustering techniques for color-content-based image retrieval from image databases. In N. Georganas (Ed.), Proceedings of the IEEE International Conference on Multimedia Computing and Systems (pp. 442-449). Piscataway, NJ: IEEE Press.
    • (1997) Proceedings of the IEEE International Conference on Multimedia Computing and Systems , pp. 442-449
    • Wang, J.1    Yang, W.2    Acharya, R.3


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