REDUCED PERMUTATION GROUP BY MEAN-BASED COLORING

Rastislav Lukáč - Stanislav Marchevský

    This paper is focused to the mean-based coloring of permutation group. The coloring is an equivalence relation applied to full permutation group. Simply, all equivalent elements, which are said to comprise an equivalence class, will be represented by a common color. Thus, the coloring information is used as the base for a quantization of permutation group and the reduced permutation group is obtained. The memory requirements are simplified and the reduced permutation group is useful for potential processing.

Keywords: coloring, permutation filters, permutation group, equivalence class

[full-paper]