Accurate banded graph cut segmentation of thin structures using laplacian pyramids

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4191 LNCS - II, Issue , 2006, Pages 896-903

  Sinop, Ali Kemal ^a   Grady, Leo ^a  

^a SIEMENS CORPORATE RESEARCH   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATION THEORY; IMAGE SEGMENTATION; LAPLACE TRANSFORMS; MEDICAL IMAGING;

COMPUTATIONAL SPEED; LAPLACIAN PYRAMIDS; QUALITATIVE COMPARISONS; THIN STRUCTURES;

GRAPH THEORY;

ALGORITHM; ARTICLE; ARTIFICIAL INTELLIGENCE; AUTOMATED PATTERN RECOGNITION; COMPUTER ASSISTED DIAGNOSIS; EVALUATION; IMAGE ENHANCEMENT; METHODOLOGY; REPRODUCIBILITY; SENSITIVITY AND SPECIFICITY; THREE DIMENSIONAL IMAGING;

ALGORITHMS; ARTIFICIAL INTELLIGENCE; IMAGE ENHANCEMENT; IMAGE INTERPRETATION, COMPUTER-ASSISTED; IMAGING, THREE-DIMENSIONAL; PATTERN RECOGNITION, AUTOMATED; REPRODUCIBILITY OF RESULTS; SENSITIVITY AND SPECIFICITY;

EID: 79551680931     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11866763_110     Document Type: Conference Paper

References (10)

1. Boykov, Y., Jolly, M.P.: Interactive graph cuts for optimal boundary & region segmentation of objects in N-D images. In: Proc. of ICCV 2001. (2001) 105-112
2. Lombaert, H., Sun, Y., Grady, L., Xu, C.: A multilevel banded graph cuts method for fast image segmentation. In: Proceedings of ICCV 2005. Volume I., Bejing, China, IEEE (2005) 259-265
3. Gibbons, A.: Algorithmic Graph Theory. Cambridge University Press (1989)
4. Boykov, Y., Kolmogorov, V.: An experimental comparison of min-cut/max-flow algorithms for energy minimization in vision. IEEE PAMI 26(9) (2004) 1124-1137
5. D. Greig, B.P., Seheult, A.: Exact maximum a posteriori estimation for binary images. Journal of the Royal Statistical Society, Series B 51(2) (1989) 271-279
6. Boykov, Y., Veksler, O., Zabih, R.: A new algorithm for energy minimization with discontinuities. In Pelillo-M., H.E.R., ed.: Energy Minimization Methods in Computer Vision and Pattern Recognition. Second International Workshop, EMMCVPR'99, York, UK, 26-29 July 1999. (1999) 205-220
7. Boykov, Y., Kolmogorov, V.: Computing geodesics and minimal surfaces via graph cuts. In: Proceedings of Iternational Conference on Computer Vision. Volume 1. (2003)
8. Li, Y., Sun, J., Tang, C., Shum, H.: Lazy snapping. In: Proceedings of ACM SIGGRAPH 2004. (2004) 303-308
9. Roerdink, J., Meijster, A.: The watershed transform: Definitions, algorithms, and parallellization strategies. Fund. Informaticae 41 (2000) 187-228
10. Butt, P.J., Adelson, E.H.: The Laplacian pyramid as a compact image code. IEEE Transactions on Communications COM-31(4) (1983) 532-540