Minimal graph cuts on network subgraphs
Trudy Matematicheskogo Instituta imeni V.A. Steklova, Tome 62 (2007) no. 4, pp. 810-812
Cet article a éte moissonné depuis la source Math-Net.Ru
@article{RM_2007_62_4_a16,
author = {V. S. Lempitskii},
title = {Minimal graph cuts on network subgraphs},
journal = {Trudy Matematicheskogo Instituta imeni V.A. Steklova},
pages = {810--812},
year = {2007},
volume = {62},
number = {4},
language = {en},
url = {http://geodesic.mathdoc.fr/item/RM_2007_62_4_a16/}
}
V. S. Lempitskii. Minimal graph cuts on network subgraphs. Trudy Matematicheskogo Instituta imeni V.A. Steklova, Tome 62 (2007) no. 4, pp. 810-812. http://geodesic.mathdoc.fr/item/RM_2007_62_4_a16/
[1] L. R. Ford, D. R. Falkerson, Potoki v setyakh, Mir., M., 1966 | Zbl
[2] H. Lombaert, Y. Sun, L. Grady, C. Xu, “A multilevel banded graph cuts method for fast image segmentation”, Proc. IEEE ICCV' 05, Vol. 1, IEEE Computer Soc., 2005, 259–265 | DOI
[3] V. Lempitsky, Y. Boykov, “Global optimization for shape fitting”, Proc. IEEE CVRP' 07, IEEE Computer Soc., 2007, 1–8 | DOI