What metrics can be approximated by geo-cuts, or global optimization of length/area and flux
暂无分享,去创建一个
[1] Michael E. Leventon,et al. Statistical models in medical image analysis , 2000 .
[2] Marie-Pierre Jolly,et al. Interactive graph cuts for optimal boundary & region segmentation of objects in N-D images , 2001, Proceedings Eighth IEEE International Conference on Computer Vision. ICCV 2001.
[3] Kaleem Siddiqi,et al. Flux Maximizing Geometric Flows , 2001, ICCV.
[4] Ian H. Jermyn,et al. Globally Optimal Regions and Boundaries as Minimum Ratio Weight Cycles , 2001, IEEE Trans. Pattern Anal. Mach. Intell..
[5] Endre Boros,et al. Pseudo-Boolean optimization , 2002, Discret. Appl. Math..
[6] Daniel Cremers,et al. Statistical shape knowledge in variational motion segmentation , 2003, Image Vis. Comput..
[7] Vladimir Kolmogorov,et al. Computing geodesics and minimal surfaces via graph cuts , 2003, Proceedings Ninth IEEE International Conference on Computer Vision.
[8] Kaleem Siddiqi,et al. Flux invariants for shape , 2003, 2003 IEEE Computer Society Conference on Computer Vision and Pattern Recognition, 2003. Proceedings..
[9] Alfred M. Bruckstein,et al. Regularized Laplacian Zero Crossings as Optimal Edge Integrators , 2003, International Journal of Computer Vision.
[10] Vladimir Kolmogorov,et al. What energy functions can be minimized via graph cuts? , 2002, IEEE Transactions on Pattern Analysis and Machine Intelligence.
[11] S. Gortler,et al. A Discrete Global Minimization Algorithm for Continuous Variational Problems , 2004 .
[12] Maxime Descoteaux,et al. Geometric Flows for Segmenting Vasculature in MRI: Theory and Validation , 2004, MICCAI.
[13] Vladimir Kolmogorov,et al. An experimental comparison of min-cut/max- flow algorithms for energy minimization in vision , 2001, IEEE Transactions on Pattern Analysis and Machine Intelligence.