Abstract
The Potts model is a well established approach to solve different multi-label problems. The classical Potts prior penalizes the total interface length to obtain regular boundaries. Although the Potts prior works well for many problems, it does not preserve fine details of the boundaries. In recent years, non-local regularizers have been proposed to improve different variational models. The basic idea is to consider pixel interactions within a larger neighborhood. This can for example be used to incorporate low-level segmentation into the regularizer which leads to improved boundaries. In this work we study such an extension for the multi-label Potts model. Due to the increased model complexity, the main challenge is the development of an efficient minimization algorithm. We show that an accelerated first-order algorithm of Nesterov is well suited for this problem, due to its low memory requirements and its potential for massive parallelism. Our algorithm allows us to minimize the non-local Potts model with several hundred labels within a few minutes. This makes the non-local Potts model applicable for computer vision problems with many labels, such as multi-label image segmentation and stereo.
This work was supported by the BRIDGE project HD-VIP (no. 827544).
Access provided by Autonomous University of Puebla. Download to read the full chapter text
Chapter PDF
Similar content being viewed by others
References
Aujol, J.F.: Some first-order algorithms for total variation based image restoration. J. Math. Imaging Vis. 34(3), 307–327 (2009)
Bae, E., Yuan, J., Tai, X.C.: Global minimization for continuous multiphase partitioning problems using a dual approach. International Journal of Computer Vision, 1–18 (2010), doi:10.1007/s11263-010-0406-y
Beck, A., Teboulle, M.: A fast iterative shrinkage-thresholding algorithm for linear inverse problems. SIAM J. Imaging Sci. 2(1), 183–202 (2009)
Boykov, Y., Veksler, O., Zabih, R.: Fast approximate energy minimization via graph cuts. IEEE Trans. Pattern Analysis and Machine Intelligence 23(11), 1222–1239 (2001)
Boykov, Y.Y., Lea, G.F.: Graph cuts and efficient N-D image segmentation. International Journal of Computer Vision 70(2), 109–131 (2006)
Bresson, X., Chan, T.F.: Non-local unsupervised variational image segmentation models. Tech. rep., UCLA CAM Report 08-67 (October 2008)
Bresson, X., Esedoglu, S., Vandergheynst, P., Thiran, J.P., Osher, S.J.: Fast global minimization of the active contour/snake model. J. Math. Imaging Vis. 28(2), 151–167 (2007)
Brox, T., Kleinschmidt, O., Cremers, D.: Efficient nonlocal means for denoising of textural patterns. IEEE Trans. on Image Processing 17(7), 1083–1092 (2008)
Buades, A., Coll, B., Morel, J.M.: Nonlocal image and movie denoising. International Journal of Computer Vision 76(2), 123–139 (2007)
Chambolle, A., Pock, T.: A first-order primal-dual algorithm for convex problems with applications to imaging. J. Math. Imaging Vis. (2010)
Chan, T., Esedoglu, S., Nikolova, M.: Algorithms for finding global minimizers of image segmentation and denoising models. SIAM Journal of Applied Mathematics 66(5), 1632–1648 (2006)
Chan, T., Vese, L.: Active contours without edges. IEEE Trans. Image Processing 10(2), 266–277 (2001)
Dahl, J., Hansen, P.C., Jensen, S.H., Jensen, T.L.: Algorithms and software for total variation image reconstruction via first-order methods. Numerical Algorithms 53(1), 67–92 (2010)
Efros, A.A., Leung, T.K.: Texture synthesis by non-parametric sampling. In: ICCV, pp. 1033–1038 (1999)
Gilboa, G., Osher, S.J.: Nonlocal operators with applications to image processing. Tech. rep., UCLA CAM Report 07-23 (July 2007)
Huber, P.J.: Robust Statistics. Wiley Series in Probability and Statistics (1981)
Ishikawa, H.: Exact optimization for markov random fields with convex priors. IEEE Trans. Pattern Analysis and Machine Intelligence 25(10), 1333–1336 (2003)
Ising, E.: Beitrag zur Theorie des Ferromagnetismus. Zeitschrift für Physik 23, 253–258 (1925)
Lellmann, J., Kappes, J., Yuan, J., Becker, F., Schnörr, C.: Convex Multi-class Image Labeling by Simplex-Constrained Total Variation. In: Tai, X.-C., Mørken, K., Lysaker, M., Lie, K.-A. (eds.) SSVM 2009. LNCS, vol. 5567, pp. 150–162. Springer, Heidelberg (2009)
Michelot, C.: A finite algorithm for finding the projection of a point onto the canonical simplex of ℝn. Journal of Optimization Theory and Applications 50, 195–200 (1986)
Mumford, D., Shah, J.: Optimal approximation by piecewise smooth functions and associated variational problems. Comm. Pure Appl. Math. 42, 577–685 (1989)
Nesterov, Y.: A method for solving the convex programming problem with convergence rate O(1/k 2). Dokl. Akad. Nauk USSR 269(3), 543–547 (1983)
Nesterov, Y.: Smooth minimization of non-smooth functions. Math. Program. 103(1, ser. A), 127–152 (2005)
Pock, T., Chambolle, A., Cremers, D., Bischof, H.: A convex relaxation approach for computing minimal partitions. In: IEEE Computer Society Conference on Computer Vision and Pattern Recognition, CVPR (2009)
Pock, T., Cremers, D., Bischof, H., Chambolle, A.: Global solutions of variational models with convex regularization. SIAM Journal on Imaging Sciences 3(4), 1122–1145 (2010)
Potts, R.B.: Some generalized order-disorder transformations. Proc. Camb. Phil. Soc. 48, 106–109 (1952)
Santner, J., Pock, T., Bischof, H.: Interactive multi-label segmentation. In: Kimmel, R., Klette, R., Sugimoto, A. (eds.) ACCV 2010, Part I. LNCS, vol. 6492, pp. 397–410. Springer, Heidelberg (2011)
Sun, D., Roth, S., Black, M.J.: Secrets of optical flow estimation and their principles. In: IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR), San Francisco, CA, USA (June 2010)
Tomasi, C., Manduchi, R.: Bilateral filtering for gray and color images. In: ICCV, pp. 839–846 (1998)
Weiss, P., Blanc-Féraud, L., Aubert, G.: Efficient schemes for total variation minimization under constraints in image processing. SIAM J. Scientific Computing 31(3), 2047–2080 (2009)
Werlberger, M., Pock, T., Bischof, H.: Motion estimation with non-local total variation regularization. In: IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR), San Francisco, CA, USA (June 2010)
Yaroslavsky, L.P.: Digital Picture Processing — an Introduction. Springer, Berlin (1985)
Yoon, K.J., Kweon, I.S.: Adaptive support-weight approach for correspondence search. IEEE Trans. on Pattern Analysis and Machine Intelligence 28(4), 650–656 (2006)
Zach, C., Gallup, D., Frahm, J.M., Niethammer, M.: Fast global labeling for real-time stereo using multiple plane sweeps. In: Proceedings of the Vision, Modeling, and Visualization Conference, pp. 243–252 (2008)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Werlberger, M., Unger, M., Pock, T., Bischof, H. (2012). Efficient Minimization of the Non-local Potts Model. In: Bruckstein, A.M., ter Haar Romeny, B.M., Bronstein, A.M., Bronstein, M.M. (eds) Scale Space and Variational Methods in Computer Vision. SSVM 2011. Lecture Notes in Computer Science, vol 6667. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-24785-9_27
Download citation
DOI: https://doi.org/10.1007/978-3-642-24785-9_27
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-24784-2
Online ISBN: 978-3-642-24785-9
eBook Packages: Computer ScienceComputer Science (R0)