An efficient euler number computing algorithm

The Euler number of a binary image is a very important topological property for image processing pattern recognition, and computer vision. This paper proposes an efficient run-based algorithm for Euler number computing. For calculating 8-neighbor runs, unlike the conventional run-based algorithm, wh...

Full description

Saved in:
Bibliographic Details
Published in2015 IEEE International Conference on Information and Automation pp. 1167 - 1171
Main Authors Yuyan Chao, Shiying Kang, Bin Yao, Xiao Zhao, Lifeng He
Format Conference Proceeding
LanguageEnglish
Japanese
Published IEEE 01.08.2015
Subjects
Algorithm design and analysis
Classification algorithms
Computer vision
Euler number
Image processing
Labeling
Noise
Pattern recognition
run
topological feature
Online AccessGet full text
DOI10.1109/ICInfA.2015.7279463

Cover

More Information
Summary:The Euler number of a binary image is a very important topological property for image processing pattern recognition, and computer vision. This paper proposes an efficient run-based algorithm for Euler number computing. For calculating 8-neighbor runs, unlike the conventional run-based algorithm, which needs to record start points and end points of all runs, our algorithm only needs to record end points of runs in odd rows. By our method, the number of pixel accesses required for computing Euler number will decrease. Experimental results on various noise images demonstrated that our algorithm outperforms conventional Euler number computing algorithms.
DOI:10.1109/ICInfA.2015.7279463