메뉴 건너뛰기




Volumn , Issue , 2007, Pages 150-153

Fast graph segmentation based on statistical aggregation phenomena

Author keywords

[No Author keywords available]

Indexed keywords

2D IMAGES; 3D MESHES; AGGREGATION PHENOMENA; ARBITRARY GRAPHS; COLOR IMAGE SEGMENTATION; GRAPH SEGMENTATION; PRE-SEGMENTATION; REAL-TIME VIDEO SEGMENTATION; ROBOTICS APPLICATIONS; VOLUME DATA;

EID: 84155161618     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper
Times cited : (4)

References (7)
  • 3
    • 26444530577 scopus 로고    scopus 로고
    • Real-time adaptive colour segmentation for the RoboCup middle size league
    • volume 3276 of Lecture Notes in Computer Science, Springer
    • C. Gönner, M. Rous, and K.-F. Kraiss. Real-time adaptive colour segmentation for the RoboCup middle size league. In RoboCup 2004: Robot Soccer World Cup VIII, volume 3276 of Lecture Notes in Computer Science, pages 402-409. Springer, 2004.
    • (2004) RoboCup 2004: Robot Soccer World Cup VIII , pp. 402-409
    • Gönner, C.1    Rous, M.2    Kraiss, K.-F.3
  • 4
    • 0000672724 scopus 로고    scopus 로고
    • Concentration
    • M. Habib, C. McDiarmid, J. ramirez Alfonsen, and B. Reed, editors
    • C. McDiarmid. Concentration. In M. Habib, C. McDiarmid, J. ramirez Alfonsen, and B. Reed, editors, Probabilistic mMethods for Algorithmic Discrete Mathematics, pages 195-248. 1998.
    • (1998) Probabilistic MMethods for Algorithmic Discrete Mathematics , pp. 195-248
    • McDiarmid, C.1
  • 5
    • 14644396085 scopus 로고    scopus 로고
    • Semi-supervised statistical region refinement for color image segmentation
    • R. Nock and F. Nielsen. Semi-supervised statistical region refinement for color image segmentation. Pattern Recognition, 38(6):835-846, 2005.
    • (2005) Pattern Recognition , vol.38 , Issue.6 , pp. 835-846
    • Nock, R.1    Nielsen, F.2
  • 7
    • 0018455018 scopus 로고
    • A class of algorithms which require nonlinear time to maintain disjoint sets
    • R. E. Tarjan. A class of algorithms which require nonlinear time to maintain disjoint sets. J. Comput. Syst. Sci., 18(2):110-127, 1979.
    • (1979) J. Comput. Syst. Sci. , vol.18 , Issue.2 , pp. 110-127
    • Tarjan, R.E.1


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