Improving the accuracy and speed of fast template‐matching algorithms by neural architecture search

• Published in: Expert systems Vol. 40; no. 9
• Main Authors: Shariatzadeh, Seyed Mahdi, Fathy, Mahmood, Berangi, Reza
• Format: Journal Article
• Language: English
• Published: Oxford Blackwell Publishing Ltd 01.11.2023
• Subjects: Algorithms; Artificial neural networks; Computing costs; Error reduction; Image processing; Iterative methods; Pattern matching; Robustness; Searching; Template matching
• ISSN: 0266-4720; 1468-0394
• DOI: 10.1111/exsy.13358

Neural architecture search can be used to find convolutional neural architectures that are precise and robust while enjoying enough speed for industrial image processing applications. In this paper, our goal is to achieve optimal convolutional neural networks (CNNs) for multiple‐templates matching for applications such as licence plates detection (LPD). We perform an iterative local neural architecture search for the models with minimum validation error as well as low computational cost from our search space of about 32 billion models. We describe the findings of the experience and discuss the specifications of the final optimal architectures. About 20‐times error reduction and 6‐times computational complexity reduction is achieved over our engineered neural architecture after about 500 neural architecture evaluation (in about 10 h). The typical speed of our final model is comparable to classic template matching algorithms while performing more robust and multiple‐template matching with different scales.