Fast graph cuts: a weak shape assumption provides a fast exact method for graph cuts segmentation
作者： Leo Grady , Chenyang Xu
DOI:
关键词:
摘要: Traditional graph cuts provides a powerful method for producing semi-automatic image/volume segmentation, but often exceed available computer power. Multi-level methods coarsening images/volumes are disclosed that allow faster processing and creation of segmentation without sacrificing quality image. The can be used at interactive speeds.
lens.org 参考文章(12)
Dan Dalton, Managing images captured by a digital camera ,(2003)
Naruto Takasaki, Yutake Tanaka, Pattern recognition apparatus ,(1989)
Eitan Sharon, Ronen Basri, Achi Brandt, Method and apparatus for data clustering including segmentation and boundary detection ,(2001)
Carsten Curt Eckard Rother, Andrew Blake, Padmanabhan Anandan, Foreground extraction using iterated graph cuts ,(2004)
Christopher R. Les Hameaux Du Glezy Dance, Kimberly Moravec, Method and apparatus for automatically determining image foreground color 7,536,048. (2004). ,(2004)
Carsten Rother, Vladimir Kolmogorov, Andrew Blake, "GrabCut" ACM Transactions on Graphics. ,vol. 23, pp. 309- 314 ,(2004) , 10.1145/1015706.1015720
Jitendra Malik, Serge Belongie, Thomas Leung, Jianbo Shi, Contour and Texture Analysis for Image Segmentation International Journal of Computer Vision. ,vol. 43, pp. 7- 27 ,(2001) , 10.1023/A:1011174803800
D. Geiger, J.E. Kogler, Scaling images and image features via the renormalization group computer vision and pattern recognition. pp. 47- 53 ,(1993) , 10.1109/CVPR.1993.341002
Haan Gerard De, A unit for and method of image conversion ,(2003)
Heung-Yeung Shum, Chi Keung Tang, Jian Sun, Yin Li, Systems and methods for image data separation ,(2005)