메뉴 건너뛰기




Volumn , Issue , 2008, Pages

Interactive image segmentation via minimization of quadratic energies on directed graphs

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMBINATORIAL MATHEMATICS; COMPUTER VISION; DIGITAL IMAGE STORAGE; FEATURE EXTRACTION; GRAPH THEORY; IMAGE PROCESSING; IMAGE SEGMENTATION; ITERATIVE METHODS; OPTIMIZATION; PATTERN RECOGNITION; PIXELS; QUADRATIC PROGRAMMING; REPAIR;

EID: 51949091181     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/CVPR.2008.4587485     Document Type: Conference Paper
Times cited : (25)

References (11)
  • 1
    • 33746427122 scopus 로고    scopus 로고
    • Graph Cuts and Efficient N-D Image Segmentation
    • Y. Boykov and G. Funka-Lea. Graph Cuts and Efficient N-D Image Segmentation. IJCV, 70(2):109-131, 2006.
    • (2006) IJCV , vol.70 , Issue.2 , pp. 109-131
    • Boykov, Y.1    Funka-Lea, G.2
  • 2
    • 0031071476 scopus 로고    scopus 로고
    • Geodesic Active Contours
    • V. Caselles, R. Kimmel, and G. Sapiro. Geodesic Active Contours. IJCV, 22(1):61-79, 1997.
    • (1997) IJCV , vol.22 , Issue.1 , pp. 61-79
    • Caselles, V.1    Kimmel, R.2    Sapiro, G.3
  • 3
    • 85069413985 scopus 로고    scopus 로고
    • P. Doyle and L. Snell. Random Walks and Electric Networks. Number 22 in The Carus Mathematical Monographs. The Mathematical Society of America, 1984.
    • P. Doyle and L. Snell. Random Walks and Electric Networks. Number 22 in The Carus Mathematical Monographs. The Mathematical Society of America, 1984.
  • 4
    • 33846207510 scopus 로고    scopus 로고
    • Random Walks for Image Segmentation
    • November
    • L. Grady. Random Walks for Image Segmentation. IEEE Trans. on PAMI, 28(11):1768-1783, November 2006.
    • (2006) IEEE Trans. on PAMI , vol.28 , Issue.11 , pp. 1768-1783
    • Grady, L.1
  • 6
    • 33745969182 scopus 로고    scopus 로고
    • What Metrics Can Be Approximated by Geo-Cuts, or Global Optimization of Length/Area and Flux
    • V. Kolmogorov and Y. Boykov. What Metrics Can Be Approximated by Geo-Cuts, or Global Optimization of Length/Area and Flux. In ICCV, volume 1, pages 564-571, 2005.
    • (2005) ICCV , vol.1 , pp. 564-571
    • Kolmogorov, V.1    Boykov, Y.2
  • 7
    • 0742286180 scopus 로고    scopus 로고
    • What Energy Functions Can Be Minimized Via Graph Cuts?
    • V. Kolmogorov and R. Zabih. What Energy Functions Can Be Minimized Via Graph Cuts? IEEE Trans. on PAMI, 26(2):147-159, 2004.
    • (2004) IEEE Trans. on PAMI , vol.26 , Issue.2 , pp. 147-159
    • Kolmogorov, V.1    Zabih, R.2
  • 9
    • 0029255247 scopus 로고
    • Shape Modeling with Front Propagation: A Level Set Approach
    • Feb
    • R. Malladi, J. Sethian, and B. C. Vemuri. Shape Modeling with Front Propagation: A Level Set Approach. IEEE Trans. on PAMI, 17(2):158-175, Feb. 1995.
    • (1995) IEEE Trans. on PAMI , vol.17 , Issue.2 , pp. 158-175
    • Malladi, R.1    Sethian, J.2    Vemuri, B.C.3
  • 10
    • 50649084500 scopus 로고    scopus 로고
    • A Seeded Image Segmentation Framework Unifying Graph Cuts and Random Walker Which Yields A New Algorithm
    • A. K. Sinop and L. Grady. A Seeded Image Segmentation Framework Unifying Graph Cuts and Random Walker Which Yields A New Algorithm. In ICCV, 2007.
    • (2007) ICCV
    • Sinop, A.K.1    Grady, L.2
  • 11
    • 0036940308 scopus 로고    scopus 로고
    • Flux Maximizing Geometric Flows
    • A. Vasilevskiy and K. Siddiqi. Flux Maximizing Geometric Flows. IEEE Trans. on PAMI, 24(12):1565-1578, 2002.
    • (2002) IEEE Trans. on PAMI , vol.24 , Issue.12 , pp. 1565-1578
    • Vasilevskiy, A.1    Siddiqi, K.2


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