{"title":"数字字符串的分割","authors":"G. Congedo, G. Dimauro, S. Impedovo, G. Pirlo","doi":"10.1109/ICDAR.1995.602080","DOIUrl":null,"url":null,"abstract":"This paper presents a complete procedure for the segmentation of handwritten numeric strings. The procedure uses an hypothesis-then-verification strategy in which multiple segmentation algorithms based on contiguous row partition work sequentially on the binary image until an acceptable segmentation is obtained. At this purpose a new set of algorithms simulating a \"drop falling\" process is introduced. The experimental tests demonstrate the effectiveness of the new algorithms in obtaining high-confidence segmentation hypotheses.","PeriodicalId":273519,"journal":{"name":"Proceedings of 3rd International Conference on Document Analysis and Recognition","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1995-08-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"83","resultStr":"{\"title\":\"Segmentation of numeric strings\",\"authors\":\"G. Congedo, G. Dimauro, S. Impedovo, G. Pirlo\",\"doi\":\"10.1109/ICDAR.1995.602080\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper presents a complete procedure for the segmentation of handwritten numeric strings. The procedure uses an hypothesis-then-verification strategy in which multiple segmentation algorithms based on contiguous row partition work sequentially on the binary image until an acceptable segmentation is obtained. At this purpose a new set of algorithms simulating a \\\"drop falling\\\" process is introduced. The experimental tests demonstrate the effectiveness of the new algorithms in obtaining high-confidence segmentation hypotheses.\",\"PeriodicalId\":273519,\"journal\":{\"name\":\"Proceedings of 3rd International Conference on Document Analysis and Recognition\",\"volume\":\"1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1995-08-14\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"83\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of 3rd International Conference on Document Analysis and Recognition\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICDAR.1995.602080\",\"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 International Conference on Document Analysis and Recognition","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICDAR.1995.602080","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
This paper presents a complete procedure for the segmentation of handwritten numeric strings. The procedure uses an hypothesis-then-verification strategy in which multiple segmentation algorithms based on contiguous row partition work sequentially on the binary image until an acceptable segmentation is obtained. At this purpose a new set of algorithms simulating a "drop falling" process is introduced. The experimental tests demonstrate the effectiveness of the new algorithms in obtaining high-confidence segmentation hypotheses.