JPS63309458A - Image processor - Google Patents

Abstract

PURPOSE:To prevent thoroughly a line on a joint part of images from occurrence, by a method wherein error data information of the joint part of the images is stored in memory, and the images are processed at the joint part of the images based on the error data information stored in the memory. CONSTITUTION:A line buffer for keeping bringing over errors from the 255th, 256th pixels of each line of a region (a) to be applied to the first and second pixels of a region (b) is provided. That is, when the region (b) is processed, the bringing over data of the region (a) is read from this line buffer, and is applied to the first and second pixels of each line of the region (b), and then is successively processed to form this method. Therefore, by using form of a diffusion matrix and by providing a line buffer for keeping the bringing over error from the pixel of the preceeding region to be applied to a pixel of an attention region, a line having been generated on the boundary between the regions can be thoroughly solved.

Description

DETAILED DESCRIPTION OF THE INVENTION [Description of the Field to which the Invention Pertains] The present invention relates to an image processing method in a device that performs digital image processing, such as a digital copying machine, an image scanner, a printer, and the like.

[Description of conventional technology]

Conventionally, laser beam printers (LBP) and ink printers
Many jet printers use a binary recording method of "printing or not" for recording dots.
In a copying device that applies this, in order to copy images with halftone density such as photographs and halftone originals, the halftone image data that has been read is used to reproduce the halftones in a pseudo manner using an image processing circuit. is being processed.

As one of these methods of pseudo-halftone processing, there is currently a widely used method (the so-called R-dither method).
There is.

This dither method has the advantage of being able to express the above-mentioned pseudo halftones at low cost because of its simple hardware configuration. However, this method also has the following drawbacks.

■ If the original is a halftone image such as a print, periodic striped patterns (moiré) occur in the copied image, degrading the image.

■ If the original contains line drawings, characters, etc., the reproducibility of the lines will be poor and the image will deteriorate.

To address the drawback of ■, smoothing processing (spatial filtering processing) is applied to the read halftone image data.
There are countermeasures against the drawback (2), such as edge enhancement processing, but in either case, it is impossible to obtain images with good reproducibility for all types of images such as photographs, halftone images, line drawings, and text. difficult.

In addition, such processing increases the circuit scale and complicates it, and the original advantages of the dither method are lost.

Against this background, there is a method called "error diffusion method" as a pseudo halftone processing method that has been attracting attention in recent years.

The error diffusion method is a method that is characterized by diffusing the density error during binarization to surrounding pixels and preserving the density.References include RoW Floyd and L.
Steinberg An Adaptive Al
gorithmfor 5patial Gray
5cale"SID 75 Digest.

There is no problem when this error diffusion method is applied to a copying machine that copies an image of the entire surface of a document using the scanning method shown in Figure 1-b. When this method is applied to a copying apparatus that copies an image of the entire surface of a document, the following problems arise.

In FIG. 1-a, the images of the area ``■'' and the area ``■'' are sequentially read in the order shown in the figure, and are sequentially processed by the error diffusion method. At this time, when the processing of the ■ area is finished and the process moves on to the next ■ area, the error in processing the ■ area will be lost.

In other words, since there is no carryover error of the ■ area, which is necessary when performing binarization from the first line of the ■ area, correct binarization of the ■ area cannot be performed, and the ■ area and the ■ area are It becomes discontinuous and a streak appears on the boundary.

Similarly, when performing binarization at the 255th and 256th pixels of each line in the ■ area, error information at the 1st and 2nd pixels on each line in the ■ area is required, and the areas where error information is insufficient (■
Correct binarization is not performed at the boundary between the area and the area (2), resulting in poor consistency and streaks on the boundary.

The cause of the occurrence of streaks at the boundaries of the processing areas will be explained in more detail with reference to FIG.

3 shown in Figure 2-a as a diffusion matrix for the error diffusion method.
Consider the case where an X5 diffusion matrix is used (the numbers represent examples of error distribution ratios).

In Figure 2-b, the number of pixels in each main scanning line is 25.
It is assumed that there are 6 pixels, and the second line in the sub-scanning direction of the 255th main-scanning pixel in the area ■ is described as a (255, 2).

First, a (255゜l
) Focus on pixels. As is clear from the diffusion matrix in Figure 2-a, the errors that occurred during the binarization of a (255, 1) are b (1, 1), b (1, 2), b (1,
3) Will be added to the pixel.

Also, if we pay attention to a (256,1) pixel, a (2
The error generated at 56°l) is b(1,1), b(1,
2), b (1, 3), b (2, 1), b (2, 2),
b(2,3) pixel. Thereafter, similarly, the errors occurring at the 255th and 256th pixels of each line in the ■ area are added to the 1.2nd pixels of each line in the ■ area.

Therefore, there is no problem when using the scanning method shown in FIG. 1-b, but when using the scanning method shown in FIG. 1-a, each line 1. The error that occurs when binarizing the 2nd pixel is not added as a necessary error when binarizing the 255th and 256th pixels of each line in the ■ area, and
Binarization of the 55,256th pixel cannot be performed correctly. Also, the error that occurs at the 255th and 256th pixel of each line in the ■ area needs to be added to the 1st and 2nd pixels of each line in the ■ area, so when processing is being performed in the ■ area, Unless the error information is retained, the binarization of the first and second pixels of each line in the area (2) will not be performed correctly.

As a result, streaks occur at the boundary between the ■ area and the ■ area.

[Object of the Invention] The present invention provides an image processing method for solving the problems of the prior art described above in image processing using the error/difference diffusion method or the minimum average error method, which is equivalent in principle. It is an object.

[Explanation of Examples]

First, the principle for solving the above problem will be explained using FIG.

When considering the shape of the diffusion matrix as shown in Figure 2-a, as mentioned in the explanation of the prior art, the error occurring at the 1.2 pixel of each line in the ■ area in Figure 2-b is It is necessary when binarizing the 255th and 256th pixels of each line, and if this error information is not available, each line 255 and 256 of the area ■
Binarization of the pixel is not performed correctly. Therefore, in order to correctly perform the binarization of the 255th and 256th pixels of each line in the ■ area, the shape of the diffusion matrix (Figure 3-a) must be adjusted so that the error generated in the ■ area is not added to the ■ area. I understand that I need to change it.

In the example of the shape of the diffusion matrix shown in FIG. 3-a, errors are not distributed to pixels in the direction opposite to the main scanning direction from the pixel of interest. Here, a 4×4 diffusion matrix is used, but any shape may be used as long as the shape of the diffusion matrix does not distribute errors to pixels in the opposite direction to the main scanning direction when viewed from the pixel of interest.

By creating the shape of the diffusion matrix as shown in Figure 3-a, the error occurring at the 1.2 pixel of each line in the rear area is not diffused into the region of interest, as shown in Figure 3-b.
Binarization of the 255th and 256th pixels of each line of the region of interest is correctly performed. Furthermore, when binarizing the 1.2nd pixel of each line in the rear region, it is only necessary to consider the error carried over from the region of interest to the rear region, which is better than when using the diffusion matrix shown in Figure 2-a. The processing circuit is also simpler than when using the diffusion matrix shown in Figure 2-a.
The "streaks" that occur at the boundaries between regions can be easily improved.

One way to eliminate this "streak" is to add the 25th pixel of each line of the ■ area to the 1st and 2nd pixels of each line of the ■ area.
It is conceivable to provide a line buffer that holds the carryover error from the 5,256th pixel. That is, when processing the ■ area, the carryover error data of the ■ area is read out from this line buffer, and each line 1 of the ■ area is processed.
, the second pixel and sequentially process them (this is the method).

Therefore, by using the shape of the diffusion matrix as shown in Figure 3-a and by providing a line buffer that holds the carryover error from the pixels of the previous region that is added to the pixels of the region of interest, it is possible to It is possible to completely eliminate the "streaks" that occur at the boundaries of regions.

Next, a more detailed explanation will be given based on a specific example to which the present invention is applied.

(Explanation of External Shape) FIG. 4 shows an external view of a digital color copying machine to which the present invention is applied.

The whole can be divided into two parts.

The upper part of Fig. 4 shows a color image scanner unit 1 (hereinafter abbreviated as scanner unit 1) that reads the original image and outputs digital color image data, and a color image scanner unit 1 built in the scanner unit 1 that reads the original image and outputs digital color image data. The controller section 2 performs image processing and has processing functions such as interface with external devices.

The scanner section 1 reads a three-dimensional object placed downward under the document presser 11, a sheet document, and also has a built-in mechanism for reading a large-sized sheet document.

Further, the operation section 10 is connected to the controller section 2, and is used to input various information regarding the copying machine. The controller section 2 instructs the scanner section 1 and the printer section 3 regarding operations according to the input information.

Further, when it is necessary to perform complicated editing processing, a digitizer or the like is attached in place of the document presser 11, and this is connected to the controller section 2, thereby making it possible to perform sophisticated processing.

The lower part of FIG. 4 is a printer section 3 for recording the color digital image signal outputted from the controller section 2 onto recording paper. In this embodiment, the blink part 3 is
This is a full color ink jet printer using a recording head of the ink jet recording method described in Publication No. 4-59936.

The two parts described above can be separated, and can be installed at separate locations by extending the connecting cable.

(Printer Section) FIG. 5 is a sectional view of the digital color copying machine shown in FIG. 4 viewed from the side.

First, an exposure lamp 14, a lens 15, and an image sensor 16 (in this embodiment, a CCD capable of reading line images in full color) are used to scan the original platen glass 1.
A document image placed on the document sheet 7, an image projected by a projector, or a sheet document image by the sheet feeding mechanism 12 is read. The scanned image undergoes various image processing in the scanner section 1.
After that, the controller section 2 prints the image, and then the printer section 3 records it on recording paper.

In FIG. 5, recording paper is stored in a paper feed cassette 20 that stores cut paper of small standard sizes (A4 to A3 size in this example) and large size (A2 to AI size in this example). It is supplied from a roll paper 29 for carrying out the process.

In addition, paper feeding from outside the apparatus (=manual paper feeding) is also possible by feeding recording paper one sheet at a time along the paper feeding unit cover 21 through the manual feeding port 22 shown in FIG.

The big up roller 24 is a roller for feeding cut sheets one by one from the paper feed cassette 20, and the fed cut sheets are conveyed to the 10th feed roller 26 by the cut paper feed roller 25. be done.

The roll paper 29 is sent out by a roll paper feed roller 30, cut into a standard length by a cutter 31, and then transferred to the paper feed number 10.
- It is conveyed to La 26.

Similarly, the recording paper input through the manual feed port 22 is conveyed to the paper feed roller 26 by the manual feed roller 32.

Pick up roller 24, cut paper feed roller 25
, the roll paper feed roller 30, the 10th paper feed roller 26, and the manual feed roller 32 are connected to a paper feed motor (not shown in the drawings, D
It is driven by a C servo motor (using a C servo motor), and can be turned on and off at any time by electromagnetic clutches attached to each roller.

When the printing operation is started in accordance with an instruction from the controller section 2, recording paper selectively fed from one of the above-mentioned paper feeding paths is conveyed to the paper feeding path 26. In order to eliminate the skew of the recording paper, after creating a predetermined amount of paper loops, the 10th paper feeder 26 is turned on and the recording paper is conveyed to the 20th paper feeder 27.

Between the 10th paper feed roller 26 and the 20th paper feed roller 27, a predetermined amount of paper is applied to the recording paper in order to perform an accurate paper feeding operation between the paper feed roller 28 and the 20th paper feed roller 27. Create a buffer. The buffer amount detection sensor 33 is a sensor for detecting the buffer amount. By creating a buffer in the middle of paper transport, it is possible to reduce the load on the paper feed roller 28 and paper feed roller 27, especially when transporting large-sized recording paper, allowing accurate paper feeding operation. become.

When printing with the recording head 37, the recording head 3
A scanning carriage 34 consisting of 7 etc. is a carriage.
The rail 36 is scanned back and forth by the scanning motor 35. In the forward scan, an image is printed on the recording paper, and in the backward scan, the recording paper is fed by a predetermined amount from the paper feed roller 28. At this time, while the drive system is detected by the buffer amount detection sensor 33 using the paper feed motor, control is performed so that the buffer amount is always a predetermined amount.

The printed recording paper is discharged to the paper discharge tray 23, and the printing operation is completed.

Next, the scanning carriage 3 and the invention will be described in detail using FIG.

In FIG. 6, a paper feed motor 40 is a drive source for intermittently feeding the recording paper, and a paper feed roller 28,
The 20th paper feeder 27 is driven via the 0-ra clutch 43.

The scanning motor 35 moves the scanning carriage 34 to the scanning belt 42.
This is a drive source for scanning in the directions of arrows A and H through the arrows. In this embodiment, since accurate paper feeding control is required, pulse motors are used for the paper feeding motor 40 and the scanning motor 35.

When the recording paper reaches paper feed number 20-27, paper feed number 20
-La clutch 43 and paper feed motor 40 are turned on, and the recording paper is conveyed over the platen 39 to the paper feed roller 28.

The recording paper is detected by a paper detection sensor 44 provided on the platen, and sensor information is used for position control, jam detection, etc.

When the recording paper reaches the paper feed roller 28, the paper feed number 20-
The clutch 43 and the paper feed motor 40 are turned off, and a suction operation (not shown) is performed from inside the platen 39 to bring the recording paper into close contact with the platen 39.

Prior to the image recording operation on recording paper, the scanning carriage 34 is moved to the position of the home position sensor 41,
Next, forward scanning is performed in the direction of arrow A, and cyan, C1, magenta, M1, yellow, and Y1 black inks are ejected from the recording head 37 from predetermined positions to record an image. After recording the image for a predetermined length, the scanning carriage 34 is stopped, and reverse scanning is started in the direction of arrow B to return the scanning carriage 34 to the position of the home position sensor 41.

During the backward scan, the paper is fed by the length recorded by the recording head 37 in the direction of arrow C by driving the paper feed roller 28 by the paper feed motor 40.

In this embodiment, the recording head 37 is an ink jet nozzle of the above-mentioned ink jet type, and uses four ink jet nozzles each having 256 nozzles assembled together.

Scanning carriage 34 is home position sensor 41
When it stops at the position detected by , the recording head 37 performs a recovery operation. This is a process for stable printing operation, and in order to prevent unevenness at the start of ejection caused by changes in the viscosity of the ink remaining in the nozzles of the print head 37, paper feed time, device The recording head 3 is adjusted according to pre-programmed conditions such as internal temperature and ejection time.
This is a process in which pressurizing operation to 7, idle ejection operation of ink, etc.

By repeating the operations described above, an image is recorded on the entire surface of the recording paper.

(Scanner Section) Next, the operation of the scanner section 1 will be explained using FIGS. 7 and 8.

FIG. 7 is a diagram for explaining the mechanical mechanism inside the scanner section 1.

The CCD unit 18 is a unit composed of a CCD 16, a lens 15, etc., and a main scanning motor 50 fixed on a rail 54, a pulley 51 . Pulley 52, wire 53
It moves on the rail 54 by a drive system in the main scanning direction consisting of the following, and reads the image on the document platen glass 17 in the main scanning direction. The light shielding plate 55 and the home position sensor 56 are used for position control when moving the CCD unit 18 to the main scanning home position in the correction area 68 in the figure.

The rail 54 rests on rails 65 and 69, and is equipped with a sub-scanning motor 60, pulleys 67, 68, 71, 76, and shafts 72 and 69.
73, and is moved by a drive system in the sub-scanning direction consisting of wires 66 and 70. The light shielding plate 57 and home position sensors 58 and 59 are used for sub-scanning in the book mode for reading originals such as books and three-dimensional objects placed on the document table glass 17, and in the sheet mode for sheet reading. It is used for position control when moving the rail 54 to the home position.

Sheet feed motor 61. Sheet feed rollers 74 and 75,
The pulleys 62 and 64 and the wire 63 are mechanisms for feeding the sheet original. This mechanism is located on the document table glass 17, and transports the sheet document placed face down to the sheet feed roller 7.
This is a mechanism for feeding a predetermined amount at a time of 4.75.

FIG. 8 is an explanatory diagram of the reading operation in book mode and sheet mode.

In the book mode, the CCD unit 18 is moved to the book mode home position (book mode HP) shown in the correction area 68 in FIG. Start reading the entire surface.

Prior to scanning the original, processing such as shading correction, black level correction, and color correction is performed in the correction area 68. Thereafter, scanning in the main scanning direction is started by the main scanning motor 50 in the direction of the illustrated arrow. When the reading operation of the area indicated by (2) is completed, the main scanning motor 50 is reversed and the sub-scanning motor 60 is driven to move the area (2) to the correction area 68 in the sub-scanning direction. Subsequently, similarly to the main scanning of the area (2), processing such as shading correction, black level correction, color correction, etc. is performed as necessary, and the reading operation of the area (2) is performed.

By repeating the above scanning, the entire areas ① to ② are read, and after completing the reading operation in the area ②, the COD unit 18 is returned to the book mode home position.

In this embodiment, the document platen glass 17 can read documents up to A2 size, so in reality it must be scanned many times, but in this explanation the operation will be simplified to make it easier to understand. ing.

In the seat mode, the COD unit 18 is moved to the seat mode home position (seat mode H) shown in the figure.
P), and repeatedly reads the sheet document in the area (3) while operating the sheet feed motor 61 intermittently, thereby reading the entire sheet document.

Prior to scanning the document, processing such as shading correction, black level correction, and color correction is performed in the correction area 68, and then scanning in the main scanning direction is started by the main scanning motor 50 in the direction of the arrow shown in the figure. When the forward scanning operation of the area (2) is completed, the main scanning motor 50 is reversed, and during this backward scanning, the sheet feed motor 61 is driven to move the sheet original by a predetermined amount in the sub-scanning direction. Subsequently, the same operation is repeated to read the entire sheet document.

Assuming that the reading operation described above is a same-size reading operation, the area that can be read by the COD unit 18 is actually a wide area as shown in FIG. this is,
This is because the digital color copying machine of this embodiment has a built-in magnification/reduction function. That is, as explained above (
This is because the area that can be recorded by the recording head 37 is fixed at 256 bits at a time, so when performing a 50% reduction operation, for example, image information of at least twice the area of 512 bits is required. be.

Further, the present scanner section 1 is capable of overlapping reading across a plurality of scanning areas.

(Overall Functional Block Description) Next, the functional blocks of the digital color copying machine of this embodiment will be described using FIG. 9.

Control unit 102. 111. A control circuit 121 controls the scanner section 1, controller section 2, and printer section 3, respectively, and is composed of a microcomputer, a program ROM, a data memory, a communication circuit, and the like.

The control units 102 to 111 and the control units 111 to 121 are connected by a communication line, and the control units 102 . A so-called master-slave control mode is adopted in which the controller 121 performs the operation.

When operating as a color copying machine, the control section 111 performs control operations in accordance with input instructions from the operation section IO and the digitizer 114.

The operation unit 10 uses, for example, a liquid crystal as a display unit and is equipped with a touch panel made of transparent electrodes on its surface, so that selection instructions such as color specifications and editing operation specifications can be made. This is the operation section. There are also operation-related keys, such as a key to start copying (start key), a key to stop copying (stop key), and a key to return the operating mode to the standard state (stop key).
Frequently used keys, such as the reset key), are provided separately.

The digitizer 114 is used to input position information indicating a processing area for trimming, masking processing, color conversion, etc., and is connected as an option when complex editing processing is required.

The control unit 111 also controls a control circuit (=I/F control unit 112) of a general-purpose parallel interface such as IEEE-488, so-called GP-IB interface, and transfers image data between external devices. Input/output and remote control by external devices can be performed via this interface.

Further, the control unit 111 also controls a multi-value synthesis unit 106, an image processing unit 107, a binarization processing unit 108, a binary synthesis unit 109, and a buffer memory 110, which perform various processes related to images.

The control unit 102 controls a mechanical drive unit 105 that controls the drive of the mechanism of the scanner unit l described above, an exposure control unit 103 that controls the exposure of a lamp when reading a reflective original, and a halogen lamp when using a projector. The exposure controller 104 controls the exposure control section 90. In addition, the control unit 1
02 also controls the analog signal processing section 100 and the input image processing section 101, which perform various processes related to images.

The control unit 121 includes a mechanical drive unit 105 that controls the drive of the mechanism of the printer unit 3 described above, and a mechanism that absorbs time variations in the mechanical operation of the printer unit 3 and compensates for delays due to the mechanical arrangement of the recording heads 117 to 120. The synchronization delay memory 115 is controlled to carry out the synchronization.

Next, the image processing block shown in FIG. 9 will be further explained in detail along the flow of the image.

The image formed on the CCD 16 is converted into an analog electrical signal by the CCD 16. The converted image information is
The signals are serially processed in the order of red → green → blue and input to the analog signal processing section 100.

The analog signal processing section 100 performs sample-and-hold, dark level correction, dynamic range control, etc. for each color of red, green, and blue, and then performs analog-to-digital conversion (A/D conversion) and serial multi-color signal processing. value (in this example,
The digital image signal is converted into a digital image signal (8 bits long for each color) and output to the input image processing unit IO1.

The human image processing unit 101 similarly performs correction processing necessary in the reading system, such as shading correction, color correction, and γ correction, on the serial multivalued digital image signal.

The multi-value synthesis section 106 of the controller section 2 is connected to the scanner section l.
This is a circuit block that performs selection and synthesis processing of a serial multi-value digital image signal sent from a serial multi-value digital image signal and a serial multi-value digital image signal sent via a parallel I/F. The selectively combined image data is sent to the image processing unit 107 as a serial multi-level digital image signal.

The image processing unit 107 performs edge enhancement, black extraction, and UCR.

This circuit performs masking processing and the like for color correction of recording ink used in the recording heads 117 to 120.

The serial multilevel digital image signal output is input to the binarization processing section 10B and the buffer memory 110, respectively.

The binarization processing unit lO8 is a circuit for binarizing a serial multi-level digital image signal to which an error diffusion method is applied. Here, the serial multi-value digital image signal is converted into a four-color binary parallel image signal.

Image data of four colors is sent to the binary synthesis unit 109 and image data of three colors is sent to the buffer memory 110.

The binary synthesis unit 109 combines the three-color binary parallel image signals sent from the buffer memory 110 with the binarization processing unit 1.
This is a circuit for selecting and combining four-color binary parallel image signals sent from 08 to produce four-color binary parallel image signals.

The buffer memory 110 is a buffer memory for inputting and outputting multivalued images and binary images via a parallel I/F.

The synchronization delay memory 115 of the printer section 3
Absorption of time variations in mechanical operation and recording head 117~
This is a circuit for correcting the delay due to the mechanical arrangement of the recording heads 117 to 120, and internally also generates the timing necessary for driving the recording heads 117 to 120.

The head driver 116 drives the recording heads 117 to 120.
This is an analog drive circuit for driving the recording heads 117 to 120, and internally generates signals that can directly drive the recording heads 117 to 120.

The recording heads 117 to 120 respectively eject cyan C1 magenta M1 yellow Y1 black ink to record an image on recording paper.

(Example of Timing Signal) FIG. 10 is an explanatory diagram of the timing of images between the circuit blocks described in FIG. 9.

Signal BVE is a signal indicating the image valid section for each scan in the main scanning reading operation explained in FIG. Signal B
Full-screen image output is performed by outputting VE multiple times.

The signal VE is a signal indicating the valid section of the image read by the CCD 16 for every l line. Only the signal VE is valid when the signal BVE is valid.

Signal VCK is a clock signal for sending out image data VD. Signal BVE and signal VE also change in synchronization with this signal VCK.

The signal H3 is a signal used when the valid and invalid sections are repeated discontinuously while the signal VE outputs one line.
If the signal VE is continuously valid while outputting one line, it is an unnecessary signal. This is a signal indicating the start of one line of image output.

(Specific Example of Circuit Configuration of Image Processing Unit 107) Next, a specific example of the circuit configuration of the image processing unit 107 will be further explained with reference to FIG.

The color conversion circuit 201 converts the sequential three-color multi-value image information (cyan C1 magenta M1 yellow Y) sent from the multi-value synthesis unit 106 to other colors specified by the digitizer 114 or the like. This is a circuit for electrically converting colors. By passing through this circuit, a specific color of the original (for example,
It becomes possible to convert the fabric color, etc. in a design image to any color.

Serial/parallel signal conversion circuit (sp conversion circuit) 2
03 is a circuit for separating color-sequential three-color multi-value image information for each color for color processing in the masking circuit 204 at the next stage.

The masking circuit 204 is a circuit for correcting input color information and color information in consideration of color reproducibility at the link section. Specifically, it is a circuit that performs arithmetic processing as shown in the following formula.

YMC: Input data Y'M'C': Output data all ~
C33: The correction coefficient black extraction circuit 202 is a circuit for calculating and extracting a black component (black K) from color-sequential three-color multi-value image information.

The color component data having the lowest density value among cyan C1 magenta M1 yellow Y is calculated and extracted as a black component.

The background removal circuit (UCR circuit) 205 is the black extraction circuit 20
The black components and cyan C1 magenta M1 extracted in step 2
Calculation is performed with each component of yellow Y, and processing is performed to improve color reproducibility. By passing through this circuit, color sequential 3
Color multi-value image information (cyan C1 magenta M1 yellow Y
) are four colors in sequence (cyan C1 magenta M1 yellow Y
1 black K).

The background removal circuit 205 may perform gamma correction and image data value offset processing as necessary.

The edge enhancement circuit 206 is a circuit that extracts edge components for each color and performs addition and subtraction on the original image data. It is inserted to improve the reproducibility of fine lines and reproduce images with sharpness. For example, edge components are extracted by 3×3 calculation matrix processing as shown in the following equation.

The block processing circuit 207 is a circuit for reducing the unique striped pattern that occurs in the image, especially in the highlight portion, when the error diffusion method is applied.

The image data processed by the block processing circuit 207 is binarized by the binarization processing unit 108 using an error diffusion method.

This block processing circuit 207 is a circuit for the purpose of erasing band-like striped patterns that occur in highlight areas near areas where the density changes rapidly. For example, an image is divided into blocks like a 4×4 matrix, and a predetermined algorithm is used to detect whether a corresponding block is a highlighted portion. If the corresponding block is a highlighted area, by concentrating the pixel density in the block on a specific pixel and creating pseudo halftone dots, the printing dots are prevented from concentrating, and the generated pattern becomes a band-like striped pattern. to prevent

Next, using FIG. 12, this block processing circuit 20
A specific circuit configuration example of No. 7 will be explained.

Maximum value detection circuit 210. The minimum value detection circuit 211 has 4×
This is a circuit for detecting the maximum density value Dmax% and the minimum density value Dmin, respectively, in pixels divided into blocks like 4 matrices.

The sum calculation circuit 212 is a circuit that similarly calculates the sum D sum of the density values of the blocks of pixels.

Based on the maximum density value D max % minimum density value D min + total sum D sum, the determination circuit 213 performs determination processing according to the following conditions.

D 5urn < D const+ (= constant) D
max D min< D const2 (=
constant) When both conditions are satisfied, the halftone processing circuit 215
performs pseudo halftone processing on pixels within the block. If the condition is not met, the image data is passed through.

The delay circuit 214 is a line buffer that delays pixels while the above-mentioned determination process is performed. For example, when blocks are formed like a 4×4 matrix, it is sufficient to have a buffer amount for 4 lines.

In the halftone processing circuit 215, when the above conditions are met,
The following processing is performed on pixels within the block. In this case, the block is assumed to be a 4×4 matrix.

Block A Block B #: Pixel whose density is reduced by a degree *: Pixel whose density is concentrated In order to save all the density data in the block, reduce the density of the # pixel to 1/n, and apply the density to the * pixel by that amount. Make sure to put it on. Since the density data is saved, the advantages of the error diffusion method are not lost through this process.

Concentration distribution and processing blocks also increase the stages of the above judgment,
This may be done in detail.

Alternatively, the blocks may be changed for each color, such as block A1 block B, so that the dots of each color do not overlap.

In other words, there is a high probability that a dot will be struck on a pixel on which density is applied (
Therefore, by changing the processing blocks like A and B, the density concentration points are different, so the probability that dots of each color will be hit in the same place is low.

By performing such block processing, the printed dots can be dispersed, and it is possible to prevent the occurrence of band-like striped patterns that occur in highlighted areas near the areas where the density changes rapidly.

Next, a specific example of the circuit configuration of the binarization processing section 108 will be described in the first section.
This will be explained using Figure 3-a and Figure 13-b.

Here, the image data is a two-dimensional array, and the first image data in the main scanning direction and the first image data in the sub-scanning direction are D +,
Let it be expressed as j.

FIG. 13-b is an error distribution matrix diagram, in which 15 pieces of error data are binarized for arbitrary image data Di (target pixel) input to the binarization processing unit 108 at a certain ratio. FIG. 4 is a diagram showing the state of the error when the error data is divided into error data and distributed to surrounding pixels. i and l of each error data indicate errors occurring in image data D + and j.

In other words, in this binarization process, errors are accumulated by sequentially shifting the matrix shown in Figure 13-b one pixel at a time in the main scanning direction, and the total error distributed from multiple pixels is The result of addition with the image data input as the pixel of interest is binarized into rows.

FIG. 13-a is a circuit diagram showing the circuit configuration of the binarization processing section of this embodiment.

In FIG. 13-a, 301 to 312 are delay units consisting of four stages of flip-flops, which perform color sequential (cyan, cyan,
In order to process image data for each color (magenta, yellow, black), each delay section delays data by four clocks to delay one pixel.

313 to 327 are adders. The adders 313 to 326 add and subtract error data to each other in order to perform error calculations in the error diffusion matrix, and the adder 327 adds and subtracts error data and error data that is the result of error calculations in the error diffusion matrix. It adds and subtracts input image data.

328 to 330 are, for example, FiFo (first
This is a line memory using an in-first-out) memory, which stores the error calculation results for each line.
Perform a minute delay.

Reference numeral 331 denotes an error distribution unit consisting of a ROM (read only memory); 332 a comparator that compares the calculation results of the error data and image data with a set threshold;
33 is a gate circuit that performs gate processing on output data. 334 is a connection error memory for storing error data of the connection portions of images.

Next, the operation shown in FIG. 13-a will be explained.

The image data input to the binarization processing unit 10B is first
Error data output from delay section 312 and adder 327
After being added in , it is input to the error distribution section 331 . The error allocation unit 331 outputs error data (a+b+C+L eif, g) calculated according to a preset allocation ratio using a look-up table in the ROM. Further, the output of the adder 327 is compared with a preset threshold value by a comparator 332, and a binary output of 1 or O is performed. The binarized output of the comparator 332 is sent to the gate section 33
3 and outputs only the necessary pixel bones.

Here, the error distribution unit 331 for the image data Di,i
The error data output from a+, 1. b+, 1.
Ci, ++d1.1. ei, i, f+, ++ g
l, j, error data g1. .

is delayed by four colors in the delay unit 301, and then the image data D
+++, error data of the same color occurring in the I pixel g l+
1. i and an adder 313.

Thereafter, after being similarly processed as 302.314.303.315, the output of the adder 315 is sent to the line memory section 32.
8 is input. The stored error addition data is delayed by l lines in the line memory section 328 and then outputted again. The read error addition data is input to the adder 316.

Thereafter, similarly 304.317.305.318.306
At 319, error data caused by other pixel data are sequentially added, and at the adder 319, the image data D++3. I
Error data generated in ll C++3. After ++1 is added, it is input to the line memory section 329. The error data output from the line memory section 329 is sent to the adder 32
0, and thereafter 307.321.308.
After being processed at 322, 309 and 323 and having error data added thereto at an adder 323, it is input to a line memory unit 330.

The error data output from the line memory section 330 is 3
After the error data is added at 24, 310, 325, 311 and 326, it is added to the image data at an adder 327. Next, the result of addition of the error data and the image data is input to the error distribution section 331 and the comparator 332.

The above-described processing can be expressed as the following equation using the input image data DI, H as an example.

D D +, 1 = DLl 10g+-3, I-30g+-2, I-3+f+-+,
)-s +e+, 4-3+g+-3, 1-20e+-
2,1-2+d+-+, i-2+c+, i-2+
f+-3,j-+ +d+-2,4-1+b+-+,
I-+ +a+, 1-++e+-3, 1+c+-z,
j+a+-+, jDD: Data after calculation D: Image data I Pixel number in the second line (by color) I Second line number Next, the circuit operation will be explained using the timing chart of FIG. This figure shows a timing chart for a single color case to make it easier to understand the operation. In actual timing, the number of pixels is equal to the number of colors, that is, 4 colors=4 times as many.

A plurality of lines of image data can be obtained by one scan of the COD unit 18 of the scanner section 1 described above.

Now, when processing the region of interest shown in Figure 3-b, in the first scan, the SW is switched at the timing of control B shown in Figure 14.
I and each line 257 in the rear region of FIG. 3-b.
Error data to be added to the 258th, 258th, and 259th image data (corresponding to the 1st, 2nd, and 3rd in the rear area) are stored from the delay unit 312 in the splicing error memory unit 334. Ru.

These error data are read out from the splicing error memory section 334 in synchronization with the first, second, and third image data of the corresponding lines among the plurality of lines obtained in the next scan. That is, at the timing of control A shown in FIG. 14, SW2 is connected to the connection error memory 334 side. The read error data is sent to the adder 327 by SW2, and after being added to the corresponding image data,
The signal is sent to an error allocation section 331 and a comparator 332, where it is subjected to error allocation and binarization processing. Next, the 257th and 258th in the posterior area.
The error data to be added to the 259th and 259th image data (corresponding to the 1st, 2nd, and 3rd pixels of the area next to the rear area) is the same as in the first scan described above. is stored in the connection error memory 334 via SWI.

Thereafter, according to the timing shown in FIG. 14, the error data of the joint portion is similarly written to and read from the joint error memory section 334.

As described above, by storing the error information at the joint portion, an image output completely free of seam lines can be obtained as described above.

In this embodiment, table conversion using a ROM is used in the error allocation section 331, but it goes without saying that a RAM, a multiplier, etc. may also be used.

[Other possible embodiments]

FIGS. 15 to 17 are diagrams showing other examples of image output that require image connection information when the error diffusion method is applied.

FIG. 15 shows an example in which, in the copying apparatus described above, the enlargement ratio is set to a large value, and the original image is divided into four parts and output on the roll paper 29.

In this example, in addition to the image connection part explained above, 1, 2,
In the portions indicated by broken lines in each of the output images 3 and 4, new image connection information is required.

FIG. 16 shows that when cut paper is used in the copying machine described above, or when cut paper is similarly used in a copying machine using a printer such as LBP, one document is printed on printed paper. This is an example of enlarging continuous shooting into four images.

In this example, a portion requiring new image connection information occurs in the portions indicated by broken lines in images 1, 2, 3, and 4 of the original. That is, in the case of printed paper, the edges where images are in contact require image connection information.

FIG. 17 is an example showing where images are joined when images are combined in the copying apparatus described above.

This is an example in which copying is performed on print paper as shown in the figure, in which the document area indicated by A-B is scaled. In this case, AI, Bl, A
2. If copies are made in the order of B2, an image connection will occur at the boundary shown by the broken line on the printed paper. However, in this example, unlike the above example, AI, Bl
, A2. In order to copy like B2, it is necessary to separately manage information on image connections at the boundary between AI and A2, and at the boundary between Bl and B2.

In all of the examples shown in Figures 15 to 17, it can be seen that the problem of image joining when applying the error diffusion method can be solved by storing the error data of the joint part of the images in memory and processing it every other month. .

[Explanation of effects]

As explained above, by using the present invention, the error data generated during image processing at the joint part of the image is stored in the memory, and the joint part is processed based on the error data. It is now possible to completely prevent the appearance of streaks at the seams.

[Brief explanation of the drawing]

FIG. 1-a and FIG. 1-b are diagrams showing an example of image processing for explaining the problem to be solved by the present invention. FIG. 2-a and FIG. 2-b are diagrams for explaining in detail the problems to be solved by the present invention. Figures 3-a and 3-b are diagrams for explaining the present invention in detail. FIG. 4 is an external view of a digital color copying machine to which the present invention is applied. FIG. 5 is a sectional view from the side of the digital color copying machine shown in FIG. FIG. 6 is a detailed explanatory diagram of the scanning carriage 3 and the invention. FIG. 7 is a diagram for explaining the mechanical mechanism inside the scanner section 1. FIG. 8 is an explanatory diagram of reading operation in book mode and sheet mode. FIG. 9 is an explanatory diagram of functional blocks of a digital color copying machine to which the present invention is applied. FIG. 10 is a diagram showing an example of an image timing chart. FIG. 11 is a diagram showing an example of a specific circuit configuration block of the image processing unit 107. FIG. 12 is a diagram showing an example of a specific circuit configuration block of the block processing circuit 207. FIG. 13-a is a concrete circuit configuration block diagram of the binarization processing section 108. FIG. 13-b is a diagram showing an error diffusion matrix. FIG. 14 is a diagram showing an example of a specific timing chart of the binarization processing unit 108. FIG. 15, FIG. 16, and FIG. 17 are diagrams showing examples of image output requiring image connection information. Electron ratio E direction No. H-α Fig. t-b Fig. 5 drawing n drawing (t-i”L9 J Out p≠7 -11z E (■■K) = X country αD drawing -1

Claims (1)

[Claims] In an image processing method that reproduces an image by distributing error data generated during image processing to peripheral pixels, error data information of the joint part of the image is stored in a memory, and the memory is used for the joint part of the image. An image processing method characterized by processing an image based on error data information stored in the image processing method.