TY - GEN
T1 - A Novel Genetic Algorithm Approach for Discriminative Subspace Optimization
AU - Gatto, Bernardo B.
AU - Mollinetti, Marco A.F.
AU - dos Santos, Eulanda M.
AU - Koerich, Alessandro L.
AU - da Silva Junior, Waldir S.
N1 - Publisher Copyright:
© The Author(s), under exclusive license to Springer Nature Switzerland AG 2025.
PY - 2025
Y1 - 2025
N2 - Image set representation by subspace methods has shown to be effective for several image processing tasks, such as classifying multiple images and videos. A subspace exploits the geometrical structure in which images are distributed, representing the image set with a fixed dimension giving more statistical robustness to input noise and compactness to the images. The mutual subspace method (MSM) and its extensions, the Orthogonal Mutual Subspace method (OMSM), and the Generalized Difference Subspace (GDS) are the most prominent subspace methods employed. However, these methods require solving a nonlinear optimization which lacks a closed-form solution. In this paper, we present a metaheuristic-based approach for discriminative subspace optimization. We develop a Genetic Algorithm (GA) for integrating OMSM and GDS discriminative subspaces. The initialization strategy and the genetic operators of the GA provide quality of objective function value of solutions and preserve their feasibility without any extra repair step. We validated our approach on four object recognition datasets. Results show that our optimization method outperforms related methods in accuracy and highlights the use of evolutionary algorithms for subspace optimization. Code: https://github.com/bernardo-gatto/Evolving_manifold.
AB - Image set representation by subspace methods has shown to be effective for several image processing tasks, such as classifying multiple images and videos. A subspace exploits the geometrical structure in which images are distributed, representing the image set with a fixed dimension giving more statistical robustness to input noise and compactness to the images. The mutual subspace method (MSM) and its extensions, the Orthogonal Mutual Subspace method (OMSM), and the Generalized Difference Subspace (GDS) are the most prominent subspace methods employed. However, these methods require solving a nonlinear optimization which lacks a closed-form solution. In this paper, we present a metaheuristic-based approach for discriminative subspace optimization. We develop a Genetic Algorithm (GA) for integrating OMSM and GDS discriminative subspaces. The initialization strategy and the genetic operators of the GA provide quality of objective function value of solutions and preserve their feasibility without any extra repair step. We validated our approach on four object recognition datasets. Results show that our optimization method outperforms related methods in accuracy and highlights the use of evolutionary algorithms for subspace optimization. Code: https://github.com/bernardo-gatto/Evolving_manifold.
KW - Discriminative Learning
KW - Genetic Algorithm
KW - Subspace representation
UR - https://www.scopus.com/pages/publications/85219167014
U2 - 10.1007/978-3-031-79029-4_5
DO - 10.1007/978-3-031-79029-4_5
M3 - Contribution to conference proceedings
AN - SCOPUS:85219167014
SN - 9783031790287
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 64
EP - 79
BT - Intelligent Systems - 34th Brazilian Conference, BRACIS 2024, Proceedings
A2 - Paes, Aline
A2 - Verri, Filipe A. N.
PB - Springer Science and Business Media Deutschland GmbH
T2 - 34th Brazilian Conference on Intelligent Systems, BRACIS 2024
Y2 - 17 November 2024 through 21 November 2024
ER -