A new contour tracing algorithm based on run data and its parallel design and implementation

To address the problem in boundary tracing where there is no direct association between entities and boundary pixelsthat is, determining which entity a boundary belongs toa novel run data-based boundary tracing algorithm is proposed. Unlike traditional tracing algorithms, this approach first extracts boundary pixels and then classifies them to ensure 100% extraction accuracy. A region labeling algorithm is introduced to establish a direct link between boundaries and objects. The concept of boundary run data is proposed to avoid errors in previous run data algorithms, particularly at corners. Furthermore, the proposed algorithm is parallelized using MPI to further improve its speed. Experiments conducted on the MPEG-7 CE standard dataset demonstrate that the proposed algorithm achieves 100% accuracy, offers significant speed improvements over traditional algorithms, and exhibits further performance gains after parallelization.