We investigate the problem of averaging values on lattices, and in particular on discrete product lattices. This problem arises in image processing when several color values given in RGB, HSL, or another coding scheme, need to be combined. We show how the arithmetic mean and the median can be constructed by minimizing appropriate penalties, and we discuss which of them coincide with the Cartesian product of the standard mean and median. We apply these functions in image processing. We present three algorithms for color image reduction based on minimizing penalty functions on discrete product lattices.
History
Journal
IEEE transactions on image processing
Volume
21
Issue
3
Pagination
1070 - 1083
Publisher
IEEE
Location
Piscataway, N. J.
ISSN
1057-7149
eISSN
1941-0042
Language
eng
Publication classification
C1 Refereed article in a scholarly journal; C Journal article