Geodesic
Implementation of a fast post-processing algorithm of geometrical coding of digital images using CUDA architecture
Vestnik Moskovskogo universiteta. Matematika, mehanika, no. 6 (2022), pp. 64-69 
G. V. Nosovskii; A. Yu. Chekunov. Implementation of a fast post-processing algorithm of geometrical coding of digital images using CUDA architecture. Vestnik Moskovskogo universiteta. Matematika, mehanika, no. 6 (2022), pp. 64-69. http://geodesic.mathdoc.fr/item/VMUMM_2022_6_a9/
@article{VMUMM_2022_6_a9,
     author = {G. V. Nosovskii and A. Yu. Chekunov},
     title = {Implementation of a fast post-processing algorithm of geometrical coding of digital images using {CUDA} architecture},
     journal = {Vestnik Moskovskogo universiteta. Matematika, mehanika},
     pages = {64--69},
     year = {2022},
     number = {6},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/VMUMM_2022_6_a9/}
}
TY  - JOUR
AU  - G. V. Nosovskii
AU  - A. Yu. Chekunov
TI  - Implementation of a fast post-processing algorithm of geometrical coding of digital images using CUDA architecture
JO  - Vestnik Moskovskogo universiteta. Matematika, mehanika
PY  - 2022
SP  - 64
EP  - 69
IS  - 6
UR  - http://geodesic.mathdoc.fr/item/VMUMM_2022_6_a9/
LA  - ru
ID  - VMUMM_2022_6_a9
ER  - 
%0 Journal Article
%A G. V. Nosovskii
%A A. Yu. Chekunov
%T Implementation of a fast post-processing algorithm of geometrical coding of digital images using CUDA architecture
%J Vestnik Moskovskogo universiteta. Matematika, mehanika
%D 2022
%P 64-69
%N 6
%U http://geodesic.mathdoc.fr/item/VMUMM_2022_6_a9/
%G ru
%F VMUMM_2022_6_a9

Voir la notice de l'article provenant de la source Math-Net.Ru

The paper presents some improvements of fast contour recognition algorithm. The main idea of this algorithm is based on calculation of geometric characteristics of a two-dimensional surface in $R^3$, which encodes digital images. To obtain the contours, Minkowski fractal dimension calculation is used. A post-processing algorithm of contour thinning without loss of quality of entire contour picture is proposed in the paper. An estimate of the speed of the new algorithm is presented in comparison with the well-known implementation of the Canny algorithm using the OpenCV computer vision library and the parallel architecture of CUDA. Examples demonstrating the efficiency of the new algorithm are presented.

[1] Nosovskii G. V., “Geometricheskoe kodirovanie tsvetnykh izobrazhenii”, Vestn. Mosk. un-ta. Matem. Mekhan., 2018, no. 1, 3–11 | MR

[2] Nosovskii G. V., Chekunov A. Yu., Podlipaev S. A., “Bystryi algoritm geometricheskogo kodirovaniya tsifrovykh izobrazhenii”, Vestn. Mosk. un-ta. Matem. Mekhan., 2017, no. 6, 20–27 | MR

[3] Li J.Q., Sun D. C., “An improved box-counting method for image fractal dimension estimation”, Pattern Recogn., 42:11 (2009), 2460–2469 | DOI

[4] Chekunov A. Yu., “Realizatsiya bystrogo algoritma geometricheskogo kodirovaniya tsifrovykh izobrazhenii s primeneniem arkhitektury CUDA”, Vestn. Mosk. un-ta. Matem. Mekhan., 2018, no. 6, 18–28 | MR

[5] Canny J., “A computational approach to edge detection”, IEEE Trans. Pattern Anal. and Mach. Intell., 8 (1986), 679–714 | DOI