Daradkeh Yousef IbrahimGorokhovatskyi, V.Tvoroshenko, I.Zeghid Medien2022-12-042022-12-042022-01-02Tools for Fast Metric Data Search in Structural Methods for Image Classification / Daradkeh Y. I., Gorokhovatskyi V., Tvoroshenko I., Zeghid M. // IEEE Access, 10, pp. 124738-124746.DOI: 10.1109/ACCESS.2022.3225077https://openarchive.nure.ua/handle/document/21140The article proposes a new classification method based on implementing the high-speed search tools for the indexed data structure created on the etalon set of features, which has significant advantages in processing speed compared to the traditional approaches. The classifier is represented as two-stage processing, where at the first stage the class for the separate object descriptor is determined, and at the second stage, the resulting class of the object is determined based on the obtained set of local solutions. The developed method is based on the preliminary construction of the indexed hash structures for the set of descriptors of the base of the etalon images. Implementing the hash representation allows for increasing the speed of identification or classification of visual objects. A comparative experiment with the traditional method of voting has been conducted, where the linear search for the nearest descriptor has been implemented for the identification without the use of prior creation of the indexed hash representation of the etalons. In the experiment, we have gained in processing speed for the developed method compared to the traditional over 10 times. The gain in processing speed increases proportionally with the number of the etalons and the number of the descriptors in the descriptions. The experiment has shown that the efficiency of the method can be enhanced by varying the values of its parameters and adapting to the properties of the data.enComputer visiondata hashingdescriptorHamming's metricimage keypointimage classificationkeypoint (KP)speed searchArticle