{"title":"模式识别中的贝叶斯最佳优先搜索-在地址识别中的应用","authors":"Tomoyuki Hamamura, T. Akagi, Bunpei Irie","doi":"10.1109/ICDAR.2009.231","DOIUrl":null,"url":null,"abstract":"In this paper, we propose a novel algorithm “Bayesian Best-First Search (BB Search)”, for use in search problems in pattern recognition, such as address recognition.BB search uses “a posteriori” probability for the evaluation value in best-first search. BB search is more flexible to changing time limits compared to beam search used in conventional pattern recognition approach. It does not need designing a heuristic function for each problem like A* search.We demonstrated a 12.4% improvement over beam search on an address recognition experiment using real postal images.","PeriodicalId":433762,"journal":{"name":"2009 10th International Conference on Document Analysis and Recognition","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2009-07-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Bayesian Best-First Search for Pattern Recognition - Application to Address Recognition\",\"authors\":\"Tomoyuki Hamamura, T. Akagi, Bunpei Irie\",\"doi\":\"10.1109/ICDAR.2009.231\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper, we propose a novel algorithm “Bayesian Best-First Search (BB Search)”, for use in search problems in pattern recognition, such as address recognition.BB search uses “a posteriori” probability for the evaluation value in best-first search. BB search is more flexible to changing time limits compared to beam search used in conventional pattern recognition approach. It does not need designing a heuristic function for each problem like A* search.We demonstrated a 12.4% improvement over beam search on an address recognition experiment using real postal images.\",\"PeriodicalId\":433762,\"journal\":{\"name\":\"2009 10th International Conference on Document Analysis and Recognition\",\"volume\":\"1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2009-07-26\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2009 10th International Conference on Document Analysis and Recognition\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICDAR.2009.231\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2009 10th International Conference on Document Analysis and Recognition","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICDAR.2009.231","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Bayesian Best-First Search for Pattern Recognition - Application to Address Recognition
In this paper, we propose a novel algorithm “Bayesian Best-First Search (BB Search)”, for use in search problems in pattern recognition, such as address recognition.BB search uses “a posteriori” probability for the evaluation value in best-first search. BB search is more flexible to changing time limits compared to beam search used in conventional pattern recognition approach. It does not need designing a heuristic function for each problem like A* search.We demonstrated a 12.4% improvement over beam search on an address recognition experiment using real postal images.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
