Efficient Scalable Template-Matching Technique for Ancient Brahmi Script Image  

作　　者：Sandeep Kaur Bharat Bhushan Sagar 

机构地区：[1]Department of CSE,Birla Institute of Technology,Mesra,Ranchi,835215,India

出　　处：《Computers, Materials & Continua》2023年第1期1541-1559,共19页计算机、材料和连续体（英文）

摘　　要：Analysis and recognition of ancient scripts is a challenging task as these scripts are inscribed on pillars,stones,or leaves.Optical recognition systems can help in preserving,sharing,and accelerate the study of the ancient scripts,but lack of standard dataset for such scripts is a major constraint.Although many scholars and researchers have captured and uploaded inscription images on various websites,manual searching,downloading and extraction of these images is tedious and error prone.Web search queries return a vast number of irrelevant results,and manually extracting images for a specific script is not scalable.This paper proposes a novelmultistage system to identify the specific set of script images from a large set of images downloaded from web sources.The proposed system combines the two most important pattern matching techniques-Scale Invariant Feature Transform(SIFT)and Template matching,in a sequential pipeline,and by using the key strengths of each technique,the system can discard irrelevant images while retaining a specific type of images.

关 键 词：Brahmi script SIFT(scale-invariant feature transform) multi-scale template matching web scraping 

分 类 号：TP391.41[自动化与计算机技术—计算机应用技术]