Fig. 1.

Illustration of the proposed dynamic imaging penalty: The penalty is an unweighted sum of distances between patch pairs in the 3-D dataset. For a specified image patch, the penalty involves the distances between itself and other patches in its cube shaped neighborhood. The robust distance metric ϕ is capable of exploiting the redundancy between similar patches, while excluding the dissimilar patches from averaging. Hence, the algorithm can capitalize on the similarity between the corresponding patches, even if they have moved to another location. The blue squares indicate the location of the square in frame 2, while the red squares are the ones with the highest similarity with the red square in frame 2.