Abstract
In this paper, we propose a block-based connected component labeling algorithm, which predicts current block’s label by exploiting the information obtained from previous block to reduce memory access. By generating a forest of decision trees according to some of previous block’s pixels, which are also needed for current block’s label decision, we can reduce trees’ depth and number of pixels to check. Experimental results show that our method is faster than the most recent labeling algorithms with image datasets which have various size and pixel density.
Original language | English |
---|---|
Title of host publication | 2017 40th International Conference on Telecommunications and Signal Processing, TSP 2017 |
Editors | Norbert Herencsar |
Publisher | Institute of Electrical and Electronics Engineers Inc. |
Pages | 578-581 |
Number of pages | 4 |
ISBN (Electronic) | 9781509039821 |
DOIs | |
Publication status | Published - 2017 Oct 19 |
Event | 40th International Conference on Telecommunications and Signal Processing, TSP 2017 - Barcelona, Spain Duration: 2017 Jul 5 → 2017 Jul 7 |
Publication series
Name | 2017 40th International Conference on Telecommunications and Signal Processing, TSP 2017 |
---|---|
Volume | 2017-January |
Conference
Conference | 40th International Conference on Telecommunications and Signal Processing, TSP 2017 |
---|---|
Country/Territory | Spain |
City | Barcelona |
Period | 17/7/5 → 17/7/7 |
Bibliographical note
Funding Information:This work was supported by the Technological Innovation R&D Program (S2342832) funded by the Small and Medium Business Administration(SMBA, Korea)
Publisher Copyright:
© 2017 IEEE.
All Science Journal Classification (ASJC) codes
- Computer Networks and Communications
- Signal Processing