{"title":"Chinese Chess Recognition Based on Projection Histogram of Polar Coordinates Image and FFT","authors":"Peng Hu, Yangyu Luo, Chengrong Li","doi":"10.1109/CCPR.2009.5344001","DOIUrl":null,"url":null,"abstract":"The recognition of Chinese chess through computer vision includes chess detection and its character recognition, and the process should be fast and robust. In this paper, Robert operator is used to get the edge information of chess, then detection, localization and segmentation of the chess are realized through mathematical morphology and template circle method. A new algorithm based on projection histogram of polar coordinates image and Fast Fourier Transform is introduced to extract the rotation-invariant feature of chess characters. Experiments show that the algorithm can accurately recognize all chesses within 300 ms, and is robust to any rotation.","PeriodicalId":354468,"journal":{"name":"2009 Chinese Conference on Pattern Recognition","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2009-12-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"9","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2009 Chinese Conference on Pattern Recognition","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CCPR.2009.5344001","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 9
Abstract
The recognition of Chinese chess through computer vision includes chess detection and its character recognition, and the process should be fast and robust. In this paper, Robert operator is used to get the edge information of chess, then detection, localization and segmentation of the chess are realized through mathematical morphology and template circle method. A new algorithm based on projection histogram of polar coordinates image and Fast Fourier Transform is introduced to extract the rotation-invariant feature of chess characters. Experiments show that the algorithm can accurately recognize all chesses within 300 ms, and is robust to any rotation.