메뉴 건너뛰기




Volumn , Issue , 1999, Pages 1178-1183

Managing the complexity of match in retrieval by spatial arrangement

Author keywords

[No Author keywords available]

Indexed keywords

APPLICATION CONTEXTS; COMPARISON OF MODELS; MATCHING ALGORITHM; SPATIAL ARRANGEMENTS; SPATIAL MATCHING; SPATIAL RELATIONSHIPS; STATE SPACE SEARCH ALGORITHM; VISUAL CONTENT;

EID: 84890401487     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICIAP.1999.797763     Document Type: Conference Paper
Times cited : (3)

References (16)
  • 2
    • 0027593722 scopus 로고
    • A linear programming approach for the weighted graph matching problem
    • May
    • H. Almohamad. A linear programming approach for the weighted graph matching problem. IEEE PAMI, 15(5):522-525, May 1993.
    • (1993) IEEE PAMI , vol.15 , Issue.5 , pp. 522-525
    • Almohamad, H.1
  • 4
    • 0023347145 scopus 로고
    • Iconic indexing by 2-d strings
    • July
    • S. Chang,Q. Shi, and C. Yan. Iconic indexing by 2-d strings. IEEE PAMI, 9(3):413-427, July 1987.
    • (1987) IEEE PAMI , vol.9 , Issue.3 , pp. 413-427
    • Chang, S.1    Shi, Q.2    Yan, C.3
  • 7
    • 0030125842 scopus 로고    scopus 로고
    • A graduated assignment algorithm for graphmatching
    • Apr.
    • S. Gold and A. Rangarajan. A graduated assignment algorithm for graphmatching. IEEE PAMI, 18(4):377-388,Apr. 1996.
    • (1996) IEEE PAMI , vol.18 , Issue.4 , pp. 377-388
    • Gold, S.1    Rangarajan, A.2
  • 8
    • 84976823481 scopus 로고
    • Design and evaluation of algorithms for image retrieval by spatial similarity
    • Apr.
    • V. Gudivada and V. Raghavan. Design and evaluation of algorithms for image retrieval by spatial similarity. ACM Trans. on Information Systems, 13(2), Apr. 1995.
    • (1995) ACM Trans. on Information Systems , vol.13 , Issue.2
    • Gudivada, V.1    Raghavan, V.2
  • 9
    • 0031143421 scopus 로고    scopus 로고
    • Visual information retrieval
    • May
    • A. Gupta and R. Jain. Visual information retrieval. Comm. of the ACM, 40(5):70-79, May 1997.
    • (1997) Comm. of the ACM , vol.40 , Issue.5 , pp. 70-79
    • Gupta, A.1    Jain, R.2
  • 10
    • 0020750605 scopus 로고
    • On the foundations of relaxation labeling processes
    • May
    • R. Hummel and S. Zucker. On the foundations of relaxation labeling processes. IEEE PAMI, 5(3):267-286,May 1983.
    • (1983) IEEE PAMI , vol.5 , Issue.3 , pp. 267-286
    • Hummel, R.1    Zucker, S.2
  • 11
    • 0021491922 scopus 로고
    • Relaxation matching techniques - A comparison
    • May
    • K. Price. Relaxation matching techniques-a comparison. IEEE PAMI, 7(5):617-623,May 1985.
    • (1985) IEEE PAMI , vol.7 , Issue.5 , pp. 617-623
    • Price, K.1
  • 13
    • 0019612308 scopus 로고
    • Structural descriptions and inexact matching
    • Sept.
    • L. Shapiro and R. Haralick. Structural descriptions and inexact matching. IEEE PAMI, 3(5):504-519, Sept. 1981.
    • (1981) IEEE PAMI , vol.3 , Issue.5 , pp. 504-519
    • Shapiro, L.1    Haralick, R.2
  • 15
    • 0030389403 scopus 로고    scopus 로고
    • Visualseek: A fully automated content-based image query system
    • Nov.
    • J. Smith and S. Chang. Visualseek: a fully automated content-based image query system. ACM Multimedia '96, Nov. 1996.
    • (1996) ACM Multimedia '96
    • Smith, J.1    Chang, S.2
  • 16
    • 0024069925 scopus 로고
    • An eigendecomposition approach to weighted graph matching problems
    • Sept.
    • S. Umeyama. An eigendecomposition approach to weighted graph matching problems. IEEE PAMI, 10(5):695-703, Sept. 1988.
    • (1988) IEEE PAMI , vol.10 , Issue.5 , pp. 695-703
    • Umeyama, S.1


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