Journal
IEEE TRANSACTIONS ON IMAGE PROCESSING
Volume 24, Issue 9, Pages 2725-2735Publisher
IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
DOI: 10.1109/TIP.2015.2425540
Keywords
Computer vision; pattern recognition; image analysis; image feature; the Euler number; the hole number
Funding
- National Natural Science Foundation of China [61471227]
- Ministry of Education, Science, Sports and Culture, Japan [26330200]
- Key Science and Technology Program for Social Development of Shaanxi Province, China [2014K11-02-01-13]
- Grants-in-Aid for Scientific Research [26330200] Funding Source: KAKEN
Ask authors/readers for more resources
Labeling connected components and calculating the Euler number in a binary image are two fundamental processes for computer vision and pattern recognition. This paper presents an ingenious method for identifying a hole in a binary image in the first scan of connected-component labeling. Our algorithm can perform connected component labeling and Euler number computing simultaneously, and it can also calculate the connected component (object) number and the hole number efficiently. The additional cost for calculating the hole number is only O(H), where H is the hole number in the image. Our algorithm can be implemented almost in the same way as a conventional equivalent-label-set-based connected-component labeling algorithm. We prove the correctness of our algorithm and use experimental results for various kinds of images to demonstrate the power of our algorithm.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available