Suppose now that along with each pixel AOEi; j , we have calculated a realvalued disruption measure dOEi; j , indicating how disruptive it would be to remove pixel AOEi; j . Intuitively, the lower a pixels disruption measure, the more similar the pixel is to its neighbors. Suppose further that we define the disruption measure of a seam to be the sum of the disruption measures of its pixels.

Give an algorithm to find a seam with the lowest disruption measure. How efficient is your algorithm?