A Warp Speed Chain-Code Algorithm Based on Binary Decision Trees

Abstract: Contours extraction, also known as chain-code extraction, is one of the most common algorithms of binary image processing. Despite being the raster way the most cache friendly and, consequently, fast way to scan an image, most commonly used chain-code algorithms perform contours tracing, and therefore tend to be fairly inefficient. In this paper, we took a rarely used algorithm that extracts contours in raster scan, and optimized its execution time through template functions, look-up tables and decision trees, in order to reduce code branches and the average number of load/store operations required. The result is a very fast solution that outspeeds the state-of-the-art contours extraction algorithm implemented in OpenCV, on a collection of real case datasets. Contribution: This paper significantly improves the performance of existing chain-code algorithms, by smartly introducing decision trees to reduce code branches and the average number of load/store operations required.

Citation:

Allegretti, Stefano; Bolelli, Federico; Grana, Costantino "A Warp Speed Chain-Code Algorithm Based on Binary Decision Trees" 2020 Joint 10th International Conference on Informatics, Electronics & Vision (ICIEV) and 2020 5th International Conference on Imaging, Vision & Pattern Recognition (icIVPR), Kitakyushu, Fukuoka, Japan, pp. 1 -8 , Aug 26-29, 2020 DOI: 10.1109/ICIEVicIVPR48672.2020.9306532

 not available

Paper download:

• Author version:
• DOI: 10.1109/ICIEVicIVPR48672.2020.9306532