DocumentCode
2288323
Title
Solutions of several color matching problems using convex projection theory
Author
Yang, Yongyi ; Stark, Henry
Author_Institution
Dept. of Electr. & Comput. Eng., Illinois Inst. of Technol., Chicago, IL, USA
fYear
1994
fDate
13-16 Apr 1994
Firstpage
316
Abstract
Uses the method of projections onto convex sets (POCS) to solve several problems related to color matching. As is well known POCS is an iterative algorithm that projects onto a sequence of constraint sets and eventually produces a solution that satisfies all prior known constraints. Among the questions addressed are: (1) what is the smallest adjustment required of a given spectrum to produce color matching in a color sensitive visual system? and (2) what contributions of basis colors will produce a match to a particular set of measurements?
Keywords
colour vision; image sequences; spectral analysis; POCS; color matching problems; color sensitive visual system; convex projection theory; iterative algorithm; projections onto convex sets; sequence of constraint sets; smallest adjustment required; spectrum; Ear; Humans; Iterative algorithms; Particle measurements; Sensor systems; Visual system;
fLanguage
English
Publisher
ieee
Conference_Titel
Speech, Image Processing and Neural Networks, 1994. Proceedings, ISSIPNN '94., 1994 International Symposium on
Print_ISBN
0-7803-1865-X
Type
conf
DOI
10.1109/SIPNN.1994.344903
Filename
344903
Link To Document