{"title":"基于熵的文档图像压缩模式匹配","authors":"Qin Zhang, J. Danskin","doi":"10.1109/ICIP.1996.560734","DOIUrl":null,"url":null,"abstract":"In this paper, we introduce a pattern matching algorithm used in document image compression. This pattern matching algorithm uses the cross entropy between two patterns as the criterion for a match. We use a physical model which is based on the finite resolution of the scanner (spatial sampling error) to estimate the probability values used in cross entropy calculation. Experimental results show this pattern matching algorithm compares favorably to previous algorithms.","PeriodicalId":192947,"journal":{"name":"Proceedings of 3rd IEEE International Conference on Image Processing","volume":"32 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1996-09-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"23","resultStr":"{\"title\":\"Entropy-based pattern matching for document image compression\",\"authors\":\"Qin Zhang, J. Danskin\",\"doi\":\"10.1109/ICIP.1996.560734\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper, we introduce a pattern matching algorithm used in document image compression. This pattern matching algorithm uses the cross entropy between two patterns as the criterion for a match. We use a physical model which is based on the finite resolution of the scanner (spatial sampling error) to estimate the probability values used in cross entropy calculation. Experimental results show this pattern matching algorithm compares favorably to previous algorithms.\",\"PeriodicalId\":192947,\"journal\":{\"name\":\"Proceedings of 3rd IEEE International Conference on Image Processing\",\"volume\":\"32 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1996-09-16\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"23\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of 3rd IEEE International Conference on Image Processing\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICIP.1996.560734\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of 3rd IEEE International Conference on Image Processing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICIP.1996.560734","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Entropy-based pattern matching for document image compression
In this paper, we introduce a pattern matching algorithm used in document image compression. This pattern matching algorithm uses the cross entropy between two patterns as the criterion for a match. We use a physical model which is based on the finite resolution of the scanner (spatial sampling error) to estimate the probability values used in cross entropy calculation. Experimental results show this pattern matching algorithm compares favorably to previous algorithms.