Coupling image restoration and segmentation: A generalized linear model/bregman perspective

International Journal of Computer Vision

Volumn 104, Issue 1, 2013, Pages 69-93

  Paul, Grégory ^a   Cardinale, Janick ^a   Sbalzarini, Ivo F ^a,b  

^a ETH ZURICH   (Switzerland)

^b CENTER FOR SYSTEMS BIOLOGY DRESDEN   (Germany)

Author keywords

Alternating split Bregman; Convex relaxation; Generalized linear model; Restoration; Segmentation; Shape gradient

Indexed keywords

ALTERNATING MINIMIZATION ALGORITHMS; BREGMAN; BREGMAN DIVERGENCES; CONVEX RELAXATION; GENERALIZED LINEAR MODEL; SHAPE GRADIENT; STATISTICAL FRAMEWORK; UNCERTAINTY ESTIMATES;

IMAGE RECONSTRUCTION; IMAGE SEGMENTATION; INVERSE PROBLEMS; MAXIMUM LIKELIHOOD; RELAXATION PROCESSES;

PROBLEM SOLVING;

EID: 84879907259     PISSN: 09205691     EISSN: 15731405     Source Type: Journal    
DOI: 10.1007/s11263-013-0615-2     Document Type: Article

References (81)

1. Alliney, S. (1997). A property of the minimum vectors of a regularizing functional defined by means of the absolute norm. Signal Processing IEEE Transactions on, 45(4), 913-917.
2. Art, J. (2006). Photon detectors for confocal microscopy. In J. B. Pawley (Ed.), Handbook of biological confocal microscopy (pp. 251-264). Berlin: Springer.
3. Aubert, G.; Aujol, J. F. (2008). A variational approach to removing multiplicative noise. SIAM Journal on Applied Mathematics, 68(4), 925-946.
4. Aubert, G.; Kornprobst, P. (2006). Mathematical problems in image processing: Partial differential equations and the calculus of variations, applied mathematical sciences, vol 147, 2nd edn. Berlin: Springer.
5. Aubert, G.; Barlaud, M.; Faugeras, O.; Jehan-Besson, S. (2003). Image segmentation using active contours: Calculus of variations or shape gradients? SIAM Journal of Applied Mathematics, 63(6), 2128-2154.
6. Aujol, J. F.; Gilboa, G.; Chan, T.; Osher, S. (2006). Structure-texture image decomposition modeling, algorithms, and parameter selection. International Journal of Computer Vision, 67, 111-136.
7. Baldi, P.; Brunak, S.; Chauvin, Y.; Andersen, C. A. F.; Nielsen, H. (2000). Assessing the accuracy of prediction algorithms for classification: An overview. Bioinformatics, 16(5), 412-424.
8. Banerjee, A.; Merugu, S.; Dhillon, I.; Ghosh, J. (2005). Clustering with Bregman divergences. The Journal of Machine Learning Research, 6, 1705-1749.
9. Barndorff-Nielsen, O. E. (1978). Information and exponential families in statistical theory (Wiley series in probability and mathematical statistics). Chichester: Wiley.
10. Bertero, M.; Boccacci, P. (1998). Introduction to inverse problems in imaging. London: Taylor and Francis.
11. Bertero, M.; Poggio, T.; Torre, V. (1988). Ill-posed problems in early vision. Proceedings of the IEEE, 76(8), 869-889.
12. Bovik, A. C. (2005). Handbook of image and video processing (communications, networking and multimedia) (2nd ed.). Orlando: Academic Press, Inc.
13. Boykov, Y.; Veksler, O.; Zabih, R. (2001). Fast approximate energy minimization via graph cuts. Pattern Analysis and Machine Intelligence, IEEE Transactions, 23(11), 1222-1239.
14. Bresson, X.; Esedolu, S.; Vandergheynst, P.; Thiran, J. P.; Osher, S. (2007). Fast global minimization of the active contour/snake model. Journal of Mathematical Imaging and Vision, 28, 151-167.
15. Brown, E.; Chan, T.; Bresson, X. (2012). Completely convex formulation of the Chan-Vese image segmentation model. International Journal of Computer Vision, 98(1), 103-121.
16. Brox, T.; Rousson, M.; Deriche, R.; Weickert, J. (2010). Colour, texture, and motion in level-set based segmentation and tracking. Image and Vision Computing, 28(3), 376-390.
17. Burger, M.; Hintermüller, M. (2005). Projected gradient flows for BV/level-set relaxation. PAMM, 5(1), 11-14.
18. Burger, M.; Osher, S. (2005). A survey on level set methods for inverse problems and optimal design. European Journal of Applied Mathematics, 16(02), 263-301.
19. Cardinale, J.; Paul, G.; Sbalzarini, I. (2012). Discrete region competition for unknown numbers of connected regions. Image Processing IEEE Transactions, 21(8), 3531-3545.
20. Caselles, V.; Catté, F.; Coll, T.; Dibos, F. (1993). A geometric model for active contours in image processing. Numerische Mathematik, 66, 1-31.
21. Caselles, V.; Kimmel, R.; Sapiro, G. (1997). Geodesic active contours. International Journal of Computer Vision, 22, 61-79.
22. Chambolle, A. (2004). An algorithm for total variation minimization and applications. Journal of Mathematical Imaging and Vision, 20, 89-97.
23. Chambolle, A.; Pock, T. (2011). A first-order primal-dual algorithm for convex problems with applications to imaging. Journal of Mathematical Imaging and Vision, 40, 120-145.
24. Chambolle, A.; Cremers, D.; Pock, T. (2012). A convex approach to minimal partitions. SIAM Journal on Imaging Sciences, 5(4), 1113-1158.
25. Chan, T. F.; Esedolu, S. (2005). Aspects of total variation regularized L1 function approximation. SIAM Journal on Applied Mathematics, 65(5), 1817-1837.
26. Chan, T. F.; Shen, J. J. (2005). Image processing and analysis: Variational, PDE, wavelet, and stochastic methods. Philadephia: Society for Industrial and Applied Mathematics.
27. Chan, T. F.; Vese, L. (2001). Active contours without edges. Image Processing IEEE Transactions, 10(2), 266-277.
28. Chan, T. F.; Esedolu, S.; Nikolova, M. (2006). Algorithms for finding global minimizers of image segmentation and denoising models. SIAM Journal on Applied Mathematics, 66(5), 1632-1648.
29. Chesnaud, C.; Réfrégier, P.; Boulet, V. (1999). Statistical region snake-based segmentation adapted to different physical noise models. Pattern Analysis and Machine Intelligence IEEE Transactions, 21(11), 1145-1157.
30. Choksi, R.; van Gennip, Y.; Oberman, A. (2011). Anisotropic total variation regularized L1 approximation and denoising/deblurring of 2D bar codes. Inverse Problems and Imaging, 5(3), 591-617.
31. Cremers, D.; Rousson, M.; Deriche, R. (2007). A review of statistical approaches to level set segmentation: Integrating color, texture, motion and shape. International Journal of Computer Vision, 72, 195-215.
32. Delfour, M.; Zolésio, J. (2011). Shapes and geometries: Metrics, analysis, differential calculus, and optimization, (Vol. 22). Philadelphia: Society for Industrial Mathematics.
33. Dey, N.; Blanc-Féraud, L.; Zimmer, C.; Kam, Z.; Olivo-Marin, J.C.; Zerubia, J. (2004). A deconvolution method for confocal microscopy with total variation regularization. In Biomedical imaging: Nano to macro, 2004. IEEE International Symposium on, (Vol. 2) (pp 1223-1226). Arlington.
34. Esser, E. (2009). Applications of Lagrangian-based alternating direction methods and connections to split Bregman. Technical report UCLA Computational and Applied Mathematics.
35. Geiger, D.; Yuille, A. (1991). A common framework for image segmentation. International Journal of Computational Vision, 6, 227-243.
36. Geman, S.; Geman, D. (1984). Stochastic relaxation, Gibbs distributions, and the Bayesian restoration of images. Pattern Analysis and Machine Intelligence IEEE Transactions, 6(6), 721-741.
37. Goldstein, T.; Osher, S. (2009). The split Bregman method for l1 -regularized problems. SIAM Journal on Imaging Sciences, 2(2), 323-343.
38. Goldstein, T.; Bresson, X.; Osher, S. (2010). Geometric applications of the split Bregman method: Segmentation and surface reconstruction. Journal of Scientific Computing, 45, 272-293.
39. Goudail, F.; Réfrégier, P.; Ruch, O. (2003). Definition of a signal- to-noise ratio for object segmentation using polygonal MDL-based statistical snakes. In Energy minimization methods in computer vision and pattern recognition, Vol. 2683 (pp. 373-388). Berlin: Springer.
40. Goudail, F.; Réfrégier, P.; Delyon, G. (2004). Bhattacharyya distance as a contrast parameter for statistical processing of noisy optical images. Journal of the Optical Society of America A, 21(7), 1231-1240.
41. Greig, D. M.; Porteous, B. T.; Seheult, A. H. (1989). Exact maximum a posteriori estimation for binary images. Journal of the Royal Statistical Society Series B (Methodological), 51(2), 271-279.
42. Hansen, P. C.; Nagy, J. G.; O'Leary, D. P. (2006). Deblurring images: Matrices, spectra, and filtering (fundamentals of algorithms 3) (fundamentals of algorithms). Philadelphia: Society for Industrial and Applied Mathematics.
43. Hebert, T.; Leahy, R. (1989). A generalized EM algorithm for 3D Bayesian reconstruction from Poisson data using Gibbs priors. Medical Imaging IEEE Transactions, 8(2), 194-202.
44. Helmuth, J.; Sbalzarini, I. (2009). Deconvolving active contours for fluorescence microscopy images. In Advances in visual xomputing, lecture notes in computer science (Vol. 5875, pp. 544-553). Berlin: Springer.
45. Helmuth, J.; Burckhardt, C.; Greber, U.; Sbalzarini, I. (2009). Shape reconstruction of subcellular structures from live cell fluorescence microscopy images. Journal of Structural Biology, 167(1), 1-10.
46. Jung, M.; Chung, G.; Sundaramoorthi, G.; Vese, L.; Yuille, A. (2009). Sobolev gradients and joint variational image segmentation, denoising and deblurring. In SPIE Electronic Imaging Conference Proceedings, Computational Imaging VII, SPIE (Vol. 7246).
47. Kass, M.; Witkin, A.; Terzopoulos, D. (1988). Snakes: Active contour models. International Journal of Computer Vision, 1, 321-331.
48. Kersten, D.; Mamassian, P.; Yuille, A. (2004). Object perception as bayesian inference. Annual Review of Psychology, 55, 271-304.
49. Lecellier, F.; Jehan-Besson, S.; Fadili, J.; Aubert, G.; Revenu, M. (2006). Statistical region-based active contours with exponential family observations. In Proceedings of IEEE International Acoustics, Speech and Signal Processing Conference ICASSP 2006 (Vol. 2).
50. Lecellier, F.; Fadili, J.; Jehan-Besson, S.; Aubert, G.; Revenu, M.; Saloux, E. (2010). Region-based active contours with exponential family observations. Journal of Mathematical Imaging and Vision, 36, 28-45.
51. Lellmann, J.; Schnörr, C. (2011). Continuous multiclass labeling approaches and algorithms. SIAM Journal on Imaging Sciences, 4(4), 1049-1096.
52. Leung, S.; Osher, S. (2005). Global minimization of the active contour model with TV-inpainting and two-phase denoising. In Variational, geometric, and level set methods in computer vision (Vol. 3752, pp. 149-160). Springer: Berlin.
53. Malladi, R.; Sethian, J.; Vemuri, B. (1995). Shape modeling with front propagation: A level-set approach. Pattern Analysis and Machine Intelligence IEEE Transactions, 17(2), 158-175.
54. Marquina, A.; Osher, S. (2008). Image super-resolution by TV-regularization and Bregman iteration. Journal of Scientific Computing, 37, 367-382.
55. Martin, P.; Réfrégier, P.; Goudail, F.; Guérault, F. (2004). Influence of the noise model on level-set active contour segmentation. Pattern Analysis and Machine Intelligence IEEE Transactions, 26(6), 799-803.
56. Matthews, B. (1975). Comparison of the predicted and observed secondary structure of t4 phage lysozyme. Biochimica et Biophysica Acta (BBA) - Protein Structure, 405(2), 442-451.
57. McCullagh, P.; Nelder, J. (1989). Generalized linear models, 2nd edn. London: Chapman and Hall/CRC.
58. Mumford, D. (1994). The Bayesian rationale for energy functionals. In Geometry-driven diffusion in computer vision (pp. 141-153). Dordrecht: Kluwer Academic Publishers.
59. Mumford, D.; Shah, J. (1989). Optimal approximations by piecewise smooth functions and associated variational problems. Communications on Pure and Applied Mathematics, 42(5), 577-685.
60. Nelder, J.; Wedderburn, R. (1972). Generalized linear models. Journal of the Royal Statistical Society Series A (General), 135(3), 370-384.
61. Nikolova, M. (2004). A variational approach to remove outliers and impulse noise. Journal of Mathematical Imaging and Vision, 20, 99-120.
62. Osher, S.; Fedkiw, R. (2003). Level set methods and dynamic implicit surfaces, applied mathematical sciences (Vol. 153). New York: Springer.
63. Osher, S.; Paragios, N. (2003). Geometric level set methods in imaging, vision, and graphics. New York: Springer.
64. Paragios, N.; Deriche, R. (2002). Geodesic active regions: A new framework to deal with frame partition problems in computer vision. Journal of Visual Communication and Image Representation, 13(1-2), 249-268.
65. Paul, G.; Cardinale, J.; Sbalzarini, I. (2011). An alternating split Bregman algorithm for multi-region segmentation. In Signals, systems and computers (ASILOMAR), 2011 Conference Record of the Forty Fifth Asilomar Conference on, (pp. 426-430).
66. Pock, T.; Schoenemann, T.; Graber, G.; Bischof, H.; Cremers, D. (2008). A convex formulation of continuous multi-label problems. In Computer vision-ECCV 2008 (Vol. 5304, pp 792-805). Berlin: Springer.
67. Pock, T.; Chambolle, A.; Cremers, D.; Bischof, H. (2009). A convex relaxation approach for computing minimal partitions. In IEEE Conference on Computer vision and pattern recognition, 2009. CVPR 2009 (pp. 810-817).
68. Rudin, L. I.; Osher, S.; Fatemi, E. (1992). Nonlinear total variation based noise removal algorithms. Physica D: Nonlinear Phenomena, 60(1-4), 259-268.
69. Sbalzarini, I. F.; Mezzacasa, A.; Helenius, A.; Koumoutsakos, P. (2005). Effects of organelle shape on fluorescence recovery after photobleaching. Biophysical Journal, 89(3), 1482-1492.
70. Sbalzarini, I. F.; Hayer, A.; Helenius, A.; Koumoutsakos, P. (2006). Simulations of (an)isotropic diffusion on curved biological surfaces. Biophysical Journal, 90(3), 878-885.
71. Sethian, J. (1999). Level set methods and fast marching methods: Evolving interfaces in computational geometry, fluid mechanics, computer vision, and material science. Cambridge: Cambridge University Press.
72. Setzer, S. (2011). Operator splittings, Bregman methods and frame shrinkage in image processing. International Journal of Computer Vision, 92, 265-280.
73. Setzer, S.; Steidl, G.; Teuber, T. (2010). Deblurring Poissonian images by split Bregman techniques. Journal of Visual Communication and Image Representation, 21(3), 193-199.
74. Shepp, L. A.; Vardi, Y. (1982). Maximum likelihood reconstruction for emission tomography. Medical Imaging IEEE Transactions, 1(2), 113-122.
75. Song, P.X.K. (2007). Vector generalized linear models. In Correlated data analysis: Modeling, analytics, and applications, Springer series in statistics (pp. 121-155). New York: Springer.
76. Strang, G. (1999). The discrete cosine transform. SIAM Review, 41(1), 135-147.
77. Tai, X.C.; Wu, C. (2009). Augmented lagrangian method, dual methods and split bregman iteration for rof model. In Scale space and variational methods in computer vision (Vol. 5567, pp. 502-513). Berlin: Springer.
78. Vogel, C. R. (2002). Computational methods for inverse problems. Philadelphia: Society for Industrial and Applied Mathematics.
79. Vonesch, C.; Unser, M. (2008). A fast thresholded Landweber algorithm for wavelet-regularized multidimensional deconvolution. IEEE Transactions on Image Processing, 17(4), 539-549.
80. Zartman, J.; Restrepo, S.; Basler, K. (2013). A high-throughput template for optimizing Drosophila organ culture with response-surface methods. Development, 143(3), 667-674.
81. Zhu, S.; Yuille, A. (1996). Region competition: Unifying snakes, region growing, and Bayes/MDL for multiband image segmentation. IEEE Transactions on Pattern Analysis and Machine Intelligence, 18(9), 884-900.