Departmental Papers (ESE)

Document Type

Journal Article

Date of this Version

January 2000

Comments

Reprinted with permission of IS&T: The Society for Imaging Science and Technology sole copyright owners of NIP16: International Conference on Digital Printing Technologies Proceedings, 2000, pages 255-260.

NOTE: At the time of publication the author, Daniel Koditschek, was affiliated with the University of Michigan. Currently, he is a faculty member of the School of Engineering at the University of Pennsylvania.

Abstract

We propose the "minvar" algorithm for computing continuous, continuously invertible, piecewise linear (PL) approximations of color space transformations that can serve as functional replacements wherever look-up tables are presently used. After motivating the importance of invertible approximants in color space management applications, we review the parameterization and computational implementation of PL functions as representing one useful instance of this notion. Finally, we describe the present version of the minvar algorithm and compare the approximations it yields with standard industrial practice — interpolation of look-up table data.

Share

COinS
 

Date Posted: 28 March 2008

This document has been peer reviewed.