Inpainting and zooming using sparse representations

Computer Journal

Volumn 52, Issue 1, 2009, Pages 64-79

  Fadili, M J ^a   Starck, J L ^b   Murtagh, Fionn ^c  

^a ENSICAEN   (France)

^b UNIVERSITÉ PARIS DIDEROT   (France)

^c UNIVERSITY OF LONDON   (United Kingdom)

Author keywords

EM algorithm; Inpainting; Interpolation; Penalized likelihood; Sparse representations

Indexed keywords

BAYESIAN NETWORKS; COMPETITION; FOURIER SERIES; HARMONIC ANALYSIS; IMAGE PROCESSING; INTERPOLATION;

BAYESIAN FRAMEWORKS; BAYESIAN STATISTICS; CONVERGENCE PROPERTIES; DEGREE OF FLEXIBILITIES; EM ALGORITHM; ESTIMATION PROBLEMS; EXPECTATION-MAXIMIZATION ALGORITHMS; IMAGE INPAINTING; INPAINTING; ITERATIVE ALGORITHMS; MISSING DATUM; PENALIZED LIKELIHOOD; PIECEWISE SMOOTHES; REGULARIZATION PARAMETERS; SPARSE REPRESENTATIONS; STRUCTURAL COMPONENTS;

ALGORITHMS;

EID: 60649102899     PISSN: 00104620     EISSN: 14602067     Source Type: Journal    
DOI: 10.1093/comjnl/bxm055     Document Type: Article

References (73)

1. Masnou, S. and Morel, J. (1998) Level Lines-Based Disocclusion. IEEE Int. Conf. Image Processing, Chicago, vol. 3, pp. 259-263.
2. Masnou, S. and Morel, J. (2002) Disocclusion: A variational approach using level lines. IEEE Trans. Image Process, 11, 68-76.
3. Bertalmío, M., Sapiro, G., Caselles, V. and Ballester, C. (2000) Image inpainting. SIGGRAPH 2000, New Orleans, USA, pp. 417-424.
4. Bertalmío, M., Bertozzi, A. and Sapiro, G. (2001) Navier-Stokes, fluid-dynamics and image and video inpainting. CVPR'01, Kauai, HI, vol. 1, pp. 355-362.
5. Tschumperlé, D. and Deriche, R. (2005) Vector-valued image regularization with PDEs : A common framework for different applications. IEEE Trans. Pattern Anal. Mach. Intell., 27, 506-517.
6. Bornemann, F. and März, T. (2006) Fast image inpainting based on coherence transport. Technical report. Technische Universität München.
7. Caselles, V., Morel, J. and Sbert, C. (1998) An axiomatic approch to image interpolation. IEEE Trans. Image Process, 7, 376-386.
8. Ballester, C., Caselles, V., Verdera, J., Sapiro, G. and Bertalmío, M. (2001) A Variational Model for Filling-in Gray Level and Color Images. IEEE Int. Conf. Computer Vision, Vancouver, Canada, pp. 10-16.
9. Ballester, C., Bertalmío, M., Caselles, V., Sapiro, G. and Verdera, J. (2001) Filling-in by joint interpolation of vector fields and gray levels. IEEE Trans. Image Process, 10, 1200-1211.
10. Ballester, C., Caselles, V. and Verdera, J. (2003) Disocclusion by joint interpolation of vector fields and gray levels. Multiscale Modeling and Simul., 2, 80-123.
11. Chan, T. and Shen, J. (2001) Non-texture inpainting by curvature-driven diffusions (cdd). J. Vis. Commun. Image Represent., 12, 436-449.
12. Chan, T. and Shen, J. (2001) Mathematical models for local non-texture inpainting. SIAM J. Appl. Math., 62, 1019-1043.
13. Chan, T., Kang, S.H. and Shen, J. (2002) Euler's elastica and curvature based inpainting. SIAM J. Appl. Math., 63, 564-592.
14. Esedoglu, S. and Shen, J. (2002) Digital image inpainting by the Mumford-Shah-Euler image model. Eur. J. Appl. Math., 13, 353-370.
15. Chan, T.F., Yip, A.M. and Park, F.E. (2004) Simultaneous total variation image inpainting and blind deconvolution. Int. J. Imaging Syst. Technol., 15, 92-102.
16. Chan, T.F., Ng, M.K., Yau, A.C. and Yip, A.M. (2006) Superresolution image reconstruction using fast inpainting algorithms. Technical report. UCLA CAM.
17. Song, B. (2003) Topics in Variational PDE Image Segmentation, Inpainting and Denoising. PhD Thesis, University of California, LA.
18. Bertozzi, A., Esedoglu, S. and Gillette, A. (2007) Inpainting by the Cahn-Hilliard equation. IEEE Trans. Image Process, 16, 285-291.
19. Chan, T.F. and Shen, J.J. (2005) Image Processing and Analysis-Variational, PDE, Wavelet, and Stochastic Methods. SIAM, Philadelphia.
20. Bertalmío, M., Caselles, V., Haro, G. and Sapiro, G. (2005) The State of the Art of Image and Surface Inpainting. In Paragios, N., Faugeras, O. and Chen, Y. (eds.), Mathematical Models in Computer Vision: The Handbook, pp. 309-322. Springer-Verlag, Berlin.
21. Efros, A.A. and Leung, T.K. (1999) Texture Synthesis by Non-Parametric Sampling. IEEE Int. Conf. Computer Vision, Kerkyra, Greece, pp. 1033-1038.
22. Bertalmiío, M., Vese, L., Sapiro, G. and Osher, S. (2003) Simultaneous structure and texture image inpainting. IEEE Trans. Image Process, 12, 882-889.
23. Demanet, L., Song, B. and Chan, T. (2003) Image Inpainting by Correspondence Maps: A Deterministic Approach. VLSM, Nice, France.
24. Rane, S., Bertalmio, M. and Sapiro, G. (2002) Structure and texture filling-in of missing image blocks for wireless transmission and compression applications. IEEE Trans. Image Process, 12, 296-303.
25. Jia, J. and Tang, C.-K. (2003) Image Repairing: Robust Image Synthesis By Adaptive Nd Tensor Voting. IEEE CVPR, vol. 1, pp., 643-650.
26. Acton, S.T., Mukherjee, D.P., Havlicek, J.P. and Bovik, A.C. (2001) Oriented texture completion by AM-FM reaction-diffusion. IEEE Trans. Image Process, 10, 885-896.
27. Criminisi, A., Pérez, P. and Toyama, K. (2004) Region filling and object removal by examplar-based image inpainting. IEEE Trans. Image Process, 13, 1200-1212.
28. Drori, I., Cohen-Or, D. and Yeshurun, H. (2003) Fragment-based image completion. ACM Trans. Graph., 22, 303-312.
29. Elad, M., Starck, J.-L., Querre, P. and Donoho, D. (2005) Simultaneous cartoon and texture image inpainting. Appl. Comput. Harmon. Anal., 19, 340-358.
30. Starck, J.-L., Elad, M. and Donoho, D. (2005) Image decomposition via the combination of sparse representatations and variational approach. IEEE Trans. Image Process, 14, 1570-1582.
31. Starck, J.-L., Elad, M. and Donoho, D. (2004) Redundant multiscale transforms and their application for morphological component analysis. Adv. Imag. Electron Phys., 132, 287-348.
32. Donoho, D.L. (2004) Compressed sensing. Technical report. Stanford University, Department of Statistics.
33. Donoho, D. and Tsaig, Y. (2006) Extensions of compressed sensing. EURASIP J. Appl. Signal Process., 86, 549-571.
34. Candès, E., Romberg, J. and Tao, T. (2004) Robust uncertainty principles: Exact signal reconstruction from highly incomplete frequency information. Technical report. CalTech, Applied and Computational Mathematics.
35. Candès, E. and Tao, T. (2005) Stable signal recovery from noisy and incomplete observations. Technical report. CalTech, Applied and Computational Mathematics.
36. Candès, E. and Tao, T. (2004) Near optimal signal recovery from random projections: Universal encoding strategies? Technical report. CalTech, Applied and Computational Mathematics.
37. Dempster, A., Laird, N. and Rubin, D. (1977) Maximum likelihood from incomplete data via the EM algorithm. J. Roy. Stat. Soc. B, 39 1-38.
38. Little, R. and Rubin, D. (1987) Statistical Analysis with Missing Data. Wiley, New York.
39. Mallat, S.G. (1998) A Wavelet Tour of Signal Processing (2nd edn). Academic Press.
40. Starck, J.-L., Murtagh, F. and Bijaoui, A. (1998) Image Processing and Data Analysis: The Multiscale Approach. Cambridge University Press.
41. Candès, E.J. and Donoho, D.L. (1999) Curvelets-a surprisingly effective nonadaptive representation for objects with edges. In Cohen, A., Rabut, C. and Schumaker, L. (eds.), Curve and Surface Fitting: Saint-Malo 1999, Vanderbilt University Press, Nashville, TN.
42. Candès, E., Demanet, L., Donoho, D. and Ying, L. (2006) Fast discrete curvelet transforms. SIAM Multiscale Modeling Simul., 5, 861-899.
43. Candès, E. and Donoho, D. (1999) Ridgelets: The key to high dimensional intermittency? Philos. Trans. R. Soc. Lond. A, 357 2495-2509.
44. Starck, J.L., Candès, E. and Donoho, D.L. (2002) The curvelet transform for image denoising. IEEE Trans. Image Process, 11 670-684.
45. 1 minimization. Proc. Natl Acad. Sci., 100, 2197-2202.
46. N bases. IEEE Trans. Inf. Theory, 48, 2558-2567.
47. Gribonval, R. and Nielsen, M. (2003) Sparse representations in unions of bases. IEEE Trans. Inf. Theory, 49, 3320-3325.
48. Tropp, T. (2004) Topics in sparse approximation. PhD Thesis, University of Texas, Austin.
49. Bickel, P. andDocksum,K. (2001) Mathematical Statistics: Basic Ideas and Selected Topics (2nd edn). Prentice-Hall, London.
50. Chen, S.S., Donoho, D.L. and Saunders, M.A. (1999) Atomic decomposition by basis pursuit. SIAM J. Sci. Comput., 20, 33-61.
51. Sardy, S., Bruce, A. and Tseng, P. (2000) Block coordinate relaxation methods for nonparametric wavelet denoising. J. Comput. Graph. Stat. 9, 361-379.
52. Antoniadis, A. and Fan, J. (2001) Regularization of wavelets approximations. J. Am. Stat. Assoc., 96, 939-963.
53. Nikolova, M. (2000) Local strong homogeneity of a regularized estimator. SIAM J. Appl. Math., 61, 633-658.
54. Elad, M. (2005) Why simple shrinkage is still relevant for redundant representations? Technical report. Department of Computer Science, Technion.
55. Elad, M., Matalon, B. and Zibulevsky, M. (2006) Coordinate and subspace optimization methods for linear least squares with non-quadratic regularization. Technical report. Department of Computer Science, Technion.
56. Meng, X.L. and Rubin, D.B. (1993) Maximum likelihood estimation via the ECM algorithm: A general framework. Biometrika, 80, 267-278.
57. Wu, C. (1983) On the convergence properties of the EM algorithm. Ann. Stat., 11, 95-103.
58. Nikolova, M. (2005) Analysis of the recovery of edges in images and signals by minimizing nonconvex regularized least-squares. SIAM J. Multiscale Modeling Simul., 4, 960-991.
59. Combettes, P.L. and Wajs, V.R. (2005) Signal recovery by proximal forward-backward splitting. SIAM J. Multiscale Modeling Simul., 4, 1168-1200.
60. Meng, X.L. and Rubin, D.B. (1992) Recent extensions to the EM algorithm. In Bernardo, J., Berger, J., Dawid, A. and Smith, A. (eds.), Bayesian Statistics, pp. 307-320. Oxford University Press.
61. Meng, X.L. (1994) On the rate of convergence of the ECM algorithm. Ann. Stat., 22, 326-339.
62. Ciarlet, P.G. (1982) Introduction à l'Analyse Numérique Matricielle et à l'Optimisation. Masson, Paris.
63. Glowinski, R., Lions, J. and Trémolières, R. (1976) Analyse Numérique des Inéquations Variationnelles (1stedn). Dunod, Paris.
64. Tseng, P. (2001) Convergence of a block coordinate descent method for nondifferentiable minimizations. J. Optim. Theory Appl., 109 457-494.
65. Ueda, N. and Nakano, R. (1998) Deterministic annealing EM algorithm. Neural Netw., 11, 271-282.
66. Efron, B., Hastie, T., Johnstone, I. and Tibshirani, R. (2004) Least angle regression. Ann. Stat., 32, 407-499.
67. Donoho, D., Tsaig, Y., Drori, I. and Starck, J.-K. (2006) Sparse solution of underdetermined linear equations of stagewise orthogonal matching pursuit. Technical Report. Dept. of Statistics, Stanford University.
68. Guleryuz, O. (2006) Nonlinear approximation based image recovery using adaptive sparse reconstructions and iterated denoising. Part II: adpative algorithms. IEEE Trans. Image Process, 15, 555-571.
69. Buckheit, J. and Donoho, D. (1995) Wavelab and Reproducible Research. In Antoniadis, A. (ed.), Wavelets and Statistics. Springer.
70. Guleryuz, O. (2006) Nonlinear approximation based image recovery using adaptive sparse reconstructions and iterated denoising. Part I: Theory. IEEE Trans. Image Process, 15, 539-554.
71. Chan, R., Shen, L. and Shen, Z. (2005) A framelet-based approach for image inpainting. Technical report. The Chinese University of Hong Kong.
72. Opial, Z. (1967) Weak convergence of the sequence of successive approximations for nonexpansive mappings. Bull. Am. Math. Soc., 73, 591-597.
73. Daubechies, I., Defrise, M. and Mol, C.D. (2004) An iterative thresholding algorithm for linear inverse problems with a sparsity constraint. Comm. Pure Appl. Math., 57, 1413-1541.