Bregman Divergence Applied to Hierarchical Segmentation Problems
Image segmentation is one of the first steps in any process concerning digital image analysis and its accuracy will go on to determine the quality of this analysis. A classic model used in image segmentation is the Mumford-Shah functional, which includes both the information to pertaining the region and the length of its borders. In this work, by using the concept of loss in Bregman Information a functional is defined which is a generalization of the Mumford-Shah functional, once it is obtained from the proposed function by means of the Squared Euclidean distance as a measure of similarity. The algorithm is constructed by using a fusion criterion, which minimizes the loss in Bregman Information. It is shown that the proposed hierarchical segmentation method generalizes the algorithm which minimizes the piecewise constant Mumford-Shah functional. The results obtained through use of the Generalized I-Divergence, Itakura-Saito and Squared Euclidean distance, show that the algorithm attained a good performance.
KeywordsHierarchical segmentation Mumford-Shah functional Fusion region
- 3.Bregman, L.M.: The relaxation method of finding the common point of convex sets and its application to the solution of problems in convex programming. USSR, Computational Mathematics and Mathematical Physics 200–217 (1967)Google Scholar
- 4.Cardelino, J., Bertalmio, M., Caselles, V., Randall G.: A contrario hierarchical segmentation. In: 16th IEEE International Conference Image Processing (ICIP), pp. 4041–4044 (2009)Google Scholar
- 6.Mumford, D., Shah, J.: Optimal approximations by piecewise smooth functions and associated variational problems. Pure Appl. Math. (1989)Google Scholar
- 8.Telgarsky, M. and Dasgupta, S.: Agglomerative Bregman clustering. In: Proc. ICML (2012)Google Scholar