Method for lowering black content in digital image

A digital image, black technology, applied in the field of reducing the black content in digital images, can solve problems such as top-heavy images

Inactive Publication Date: 2011-06-29
杨国屏
View PDF4 Cites 0 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

The image will also be removed due to the K value (dark part) of the original im

Method used

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
View more

Image

Smart Image Click on the blue labels to locate them in the text.
Viewing Examples
Smart Image
  • Method for lowering black content in digital image
  • Method for lowering black content in digital image
  • Method for lowering black content in digital image

Examples

Experimental program
Comparison scheme
Effect test

no. 1 example

[0101] please see Figure 10 The original pixel 31a corresponds to four pixels 41j~41n to be converted, and its color information can be found in Figure 11 example.

[0102] The color information of the 2 pixels to be transformed in 41j and 41n is: R=F and G=F, and B is equal to the B value of the original pixel 31a;

[0103] The color information of the two pixels 41k and 41m to be converted is: B=F, and the R value and G value are equal to the R value and G value of the original pixel 31a.

[0104] That is, for the RGB value of the original pixel 31a, two of the to-be-transformed pixels present the B value of the original pixel 31a, and the other two to-be-converted pixels present the R and G values ​​of the original pixel 31a. Since at least one color information of each of the pixels 41j-41n to be converted has a full value (equal to F), there will be no K value when printing (the printer will convert to CMYK system). Figure 11 The embodiment is to ensure that the K valu

no. 2 example

[0108] please see Figure 10 The original pixel 31a corresponds to four pixels 41j~41n to be converted, and its color information can be found in Figure 12 example.

[0109] The color information of the two pixels to be transformed in 41j and 41n is: G=F and B=F, and R is equal to the R value of the original pixel 31a;

[0110] The color information of the two pixels 41k and 41m to be transformed is: R=F, and the G value and B value are equal to the G value and B value of the original pixel 31a.

[0111] That is, for the RGB value of the original pixel 31a, the two to-be-transformed pixels present the R value of the original pixel 31a, while the other two to-be-converted pixels present the G and B values ​​of the original pixel 31a. Since at least one color information of each of the pixels 41j-41n to be converted is full (equal to F), no K value will appear when printing (the printer will convert to CMYK system). Figure 12 The embodiment is to ensure that the K value is rem

no. 3 example

[0115] please see Figure 10 The original pixel 31a corresponds to four pixels to be converted 41j~41n, and its color information can be found in Figure 13 example.

[0116] The color information of the 2 pixels to be transformed in 41j and 41n is: B=F and R=F, and R is equal to the G value of the original pixel 31a;

[0117] The color information of the two pixels 41k and 41m to be transformed is: G=F, and the B value and R value are equal to the B value and R value of the original pixel 31a.

[0118] That is, for the RGB value of the original pixel 31a, the G value of the original pixel 31a is represented by the two pixels to be converted, and the B value and R value of the original pixel 31a are represented by the other two pixels to be converted. Since at least one color information in each of the pixels 41j-41n to be converted is full (equal to F), there will be no K value when printing (the printer will convert to CMYK system). Figure 12 The embodiment is to ensure that

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to view more

PUM

No PUM Login to view more

Abstract

The invention discloses a method for lowering black content in a digital image, which is characterized in that an original digital image is processed into the digital image with low black content or with no black. In the method, pixel content is mainly improved by 4 or 9 times, the color information of the pixel is changed to eliminate black or lower the black content.

Description

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to view more

Claims

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to view more

Application Information

Patent Timeline
no application Login to view more
Owner 杨国屏
Who we serve
  • R&D Engineer
  • R&D Manager
  • IP Professional
Why Eureka
  • Industry Leading Data Capabilities
  • Powerful AI technology
  • Patent DNA Extraction
Social media
Try Eureka
PatSnap group products