TL;DR: In this article, a human operator selects the reference colors most closely matching the adjustment colors, and the mapping parameters are determined from the operator's selections, by table look-up or by use of a mathematical formula.
Abstract: Parameters for mapping colors from an input system to an output system are determined by displaying a set of adjustment colors in the input system and outputting a reference color pattern in the output system. A human operator selects the reference colors most closely matching the adjustment colors. The mapping parameters are determined from the operator's selections, by table look-up or by use of a mathematical formula, for example. Accurate color mapping parameters can be generated in this way without the need for trial and error.
TL;DR: In this paper, a superposed colors graphic providing a true, continuous color fade transition between two different colors achieved by applying first and second color graphics onto respectively different side surfaces of at least one transparent substrate, each color graphic having a respective color fade.
Abstract: A superposed colors graphic providing a true, continuous color fade transition between two different colors achieved by applying first and second color graphics onto respectively different side surfaces of at least one transparent substrate, each color graphic having a respective color fade. The first and second color graphics are mutually aligned such that the color fade of each of the color graphics are mutually coextensive and superposed so as to thereby provide a continuous fade between the colors. The first and second color graphics may be applied to the respective substrate side surfaces by any suitable method, such as for example by silk screening, by lithography or by decorative film applique.
TL;DR: In this article, a system and method interpolates a full color image from an array of single color sensors, where each sensor measures a single color, e.g., red, green or blue.
Abstract: A system and method interpolates a full color image from an array of single color sensors. Each sensor measures a single color, e.g., red, green or blue. The measured color values are stored as an array of data. For each data element, a plurality, e.g., four, gradients are computed that specify the color and/or luminance difference along different linear paths extending through the data element. At least some of the gradients are computed using a first order color differential and a second order color or luminance differential along the selected path. One or more gradients are then selected based on a comparison of the gradients to a computed threshold. Using the data elements along the path of the selected gradient or gradients, the missing color values are interpolated. The interpolation algorithm also utilizes first and second order color differentials.
TL;DR: In this article, the authors proposed a pseudo-morphology based on reduced ordering of colors (associate a scalar to each color, order the scalars and impose their ranking to their corresponding colors).
Abstract: Mathematical morphology is based on two infimum- and respectively, supremum-commuting operations (the erosion and the dilation). In the scalar case, these operations are obviously the minimum and maximum. In the vector-valued case, minimum and maximum cannot be easily defined. Pixels within color images are described by three-component vectors, and thus the mathematical morphology is difficult to introduce for colors. We propose pseudo-morphology based on reduced ordering of colors (associate a scalar to each color, order the scalars and impose their ranking to their corresponding colors). The approach has been widely investigated, by proposing different scalars (usually the same scalars as used for distance-based color image filtering). We propose the use of scalars issued as geometrical shape invariants for a triangle-representation of colors.
TL;DR: In this article, a method for color bar codes includes selecting N bar code colors for a color bar code system to be generally distinct from each other given the range of colors that a camera reader is expected to produce given at least one environmental condition in which the camera reader was expected to operate.
Abstract: A method for color bar codes includes selecting N bar code colors for a color bar code system to be generally distinct from each other given the range of colors that a camera reader is expected to produce given at least one environmental condition in which the camera reader is expected to operate.
TL;DR: In this article, at least three chromatic colors and additional chromatic colours differing in hue from said three colors are used in combination to obtain a color which has almost uniform spectral reflectance over the entire region of wavelengths, thus it is possible to obtain printing which is less vulnerable to change in color under different light sources.
Abstract: Colors look differently when observed under sunlight and room light. At least three chromatic colors and additional chromatic colors differing in hue from said three colors are used in combination. The additional colors are those which have a spectral reflectance which smoothens waviness in the spectral reflectance curve of the nearly achromatic color produced by the combination of the three chromatic colors. As the result, the combination of the colors gives rise to a color which has almost uniform spectral reflectance over the entire region of wavelengths. Thus it is possible to obtain printing which is less vulnerable to change in color under different light sources.
TL;DR: This paper archives fast multi-level vector error diffusion by avoiding additional computation and produces visually pleasing halftone pattern by excluding noticeable primary colors.
Abstract: This paper proposes multi-level vector error diffusion based on adaptive primary color selection for fast and accurate color reproduction. Conventional bi-level vector error diffusion uses eight primary colors(R, G, B, C, M, Y, W, K). However, multi-level vector error diffusion uses more primary colors (this paper uses 64 primary colors) depending on the printing device, thereby significantly increasing the time complexity due to the additional increment of computation. Moreover, the output image can also include color artifacts that have a noticeable primary color under the influence of
large quantization error and increased primary color. Accordingly, to reduce these problems, we proposed the quantization process to decide a candidate primary among the 64 primary colors using lightness difference. First, we classified the 64 primary colors into 60 chromatic colors and 4 achromatic colors and then we exclude primary colors with the large lightness difference against the input color from a set of 60 chromatic primary colors. Using both 4 achromatic primary colors and a candidate primary colors, we calculated the vector norm to select output color. Also this paper determine optimal threshold experimentally to remove smear artifacts resulting from the diffusion of large quantization error. As a result, this paper archives fast multi-level vector error diffusion by avoiding additional computation and produces visually pleasing halftone pattern by excluding noticeable primary colors.
TL;DR: It is shown that relatively few sample colors are needed to produce a well-behaved interpolation in three-dimensional color spaces.
Abstract: With the proliferation of digital cameras, more consumers are faced with the problem of making color corrections to their pictures, while most picture editors allow some white point, or illuminant, correction and some enhancements, these methods work on the image, as a whole rather than on specific regions or colors. This work describes a simple method, that allows the user the ability to correct specific colors in specific locations in a picture. It is shown that relatively few sample colors are needed to produce a well-behaved interpolation in three-dimensional color spaces. A quantitative measure of performance is obtained by using the method to correct for illumination.
TL;DR: In this article, a method of detecting spatial gradient which is applied to an image region segmentation and boundary extraction system comprising a first step of simplifying each color information of an image signal, a second step of detecting said spatial gradient information for each simplified color information, a third step of multiplying an appropriate weighting value to each color gradient information, and a fourth step of obtaining a combined spatial gradient for each weighted colorgradient information.
Abstract: The present invention provides a method of detecting spatial gradient which is applied to an image region segmentation and boundary extraction system comprising a first step of simplifying each color information of an image signal; a second step of detecting said spatial gradient information for each simplified color information; a third step of multiplying an appropriate weighting value to each color gradient information; and a fourth step of obtaining a combined spatial gradient for each weighted color gradient information.
TL;DR: In this article, a digital calibration pattern with color patches is printed within the color space CMY by a printer and the pattern is evaluated in a so-called laboratory color space and a correspondence table is defined between the printer color spaces and a laboratory colour space.
Abstract: Calibration method in which a digital calibration pattern (11) with color patches (22) is printed within the color space CMY by a printer (2) The pattern is evaluated in a so-called laboratory color space and a correspondence table (13) defined between the printer color space and a laboratory color space To determine the colors in a laboratory color space the color patches are analyzed with a scanner in a defined reference colorimetric space, the colors are determined in this space and a transform from this space is defined as a laboratory space To implement a printer calibration a PC (1) is connected via a network to a calibration server (21)
TL;DR: In this paper, a first color surface for a first colour is displayed on a screen, and the second color surfaces for the second colors are then displayed on the screen and one of the second colour surfaces is then chosen.
Abstract: First color coordinates for a first color are entered. Colors are then selected with second color coordinates, which are similar with reference to the first color coordinates. A first color surface for a first color is displayed on a screen. Second color surfaces for the second colors are then displayed on the screen. One of the second color surfaces is then chosen. Independent claims are also included for the following: (1) a computer program product with program devices for carrying out the stages of the method of the present invention; (2) a computer system for running the method of the present invention.
TL;DR: In this article, the problem of providing print showing no artifact but giving highly qualified colors outside a whole range by producing a boundary of the whole range of colors minimizing image-quality artifact related to a DICS value outside the whole spectrum mapped on the boundary of a whole spectrum of colors.
Abstract: PROBLEM TO BE SOLVED: To provide print showing no artifact but giving highly qualified colors outside a whole range by producing a boundary of the whole range of colors minimizing image-quality artifact related to a DICS value outside the whole range mapped on the boundary of the whole range of colors. SOLUTION: A method of producing the boundary of the whole range of reduced colors for a color output device producing colors using 3 or more coloring agents has a front device model determining step for the color output device relating a control signal vector of the coloring agent to the corresponding output color, a boundary determining step of the whole complete color range for the output device of colors including one set of boundary points of the whole color range, and a determining step of one set of controlling signal vectors of coloring agents each as a candidate for each point in the boundary of the whole complete color range, and the amount of each coloring agent is controlled by the controlling signal vector of the coloring agent. The method has a selection of preferable controlling signal vector of the preferable coloring agent. COPYRIGHT: (C)2004,JPO&NCIPI
TL;DR: A method to merge multiple scans of a 3D object, which exhibit color variation in the overlapped regions, is presented, which attempts to recover the reflectance properties of the object from the color image of each view.
Abstract: A method to merge multiple scans of a 3D object, which exhibit color variation in the overlapped regions is presented in this paper. Our method attempts to recover the reflectance properties of the object from the color image of each view. Then we use the recovered reflectance properties to produce a more consistent color blending in the overlapped regions. The recovered reflectance properties can also be used to apply different lighting to the acquired 3D model. Our method differs from previous works by allowing the object colors to vary across the surfaces and by allowing each scan to have a different light source position.
TL;DR: This paper proposes a method of converting color business graphics to grayscale in a manner that preserves discriminability, and subjective experiments indicate that the proposed algorithms outperform standard color-to-grayscale conversions.
Abstract: Monochrome devices that receive color imagery must perform a conversion from color to grayscale. The most common approach is to calculate the luminance signal from the three color signals. The problem with this approach is that the distinction between two colors of similar luminance (but different hue) is lost. This can be a significant problem when rendering colors within graphical objects such as pie charts and bar charts, which are often chosen for maximum discriminability.
This paper proposes a method of converting color business graphics to grayscale in a manner that preserves discriminability. Colors are first sorted according to their original lightness values. They are then spaced equally in gray, or spaced according to their 3-D color difference from colors adjacent to them along the lightness dimension. This is most useful when maximum differentiability is desired in images containing a small number of colors, such as pie charts and bar graphs. Subjective experiments indicate that the proposed algorithms outperform standard color-to-grayscale conversions.