The first term ensures that any minimizer S is smooth (except across edges)
while the second term ensures that minimizers approximate I. The last term will
cause the set K to be regular. It is interesting to note as argued in the book [67]
that many segmentation algorithms (including some of the most common) can be
formulated in the Mumford-Shah framework. Further the Mumford-Shah functional
can be given a very natural Bayesian interpretation