{"title":"基于图语法的车牌识别","authors":"Yuqing Song, Jianqing Liu, Dianwei Li","doi":"10.1109/ICINIS.2012.54","DOIUrl":null,"url":null,"abstract":"Automatic license plate recognition is still a challenging problem where severe imaging conditions must be handled. As compared with other formal tools, the graph grammar model is more suitable when dealing with the severe imaging conditions. In this paper we introduce a graph grammar based method of license plate recognition. In our approach, a level set based license location process is first employed to find candidate plate locations. Then a graph grammar is applied to each candidate location to recognize the plate. The grammar consists of 3 rules. The first two rules recognize individual characters. The third rule represents the license plate layout by a graph. The plate recognition is achieved by a graph matching process.","PeriodicalId":302503,"journal":{"name":"2012 Fifth International Conference on Intelligent Networks and Intelligent Systems","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2012-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Graph Grammar Based License Plate Recognition\",\"authors\":\"Yuqing Song, Jianqing Liu, Dianwei Li\",\"doi\":\"10.1109/ICINIS.2012.54\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Automatic license plate recognition is still a challenging problem where severe imaging conditions must be handled. As compared with other formal tools, the graph grammar model is more suitable when dealing with the severe imaging conditions. In this paper we introduce a graph grammar based method of license plate recognition. In our approach, a level set based license location process is first employed to find candidate plate locations. Then a graph grammar is applied to each candidate location to recognize the plate. The grammar consists of 3 rules. The first two rules recognize individual characters. The third rule represents the license plate layout by a graph. The plate recognition is achieved by a graph matching process.\",\"PeriodicalId\":302503,\"journal\":{\"name\":\"2012 Fifth International Conference on Intelligent Networks and Intelligent Systems\",\"volume\":\"1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2012-11-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2012 Fifth International Conference on Intelligent Networks and Intelligent Systems\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICINIS.2012.54\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2012 Fifth International Conference on Intelligent Networks and Intelligent Systems","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICINIS.2012.54","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Automatic license plate recognition is still a challenging problem where severe imaging conditions must be handled. As compared with other formal tools, the graph grammar model is more suitable when dealing with the severe imaging conditions. In this paper we introduce a graph grammar based method of license plate recognition. In our approach, a level set based license location process is first employed to find candidate plate locations. Then a graph grammar is applied to each candidate location to recognize the plate. The grammar consists of 3 rules. The first two rules recognize individual characters. The third rule represents the license plate layout by a graph. The plate recognition is achieved by a graph matching process.