Exact reproduction of colored images
β Scribed by Berthold K.P. Horn
- Book ID
- 103912727
- Publisher
- Elsevier Science
- Year
- 1983
- Weight
- 45 KB
- Volume
- 22
- Category
- Article
- ISSN
- 0734-189X
No coin nor oath required. For personal study only.
β¦ Synopsis
The problem of producing a colored image from a colored original is analyzed. Conditions are determined for the production of an image in which the colors cannot be distinguished from those in the original by a human observer. If the final image is produced by superposition of controlled amounts of colored lights, only a simple linear transform need be applied to the outputs of the image sensors to produce the control inputs required for the image generators. In systems which depend instead on control of the concentration or the fractional area covered by colored dyes, a more difficult computation is called for. This calculation may for practical purposes be expressed in table look-up form. The conditions for exact reproduction of colored images should prove useful in the design and analysis of image processing systems whose final output is intended for human viewing. Judging by the design of some existing systems, these rules are not generally known or adhered to. Modem computational techniques make it practical to tackle this problem now. Adherence to design constraints developed here is of particular importance where colors are to be judged when the original is not directly accessible to the observer as, for example, when it is on another planet.
NOTE
Image Contrast, Complexity, and Stability. ROBERT RICH. March 21.
π SIMILAR VOLUMES
To obtain better informed consent from patients in dentistry, the state of the disease and the treatment process are effectively presented by images, and more realistic hard copies are sought. In this research, we propose obtaining realistic output images by the addition of rendering in the CIE L \*
Let M k be a given set of k integers. Define Exact-M k -Colorability to be the problem of determining whether or not Ο(G), the chromatic number of a given graph G, equals one of the k elements of the set M k exactly. In 1987, Wagner [Theoret. Comput. Sci. 51 (1987) is the 2kth level of the Boolean