Abstract
Regularization plays a vital role in inverse problems, and especially in ill-posed ones. Along with classical regularization techniques based on smoothness, entropy, and sparsity, an emerging powerful regularization is one that leans on image examples. In this paper, we propose an efficient scheme for using image examples as driving a powerful regularization, applied to the image scale-up (super-resolution) problem. In this work, we target specifically scanned documents containing written text, graphics, and equations. Our algorithm starts by assigning per each location in the degraded image several candidate high-quality patches. Those are found as the nearest-neighbors (NN) in an image-database that contains pairs of corresponding low- and high-quality image patches. The found examples are used for the definition of an image prior expression, merged into a global MAP penalty function. We use this penalty function both for rejecting some of the irrelevant outlier examples, and then for reconstructing the desired image. We demonstrate our algorithm on several scanned documents with promising results.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Aharon M., Elad M., Bruckstein A.M. (2006a) The K-SVD: An algorithm for designing of overcomplete dictionaries for sparse representation. IEEE Transactions on Signal Processing 54(11): 4311–4322
Aharon M., Elad M., Bruckstein A.M. (2006b) On the uniqueness of overcomplete dictionaries, and a practical way to retrieve them. Journal of Linear Algebra and Applications 416(7): 48–67
Baker S., Kanade T. (2002) Limits on super-resolution and how to break them. IEEE Transactions on Pattern Analysis and Machine Intelligence 24(9): 1167–1183
Buccigrossi R.W., Simoncelli E.P. (1999) Image compression via joint statistical characterization in the wavelet domain. IEEE Transactions on Image Processing 8(12): 1688–1701
Chen S.S., Donoho D.L., Saunders M.A. (2001) Atomic decomposition by basis pursuit. SIAM Review 43(1): 129–159
Criminisi A., Perez P., Toyama K. (2004) Region filling and object removal by exemplar-based image inpainting. IEEE Transactions on Image Processing 13(9): 1200–1212
Donoho D.L., Johnstone I.M. (1994) Ideal spatial adaptation by wavelet shrinkage. Biometrika 81(3): 425–455
Efros, A. A., & Leung, T. K. (1999). Texture synthesis by non-parametric sampling. In Proceedings of the IEEE International conference on computer vision (ICCV’99), Corfu, Greece.
Engan K., Aase S.O., Hakon-Husoy J.H. (1999) Method of optimal directions for frame design. IEEE Internationall Conference on Acoustics, Speech, and Signal Processing 5: 2443–2446
Freeman W.T., Jones T.R., Pasztor E.C. (2002) Example-based super-resolution. IEEE Computer Graphics And Applications 22(2): 56–65
Freeman W.T., Pasztor E.C., Carmichael O.T. (2000) Learning low-level vision. International Journal of computer Vision 40(1): 25–47
Friedman J.H., Bentley J.L., Finkel R.A. (1977) An algorithm for finding best matches in logarithmic expected time. ACM Transactions on Mathematical Software 3(3): 209–226
Haber E., Tenorio L. (2003) Learning regularization functionals. Inverse Problems 19: 611–626
Jaynes E.T. (1982) On the rationale of maximum-entropy methods. IEEE Proceedings 70(9): 939–952
Nakagaki R., Katsaggelos A.K. (2003) VQ-based blind image restoration algorithm. IEEE Transcations on image Processing 12(9): 1044–1053
Olshausen B.A., Field D.J. (1997) Sparse coding with an overcomplete basis set: A strategy employed by V1?. Vision Research 37: 311–325
Roth S., Black M.J. (2005) Fields of experts: A framework for learning image priors. IEEE Conference on Computer Vision and Pattern Recognition 2: 860–867
Rudin L., Osher S., Fatemi E. (1992) Nonlinear total variation based noise removal algorithms. Physica D 60: 259–268
Sochen N., Kimmel R., Bruckstein A.M. (2001) Diffusions and confusions in signal and image processing. Journal of Mathematical Imaging and Vision 14(3): 195–209
Wei, L.-Y., & Levoy, M. (2000). Fast texture synthesis using tree-structured vector quantization. Proceeding in SIGGRAPH 2000 (New Orleans, Louisiana, July 23–28, 2000). In Computer Graphics Proceedings, Annual Conference Series, 2000. ACM SIGGRAPH, pp. 479–488.
Weissman T., Ordentlich E., Seroussi G., Verdu S., Weinberger M.J. (2005) Universal discrete denoising: Known channel. IEEE Transactions on Information Theory 51(1): 5–28
Zhu S.C., Mumford D. (1997) Prior learning and Gibbs reaction-diffusion. IEEE Transactions on Pattern Analysis and Machine Intelligences 19(11): 1236–1250
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Datsenko, D., Elad, M. Example-based single document image super-resolution: a global MAP approach with outlier rejection. Multidim Syst Sign Process 18, 103–121 (2007). https://doi.org/10.1007/s11045-007-0018-z
Received:
Revised:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11045-007-0018-z