Algorithm for constructing a convex envelope and evaluating the convexity characteristics of objects on digital images
P. A. Medennikov
This paper presents an algorithm for constructing the convex envelope of an object, based on an analysis of the derivative of the chain code of its boundary. The construction process consists of selecting boundary points with a positive derivative that satisfy a proposed convexity condition. Such points determine the vertices of a closed polygon that is the convex envelope of the object. A method is proposed for estimating the number of holes and the convexity coefficient, based on the ratio of the perimeters of the object and of its convex envelope.
ЛИТЕРАТУРА
1. Гонсалес Р., Вудс Р. Цифровая обработка изображений. Пер. с англ. М.: Техносфера, 2005. 1072 с.
2. Kovalevsky V. Discrete topology and contour definition // Pattern Recognition Letters. 1984. V. 2. № 2. P. 281–288.
3. Kim C.E. Digital convexity, straightness lines and convex polygons // IEEE Trans. Pattern Analysis Machine Intelligence. 1982. V. 4. № 3. P. 618–626.
4. Sclansky J. Measuring concavity on rectangular mosaic // IEEE Trans. Computers. 1972. V. 21. № 12. P. 1355–1364.
5. Rosenfeld A. Digital straight line segment // IEEE Trans. Computers. 1974. V. 23. № 12. P. 1264– 1269.
6. Претт У.К. Цифровая обработка изображений. Пер. с англ. М.: Мир, 1982. Т. 2. 478 с.
7. Дуда Р., Харт П. Распознавание образов и анализ сцен. Пер. с англ. М.: Мир, 1976. 511 с.
8. Freeman H. On the encoding of arbitrary geometric configurations // IEEE Trans. EC-10. 1961. № 5. P. 260–268.
9. Freeman H. Computer processing of line drawing images // ACM Computer surways. 1974. V. 6. № 1. P. 57–97.
ПОЛНЫЙ ТЕКСТ