Abstract
AbstractSymbol recognition is important in many applications such as the automated interpretation of line drawings and retrieval-by-content search engines. This paper presents the use of geometric matching for symbol recognition under similarity transformations. We incorporate this matching approach in a complete symbol recognition/spotting system, which consists of denoising, symbol representation and recognition. The proposed system works for both isolated recognition and spotting symbols in context. For denoising, we use an adaptive preprocessing algorithm. For symbol representation, pixels and/or vectorial primitives can be used, then the recognition is done via geometric matching. When applied on the datasets of GREC’05 and GREC’11 symbol recognition contests, the system has performed significantly better than other statistical or structural methods.KeywordsSymbol RecognitionSymbol SpottingGeometric Matching
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
