skip to main content
10.1145/2494266.2494281acmconferencesArticle/Chapter ViewAbstractPublication PagesdocengConference Proceedingsconference-collections
research-article

Document noise removal using sparse representations over learned dictionary

Authors Info & Claims
Published:10 September 2013Publication History

ABSTRACT

In this paper, we propose an algorithm for denoising document images using sparse representations. Following a training set, this algorithm is able to learn the main document characteristics and also, the kind of noise included into the documents. In this perspective, we propose to model the noise energy based on the normalized cross-correlation between pairs of noisy and non-noisy documents. Experimental results on several datasets demonstrate the robustness of our method compared with the state-of-the-art.

References

  1. M. Aharon, M. Elad, and A. Bruckstein. K-svd: An algorithm for designing overcomplete dictionaries for sparse representation. IEEE Transactions on signal processing, 54(11):4311--4322, 2006. Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. E. Barney. Modeling image degradations for improving ocr. In European Conference on Signal Processing, pages 1--5, 2008.Google ScholarGoogle Scholar
  3. S.S. Chen, D.L. Donoho, and M.A. Saunders. Atomic decomposition by basis pursuit. SIAM Journal on Scientific Computing, 20(1):33--61, 1998. Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. S. S. Choi, S. H. Cha, and C. Tappert. A survey of binary similarity and distance measures. Journal on Systemics, Cybernetics and Informatics, 8(1):43--48, 2010.Google ScholarGoogle Scholar
  5. I. Daubechies, R. Devore, M. Fornasier, and C.S Gunturk. Iteratively reweighted least squares minimization for sparse recovery. Communications on Pure and Applied Mathematics, 63(1):1--38, october 2009.Google ScholarGoogle ScholarCross RefCross Ref
  6. E. Davies. Machine Vision: Theory, Algorithms and Practicalities. Academic Press, 1990.Google ScholarGoogle Scholar
  7. D. Donoho and M. Elad. Optimally sparse representation in general (nonorthogonal) dictionaries via l1 minimization. Proceeding of the National Academy of Sciences of the United States of America, 100(5):2197--2202, 2003.Google ScholarGoogle ScholarCross RefCross Ref
  8. M. Elad. Sparse and redundant representation: From theory to applications in signal and images processing. Springer, Reading, Massachusetts, 2010. Google ScholarGoogle ScholarDigital LibraryDigital Library
  9. K. Engan, S. O. Aase, and J. H. Husoy. Frame based signal compression using method of optimal directions (mod). In International Conference on Acoustics, Speech and Signal Processing (ICASSP), 1999.Google ScholarGoogle ScholarCross RefCross Ref
  10. I. Gonzalez and B. Rao. Sparse signal reconstruction from limited data using focuss: a re-weighted minimum norm algorithm. Signal Processing, 45(3):600--616, March 1997. Google ScholarGoogle ScholarDigital LibraryDigital Library
  11. V-T. Hoang, E.H. Barney Smith, and S. Tabbone. Edge noise removel in bilevel graphical document images using sparse representation. In IEEE international conference on Image Processing, 2011.Google ScholarGoogle Scholar
  12. T. Kanungo, R. M. Haralick, and I. T. Phillips. Global and local document degradation models. In Proceedings of the Second International Conference on Document Analysis and Recognition, pages 730--734, October 1993.Google ScholarGoogle ScholarCross RefCross Ref
  13. T. Kanungo, R.M. Haralick, H.S. Baird, W. Stuezle, and D. Madigan. A statistical, nonparametric methodology for document degradation model validation. IEEE Transactions on PAMI, 22(11):1209--1223, June 2000. Google ScholarGoogle ScholarDigital LibraryDigital Library
  14. J. P. Lewis. Fast normalized cross-correlation. Vision Interface, 1995.Google ScholarGoogle Scholar
  15. S. G. Mallat and Z. Zhang. Matching pursuits with time-frequency dictionaries. Signal Processing, 41(12):3397--3415, 1993. Google ScholarGoogle ScholarDigital LibraryDigital Library
  16. P. Marrgos and R.W. Schafer. Morphological filters, part 2: Their relations to median, order-statistic, and stack filters. IEEE Transactions on acoustics, speech, and signal processing, 35(8):87--134, 1987.Google ScholarGoogle Scholar
  17. Y. Pati, R. Rezaiifar, and P. Krishnaprasad. Orthogonal matching pursuit: Recursive function approximation with applications to wavelet decomposition. In Proceedings of the 27th Annual Asilomar Conference on Signals, Systems, and Computers, pages 40--44, 1993.Google ScholarGoogle ScholarCross RefCross Ref
  18. J.L. Starck, E.J. Candes, and D.L. Donoho. The curvelet transform for image denoising. IEEE Transactions on image processing, 11(6):670--684, 2002. Google ScholarGoogle ScholarDigital LibraryDigital Library
  19. V. N. Temlyakov. Weak greedy algorithms. Advances in Computational Mathematics, 5:173--187, 2000.Google ScholarGoogle Scholar
  20. Z. Wang, A. C. Bovik, H. R. Sheikh, and E. P. Simoncelli. Image quality assessment: From error visibility to structural similarity. IEEE Transactions on Image Processing, 13(4):600--612, 2004. Google ScholarGoogle ScholarDigital LibraryDigital Library

Index Terms

  1. Document noise removal using sparse representations over learned dictionary

    Recommendations

    Comments

    Login options

    Check if you have access through your login credentials or your institution to get full access on this article.

    Sign in
    • Published in

      cover image ACM Conferences
      DocEng '13: Proceedings of the 2013 ACM symposium on Document engineering
      September 2013
      582 pages
      ISBN:9781450317894
      DOI:10.1145/2494266

      Copyright © 2013 ACM

      Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

      Publisher

      Association for Computing Machinery

      New York, NY, United States

      Publication History

      • Published: 10 September 2013

      Permissions

      Request permissions about this article.

      Request Permissions

      Check for updates

      Qualifiers

      • research-article

      Acceptance Rates

      DocEng '13 Paper Acceptance Rate16of50submissions,32%Overall Acceptance Rate178of537submissions,33%
    • Article Metrics

      • Downloads (Last 12 months)2
      • Downloads (Last 6 weeks)0

      Other Metrics

    PDF Format

    View or Download as a PDF file.

    PDF

    eReader

    View online with eReader.

    eReader