Total Cyclic Variation and Generalizations
详细信息    查看全文
  • 作者:Daniel Cremers (1)
    Evgeny Strekalovskiy (1)
  • 关键词:Total variation ; Convex relaxation ; Optimization ; Manifold valued maps
  • 刊名:Journal of Mathematical Imaging and Vision
  • 出版年:2013
  • 出版时间:November 2013
  • 年:2013
  • 卷:47
  • 期:3
  • 页码:258-277
  • 全文大小:1600KB
  • 参考文献:1. Alberti, G., Bouchitt茅, G., Maso, G.D.: The calibration method for the Mumford-Shah functional and free-discontinuity problems. Calc. Var. Partial Differ. Equ. 3(16), 299鈥?33 (2003) CrossRef
    2. Ambrosio, L., Fusco, N., Pallara, D.: Functions of Bounded Variation and Free Discontinuity Problems. Oxford University Press, Oxford (2000)
    3. Bertalmio, M., Vese, L., Sapiro, G., Osher, S.J.: Simultaneous structure and texture image inpainting. IEEE Trans. Image Process. 12(8), 882鈥?89 (2003) CrossRef
    4. Boerdgen, M., Berkels, B., Rumpf, M., Cremers, D.: Convex relaxation for grain segmentation at atomic scale. In: VMV, pp. 179鈥?86 (2010)
    5. Boykov, Y., Veksler, O., Zabih, R.: Fast approximate energy minimization via graph cuts. IEEE Trans. Pattern Anal. Mach. Intell. 23(11), 1222鈥?239 (2001) CrossRef
    6. Brox, T., Bruhn, A., Papenberg, N., Weickert, J.: High accuracy optical flow estimation based on a theory for warping. In: ECCV, pp. 25鈥?6 (2004)
    7. Chambolle, A., Pock, T.: A first-order primal-dual algorithm for convex problems with applications to imaging. J. Math. Imaging Vis. 40, 120鈥?45 (2011) CrossRef
    8. Ghiglia, D.C., Pritt, M.D.: Two-Dimensional Phase Unwrapping: Theory, Algorithms and Software. Wiley, New York (1998)
    9. Giaquinta, M., Modica, G., Sou膷ek, J.: Variational problems for maps of bounded variation with values in / s 1. Calc. Var. Partial Differ. Equ. 1(1), 87鈥?21 (1993) CrossRef
    10. Giaquinta, M., Modica, G., Sou膷ek, J.: Cartesian Currents in the Calculus of Variations, I: Cartesian Currents. Springer, Berlin (1998) CrossRef
    11. Giaquinta, M., Mucci, D.: The BV-energy of maps into a manifold: relaxation and density results. Ann. Sc. Norm. Super. Pisa, Cl. Sci. 5(4), 483鈥?48 (2006)
    12. Giaquinta, M., Mucci, D.: Maps of bounded variation with values into a manifold: total variation and relaxed energy. Pure Appl. Math. Q. 3(2), 513鈥?38 (2007)
    13. Kleinberg, J., Tardos, E.: Approximation algorithms for classification problems with pairwise relationships: metric labeling and Markov random fields. In: FOCS, pp. 14鈥?3 (1999)
    14. Kolev, K., Klodt, M., Brox, T., Cremers, D.: Continuous global optimization in multiview 3d reconstruction. Int. J. Comput. Vis. 84(1), 80鈥?6 (2009) CrossRef
    15. Lellmann, J., Kappes, J.H., Yuan, J., Becker, F., Schn枚rr, C.: Convex multi-class image labeling by simplex-constrained total variation. Tech. rep, IWR, Univ. Heidelberg (2008)
    16. Marquina, A., Osher, S.J.: Image super-resolution by TV regularization and Bregman iteration. J. Sci. Comput. 37(3), 367鈥?82 (2008) CrossRef
    17. Nikolova, M., Esedoglu, S., Chan, T.F.: Algorithms for finding global minimizers of image segmentation and denoising models. SIAM J. Appl. Math. 66(5), 1632鈥?648 (2006) CrossRef
    18. Ostresh, L.M.: On the convergence of a class of iterative methods for solving the Weber location problem. Oper. Res. 26(4) (1978)
    19. Pock, T., Chambolle, A.: Diagonal preconditioning for first order primal-dual algorithms in convex optimization. In: ICCV, pp. 1762鈥?769 (2011)
    20. Pock, T., Chambolle, A., Bischof, H., Cremers, D.: A convex relaxation approach for computing minimal partitions. In: CVPR, pp. 810鈥?17 (2009)
    21. Pock, T., Cremers, D., Bischof, H., Chambolle, A.: An algorithm for minimizing the piecewise smooth Mumford-Shah functional. In: ICCV (2009)
    22. Pock, T., Cremers, D., Bischof, H., Chambolle, A.: Global solutions of variational models with convex regularization. SIAM J. Imaging Sci. 3(4), 1122鈥?145 (2010) CrossRef
    23. Pock, T., Schoenemann, T., Graber, G., Bischof, H., Cremers, D.: A convex formulation of continuous multi-label problems. In: ECCV, pp. 792鈥?05 (2008)
    24. Rockafellar, R.T.: Convex Analysis. Princeton University Press, Princeton (1996)
    25. Rudin, L.I., Osher, S.J., Fatemi, E.: Nonlinear total variation based noise removal algorithms. Physica D 60(1鈥?), 259鈥?68 (1992) CrossRef
    26. Shulman, D., Herve, J.: Regularization of discontinuous flow fields. In: Visual Motion, pp. 81鈥?6 (1989)
    27. Stefanovic, P., Haataja, M., Provatas, N.: Phase field crystal study of deformation and plasticity in nanocrystalline materials. Phys. Rev. E 80(4), 046,107 (2009) CrossRef
    28. Strekalovskiy, E., Cremers, D.: Total variation for cyclic structures: convex relaxation and efficient minimization. In: CVPR, pp.聽1905鈥?911 (2011) CrossRef
  • 作者单位:Daniel Cremers (1)
    Evgeny Strekalovskiy (1)

    1. Technical University Munich, Boltzmannstrasse 3, 85748, Garching, Germany
文摘
We introduce a general framework for regularization of signals with values in a cyclic structure, such as angles, phases or hue values. These include the total cyclic variation ${TV_{{S}^{1}}}$ , as well as cyclic versions of quadratic regularization, Huber-TV and Mumford-Shah regularity. The key idea is to introduce a convex relaxation of the original non-convex optimization problem. The method handles the periodicity of values in a simple way, is invariant to cyclical shifts and has a number of other useful properties such as lower-semicontinuity. The framework allows general, possibly non-convex data terms. Experimental results are superior to those obtained without special care about wrapping interval end points. Moreover, we propose an equivalent formulation of the total cyclic variation which can be minimized with the same time and memory efficiency as the standard total variation. We show that discretized versions of these regularizers amount to NP-hard optimization problems. Nevertheless, the proposed framework provides optimal or near-optimal solutions in most practical applications.

© 2004-2018 中国地质图书馆版权所有 京ICP备05064691号 京公网安备11010802017129号

地址:北京市海淀区学院路29号 邮编:100083

电话:办公室:(+86 10)66554848;文献借阅、咨询服务、科技查新:66554700