A graph-theory-based Euler number computing algorithm
Published • Aug 1, 2015
NobleIDNI3P11W41R40S01
Authors:,,
Bin Yao
Kang Shi-ying
Xiao Zhao
Abstract
This paper proposes a new graph-theory-based Euler number computing algorithm. The proposed algorithm only needs to count two bit-quad patterns in the given image, while conventional bit-quad-based algorithms need to count ten. Moreover, by use of the information obtained during processing previous ...
Finding related papers...
Discussions
(0)No comments yet
Be the first to share your thoughts!