Content area
Vision and graphics researchers continue to explore graph cuts as a topic of study in their respective fields. Some appealing links among graph cuts, those certain combinatorial algorithms (dynamic programming, direct paths) and Markov random fields have been discovered or rediscoveries in recent years. Another relationship is between sub modular functions and electric circuit theory, Bayesian networks and belief propagation, and essential geometry and anisotropic diffusion.