Approximating Condorcet Ordering for Vector-valued Mathematical Morphology
Abstract
Mathematical morphology provides a nonlinear framework for image and spatial data processing and analysis. Although there have been many successful applications of mathematical morphology to vector-valued images, such as color and hyperspectral images, there is still no consensus on the most suitable vector ordering for constructing morphological operators. This paper addresses this issue by examining a reduced ordering approximating the Condorcet ranking derived from a set of vector orderings. Inspired by voting problems, the Condorcet ordering ranks elements from most to least voted, with voters representing different orderings. In this paper, we develop a machine learning approach that learns a reduced ordering that approximates the Condorcet ordering. Preliminary computational experiments confirm the effectiveness of learning the reduced mapping to define vector-valued morphological operators for color images.
Cite
@article{arxiv.2509.06577,
title = {Approximating Condorcet Ordering for Vector-valued Mathematical Morphology},
author = {Marcos Eduardo Valle and Santiago Velasco-Forero and Joao Batista Florindo and Gustavo Jesus Angulo},
journal= {arXiv preprint arXiv:2509.06577},
year = {2025}
}
Comments
Submitted to the 4th International Conference on Discrete Geometry and Mathematical Morphology (DGMM 2025)