- Вы можете использовать опцию И / ИЛИ / НЕ для критериев, которые вы хотите добавить или. - Вы можете вернуться к обычному поиску, нажав кнопку Отмена.
This paper proposes a minimal length difference algorithm for construction of a line in an image by solving the problem of optimal contour approximation. In this algorithm, a method for finding interest points is proposed, and the object matching (classification) is done by mapping interest points onto a vector space. In cases where the lines in the representation of the images are not smooth, the algorithm converges rapidly. The results of the experiments showed that for convergence of the contour simplification, there were 5-6 iterations for n = 13. To check how close the curve approximation ...Более