Summary
Wherever anisotropic behavior in physical measurements or models is encountered matrices provide adequate means to describe this anisotropy. Prominent examples are the diffusion tensor magnetic resonance imaging in medical imaging or the stress tensor in civil engineering. As most measured data these matrix-valued data are also polluted by noise and require restoration. The restoration of scalar images corrupted by noise via minimization of an energy functional is a well-established technique that offers many advantages. A convenient way to achieve this minimization is second-order cone programming (SOCP). The goal of this article is to transfer this method to the matrix-valued setting. It is shown how SOCP can be applied to minimize various energy functionals defined for matrix fields. These functionals couple the different matrix channels taking into account the relations between them. Furthermore, new functionals for the regularization of matrix data are proposed and the corresponding Euler–Lagrange equations are derived by means of matrix differential calculus. Numerical experiments substantiate the usefulness of the proposed methods for the restoration of matrix fields.
Similar content being viewed by others
Explore related subjects
Discover the latest articles, news and stories from top researchers in related subjects.References
Barvinok, A.: A course in convexity, graduate studies in mathematics. AMS, Providence (2002)
Basser P.J. (1995). Inferring microstructural features and the physical state of tissues from diffusion-weighted images. Nuclear Magn Reson Biomed 8: 333–334
Basser P.J., Mattiello J. and LeBihan D. (1994). MR diffusion tensor spectroscopy and imaging. Biophys J 66: 259–267
Berkels, B., Burger, M., Droske, Nemitz, M. O., Rumpf, M.: Cartoon extraction based on anisotropic image classification. In: Vision, modeling and visualization. Springer, Heidelberg (accepted)
Bigün J., Granlund G.H. and Wiklund J. (1991). Multi-dimensional orientation estimation with applications to texture analysis and optical flow. IEEE Trans Pattern Anal Mach Intell 13(8): 775–790
Borwein J.M. and Lewis A.S. (2000). Convex analysis and nonlinear optimization. Springer, New York
Brox T., Weickert J., Burgeth B. and Mrázek P. (2006). Nonlinear structure tensors. Image Vis Comput 24(1): 41–55
Burgeth, B., Bruhn, A., Didas, S., Weickert, J., Welk, M.: Morphology for matrix-data: ordering versus PDE-based approach. Image Vis Comput (2007, in print)
Burgeth B., Bruhn A., Papenberg N., Welk M. and Weickert J. (2007). Mathematical morphology for matrix fields induced by the Loewner ordering in higher dimensions. Signal Process 87(2): 277–290
Chambolle A. (2004). An algorithm for total variation minimization and applications. J Math Imag Vis 20: 89–97
Chambolle A. and Lions P.-L. (1997). Image recovery via total variation minimization and related problems. Numer Math 76: 167–188
Ciarlet P.G. (1989). Introduction to numerical linear algebra and optimisation. Cambridge University Press, Cambridge
Förstner, W., Gülch, E.: A fast operator for detection and precise location of distinct points, corners and centres of circular features. In: Proc. ISPRS Intercommission Conf. on Fast Processing of Photogrammetric Data, pp. 281–305. Interlaken, Switzerland, June (1987)
Goldfarb D. and Yin W. (2005). Second-order cone programming methods for total variation-based image restoration. SIAM J Sci Comput 2(27): 622–645
Granlund G.H. and Knutsson H. (1995). Signal processing for computer vision. Kluwer, Dordrecht
Harris, C. G., Stephens, M.: A combined corner and edge detector. In: Proc. 4th Alvey Vision Conf., pp. 147–152. Manchester, UK, August 1988
Hintermüller W. and Kunisch W. (2004). Total bounded variation regularization as a bilaterally constrained optimization problem. SIAM J Appl Math 4(64): 1311–1333
Horn R.A. and Johnson C.R. (1990). Matrix analysis. Cambridge University Press, Cambridge
Lysaker, M., Lundervold, A., Tai, X.: Noise removal using fourth-order partial differential equations with applications to medical magnetic resonance images in space and time. Technical Report CAM-02-44, Department of Mathematics, University of California at Los Angeles (2002)
Lobo M.S., Vandenberghe, Boyd S. and Lebret H. (1998). Applications of second-order cone programming. Linear Algebra Appl 284: 193–228
Magnus J.R. and Neudecker H. (1988). Matrix differential calculus with applications in statistics and econometrics. Wiley, Chichester
Mittelmann H. (2003). An independent bechmarking of SDP and SOCP solvers. Math Program Series B 95(2): 407–430
Rao A.R. and Schunck B.G. (1991). Computing oriented texture fields. CVGIP Graph Models Image Process 53: 157–185
Rudin L.I., Osher S. and Fatemi E. (1992). Nonlinear total variation based noise removal algorithms. Physica A 60: 259–268
Scherzer O. and Weickert J. (2000). Relations between regularization and diffusion filtering. J Math Imag Vis 12(1): 43–63
Setzer, S., Steidl, G., Popilka, B., Burgeth. B.: Variational methods for denoising matrix fields. Preprint Univ. Mannheim, 2007
Steidl, G., Welk, M., Weickert, J.: Locally analytic schemes: a link between diffusion filtering and wavelet shrinkage. Appl Comput Harmon Anal (2007, to appear)
Tschumperlé, D., Deriche, R.: Diffusion tensor regularization with contraints preservation. In: Proc. 2001 IEEE Computer Society Conf. on Computer Vision and Pattern Recognition, vol. 1, pp. 948–953. IEEE Computer Science Press, Kauai (2001)
Vogel C.R. (2002). Computational methods for inverse problems. SIAM, Philadelphia
Weickert J. (1998). Anisotropic diffusion in image processing. Teubner, Stuttgart
Weickert, J., Brox, T.: Diffusion and regularization of vector- and matrix-valued images. In: (Nashed, M. Z., Scherzer, O., eds.) Inverse problems, image analysis, and medical imaging, Contemporary Mathematics, vol. 313, pp. 251–268. AMS, Providence (2002)
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Steidl, G., Setzer, S., Popilka, B. et al. Restoration of matrix fields by second-order cone programming. Computing 81, 161–178 (2007). https://doi.org/10.1007/s00607-007-0247-x
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00607-007-0247-x