Aleksei Mikhailovich Popov
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Aleksei Mikhailovich Popov has a total of 37 co-authors. Here are the top co-authors by number of shared publications:
- Lev Aleksandrovich Kazakovtsev
Institute of Informatics and Telecommunications, Reshetnev Siberian State University of Science and Technology, 31 Krasnoyarskii Rabochii Prospekt, Krasnoyarsk 660037, Russia
6 shared publications - Elena Tovbis
Institute of Informatics and Telecommunications, Reshetnev Siberian State University of Science and Technology, 31 Krasnoyarskii Rabochii Prospekt, Krasnoyarsk 660037, Russia
3 shared publications - Alena Alexandrovna Stupina
Siberian Federal University, Krasnoyarsk, Russia
2 shared publications - Igor S. Masich
Bauman Moscow State Technical University, Moscow, Russian Federation
2 shared publications - Margarita Nikolaevna Favorskaya
Reshetnev Siberian State University of Science and Technology
2 shared publications - Predrag S. Stanimirovic
Faculty of Sciences and Mathematics, University of Niš, Niš, Serbia
2 shared publications
Latest Publications
- Open Access
- 9 October 2025
- Published by MDPI AG in Big Data and Cognitive Computing
- Vol. 9 (10) , 254
Fast Adaptive Approximate Nearest Neighbor Search with Cluster-Shaped Indices
In this study, we propose a novel adaptive algorithm for approximate nearest neighbor (ANN) search, based on the inverted file (IVF) index (cluster-based index) and online query complexity classification. The concept of the classical IVF search implemented in vector databases is as follows: all data vectors are divided into clusters, and each cluster is assigned to its central point (centroid). For an ANN search query, the closest centroids are determined, and the further search continues in the corresponding clusters only. In our study, the complexity of each query is assessed and classified with the use of results of an initial trial search in a limited number of clusters. Based on this classification, the algorithm dynamically determines the presumably sufficient number of clusters which is sufficient to achieve the desired Recall value, thereby improving vector search efficiency. Our experiments show that such a complexity classifier can be built with the use of a single feature, and we propose an algorithm for its training. We studied the impact of various features on the query processing and discovered a strong dependence on the number of clusters that contains at least one nearest neighbor (productive clusters). The new algorithm is designed to be implemented on top of the IVF search which is a well-known algorithm for approximate nearest neighbor search and uses existing IVF indexes that are widely used in the most popular vector database management systems, such as pgvector. The results obtained demonstrate a significant increase in the speed of nearest neighbor search (up to 35%) while maintaining a high Recall rate of 0.99. Additionally, the search algorithm is deterministic, which might be extremely important for tasks where the reproducibility of results plays a crucial role. The developed algorithm has been tested on datasets of varying sizes up to one billion data vectors.
- 9 October 2025
- Published by MDPI AG in Big Data and Cognitive Computing
- Vol. 9 (10) , 254
Open AccessFast Adaptive Approximate Nearest Neighbor Search with Cluster-Shaped Indices
In this study, we propose a novel adaptive algorithm for approximate nearest neighbor (ANN) search, based on the inverted file (IVF) index (cluster-based index) and online query complexity classification. The concept of the classical IVF search implemented in vector databases is as follows: all data vectors are divided into clusters, and each cluster is assigned to its central point (centroid). For an ANN search query, the closest centroids are determined, and the further search continues in the corresponding clusters only. In our study, the complexity of each query is assessed and classified with the use of results of an initial trial search in a limited number of clusters. Based on this classification, the algorithm dynamically determines the presumably sufficient number of clusters which is sufficient to achieve the desired Recall value, thereby improving vector search efficiency. Our experiments show that such a complexity classifier can be built with the use of a single feature, and we propose an algorithm for its training. We studied the impact of various features on the query processing and discovered a strong dependence on the number of clusters that contains at least one nearest neighbor (productive clusters). The new algorithm is designed to be implemented on top of the IVF search which is a well-known algorithm for approximate nearest neighbor search and uses existing IVF indexes that are widely used in the most popular vector database management systems, such as pgvector. The results obtained demonstrate a significant increase in the speed of nearest neighbor search (up to 35%) while maintaining a high Recall rate of 0.99. Additionally, the search algorithm is deterministic, which might be extremely important for tasks where the reproducibility of results plays a crucial role. The developed algorithm has been tested on datasets of varying sizes up to one billion data vectors.
- Open Access
- 2 September 2025
- Published by Astrakhan State Technical University in Vestnik of Astrakhan State Technical University. Series: Management, computer science and informatics
- Vol. 2025 (3) , 88-93
Analysis of methods and algorithms for optimizing production capacity planning
The key objective of this study is to find optimal solutions in the field of production capacity allocation and determining the optimal batch size. Methods are considered to minimize the costs associated with transportation, storage and production, as well as maximize the efficiency of resource use. The analysis of methods and algorithms used to optimize production capacity utilization is presented: Johnson's algorithm, the method of branches and boundaries, and the genetic algorithm. Each of the methods is being investigated in terms of their applicability, accuracy, computational complexity, and adaptability to different production conditions. Attention is paid to comparing the strengths and weaknesses of each approach, which makes it possible to evaluate their effectiveness depending on the specifics of production processes. The results of the analysis show that classical methods remain relevant for tasks with well-defined parameters and stable conditions, while modern technologies such as neural networks, genetic algorithms and optimization methods based on big data demonstrate high efficiency in conditions of uncertainty, dynamically changing requirements and complex production systems. Based on the conducted research, possible directions for further development are proposed, including the integration of classical and modern methods, the development of hybrid approaches combining the advantages of various technologies.
- 2 September 2025
- Published by Astrakhan State Technical University in Vestnik of Astrakhan State Technical University. Series: Management, computer science and informatics
- Vol. 2025 (3) , 88-93
Open AccessAnalysis of methods and algorithms for optimizing production capacity planning
The key objective of this study is to find optimal solutions in the field of production capacity allocation and determining the optimal batch size. Methods are considered to minimize the costs associated with transportation, storage and production, as well as maximize the efficiency of resource use. The analysis of methods and algorithms used to optimize production capacity utilization is presented: Johnson's algorithm, the method of branches and boundaries, and the genetic algorithm. Each of the methods is being investigated in terms of their applicability, accuracy, computational complexity, and adaptability to different production conditions. Attention is paid to comparing the strengths and weaknesses of each approach, which makes it possible to evaluate their effectiveness depending on the specifics of production processes. The results of the analysis show that classical methods remain relevant for tasks with well-defined parameters and stable conditions, while modern technologies such as neural networks, genetic algorithms and optimization methods based on big data demonstrate high efficiency in conditions of uncertainty, dynamically changing requirements and complex production systems. Based on the conducted research, possible directions for further development are proposed, including the integration of classical and modern methods, the development of hybrid approaches combining the advantages of various technologies.
- Open Access
- 23 December 2023
- Published by MDPI AG in Algorithms
- Vol. 17 (1) , 7
Heuristic Greedy-Gradient Route Search Method for Finding an Optimal Traffic Distribution in Telecommunication Networks
Rapid growth in the volume of transmitted information has lead to the emergence of new wireless networking technologies with variable heterogeneous topologies. With limited radio frequency resources, optimal routing problems arise, both at the network design stage and during its operation. We propose an algorithm based on a minimum loss intensity (greedy-gradient algorithm) to search for optimal routes of information transmission in telecommunication networks. The relevance of the developed algorithm is determined by its practical use in data-transmitting modeling systems. The proposed algorithm satisfies several requirements, such as the speed of the calculations performed, the fulfillment of the conditions for its convergence, and its independence on the selected loss probability function, as well as on the network topology. The idea of the algorithm is a step-by-step recalculation of metrics based on derivatives of the loss intensity function with simultaneous redistribution of information flows along the routes determined by the Floyd algorithm. The comparative efficiency of the proposed algorithm is demonstrated by computational experiments on various network topologies (up to 100 nodes) with various traffic intensities.
- 23 December 2023
- Published by MDPI AG in Algorithms
- Vol. 17 (1) , 7
Open AccessHeuristic Greedy-Gradient Route Search Method for Finding an Optimal Traffic Distribution in Telecommunication Networks
Rapid growth in the volume of transmitted information has lead to the emergence of new wireless networking technologies with variable heterogeneous topologies. With limited radio frequency resources, optimal routing problems arise, both at the network design stage and during its operation. We propose an algorithm based on a minimum loss intensity (greedy-gradient algorithm) to search for optimal routes of information transmission in telecommunication networks. The relevance of the developed algorithm is determined by its practical use in data-transmitting modeling systems. The proposed algorithm satisfies several requirements, such as the speed of the calculations performed, the fulfillment of the conditions for its convergence, and its independence on the selected loss probability function, as well as on the network topology. The idea of the algorithm is a step-by-step recalculation of metrics based on derivatives of the loss intensity function with simultaneous redistribution of information flows along the routes determined by the Floyd algorithm. The comparative efficiency of the proposed algorithm is demonstrated by computational experiments on various network topologies (up to 100 nodes) with various traffic intensities.
- Open Access
- 18 July 2023
- Published by Krasnoyarsk Science and Technology City Hall in Информатика. Экономика. Управление - Informatics. Economics. Management
- Vol. 2 (3) , 0112-0124
Адаптивное матричное представление информации о параметрах для взаимодействующих автономных интеллектуальных систем
The article considers an adaptive matrix representation of information about parameters for interacting autonomous intelligent systems. It is known that the problem of the functioning of autonomous intelligent systems is one of the most common, arising in the design of various technical devices and information systems. The study is aimed at developing the representation of information about the parameters for autonomous intelligent systems, focused on their interaction. A mechanism is presented for filling dependency matrices with information, which is carried out taking into account the analysis of changes in other system parameters, which ensures an increase in the efficiency of autonomous intelligent systems and a further possibility of expanding their scope. В статье рассматривается адаптивное матричное представление информации о параметрах для взаимодействующих автономных интеллектуальных систем. Известно, что проблема функционирования автономных интеллектуальных систем является одной из самых распространенных, возникающих при проектировании различных технических устройств и информационных систем. Исследование направлено на разработку представления информации о параметрах для автономных интеллектуальных систем, ориентированного на их взаимодействие. Представлен механизм заполнения матриц зависимости информацией, который осуществляется с учетом анализа изменения других параметров систем, что обеспечивает повышение эффективности функционирования автономных интеллектуальных систем и дальнейшую возможность расширения их области применения.
- 18 July 2023
- Published by Krasnoyarsk Science and Technology City Hall in Информатика. Экономика. Управление - Informatics. Economics. Management
- Vol. 2 (3) , 0112-0124
Open AccessАдаптивное матричное представление информации о параметрах для взаимодействующих автономных интеллектуальных систем
The article considers an adaptive matrix representation of information about parameters for interacting autonomous intelligent systems. It is known that the problem of the functioning of autonomous intelligent systems is one of the most common, arising in the design of various technical devices and information systems. The study is aimed at developing the representation of information about the parameters for autonomous intelligent systems, focused on their interaction. A mechanism is presented for filling dependency matrices with information, which is carried out taking into account the analysis of changes in other system parameters, which ensures an increase in the efficiency of autonomous intelligent systems and a further possibility of expanding their scope. В статье рассматривается адаптивное матричное представление информации о параметрах для взаимодействующих автономных интеллектуальных систем. Известно, что проблема функционирования автономных интеллектуальных систем является одной из самых распространенных, возникающих при проектировании различных технических устройств и информационных систем. Исследование направлено на разработку представления информации о параметрах для автономных интеллектуальных систем, ориентированного на их взаимодействие. Представлен механизм заполнения матриц зависимости информацией, который осуществляется с учетом анализа изменения других параметров систем, что обеспечивает повышение эффективности функционирования автономных интеллектуальных систем и дальнейшую возможность расширения их области применения.
- Open Access
- 11 May 2023
- Published by MDPI AG in Mathematics
- Vol. 11 (10) , 2264
A Family of Multi-Step Subgradient Minimization Methods
For solving non-smooth multidimensional optimization problems, we present a family of relaxation subgradient methods (RSMs) with a built-in algorithm for finding the descent direction that forms an acute angle with all subgradients in the neighborhood of the current minimum. Minimizing the function along the opposite direction (with a minus sign) enables the algorithm to go beyond the neighborhood of the current minimum. The family of algorithms for finding the descent direction is based on solving systems of inequalities. The finite convergence of the algorithms on separable bounded sets is proved. Algorithms for solving systems of inequalities are used to organize the RSM family. On quadratic functions, the methods of the RSM family are equivalent to the conjugate gradient method (CGM). The methods are intended for solving high-dimensional problems and are studied theoretically and numerically. Examples of solving convex and non-convex smooth and non-smooth problems of large dimensions are given.
- 11 May 2023
- Published by MDPI AG in Mathematics
- Vol. 11 (10) , 2264
Open AccessA Family of Multi-Step Subgradient Minimization Methods
For solving non-smooth multidimensional optimization problems, we present a family of relaxation subgradient methods (RSMs) with a built-in algorithm for finding the descent direction that forms an acute angle with all subgradients in the neighborhood of the current minimum. Minimizing the function along the opposite direction (with a minus sign) enables the algorithm to go beyond the neighborhood of the current minimum. The family of algorithms for finding the descent direction is based on solving systems of inequalities. The finite convergence of the algorithms on separable bounded sets is proved. Algorithms for solving systems of inequalities are used to organize the RSM family. On quadratic functions, the methods of the RSM family are equivalent to the conjugate gradient method (CGM). The methods are intended for solving high-dimensional problems and are studied theoretically and numerically. Examples of solving convex and non-convex smooth and non-smooth problems of large dimensions are given.
- Open Access
Formation of Fuzzy Patterns in Logical Analysis of Data Using a Multi-Criteria Genetic Algorithm
The formation of patterns is one of the main stages in logical data analysis. Fuzzy approaches to pattern generation in logical analysis of data allow the pattern to cover not only objects of the target class, but also a certain proportion of objects of the opposite class. In this case, pattern search is an optimization problem with the maximum coverage of the target class as an objective function, and some allowed coverage of the opposite class as a constraint. We propose a more flexible and symmetric optimization model which does not impose a strict restriction on the pattern coverage of the opposite class observations. Instead, our model converts such a restriction (purity restriction) into an additional criterion. Both, coverage of the target class and the opposite class are two objective functions of the optimization problem. The search for a balance of these criteria is the essence of the proposed optimization method. We propose a modified evolutionary algorithm based on the Non-dominated Sorting Genetic Algorithm-II (NSGA-II) to solve this problem. The new algorithm uses pattern formation as an approximation of the Pareto set and considers the solution’s representation in logical analysis of data and the informativeness of patterns. We have tested our approach on two applied medical problems of classification under conditions of sample asymmetry: one class significantly dominated the other. The classification results were comparable and, in some cases, better than the results of commonly used machine learning algorithms in terms of accuracy, without losing the interpretability.
Open AccessFormation of Fuzzy Patterns in Logical Analysis of Data Using a Multi-Criteria Genetic Algorithm
The formation of patterns is one of the main stages in logical data analysis. Fuzzy approaches to pattern generation in logical analysis of data allow the pattern to cover not only objects of the target class, but also a certain proportion of objects of the opposite class. In this case, pattern search is an optimization problem with the maximum coverage of the target class as an objective function, and some allowed coverage of the opposite class as a constraint. We propose a more flexible and symmetric optimization model which does not impose a strict restriction on the pattern coverage of the opposite class observations. Instead, our model converts such a restriction (purity restriction) into an additional criterion. Both, coverage of the target class and the opposite class are two objective functions of the optimization problem. The search for a balance of these criteria is the essence of the proposed optimization method. We propose a modified evolutionary algorithm based on the Non-dominated Sorting Genetic Algorithm-II (NSGA-II) to solve this problem. The new algorithm uses pattern formation as an approximation of the Pareto set and considers the solution’s representation in logical analysis of data and the informativeness of patterns. We have tested our approach on two applied medical problems of classification under conditions of sample asymmetry: one class significantly dominated the other. The classification results were comparable and, in some cases, better than the results of commonly used machine learning algorithms in terms of accuracy, without losing the interpretability.
- Open Access
The Automatic Design of Multimode Resonator Topology with Evolutionary Algorithms
Microwave electromagnetic devices have been used for many applications in tropospheric communication, navigation, radar systems, and measurement. The development of the signal preprocessing units including frequency-selective devices (bandpass filters) determines the reliability and usability of such systems. In wireless sensor network nodes, filters with microstrip resonators are widely used to improve the out-of-band suppression and frequency selectivity. Filters based on multimode microstrip resonators have an order that determines their frequency-selective properties, which is a multiple of the number of resonators. That enables us to reduce the size of systems without deteriorating their selective properties. Various microstrip multimode resonator topologies can be used for both filters and microwave sensors, however, the quality criteria for them may differ. The development of every resonator topology is time consuming. We propose a technique for the automatic generation of the resonator topology with required frequency characteristics based on the use of evolutionary algorithms. The topology is encoded into a set of real valued parameters, which are varied to achieve the desired features. The differential evolution algorithm and the genetic algorithm with simulated binary crossover and polynomial mutation are applied to solve the formulated problem using the dynamic penalties method. The experimental results show that our technique enables us to find microstrip resonator topologies with desired amplitude-frequency characteristics automatically, and manufactured devices demonstrate characteristics very close to the results of the algorithm. The proposed algorithmic approach may be used for automatically exploring the new perspective topologies of resonators used in microwave filters, radar antennas or sensors, in accordance with the defined criteria and constraints.
Open AccessThe Automatic Design of Multimode Resonator Topology with Evolutionary Algorithms
Microwave electromagnetic devices have been used for many applications in tropospheric communication, navigation, radar systems, and measurement. The development of the signal preprocessing units including frequency-selective devices (bandpass filters) determines the reliability and usability of such systems. In wireless sensor network nodes, filters with microstrip resonators are widely used to improve the out-of-band suppression and frequency selectivity. Filters based on multimode microstrip resonators have an order that determines their frequency-selective properties, which is a multiple of the number of resonators. That enables us to reduce the size of systems without deteriorating their selective properties. Various microstrip multimode resonator topologies can be used for both filters and microwave sensors, however, the quality criteria for them may differ. The development of every resonator topology is time consuming. We propose a technique for the automatic generation of the resonator topology with required frequency characteristics based on the use of evolutionary algorithms. The topology is encoded into a set of real valued parameters, which are varied to achieve the desired features. The differential evolution algorithm and the genetic algorithm with simulated binary crossover and polynomial mutation are applied to solve the formulated problem using the dynamic penalties method. The experimental results show that our technique enables us to find microstrip resonator topologies with desired amplitude-frequency characteristics automatically, and manufactured devices demonstrate characteristics very close to the results of the algorithm. The proposed algorithmic approach may be used for automatically exploring the new perspective topologies of resonators used in microwave filters, radar antennas or sensors, in accordance with the defined criteria and constraints.
- Open Access
X-ray Diffraction Phase Analysis of Changes in the Lattice of Pervouralsk Quartzite upon Heating
At present, quartzite is widely used across many industries. The properties of quartzite significantly affect the technology used during the preparation of the raw materials as well as the technology used for manufacturing the final product, which may be intended for further operation at different temperatures. The purpose of the study was to create a scheme for the transformation of quartzite that would describe the changes in the parameters of its lattice parameter upon heating and would offer guidance regarding the drying technology and technology required to obtain tridymite. A Bruker D8 Advance diffractometer was used to study changes in the phase composition of quartzite at the temperatures of 200, 400, 600, 879, 1000, 1200, 1470, and 1550 °C. A detailed scheme of transformations of PKMVI-1 quartzite with a SiO2 content of at least 97.5% at normal pressure was proposed for crystalline modifications formed during its heating. As a result of this research, the changes in the parameters of the lattice parameter—such as the average interplanar distance davg, the volume of the unit cell Vavg, the density of the unit cell Davg, and the molecular weight Mavg—were established.
Open AccessX-ray Diffraction Phase Analysis of Changes in the Lattice of Pervouralsk Quartzite upon Heating
At present, quartzite is widely used across many industries. The properties of quartzite significantly affect the technology used during the preparation of the raw materials as well as the technology used for manufacturing the final product, which may be intended for further operation at different temperatures. The purpose of the study was to create a scheme for the transformation of quartzite that would describe the changes in the parameters of its lattice parameter upon heating and would offer guidance regarding the drying technology and technology required to obtain tridymite. A Bruker D8 Advance diffractometer was used to study changes in the phase composition of quartzite at the temperatures of 200, 400, 600, 879, 1000, 1200, 1470, and 1550 °C. A detailed scheme of transformations of PKMVI-1 quartzite with a SiO2 content of at least 97.5% at normal pressure was proposed for crystalline modifications formed during its heating. As a result of this research, the changes in the parameters of the lattice parameter—such as the average interplanar distance davg, the volume of the unit cell Vavg, the density of the unit cell Davg, and the molecular weight Mavg—were established.
- Open Access
- 5 November 2020
- Published by MDPI AG in Computation
- Vol. 8 (4) , 90
Self-Adjusting Variable Neighborhood Search Algorithm for Near-Optimal k-Means Clustering
The k-means problem is one of the most popular models in cluster analysis that minimizes the sum of the squared distances from clustered objects to the sought cluster centers (centroids). The simplicity of its algorithmic implementation encourages researchers to apply it in a variety of engineering and scientific branches. Nevertheless, the problem is proven to be NP-hard which makes exact algorithms inapplicable for large scale problems, and the simplest and most popular algorithms result in very poor values of the squared distances sum. If a problem must be solved within a limited time with the maximum accuracy, which would be difficult to improve using known methods without increasing computational costs, the variable neighborhood search (VNS) algorithms, which search in randomized neighborhoods formed by the application of greedy agglomerative procedures, are competitive. In this article, we investigate the influence of the most important parameter of such neighborhoods on the computational efficiency and propose a new VNS-based algorithm (solver), implemented on the graphics processing unit (GPU), which adjusts this parameter. Benchmarking on data sets composed of up to millions of objects demonstrates the advantage of the new algorithm in comparison with known local search algorithms, within a fixed time, allowing for online computation.
- 5 November 2020
- Published by MDPI AG in Computation
- Vol. 8 (4) , 90
Open AccessSelf-Adjusting Variable Neighborhood Search Algorithm for Near-Optimal k-Means Clustering
The k-means problem is one of the most popular models in cluster analysis that minimizes the sum of the squared distances from clustered objects to the sought cluster centers (centroids). The simplicity of its algorithmic implementation encourages researchers to apply it in a variety of engineering and scientific branches. Nevertheless, the problem is proven to be NP-hard which makes exact algorithms inapplicable for large scale problems, and the simplest and most popular algorithms result in very poor values of the squared distances sum. If a problem must be solved within a limited time with the maximum accuracy, which would be difficult to improve using known methods without increasing computational costs, the variable neighborhood search (VNS) algorithms, which search in randomized neighborhoods formed by the application of greedy agglomerative procedures, are competitive. In this article, we investigate the influence of the most important parameter of such neighborhoods on the computational efficiency and propose a new VNS-based algorithm (solver), implemented on the graphics processing unit (GPU), which adjusts this parameter. Benchmarking on data sets composed of up to millions of objects demonstrates the advantage of the new algorithm in comparison with known local search algorithms, within a fixed time, allowing for online computation.
- Open Access
- 18 May 2015
- Published by Copernicus GmbH in The International Archives of the Photogrammetry, Remote Sensing and Spatial Information Sciences
- Vol. XL-5/W6, 1-8
LOCALIZATION AND RECOGNITION OF DYNAMIC HAND GESTURES BASED ON HIERARCHY OF MANIFOLD CLASSIFIERS
Keywords: Dynamic Gesture, Skeleton Representation, Motion History, Gesture Recognition Generally, the dynamic hand gestures are captured in continuous video sequences, and a gesture recognition system ought to extract the robust features automatically. This task involves the highly challenging spatio-temporal variations of dynamic hand gestures. The proposed method is based on two-level manifold classifiers including the trajectory classifiers in any time instants and the posture classifiers of sub-gestures in selected time instants. The trajectory classifiers contain skin detector, normalized skeleton representation of one or two hands, and motion history representing by motion vectors normalized through predetermined directions (8 and 16 in our case). Each dynamic gesture is separated into a set of sub-gestures in order to predict a trajectory and remove those samples of gestures, which do not satisfy to current trajectory. The posture classifiers involve the normalized skeleton representation of palm and fingers and relative finger positions using fingertips. The min-max criterion is used for trajectory recognition, and the decision tree technique was applied for posture recognition of sub-gestures. For experiments, a dataset “Multi-modal Gesture Recognition Challenge 2013: Dataset and Results” including 393 dynamic hand-gestures was chosen. The proposed method yielded 84–91% recognition accuracy, in average, for restricted set of dynamic gestures.
- 18 May 2015
- Published by Copernicus GmbH in The International Archives of the Photogrammetry, Remote Sensing and Spatial Information Sciences
- Vol. XL-5/W6, 1-8
Open AccessLOCALIZATION AND RECOGNITION OF DYNAMIC HAND GESTURES BASED ON HIERARCHY OF MANIFOLD CLASSIFIERS
Keywords: Dynamic Gesture, Skeleton Representation, Motion History, Gesture Recognition Generally, the dynamic hand gestures are captured in continuous video sequences, and a gesture recognition system ought to extract the robust features automatically. This task involves the highly challenging spatio-temporal variations of dynamic hand gestures. The proposed method is based on two-level manifold classifiers including the trajectory classifiers in any time instants and the posture classifiers of sub-gestures in selected time instants. The trajectory classifiers contain skin detector, normalized skeleton representation of one or two hands, and motion history representing by motion vectors normalized through predetermined directions (8 and 16 in our case). Each dynamic gesture is separated into a set of sub-gestures in order to predict a trajectory and remove those samples of gestures, which do not satisfy to current trajectory. The posture classifiers involve the normalized skeleton representation of palm and fingers and relative finger positions using fingertips. The min-max criterion is used for trajectory recognition, and the decision tree technique was applied for posture recognition of sub-gestures. For experiments, a dataset “Multi-modal Gesture Recognition Challenge 2013: Dataset and Results” including 393 dynamic hand-gestures was chosen. The proposed method yielded 84–91% recognition accuracy, in average, for restricted set of dynamic gestures.