R. Lins, J. G. M. Silva, Fernando Mário Junqueira Martins
{"title":"评估消除文档中前后干扰的算法","authors":"R. Lins, J. G. M. Silva, Fernando Mário Junqueira Martins","doi":"10.1145/1244002.1244142","DOIUrl":null,"url":null,"abstract":"Documents written on both sides on translucent paper make visible the ink from one side on the other. This artifact is called \"back-to-front interference\" or \"bleeding\". The direct binarization of documents with such interference yields unreadable documents. The literature presents several algorithms for suitably removing such artifact. This paper presents a quantitative method to assess algorithms to remove back-to-front interference.","PeriodicalId":271294,"journal":{"name":"2006 International Telecommunications Symposium","volume":"95 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2006-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"26","resultStr":"{\"title\":\"Assessing algorithms to remove back-to-front interference in documents\",\"authors\":\"R. Lins, J. G. M. Silva, Fernando Mário Junqueira Martins\",\"doi\":\"10.1145/1244002.1244142\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Documents written on both sides on translucent paper make visible the ink from one side on the other. This artifact is called \\\"back-to-front interference\\\" or \\\"bleeding\\\". The direct binarization of documents with such interference yields unreadable documents. The literature presents several algorithms for suitably removing such artifact. This paper presents a quantitative method to assess algorithms to remove back-to-front interference.\",\"PeriodicalId\":271294,\"journal\":{\"name\":\"2006 International Telecommunications Symposium\",\"volume\":\"95 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2006-09-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"26\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2006 International Telecommunications Symposium\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1145/1244002.1244142\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2006 International Telecommunications Symposium","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/1244002.1244142","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Assessing algorithms to remove back-to-front interference in documents
Documents written on both sides on translucent paper make visible the ink from one side on the other. This artifact is called "back-to-front interference" or "bleeding". The direct binarization of documents with such interference yields unreadable documents. The literature presents several algorithms for suitably removing such artifact. This paper presents a quantitative method to assess algorithms to remove back-to-front interference.