ACM Home Page
Please provide us with feedback. Feedback
A fast algorithm to binarize and filter documents with back-to-front interference
Full text PdfPdf (148 KB)
Source Symposium on Applied Computing archive
Proceedings of the 2007 ACM symposium on Applied computing table of contents
Seoul, Korea
SESSION: Document engineering table of contents
Pages: 639 - 640  
Year of Publication: 2007
ISBN:1-59593-480-4
Authors
João Marcelo Monte da Silva  DES -- CTG -- UFPE, Recife, PE Brazil
Rafael Dueire Lins  DES -- CTG -- UFPE, Recife, PE BRAZIL
Sponsor
SIGAPP: ACM Special Interest Group on Applied Computing
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 2,   Downloads (12 Months): 34,   Citation Count: 0
Additional Information:

abstract   references   index terms   collaborative colleagues  

Tools and Actions: Review this Article  
Save this Article to a Binder    Display Formats: BibTex  EndNote ACM Ref   
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1244002.1244148
What is a DOI?

ABSTRACT

Whenever one finds documents written on both sides on translucent paper there is a "back-to-front interference". The direct binarization of such documents yields unreadable documents. This paper presents a fast segmentation-based method for generating high-quality binarized images of documents with back-to-front interference. The proposed segmentation algorithm is based on the entropy of the histogram of the image.



Collaborative Colleagues:
João Marcelo Monte da Silva: colleagues
Rafael Dueire Lins: colleagues