Employing Graph Cut for qualitative Volume Reconstruction

[1]  Kees Joost Batenburg,et al.  Generic iterative subset algorithms for discrete tomography , 2009, Discret. Appl. Math..

[2]  Ming Jiang,et al.  Convergence of the simultaneous algebraic reconstruction technique (SART) , 2003, Conference Record of Thirty-Fifth Asilomar Conference on Signals, Systems and Computers (Cat.No.01CH37256).

[3]  Olga Veksler,et al.  Fast Approximate Energy Minimization via Graph Cuts , 2001, IEEE Trans. Pattern Anal. Mach. Intell..

[4]  Daniel Freedman,et al.  Energy minimization via graph cuts: settling what is possible , 2005, 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05).

[5]  Vladimir Kolmogorov,et al.  Computing geodesics and minimal surfaces via graph cuts , 2003, Proceedings Ninth IEEE International Conference on Computer Vision.

[6]  Marek Chrobak,et al.  Reconstructing hv-Convex Polyominoes from Orthogonal Projections , 1999, Inf. Process. Lett..

[7]  Yogesh Rathi,et al.  Graph Cut Segmentation with Nonlinear Shape Priors , 2007, 2007 IEEE International Conference on Image Processing.

[8]  Kees Joost Batenburg.  A new algorithm for 3D binary tomography , 2005, Electron. Notes Discret. Math..