We present a thinning algorithm based on the manipulation of the polygons that represent the borders of thin structures in digital images. We pay special attention to the improvement of the algorithmic complexity of the method. We identify two steps of the algorithm whose “naive” implementations have a quadratic complexity, and that dominate the rest of the problem, and propose faster solutions for both of them. The theoretical estimates for the complexities are supported by simulation experiments.
We present a thinning algorithm based on the manipulation of the polygons that represent the borders of thin structures in digital images. We pay special attention to the improvement of the algorithmic complexity of the method. We identify two steps of the algorithm whose “naive” implementations have a quadratic complexity, and that dominate the rest of the problem, and propose faster solutions for both of them. The theoretical estimates for the complexities are supported by simulation experiments. Read More
Related posts:
Building smart adaptable cyber-physical systems: definitions, classification and elements
The fuzzy Kalman filter: Improving its implementation by reformulating uncertainty representation
Approximate reconstruction of randomly sampled signals
Optimizing failure prediction time windows through genetic algorithms and random forests
Extreme Low-Visibility Events Prediction Based on Inductive and Evolutionary Decision Rules: An Explicability-Based Approach
Denial of Chain: Evaluation and prediction of a novel cyberattack in Blockchain-supported systems