Finite-dimensional approximation of convex regularization via hexagonal pixel grids

References

• Pöschl C, Resmerita E, Scherzer O. Discretization of variational regularization in Banach spaces. Inverse Probl. 2010;26:105017 (18 p).
   Web of Science ®Google Scholar
• Neubauer A, Scherzer O. Finite-dimensional approximation of Tikhonov regularized solutions of nonlinear ill-posed problems. Numer. Funct. Anal. Optim. 1990;11:85–99.
   Web of Science ®Google Scholar
• Schuster T, Kaltenbacher B, Hofmann B, Kazimierski KS. Regularization methods in Banach spaces. Radon series on computational and applied mathematics edition. Berlin: Walter de Gruyter GmbH & Co. KG; 2012.
   Google Scholar
• Rudin LI, Osher S, Fatemi E. Nonlinear total variation based noise removal algorithms. Phys. D: Nonlinear Phenom. 1992;60:259–268.
   Web of Science ®Google Scholar
• Casas E, Kunisch K, Pola C. Regularization by functions of bounded variation and applications to image enhancement. Appl. Math. Optim. 1999;40:229–257.
   Web of Science ®Google Scholar
• Bělík P, Luskin M. Approximation by piecewise constant functions in a BV metric. Math. Models Meth. Appl. Sci. 2003;13:373–393. Dedicated to Douglas J Jr on the occasion of his 75th birthday.
   Web of Science ®Google Scholar
• Heikenfeld J, Zhou K, Kreit E, Raj B, Yang S, Sun B, Milarcik A, Clapp L, Schwartz R. Electrofluidic displays using Young-Laplace transposition of brilliant pigment dispersions. Nat. Photonics. 2009;3:292–296.
   Web of Science ®Google Scholar
• He X, Jia W. 2005. Hexagonal structure for intelligent vision.. In: First International Conference on Information and Communication Technologies, ICICT 2005; Pakistan: IEEE; p. 52–64.
   Google Scholar
• Faille F, Petrou M. 2008. Bio-inspired, invariant image reconstruction from irregularly placed samples. In: BMVC’08. p. 112.1–112.10.
   Google Scholar
• Middleton L, Sivaswamy J. Edge detection in a hexagonal-image processing framework. Image Vision Comput. 2001;19:1071–1081.
   Web of Science ®Google Scholar
• Bonans JF, Shapiro A. Perturbation analysis of optimization problems. Springer series in operations research and financial engineering edition. Heidelberg: Springer; 2000.
   Google Scholar
• Resmerita E, Scherzer O. Error estimates for non-quadratic regularization and the relation to enhancement. Inverse Probl. 2006;22:801–814.
   Web of Science ®Google Scholar
• Hofmann B, Kaltenbacher B, Pöschl C, Scherzer O. A convergence rates result in Banach spaces with non-smooth operators. Inverse Probl. 2007;23:987–1010.
   Web of Science ®Google Scholar
• Scherzer O, Grasmair M, Grossauer H, Haltmeier M, Lenzen F. Variational methods in imaging. Vol. 167, Applied mathematical sciences. New York (NY): Springer Verlag; 2009.
   Google Scholar
• Pöschl C. 2008. Tikhonov regularization with general residual term [PhD thesis]. Innsbruck: Leopold Franzens Universität Innsbruck.
   Google Scholar
• Chambolle A, Levine S, Lucier BJ. An upwind finite-difference method for total variation-based image smoothing. SIAM J. Imag. Sci. 2011;4:277–299.
   Web of Science ®Google Scholar
• Wang J, Lucier BJ. Error bounds for finite-difference methods for Rudin–Osher–Fatemi image smoothing. SIAM J. Numer. Anal. 2011;49:845–868.
   Web of Science ®Google Scholar
• Bartels S. Total variation minimization with finite elements: convergence and iterative solution. SIAM J. Numer. Anal. 2012;50:1162–1180.
   Web of Science ®Google Scholar
• Fitzpatrick BG, Keeling SL. On approximation in total variation penalization for image reconstruction and inverse problems. Numer. Funct. Anal. Optim. 1997;18:941–958.
   Web of Science ®Google Scholar
• Ambrosio L, Fusco N, Pallara D. Functions of bounded variation and free discontinuity problems. Oxford mathematical monographs. New York (NY): The Clarendon Press Oxford University Press; 2000.
   Google Scholar
• Giusti E. Minimal surfaces and functions of bounded variation. Boston: Birkhäuser; 1984.
   Google Scholar
• Boykov Y, Kolmogorov V. Basic graph cut algorithms, Chapter 2. In: Blake A, Kohli P, Rother C, editors. Markov random fields for vision and image processing. Cambridge (MA): MIT Press; 2011. p. 31–49.
   Google Scholar
• Boykov Y, Veksler O. Graph cuts in vision and graphics: theories and applications, Chapter 5. In: Paragios N, Chen Y, Faugeras O, editors. Handbook of mathematical models in computer vision. New York (NY): Springer; 2006. p. 79–96.
   Google Scholar
• Hochbaum DS. An efficient algorithm for image segmentation, Markov random fields and related problems. J. ACM. 2001;48:686–701. ( electronic).
   Web of Science ®Google Scholar
• Chambolle A. Total variation minimization and a class of binary MRF models. In: Rangarajan A, Vemuri B, Yuille AL, editors. Energy minimization methods in computer vision and pattern recognition. Vol. 3757, Lecture notes in computer vision. Berlin, Heidelberg: Springer; 2005. p. 136–152.
   Google Scholar
• Darbon J, Sigelle M. Image restoration with discrete constrained total variation. Part I: fast and exact optimization. J. Math. Imag. Vision. 2006;26:261–276.
   Web of Science ®Google Scholar
• Chambolle A, Darbon J. On total variation minimization and surface evolution using parametric maximum flows. Int. J. Comput. Vision. 2009;84:288–307.
   Web of Science ®Google Scholar
• Goldfarb D, Yin W. Parametric maximum flow algorithms for fast total variation minimization. SIAM J. Sci. Comput. 2009;31:3712–3743.
   Web of Science ®Google Scholar
• Chambolle A, Darbon J. A parametric maximum flow approach for discrete total variation regularization, Chapter 4. In: Lukac R, editor. Image processing and analysis with graphs: theory and practice, digital imaging and computer vision. London: CRC Press/Taylor and Francis; 2012. p. 93–110.
   Google Scholar
• Boykov Y, Kolmogorov V. An experimental comparison of min-cut/max-flow algorithms for energy minimization in vision. IEEE Trans. Pattern Anal. Mach. Intell. 2004;26:1124–1137.
   PubMed Web of Science ®Google Scholar
• Chan TF, Esedoḡlu S. Aspects of total variation regularized L1 function approximation. SIAM J. Appl. Math. 2005;65:1817–1837.
   Web of Science ®Google Scholar
• Condat L, Van De Ville D, Forster-Heinlein B. Reversible, fast, and high-quality grid conversions. IEEE Trans. Image Process. 2008;17:679–693.
   PubMed Web of Science ®Google Scholar