1. Gonsales, R. Tsifrovaya obrabotka izobrazhenii / R. Gonsales, R. Vuds. - M. : Tekhnosfe-
2. ra, 2005. - 1072 s.
3. Boykov, Y. An experimental comparison of min-cut/max-flow algorithms of energy minimization in vision / Y. Boykov, V. Kolmogorov // IEEE Transactions on PAMI. - 2004. - Vol. 26, № 9. - P. 1124-1137.
4. Boykov, Y. Graph Cuts and Efficient N-D image Segmentation / Y. Boykov, G. Funka-Lea //
5. Intern. J. of Computer Vision. - 2006. - Vol. 70 (2). - P. 109-131.
6. Pradun, D.V. Ispol'zovanie algoritma maksimal'nogo potoka grafa dlya fil'tratsii
7. mul'tispektral'nykh izobrazhenii / D.V. Pradun, B.A. Zalesskii // Informatika. - 2009. -
8. № 4 (24). - S. 18-27.
9. Svami, M. Grafy, seti i algoritmy / M. Svami, K. Tkhulasiraman. - M. : Mir, 1984. -
10. s.
11. Picard, J.C. Minimum cuts and related problems / J.C. Picard, H.D. Ratliff // Networks. -
12. - Vol. 5, № 4. - P. 357-370.
13. Zalesky, B.A. Network flow optimization for restoration of images / B.A. Zalesky // Journal
14. of Applied Mathematics. - 2002. - Vol. 2, № 4. - P. 199-218.
15. Zalesskii, B.A. Algoritm adaptivnoi fil'tratsii mul'tispektral'nykh izobrazhenii /
16. B.A. Zalesskii, D.V. Pradun // Informatika. - 2009. - № 2 (22). - S. 31-38.