Sidorkina I.G., Kudrin P.A. Algorithm for determining the set of nearest points for 3D images recognition

Abstract: the article present a solution for the problem of choosing an eff ective algorithm for determining the set of nearest points for 3D image recognition. The eff ectiveness of the algorithm for determining the set of nearest points aff ects eff ectiveness of the entire image recognition algorithm that uses the set of nearest points as a required step in the image recognition process. The authors present an algorithm for determining the set of nearest points by dividing the space into cubes, analyze the algorithm and shows mathematical relations of the algorithm time complexity. The article illustrates a solution for the task of the algorithm for dividing the space into cubes evaluating which consists of the splitting into elementary operations and expressing the time of execution via microoperations through constants for obtaining the degree of complexity and asymptotic relations showing the ratio of the algorithm execution time increase depending on the size of the input data. The article provides the estimations of the degree of the time complexity for the two implementations of the algorithm for dividing the space into cubes: sequential implementation and parallelized implementation. The authors present the parallelized implementation of the algorithm, obtain estimates its complexity and compare it by the time complexity with the known algorithms.

Keywords: