Mathematical Morphology in Any Color Space

Abstract

In this paper, a new graph-based ordering of color vectors is presented for mathematical morphology purposes. An attractive propoerty of the proposed ordering is its color space independence. A complete graph is defined over a filter window and its structure is analyzed to construct an ordering of color vectors by finding a Hamiltonian path in a two-step algorithm.