메뉴 건너뛰기




Volumn , Issue , 2005, Pages

Image segmentation using commute times

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER VISION; EIGENVALUES AND EIGENFUNCTIONS; LAPLACE TRANSFORMS; RANDOM PROCESSES;

EID: 84898486337     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.5244/C.19.94     Document Type: Conference Paper
Times cited : (27)

References (14)
  • 1
    • 0038589165 scopus 로고    scopus 로고
    • The anatomy of a large-scale hypertextual web search engine
    • S. Brin and L. Page. The anatomy of a large-scale hypertextual Web search engine. Computer Networks and ISDN Systems, 30(1-7): 107-117, 1998.
    • (1998) Computer Networks and ISDN Systems , vol.30 , Issue.1-7 , pp. 107-117
    • Brin, S.1    Page, L.2
  • 2
    • 0003882879 scopus 로고    scopus 로고
    • CBMS series 92. American Mathmatical Society Ed
    • F.R.K. Chung. Spectral Graph Theory. CBMS series 92. American Mathmatical Society Ed., 1997.
    • (1997) Spectral Graph Theory
    • Chung, F.R.K.1
  • 4
    • 10044276942 scopus 로고    scopus 로고
    • Graph matching using random walks
    • M. Gori, M. Maggini, and L. Sarti. Graph matching using random walks. In ICPR04, pages III: 394-397, 2004.
    • (2004) ICPR04 , vol.3 , pp. 394-397
    • Gori, M.1    Maggini, M.2    Sarti, L.3
  • 8
    • 0041939837 scopus 로고    scopus 로고
    • A new graph-theoretic approach to clustering and segmentation
    • M. Pavan and M. Pelillo. A new graph-theoretic approach to clustering and segmentation. In CVPR03, pages I: 145-152, 2003.
    • (2003) CVPR03 , vol.1 , pp. 145-152
    • Pavan, M.1    Pelillo, M.2
  • 9
    • 33646128618 scopus 로고    scopus 로고
    • String edit distance, random walks and graph matching
    • to appear
    • A. Robles-Kelly and E. R. Hancock. String edit distance, random walks and graph matching. PAMI to appear, 2005.
    • (2005) PAMI
    • Robles-Kelly, A.1    Hancock, E.R.2
  • 10
    • 22944459214 scopus 로고    scopus 로고
    • The principal components analysis of a graph, and its relationships to spectral clustering
    • M. Saerens, F. Fouss, L. Yen, and P. Dupont. The principal components analysis of a graph, and its relationships to spectral clustering. In LN-AI, 2004.
    • (2004) LN-AI
    • Saerens, M.1    Fouss, F.2    Yen, L.3    Dupont, P.4
  • 11
    • 0029713930 scopus 로고    scopus 로고
    • Quantitative measures of change based on feature organization: Eigenvalues and eigenvectors
    • page 478
    • S. Sarkar and K. L. Boyer. Quantitative measures of change based on feature organization: Eigenvalues and eigenvectors. In CVPR, page 478, 1996.
    • (1996) CVPR
    • Sarkar, S.1    Boyer, L.K.2
  • 12
    • 0000963696 scopus 로고
    • Feature grouping by relicalisation of eigenvectors of the proximity matrix
    • G. Scott and H. Longuet-Higgins. Feature grouping by relicalisation of eigenvectors of the proximity matrix. In BMVC., pages 103-108, 1990.
    • (1990) BMVC , pp. 103-108
    • Scott, G.1    Longuet-Higgins, H.2
  • 13
    • 0034244751 scopus 로고    scopus 로고
    • Normalized cuts and image segmentation
    • J. Shi and J. Malik. Normalized cuts and image segmentation. IEEE PAMI, 22(8): 888-905, 2000.
    • (2000) IEEE PAMI , vol.22 , Issue.8 , pp. 888-905
    • Shi, J.1    Malik, J.2
  • 14
    • 12144273127 scopus 로고    scopus 로고
    • First-passage properties of the erdoscrenyi random graph
    • V. Sood, S. Redner, and D. Ben Avraham. First-passage properties of the erdoscrenyi random graph. J. Phys. A: Math. Gen., pages 109-123, 2005.
    • (2005) J. Phys. A: Math. Gen , pp. 109-123
    • Sood, V.1    Redner, S.2    Ben Avraham, D.3


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