An Efficient Strategy for Bit-Quad-Based Euler Number Computing Algorithm

作     者：Yao, Bin Wu, Hua Yang, Yun Chao, Yuyan Ohta, Atsushi Kawanaka, Haruki He, Lifeng 

作者机构：Shaanxi Univ Sci & Technol Artificial Intelligence Inst Coll Elect & Informat Engn Xian 710021 Shaanxi Peoples R China Nagoya Sangyo Univ Grad Sch Environm Management Owariasahi 4888711 Japan Aichi Prefectural Univ Grad Sch Informat Sci & Technol Nagakute Aichi 4801198 Japan 

出 版 物：《IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS》 (电子信息通信学会汇刊：信息与系统)

年 卷 期：2014年第E97D卷第5期

页      面：1374-1378页

核心收录：

学科分类：0809[工学-电子科学与技术（可授工学、理学学位）] 08[工学] 0835[工学-软件工程] 0812[工学-计算机科学与技术（可授工学、理学学位）] 

基　　金：Ministry of Education, Science, Sports and Culture of Japan Foundation of Xi'an Science and Technology Bureau [CXY1343] Grants-in-Aid for Scientific Research [23500222, 26330200] Funding Source: KAKEN 

主　　题：Euler number topological property computer vision pattern recognition binary image 

摘      要：The Euler number of a binary image is an important topological property for pattern recognition, and can be calculated by counting certain bit-quads in the image. This paper proposes an efficient strategy for improving the bit-quad-based Euler number computing algorithm. By use of the information obtained when processing the previous bit quad, the number of times that pixels must be checked in processing a bit quad decreases from 4 to 2. Experiments demonstrate that an algorithm with our strategy significantly outperforms conventional Euler number computing algorithms.