Image data processing apparatus having line memory

Description

CROSS REFERENCE TO RELATED APPLICATIONS
This application claims priority benefits under 35 USC .sctn.119 of Japanese Patent Application Serial Nos. 209650/1992, 209674/1992 and 209675/1992, filed on Jul. 13, 1992, the disclosures of which are incorporated herein by reference.
BACKGROUND OF THE INVENTION
1. Field of the Invention
The present invention relates to an image data processing apparatus used in, for example, a facsimile or an image, scanner. More specifically, the present invention relates to an image data processing apparatus suitably applied so as to perform filtering processing utilizing the correlation of data between read lines and isolated point removal processing for removing a white pixel and a black pixel which are isolated in a binary image. In addition, the present invention relates to an image data processing apparatus suitably applied so as to perform so-called error diffusion processing for reproducing a halftone with respect to multivalued density data optically read.
2. Description of the Related Art
In, for example, a facsimile, data read by an image sensor is subjected to so-called filtering processing for emphasizing a binary image. Such filtering processing is performed by paying attention to a pixel and referring to data corresponding to pixels in the vicinity of the pixel paid attention to.
In order to perform the filtering processing, a line memory capable of storing data corresponding to pixels whose number is three times the number of pixels constituting a line read by the image sensor is used. That is, data corresponding to three lines can be stored in this line memory.
Data corresponding to a line including a target pixel, and lines ahead of and behind the line are written to this line memory. The target pixel is subjected to processing on the basis of each of the data corresponding to pixels arranged in a matrix with 3.times.3 pixels centered with respect to the target pixel. That is, the data corresponding to the target pixel and the data corresponding to the pixels having predetermined positional relationships with the pixel paid attention to are subjected to a predetermined operation, and the data corresponding to the target pixel is subjected to processing such as emphasis processing on the basis of the result of the operation.
This emphasis processing is processing for so increasing or decreasing data that white and black colors clearly appear with respect to a binary image. In the above described filtering processing, therefore, an image portion which is judged to be a halftone image, for example, is not subjected to the emphasis processing.
In the above described filtering processing, a line memory corresponding to three lines for creating a matrix with 3.times.3 pixels centered with respect to a target pixel is used. In addition, a line memory corresponding to a plurality of lines is generally required for processing performed on the basis of the correlation between adjacent lines, for example, not only the above described filtering processing but also isolated point removal processing as described later. In this case, if a matrix with N.times.N pixels must be created, a memory corresponding to N lines is generally used.
From the viewpoint of the effective utilization of storage areas in a memory device provided for a facsimile or the like, however, it is desirable to reduce the capacity of a line memory required for filtering processing, isolated point removal processing and the like. In addition, if a memory device having a small storage capacity can be used by reducing the capacity of the line memory, the cost can be also reduced. Consequently, the reduction of the capacity of the line memory required for filtering processing or the like is an indispensable subject.
On the other hand, in the facsimile or the like, density data for each of pixels constituting an image optically read is binary-coded, thereby to generate a binary image. In this binary image, a phenomenon that a pixel to be inherently a white pixel is a block pixel or the reverse phenomenon occurs due to, for example, the nonuniformity in conveyance of a document. Therefore, a technique for rejudging whether a target pixel is white or black depending on the shape of a black-and-white distribution of a group of pixels in the vicinity of the target pixel to perform isolated point removal processing using a value obtained by the rejudgment as binary data corresponding to the target pixel, has been conventionally known.
Such a technique is disclosed in, for example, Japanese Patent Publication No. 59513/1987. In this official gazette, a technique for eliminating the effect of jitter such as the nonuniformity in rotation or vibration of a reading device is disclosed. Specifically, even when a document image is a linear image perpendicular to the main scanning direction P as shown in FIG. 39 (a), a projected portion denoted by reference numeral 161 occurs in a read image shown in FIG. 39 (b) due to the effect of jitter.
This projected portion is shown in an enlarged manner in FIG. 40. Specifically, the projected portion due to the jitter is constituted by a pixel 162 projected along the main scanning direction P at the time of reading a document. This pixel 162 has no continuous pixels in a direction at right angles to the main scanning direction P, that is, is isolated in the direction at right angles to the main scanning direction P.
In a case where an image portion shown in FIG. 41 (a) or FIG. 42 (a) exists in a read image, therefore, if the image portion is converted into an image shown in FIG. 41 (b) or FIG. 42 (b), it is possible to prevent the degradation of the image due to the above described jitter.
Referring to FIG. 43, such conversion of the image can be made by rejudging a value of a target pixel X on the basis of the values of pixels a1, a2, a3, b1, X, b3, c1, c2 and c3 constituting a matrix with 3.times.3 pixels centered with respect to the target pixel X. Specifically, in a case where the target pixel X is a black pixel, if the pixels a1, a2, b1, c1 and c2 are all white pixels, the value of the target pixel X is so inverted that the target pixel X becomes a white pixel. Consequently, the conversion shown in FIG. 41 can be made. On the other hand, in a case where the target pixel X is a white pixel, if the pixels a1, a2, b1, c1 and c2 are all black pixels, the value of the target pixel X is so inverted that the target pixel X becomes a black pixel. Consequently, the conversion shown in FIG. 42 can be made.
Such processing is performed by the construction shown in FIG. 44. A video signal representing a binary image is inputted to a correlation judging circuit 180 through registers 171 and 172 capable of respectively holding a signal corresponding to one pixel. A signal from the register 172 is further applied to a shift register 173 for delaying a signal by one line. A signal from the shift register 173 is applied to the correction judging circuit 180 through registers 174 and 175. In addition, a signal from the register 175 is inputted to the correlation judging circuit 180 from registers 177 and 178 through a shift register 176 for delaying a signal by one line.
An input video signal and respective output signals of the registers 171 to 173 and 175 to 178 are applied to the correlation judging circuit 180, and the signals respectively have the following one-to-one correspondence with pixels constituting a matrix with 3.times.3 pixels shown in FIG. 43:
input video signal . . . pixel c3
register 171 . . . pixel c2
register 172 . . . pixel c1
shift register 173 . . . pixel b3
register 175 . . . pixel b1
shift register 176 . . . pixel a3
register 177 . . . pixel a2
register 178 . . . pixel a1
Furthermore, an output signal of the register 174 corresponds to the target pixel X. The output signal of this register 174 is applied to a register 179 from a line 181.
Based on input signals corresponding to eight pixels, the correlation judging circuit 180 applies a signal X1 to the register 179 when signals corresponding to the eight pixels a1, a2, a3, b1, b3, c1, c2 and c3 surrounding the target pixel X are in the state shown in FIG. 41 (a), while applying a signal X2 to the register 179 when they are in the state shown in FIG. 42 (a). This register 179 outputs a signal corresponding to a white pixel when the signal X1 is applied, while outputting a signal corresponding to a black pixel when the signal X2 is applied. In such a manner, the target pixel X is subjected to correction, thereby to realize conversion shown in FIG. 41 and conversion shown in FIG. 42.
However, the above described prior art has for its object to correct an isolated pixel caused by jitter. Therefore, it is impossible to remove an isolate pixel caused by the other cause. Specifically, when the value of a target pixel (indicated by a sign "*") differs from the values of eight pixels around the target pixel, as shown in FIG. 27, due to, for example, dirt on the surface of a document, the value of this target pixel is not inverted. The prior art does not thus cover all such correlations as to invert the values of pixels, so that an isolated pixel in a binary image cannot be completely removed.
In a state where the isolated pixel remains, compression efficiency in compression coding processing performed in, for example, a facsimile is reduced, so that the amounts of codes are uselessly increased. Therefore, time required for communication becomes long. When a chargeable communication line is used, the communication cost rises.
On the other hand, in the above described prior art, the shift registers 173 and 176 for delaying a signal by one line are specifically used so as to prepare a matrix with 3.times.3 pixels on the basis of signals inputted in accordance with the order of scanning at the time of reading. Therefore, the construction becomes complicated and the cost rises.
In order to perform isolated pixel removal processing without using shift registers or the like, it is considered that storage areas in a memory device provided for a facsimile or the like are utilized. In this case, the isolated pixel removal processing is processing handling data corresponding to three lines. Accordingly, a line memory corresponding to three lines is generally formed in the storage areas in the memory device, as in the filtering processing.
From the viewpoint of the effectively utilization of the storage areas in the memory device, however, it is desirable to reduce the capacity of the line memory. In addition, if a memory device having a small storage capacity can be used by reducing the capacity of the line memory, the cost can be also reduced.
In the conventional facsimile, in addition to the above described problems, there is a problem that time required for error diffusion processing performed as one of halftone processing is long, so that the speed of the entire image processing is decreased, as described below.
Specifically, in an apparatus for representing an image optically read by a binary image, for example, a facsimile, a variety of halftone processing has been conventionally applied so as to represent a halftone image such as a photograph. One of the halftone processing is error diffusion processing.
In the error diffusion processing, when a given pixel is binary-coded, a binary-coded error which is an error between multivalued density data corresponding to the pixel before binary-coding and density data corresponding to the pixel after binary-coding is operated. Specifically, in binary-coding processing, density data of a target pixel and a predetermined threshold value are compared with each other, so that the target pixel becomes a white pixel or a black pixel depending on the result of the comparison. With respect to a pixel having an intermediate density, therefore, an error inevitably occurs between the density of the pixel before binary-coding and the density thereof after binary-coding.
This binary-coded error produced in the given pixel is suitably weighted and distributed to pixels in the vicinity of the pixel. In binary-coding processing with respect to a target pixel, density data of the target pixel and binary-coded errors distributed from pixels in the vicinity of the target pixel are added to each other, and the result of the addition is compared with a predetermined threshold value.
For example, as shown in FIG. 17, when a pixel PO belonging to a given line along the main scanning direction at the time of reading by an image sensor provided for a facsimile or the like is binary-coded, a binary-coded error is produced. This binary-coded error is multiplied by an error diffusion coefficient 1/4 or 1/8 and distributed to pixels P1 to P6 in the vicinity of the pixel P0.
On the other hand, referring to FIG. 18, when attention is drawn to a pixel to which binary-coded errors are distributed, binary-coded errors are distributed to a target pixel A from pixels B, C, D, E, F and G in the vicinity of the target pixel A. Consequently, binary-coding processing with respect to the target pixel A is performed on the basis of a value obtained by adding the errors distributed from the pixels B, C, D, E, F and G in the vicinity of the target pixel A to density data of the target pixel A.
In the above described manner, the binary-coded error produced in each pixel is distributed to pixels in the vicinity of the pixel, thereby to achieve a representation of a halftone.
In order to realize such error diffusion processing, a binary-coded error produced in each pixel is stored in the memory for each pixel. For example, in the case of the binary-coding processing with respect to the target pixel A, the binary-coded errors in the pixels B, C, D, E, F and G are respectively read out from the memory. The binary-coded errors are respectively multiplied by error diffusion coefficients corresponding to the positional relationships with the target pixel A. The respective products and the density data of the target pixel A are added to each other, to find a value which is to be subjected to binary-coding judgment.
If the binary-coded error produced in each pixel is stored in the memory for each pixel as described above, access to the memory must be made, when binary-coding processing is performed with respect to a target pixel, by the number of pixels whose errors are distributed to the target pixel. Therefore, time required for the error diffusion processing is long, so that the speed of the entire image processing is reduced.
SUMMARY OF THE INVENTION
A first object of the present invention is to provide an image data processing apparatus capable of realizing processing using image data corresponding to a plurality of lines using a line memory having a small capacity.
A second object of the present invention is to provide an image data processing apparatus capable of sufficiently removing an isolated pixel in a binary image in simple construction and using a small number of storage areas.
A third object of the present invention is to provide an image data processing apparatus capable of performing error diffusion processing at high speed.
In order to attain the above described objects, according to the present invention, when data corresponding to pixels belonging to (N-1) lines just ahead of the present line are read out from storing means, data corresponding to pixels belonging to the present line are written to locations from which data corresponding to pixels belonging to a line (N-1) lines ahead of the present line have been read out. Specifically, when data processing is performed using data corresponding to N lines comprising the present line and the (N-1) lines just ahead of the present line, the data corresponding to the pixels belonging to the line (N-1) lines ahead of the present line are not required after being read out from the storing means so as to perform data processing. New data corresponding to the present line are written to the locations where the unnecessary data have been stored.
Therefore, storing means capable of storing data corresponding to (N-1) lines is sufficient to perform data processing on the basis of data corresponding to N lines.
Consequently, storing means capable of storing data corresponding to two lines is sufficient to perform an operation based on, for example, data corresponding to predetermined pixels out of nine pixels constituting a matrix with 3.times.3 pixels centered with respect to a target pixel to perform processing with respect to the target pixel.
As a result, storage areas in a memory provided for, for example, a facsimile can be effectively made use of. On the other hand, a memory device having a small capacity can be used, thereby to make it possible to contribute to the reduction of cost.
Meanwhile, writing/reading of data to or from the storing means may be performed in parallel for each predetermined number of pixels. In this case, the number of times of access to the storing means is decreased, thereby to make it possible to perform high-speed processing.
Furthermore, when data corresponding to two lines are stored in storage areas assigned continuous addresses in storing means, data corresponding to adjacent lines may be respectively stored at the odd addresses and the even addresses.
Additionally, a line memory corresponding to two lines may be constructed by dividing a storage area assigned each address in storing means into an upper bit portion and a lower bit portion. In this case, data on adjacent lines are respectively stored in the upper bit portion and the lower bit portion.
The foregoing and other objects, features, aspects and advantages of the present invention will become more apparent from the following detailed description of the present invention when taken in conjunction with the accompanying drawings.

BRIEF DESCRIPTION OF THE DRAWINGS
FIG. 1 is a block diagram showing the entire construction of a facsimile to which one embodiment of the present invention is applied;
FIG. 2 is a block diagram showing the internal construction of an input image processing circuit in the facsimile shown in FIG. 1;
FIG. 3 is a block diagram showing the construction of a shading correcting section;
FIG. 4 is a block diagram showing an example of the construction of a dividing circuit;
FIG. 5 is a diagram for explaining filtering processing;
FIG. 6 is a bock diagram showing a state where storage areas are assigned in a memory;
FIG. 7 is a diagram for explaining density adjustment processing;
FIGS. 8(a) to 8(e) are diagrams for explaining density adjustment processing, gamma correction processing and the like;
FIGS. 9(a) to 9(e) are diagrams for explaining density adjustment processing, gamma correction processing and the like;
FIG. 10 is a diagram for explaining density adjustment processing;
FIGS. 11(a) to 11(e) are diagrams for explaining density adjustment processing, gamma correction processing and the like;
FIG. 12 is a block diagram showing an example of the construction of a density adjustment processing section;
FIG. 13 is a block diagram showing another example of the construction of a density adjustment processing section;
FIG. 14 is a diagram showing addresses assigned to pixel positions in a matrix which is to be subjected to density adjustment processing;
FIG. 15 is a diagram for explaining gamma correction processing;
FIG. 16 is a diagram for explaining another technique for density adjustment processing and gamma correction processing;
FIG. 17 is a diagram for explaining error diffusion processing;
FIG. 18 is a diagram for explaining error diffusion processing;
FIG. 19 is a block diagram showing the hardware construction for performing processing with respect to a halftone image;
FIG. 20 is a timing chart for explaining an operation related to shading correction processing, filtering processing and density adjustment processing;
FIG. 21 is a timing chart for explaining an operation related to gamma correction processing and error diffusion processing;
FIG. 22 is a diagram for explaining a bit calculation related to filtering processing;
FIG. 23 is a diagram for explaining a bit calculation related to density adjustment processing and gamma correction processing;
FIG. 24 is a diagram for explaining a bit calculation related to shading correction processing;
FIG. 25 is a diagram for explaining a bit calculation related to error diffusion processing;
FIG. 26 is a diagram for explaining a bit calculation related to error diffusion processing;
FIGS. 27(a) and 27(b) are diagrams for explaining isolated point removal processing;
FIGS. 28(a) to 28(d) are diagrams for explaining isolated point removal processing;
FIGS. 29(a) to 29(d) are diagrams for explaining isolated point removal processing;
FIG. 30 is a block diagram showing the construction related to isolated point removal processing;
FIG. 31 is a diagram for explaining the positional relationship among pixels corresponding to data used for isolated point removal processing;
FIG. 32 is a timing chart for explaining an operation;
FIG. 33 is a timing chart for explaining an operation in the final stage of processing with respect to one line;
FIG. 34 is a timing chart for explaining an operation in the final stage of processing with respect to one line;
FIG. 35 is a block diagram showing the construction for generating addresses applied to a line memory;
FIG. 36 is a block diagram showing the construction of a binary-coding rejudging circuit;
FIG. 37 is a block diagram showing another example of the construction of an isolated point removal processing section;
FIG. 38 is a timing chart for explaining an operation;
FIGS. 39(a) and 39(b) are diagrams for explaining the degradation of an image due to jitter;
FIG. 40 is a diagram showing an isolated pixel caused by jitter;
FIGS. 41(a) and 41(b) are diagrams for explaining image conversion processing for removing an isolated pixel;
FIGS. 42(a) and 42(b) are diagrams for explaining image conversion processing for removing an isolated pixel;
FIG. 43 is a diagram showing a matrix with 3.times.3 pixels which is to be subjected to processing for removing an isolated pixel; and
FIG. 44 is a block diagram showing the construction in the prior art.

DESCRIPTION OF THE PREFERRED EMBODIMENT
One embodiment of the present invention will be described in detail by taking a facsimile as an example.
FIG. 1 is a block diagram showing the electrical construction of a facsimile in which one embodiment of the present invention is incorporated.
The facsimile comprises an input image processing circuit (an FIP (Fax Image Sensor Processor) section) 11, an image output processing circuit (a PRT section) 12, a CPU 14 for carrying out supervisory control of the entire facsimile, and a CPU interface 13 required to connect the input image processing circuit 11 and the image output processing circuit 12 to the CPU 14. The input image processing circuit 11 and the image output processing circuit 12 are asynchronously operated. In addition, the CPU interface 13 contains a DMA (Direct Memory Access) function in the present embodiment.
When a document is set in the facsimile and is read, a driving clock CCLK and a horizontal synchronizing signal SI are applied to an image sensor 15 from the input image processing circuit 11. The image sensor 15 optically reads a document image on the basis of the applied driving clock CCLK and the applied horizontal synchronizing signal SI, to apply read analog image data to an analog section 16.
An automatic gain control signal AGC, a sample-and-hold signal SHOLD and a gain setting signal DSCH are applied from the input image processing circuit 11 to the analog section 16. The analog image data applied from the image sensor 15 is changed into a sample-and-hold signal by predetermined amplification processing, to be applied to an analog-to-digital converter 17.
The analog-to-digital converter 17 is operated by a conversion clock ADCCLK applied from the input image processing circuit 11, and converts the applied sample-and-hold signal into digital image data and applies the digital image data to the input image processing circuit 11.
In the input image processing circuit 11, a variety of input image processing is performed with respect to the digital image data (read image data) applied from the analog-to-digital converter 17. Input image processing includes shading correction processing, binary-coded correction processing, an error diffusion processing required when a halftone is represented, and the like with respect to the read image data.
In the input image processing, two-dimensional image processing must be performed on the basis of data corresponding to a plurality of lines. Accordingly, a memory for storing image data corresponding to at least two lines and a variety of parameters required for the image processing is required. Therefore, a memory 18 serving as storing means which is constituted, for example, by an SRAM (a static random access memory) of 32 kilo bytes is connected to the input image processing circuit 11. A given area in the memory 18 is utilized as a line memory, and predetermined data for shading correction operating and error diffusion processing are stored in the given area in the memory 18.
The input image processing circuit 11 applies to the memory 18 a read strobe signal/ROE0 or a write strobe signal/RWE0, and designates an address to write or read out data corresponding to a line to or from an area where the address is designated. In addition, the input image processing circuit 11 performs the input image processing with respect to the read image data using the data corresponding to a line read out from the memory 18.
Access, that is, writing or reading of data to or from the memory 18, by the input image processing circuit 11 is made in synchronization with a memory access synchronous clock SYSCLK having a frequency of, for example, 20 MHz. Data of one pixel is processed utilizing as one cycle 16 memory access synchronous clocks SYSCLK.
The driving clock CCLK applied to the image sensor 15 has a frequency of, for example, approximately 400 KHz (the reason why such a frequency is applied is that the operation speed of the image sensor 15 is limited). The speed of the memory access synchronous clock SYSCLK is made sufficiently higher than the speed of the image sensor 15, that is, the speed of the driving clock CCLK.
The read image data after being subjected to the input image processing is directly stored once in a DRAM (a dynamic random access memory) 19. The data is transferred from the input image processing circuit 11 to the DRAM 19 by DMA transfer because a DMA function is contained in the CPU interface 13. The DMA transfer is performed when the read image data is applied from the input image processing circuit 11 to the CPU interface 13 and an amount of the data reaches a predetermined amount. Specifically, when the amount of the data reaches a predetermined amount, the CPU interface 13 issues a DMA request to the CPU 14, and transfers the read image data to the DRAM 19 after it receives DMA acknowledgment from the CPU 14.
The read image data stored once in the DRAM 19 is read out and subjected to compression processing by the CPU 14, to be stored in the DRAM 19 again. There are various systems in the standard of the facsimile of this compression processing, and, for example, systems such as MMR, MR and MH are known.
The read image data compressed and stored in the DRAM 19 is read out and applied to a modem 20 by the CPU 14. The read image data (digital data) is converted into analog data in the modem 20, and the analog data is outputted to a telephone line through an NCU (Network Control Unit) 21 and is transmitted to a facsimile on the other side of the communication.
On the other hand, when data is transmitted through the telephone line, the data is received by the NCU 21. The received data (analog data) is converted into digital data in the modem 20 and is stored in the DRAM 19. This data is compressed data.
The compressed data stored in the DRAM 19 is read out and subjected to expansion processing by the CPU 14, to be stored in the DRAM 19 again.
Thereafter, the CPU 14 applies the image data stored in the DRAM 19 again to the image output processing circuit 12.
When the image data is applied from the CPU 14 through the CPU interface 13 to the image output processing circuit 12, the image output processing circuit 12 subjects the image data to output processing, and drives an LSU (a laser scanning unit) 22 to record the image data after the output processing on paper or the like.
The output processing performed by the image output processing circuit 12 includes, for example, smoothing processing for smoothing the irregularity of the contour of image, conversion processing of the pixel or line density in a case where an image is enlarged or reduced, and conversion processing of the pixel density due to the difference between the density of the image data applied and the resolution of the LSU 22. In the output processing, a smoothing pattern corresponding to a pixel to be processed (which is called "target pixel" hereinafter) in the image data is varied depending on the state of pixels around the target pixel, and the logical OR of data on a plurality of lines is carried out to convert the pixel density, so that a memory for holding the image data is required. In addition, when a video signal corresponding to the image data is outputted to the LSU 22 from the image output processing circuit 12, it is necessary to store the video signal once in the line memory serving as a buffer, read out the video signal from the line memory serving as a buffer and output the video signal to the LSU 22 because there is a difference between the speed for output processing and the processing speed of the LSU 22. Consequently, the line memory is required. Also in the output processing, therefore, the memory 18 is made use of.
Access to the memory 18 by the image output processing circuit 12 is made in synchronization with the memory access synchronous clock SYSCLK, similarly to the access to the memory 18 by the input image processing circuit 11 and is made through the input image processing circuit 11. Therefore, the image output processing circuit 12 applies a memory access request signal MREQ and a write strobe signal/PRTWE or a read strobe signal/PRTOE to the input image processing circuit 11, and designates an address to write or read out data to or from an area where the address is designated.
Although the input image processing circuit 11 and the image output processing circuit 12 are asynchronously operated as described above, a common memory access synchronous clock SYSCLK is applied to both the circuits. Therefore, the input image processing circuit 11 and the image output processing circuit 12 access the memory 18 in synchronization with the memory access synchronous clock SYSCLK while being asynchronously operated.
When the memory access request signal MREQ is not outputted from the image output processing circuit 12, the input image processing circuit 11 has the right of access to the memory 18.
Furthermore, one cycle of the operation of the input image processing circuit 11 is set to 16 memory access synchronous clocks SYSCLK. Moreover, access to the memory 18 within one cycle is completed by eight clocks out of 16 memory access synchronous clocks. Consequently, the input image processing circuit 11 is so adapted for each cycle as to perform a memory access operation on the basis of eight clocks out of 16 memory access synchronous clocks SYSCLK and enter the stopped state (the wait state) during a period of the remaining eight clocks.
The reason why one cycle of the operation of the input image processing circuit 11 is thus constructed utilizing as a unit 16 memory access synchronous clocks SYSCLK, is that the read image data applied from the image sensor 15 to the input image processing circuit 11 is inputted for each pixel in synchronization with the driving clock CCLK having a relatively low frequency, for example, approximately 400 KHz, while the memory access synchronous clock SYSCLK is a clock having a relatively high frequency, for example, 20 MHz. Specifically, if one cycle of the operation of the input image processing circuit 11 is determined utilizing as a unit a time period during which read image data corresponding to one pixel is applied to the input image processing circuit 11, the cycle is constituted by 16 memory access synchronous clocks SYSCLK.
As a result of the foregoing, even when the input image processing circuit 11 has the right of access to the memory 18, it is in the stopped state in a period of eight memory access synchronous clocks SYSCLK for each cycle.
On the other hand, the memory access request signal MREQ is applied to the input image processing circuit 11 at arbitrary timing from the image output processing circuit 12 which is operated asynchronously with the input image processing circuit 11. If this request signal MREQ is applied, the right of access to the memory 18 is transferred to the image output processing circuit 12 as described above.
Furthermore, the input image processing circuit 11 stops operating in response to the memory access request signal MREQ and transfers the right of access to the memory 18 to the image output processing circuit 12. Therefore, the image output processing circuit 12 can access the memory 18. A time period during which the memory 18 is accessed once by the image output processing circuit 12 is predetermined, for example, a period of eight memory access synchronous clocks SYSCLK.
When the memory 18 has been accessed once by the image output processing circuit 12, the memory access request signal MREQ from the image output processing circuit 12 is not outputted. Therefore, the memory access signal switching circuit 110 is switched to the input image processing circuit 11, so that the input image processing circuit 11 acquires the right of access to the memory 18 again.
In this case, a time period during which the memory 18 is accessed by the input image processing circuit 11 may be a period of eight memory access synchronous clocks SYSCLK for each cycle. If the period of eight memory access synchronous clocks SYSCLK is ensured for as the time period during which the memory 18 is accessed for each cycle, the access to the memory 18 by the input image processing circuit 11 can be made without being interfered with.
Specifically, even if the memory access request signal MREQ from the image output processing circuit 12 is interrupted at arbitrary timing, the operation of the input image processing circuit 11 may be stopped in a time period during which the request signal MREQ is being interrupted. Moreover, even if this request signal MREQ is not interrupted, a time period during which the operation is stopped inevitably exists in each cycle. The time period during which the operation is stopped exists at arbitrary timing in one cycle. Accordingly, the access to the memory 18 by the input image processing circuit 11 can be also made without being interfered with.
Furthermore, the access to the memory 18 by the image output processing circuit 12 can be made at arbitrary timing for each cycle.
FIG. 2 is a block diagram showing the internal construction of the input image processing circuit 11. The input image processing circuit 11 comprises an image sensor interface 25 for outputting signals for driving the image sensor 15, the analog section 16, the analog-to-digital converter 17 and the like. In addition, there is provided a RAM interface 26 for sending or receiving data to or from the memory 18. A 15-bit address bus RA, a 8-bit data bus RD and the like are connected to the RAM interface 26. A read strobe signal/ROE0, a write strobe signal/RWE0 and the like are applied to the memory 18 from the RAM interface 26. On the other hand, an address signal PRTADR, data PRDTOUT, a write strobe signal PRTWE, a read strobe signal PRTOE and the like are applied from the image output processing circuit 12 to the RAM interface 26, and a memory access request signal MREQ is further inputted thereto. In addition, the above described memory access synchronous clock signal SYSCLK is applied to the RAM interface 26.
7-bit image data ID from the analog-to-digital converter 17 is applied to a shading correcting section 31, so that the variation in density between pixels due to the variation in luminance of a light source for reading is corrected.
Shading correction is made on the basis of black reference data BST corresponding to a deep black image and white reference data WST corresponding to a pure white image. The black reference data BST and the white reference data WST are produced by a white/block reference value producing section 32, and are written to the memory 18 through the RAM interface 26. The black reference data BST is generated by acquiring an output of the image sensor 15 in a state where a lamp for document illumination goes out. In addition, the white reference data WST is generated by lighting the lamp for document illumination to cause the image sensor 15 to read a white reference plate on which a white reference image is formed.
The white/black reference value producing section 32 calculates the difference between the maximum output data of the analog-to-digital converter 17 and the white reference data WST as an offset OFFSET when the white reference data WST is generated. This offset OFFSET is written to the memory 18, to be used for the shading correction (whose details will be described later). Specifically, the white/block reference value producing section 32 functions as offset operating means, to automatically generate an offset OFFSET at the same time that the white reference data WST is generated. The offset OFFSET need not be always automatically generated. Alternatively, the offset OFFSET may be operated on the basis of the white reference data WST and the maximum output data of the analog-to-digital converter 17 in response to a predetermined operation from an operating section of the facsimile.
Data SOUT after the shading correction is inputted to a filtering processing section 33. In the filtering processing section 33, image areas, that is, a halftone image area and a binary image area are detected in a separate manner, and an image in the binary image area is subjected to processing for emphasizing an edge portion of the image.
Data FOUT after filtering processing is applied to a density adjustment processing section 34. The density adjustment processing section 34 performs processing for enhancing the reproducibility of the density, particularly the density of a halftone image. Specifically, image portions each including 16 pixels constituting a matrix with 4.times.4 pixels are sequentially taken out, and a density correcting value predetermined to correspond to each of pixel positions in the matrix is added to data corresponding to a pixel in each pixel position.
An output signal WOUT of the density adjustment processing section 34 is applied to a gamma correcting section 35 and a simple binary-coding processing section 36. Specifically, data representing a halftone image is applied to the gamma correcting section 35, and data representing a binary image is applied to the simple binary-coding processing section 36.
In the gamma correcting section 35, the image data is subjected to correction for correcting gamma characteristics of the image sensor 15 and development characteristics in a case where an electrostatic latent image formed on a photoreceptor by scanning of a laser beam is developed into a toner image in order to accurately reproduce the density of a document image.
Data GOUT after the gamma correction is applied to an error diffusion processing section 37. Error diffusion processing is a pseudo halftone processing method and a technique for weighting a binary-coded error between the read density and the binary-coded density of each of reference pixels in the vicinity of a target pixel in accordance with the positional relationship with the target pixel and distributing the error to the target pixel, and performing binary-coding processing with respect to the target pixel on the basis of the result of addition of the density of the target pixel and the binary-coded errors distributed from the reference pixels in the vicinity of the target pixel. The binary-coding processing is performed on the basis of a predetermined threshold value.
The data WOUT applied to the simple binary-coding processing section 36 from the density adjustment processing section 34 is binary-coded as "0" or "1" by a predetermined threshold value. A threshold value for binary-coding is inputted to the simple binary-coding processing section 36 from an automatic density adjustment processing section 38. The automatic density adjustment processing section 38 finds the average value of the peak densities on a plurality of lines and changes the threshold value for binary-coding on the basis of the average value. Therefore, different threshold values are set for respective portions of, for example, one document.
Binary data from the simple binary-coding processing section 36 is inputted to an isolated point removal processing section 39. Isolated point removal processing is, for example, processing for preventing the image quality from being lowered due to the nonuniformity in the rotation of a motor for conveying a document and removing, when a white pixel or a black pixel, for example, alone exists due to noise such as dirt on the surface of the document, such a so-called isolated pixel. The isolated point removal processing can be performed by forcing, when all pixels in predetermined positions around a given target pixel have binary data corresponding to one of the white pixel and the black pixel, binary data corresponding to the target pixel to be converted into the binary data.
The black pixel or the white pixel can be prevented from being isolated by such processing, thereby to make it possible to improve the image quality. Moreover, compression efficiency in compression coding of the binary data for facsimile transmission is increased, thereby to decrease the amounts of transmission codes. Therefore, it is possible to establish high speed communication.
The binary data from the error diffusion processing section 37 and the isolated point removal processing section 39 are applied to a binary-coding output circuit 40. In the binary-coding output circuit 40, the binary data applied in series for each pixel is converted into 8-bit parallel data BIN0 to BIN7 and is outputted. This binary data is applied to the CPU interface 13 shown in FIG. 1.
The input image processing circuit 11 comprises, in addition to the above described components, an address counter 41 for generating a write or read address to the memory 18, a timing control circuit 42 for controlling operation timing of each component, and the like.
FIG. 3 is a block diagram showing the internal construction of the shading correcting section 31. White reference data WST, black reference data BST and image data ID are applied to the shading correcting section 31. The difference between the white reference data WST and the black reference data BST (WST-BST) is operated by a first subtracter 45, and the difference between the image data ID and the black reference data BST (ID-BST) is operated by a second subtracter 46. In addition, outputs (WST-BST) and (ID-BST) of the subtracters 45 and 46 are respectively applied to first and second adders 47 and 48, and an offset OFFSET is added to both the outputs.
An output of the adder 47 (WST-BST+OFFSET) and an output of the adder 48 (ID-BST+OFFSET) are applied to a divider circuit 49. This divider circuit 49 carries out division expressed by the following equation (1), to output shading correction data SOUT: ##EQU1## where K is a constant.
The operation expressed by the equation (1) can be also realized by previously adding the white reference data WST and the offset OFFSET and adding the image data ID and the offset OFFSET, subtracting the black reference data BST from the respective results of the addition, and performing division with respect to the respective results of the subtraction.
The white reference data WST and the black reference data BST are produced in the white/black reference value producing section 32 (see FIG. 2), and are stored in the memory 18. The reference data WST and BST in the memory 18 are read out, and are applied to subtracters 45 and 46.
On the other hand, the offset OFFSET is calculated and is stored in the memory 18 at the same time that the white reference data WST is generated in the white/black reference value producing section 32 as described above, and is supplied to the adders 47 and 38 from a register (not shown). This offset OFFSET is calculated by the following equation (2):
OFFSET=(maximum output of A/D converter)-WST (2)
Specifically, the difference between the maximum output data of the analog-to-digital converter 17 and the white reference data WST becomes the offset OFFSET. The offset OFFSET is previously added to divisor data (WST-BST) and dividend data (ID-BST) in the division for shading correction, thereby to ensure a wide dynamic range of the shading correction data SOUT.
For example, if in a case where the output data of the analog-to-digital converter 17 is seven bits in depth, the white reference data WST is data having a value of not more than "1111", (ID-BST)/(WST-BST) becomes data substantially represented by not more than four bits. Therefore, the dynamic range of the shading correction data SOUT is liable to be narrowed.
On the other hand, in the present embodiment, the offset OFFSET is added to the divisor data and the dividend data in the operation for shading correction, thereby to increase the number of effective bits to ensure a wide dynamic range. Consequently, the data after shading correction SOUT becomes a representation of the density at a lot of gray levels.
As the offset OFFSET, a predetermined value may be used in place of the value obtained by the calculation using the foregoing equation (2).
An example of the construction of the divider circuit 49 is shown in FIG. 4. Specifically, when an operation of A.div.B is performed, the divisor data B is applied to one input terminal of a subtracter 50, and the dividend data A is applied to an input terminal Ia of a data selector 51. An output of the data selector 51 is applied to the other input terminal of the subtracter 50. The subtracter 50 subtracts the divisor data B from output data of the data selector 51, and outputs a signal having a logic "1" to a line 52 if the subtraction is possible (the result of the subtraction is not a negative value), while outputting a signal having a logic "0" to the line 52 if the subtraction is impossible. This signal is inputted to a 7-bit shift register 53.
The output of the data selector 51 is shifted higher by one bit, and is fed back to an input terminal Ic of the selector 51 from a line 54. In addition, data representing the result of the subtraction in the subtracter 50 is shifted higher by one bit, and is fed back to an input terminal Ib of the data selector 51 from a line 55.
A selection control signal for selecting the dividend data A applied to the input terminal Ia is applied to the data selector 51 from a line 56. In addition, the signal outputted to the line 52 from the subtracter 50 is applied from a line 57 as a selection control signal for selecting an input signal of either one of the input terminals Ib and Ic. The data selector 51 selects the input data from the input terminal Ib when a signal having a logic "1" is applied from the line 57, while selecting the input data from the input terminal Ic when a signal having a logic "0" is applied from the line 57.
By this construction, the dividend data A from the input terminal Ia is first applied to the subtracter 50. At this time, a signal having a logic "0" is outputted to the line 52 if A-B<0. Data from the input terminal Ic obtained by shifting the dividend data A higher by one bit, is selected and is inputted to the subtracter 50. At this time, if the divisor data B can be subtracted from the data obtained by shifting the dividend data A by one bit, a signal having a logic "1" is outputted to the line 52, so that the data from the input terminal Ib which is obtained by shifting the result of the subtraction higher by one bit is selected by the data selector 51.
Such an operation is repeatedly performed seven times if the dividend data A and the divisor data B are, for example, 7-bit data. As a result, 7-bit data obtained by dividing the dividend data A by the divisor data B is stored in the shift register 53. This 7-bit data is outputted as quotient data.
FIG. 5 is a diagram for explaining processing performed in the filtering processing section 33. In the present embodiment, a so-called Laplacian filter is adopted. The filtering processing is performed on the basis of data after shading correction corresponding to pixels arranged in a matrix with 3.times.3 pixels centered with respect to a target pixel.
In order to create a matrix with 3.times.3 pixels, data corresponding to three lines are required. Specifically, data B.sub.n, B.sub.n-1, B.sub.n-2, . . . corresponding to the present line which are subjected to shading correction and sequentially outputted, data X.sub.n, X.sub.n-1, X.sub.n-2, . . . corresponding to a line one line ahead of the present line to which a target pixel belongs, and data A.sub.n, A.sub.n-1, A.sub.n-2, . . . two lines ahead of the present line are required. In the filtering processing, a differential value S expressed by the following equation (3) is operated. ##EQU2## where R1 and R2 are random numbers, i.e., 0 or 1.
Data FOUT after the filtering processing shown in the following table 1 are obtained depending on the operated differential value S. However, data corresponding to each pixel shall be 8-bit data which can have a value in the range of 0 to 255.
TABLE 1______________________________________range of contents data FOUT afterdifferential value S of processing filtering processing______________________________________-255 .ltoreq. S < -128 forced black pro- FOUT = 0 cessing-127 .ltoreq. S < SLB in case of (X + FOUT = 0 S) .ltoreq. 0 forced black processing in case of (X + FOUT = (X + S) - 1 S) > 0 black emphasis process- ingSLB .ltoreq. S < SLW unprocessed (half- FOUT = X tone area)SLW .ltoreq. S < 128 in case of (X + FOUT = (X + S) - 1 S) .ltoreq. 128 white emphasis process- ing in case of (X + FOUT = 127 S) > 128 forced white processing129 .ltoreq. S < 256 forced white pro- FOUT = 127 cessing______________________________________
In the foregoing table 1, X corresponds to the image data X.sub.n-1 shown in FIG. 5, SLB is a threshold value concerning black pixel emphasis processing, and SWB is a threshold value concerning white pixel emphasis processing.
By the above described processing, a halftone area and a binary image area are detected in a separate manner, so that the binary image area is subjected to processing for emphasizing a white or block color. Consequently, the reproducibility of a binary image is improved.
In the present embodiment, a line memory corresponding to two lines is provided in storage areas in the memory 18 so as to perform filtering processing. This will be described by referring to a memory map in the memory 18 shown in FIG. 6.
Addresses "0000" to "1AFF" in the memory 18 are used for storing data SOUT after shading correction (shading correction data) and black reference data BST and white reference data WST which correspond to two lines. One line is constituted by, for example, 1728 pixels. In addition, addresses "1B00" to "1FFF" are used as a work area, and addresses "2000" to "26BF" are used for error diffusion processing and simple binary-coding processing. Furthermore, addresses "26C0" to "26FF" are used to store a correcting table for gamma correction, and addresses "2700" to "7FFF" are used as a work area in the CPU 14.
In the filtering processing, the addresses "0000" to "1AFF" are used as a line memory corresponding to two lines. Specifically, data after shading correction corresponding to the first pixel related to the main scanning direction in image reading by the image sensor is written in the addresses "0000" and "0001". Data on one of adjacent two lines is stored in the address "0000", and data on the other line is stored in the address "0001". Similarly, data corresponding to the second pixel is stored in the addresses "0004" and "0005", and data corresponding to the third pixel is stored in the addresses "0008" and "0009". In such a manner, it is possible to store data corresponding to pixels belonging to two lines.
For example, data corresponding to a line two lines ahead of the present line shall be written in the addresses "0000", "0004", "0008", "000C", . . . , and data corresponding to a line one line ahead of the present line shall be written in the addresses "0001", "0005", "0009", "000D", . . . For example, if the data on the line two lines ahead of the present line which is written in the address "0008" is read out as data A.sub.n-2 shown in FIG. 5 and is used for the filtering processing, data B.sub.n-1, on the present line is written in this address "0008". In the same manner, if the use of data on a pixel belonging to the line two lines ahead of the present line is terminated in the filtering processing, data on the present line is written in place of the data corresponding to the pixel whose use is terminated to a memory address at which the data corresponding to the pixel has been stored.
In such a manner, the filtering processing in which image data corresponding to three lines must be handled can be achieved by preparing a line memory corresponding to two lines. Consequently, it is possible to effectively make use of the storage areas in the memory 18. On the other hand, a device having a small storage capacity can be used as the memory 18, thereby to make it possible to contribute to the decrease in cost.
Meanwhile, image data corresponding to two lines or image data corresponding to not less than four lines may be used for the filtering processing. If the filtering processing is performed on the basis of data corresponding to N (N.gtoreq.2) lines, a line memory corresponding to (N-1) lines may be prepared in the memory 18, to sequentially read out data corresponding to pixels belonging to (N-1) lines Just ahead of the present line from the memory and write data corresponding to the present line to addresses from which data corresponding to a line (N-1) lines ahead of the present line have been read out. Consequently, the filtering processing requiring data corresponding to N lines can be achieved by preparing a memory corresponding to (N-1) lines.
FIG. 7 is a diagram for explaining processing in the density adjustment processing section 34. The density adjustment processing section 34 sequentially takes out partial images each comprising 16 pixels arranged in a matrix with 4.times.4 pixels, and adds or subtracts predetermined density correcting values to or from pixels W0, W1, W2, . . . , W7 in predetermined pixel positions in this matrix.
For example, the density correcting values which are added to the pixels W0, W1, . . . , W7 are respectively taken as WD0, WD1, . . . , WD7, and the following equation shall hold:
WD0=WD1=WD2=. . . =WD7=3 . . . (4)
At this time, if image data FOUT after filtering processing corresponding to the pixels arranged in the matrix with 4.times.4 pixels are as shown in FIG. 8 (a), the data are changed into data WOUT shown in FIG. 8(b).
Addition of the density correcting value WDi (0.ltoreq.i.ltoreq.7) to the image data may be performed under predetermined conditions. For example, if the following expression is a condition for addition, image data FOUT after filtering processing as shown in FIG. 9 (a) are converted into data WOUT as shown in FIG. 9 (b):
FOUT>0 . . . (5)
Specifically, the density correcting value WDi is not added to a pixel corresponding to the data FOUT whose value is zero.
Furthermore, a different condition may be established for each pixel position in the matrix to add to a pixel corresponding to the data FOUT satisfying the condition in its pixel position the density correcting value WDi corresponding to the pixel position.
For example, as shown in FIG. 10, the following condition C1 is established with respect to the pixels W0, W3, W4 and W7 in the matrix, and the following condition C2 is established with respect to the pixels W1, W2, W5 and W6:
Condition C1 . . . FOUT>WMIN=0 (6)
Condition C2 . . . FOUT>WMAX=8 (7)
Let's add to a pixel satisfying the condition C1 or C2 established for its pixel position the density correcting value WDi corresponding to the pixel position. In this case, image data FOUT after filtering processing as shown in FIG. 11 (a) are converted into data WOUT as shown in FIG. 11 (b). That is, only the condition C1 holds in this case.
All the density correcting values WDi need not be equal to each other. Alternatively, a different density correcting value may be set for each pixel position.
FIG. 12 is a block diagram showing an example of the construction for performing the above described density adjustment processing. Density correcting values WD0 to WD7 are previously stored in the memory 18. The density correcting values are outputted to a data bus 59 by the CPU 14. The density correcting values WD0, WD1 . . . . WD7 are respectively written to registers 60, 61, . . . , 67 by a writing signal from the CPU 14.
On the other hand, threshold value data WMIN and WMAX for conditioning are respectively written to registers 68 and 69 through the data bus 59. By this construction, the density correcting values WD0, WD1, WD2, . . . , WD7 are respectively added to the image data corresponding to the pixels W0, W1, W2, . . . , W7 in the matrix with 4.times.4 pixels (see FIG. 7).
If addition is conditionally performed, the data corresponding to the pixels W0, W1, W2, . . . , W7 which are to be subjected to the addition and output data of the registers 68 and 69 may be compared with each other, to determine whether or not the addition is performed depending on the result of the comparison.
FIG. 13 is a block diagram showing another example of the construction for density adjustment processing. In this construction, density correcting values WD0, WD1, . . . , WD7 are inputted to a multiplexer 70, and any one of the density correcting values WDi is outputted as density correction data WDATA from output terminals Q0 to Q6 of the multiplier 70.
A selection control signal for selecting a density correcting values WDi to be outputted is applied to the multiplexer 70 from a line decoder 71. This line decoder 71 has eight output terminals Y0 to Y7, and outputs a low-level signal to any one of the output terminals corresponding to the density correcting value WDi to be selected. If the addition is not performed, all the output terminals Y0 to Y7 attain a high level.
In this example of the construction, a predetermined 4-bit address is applied to each of pixel positions in the matrix with 4.times.4 pixels, and a signal corresponding to lower three bits of this address is inputted to input terminals A, B and C of the line decoder 71. The most significant bit of the above described address is applied to an input terminal G1 of the line decoder 71 through an AND gate 72. A signal OUTFIL for choosing whether to make density adjustment is also inputted to the AND gate 72.
If a low-level signal is applied to the input terminal G1, the line decoder 71 outputs a high-level signal to all the output terminals Y0 to Y7. When the most significant bit of the address is "0" or the signal OUTFIL is at a low level, therefore, output data of the multiplexer 70 becomes "0". Accordingly, addition of the density correcting value WDi is not performed at this time.
FIG. 14 is a diagram showing a 4-bit address applied to each of the pixels in the matrix with 4.times.4 pixels. Specifically, the most significant bit of the address is "1" with respect to the pixels W0, W1, . . . , W7 shown in FIG. 7 to which the density correcting value WDi is to be added, while being "0" with respect to the remaining pixels. Therefore, the density correcting value WDi is added only to the pixels W0, W1 . . . . , W7. By lower three bits of the address, the density correcting values WD0 to WD7 corresponding to the respective pixels W0 to W7 are selected and are outputted as the density correction data WDATA.
In the density adjustment processing section 34, the position in the matrix with 4.times.4 pixels of a target pixel is detected. The address shown in FIG. 14 corresponding to the result of the detection is generated, to be inputted to the input terminals A, B and C of the line decoder 71 and the AND gate 72.
FIG. 15 is a diagram for explaining processing in the gamma correcting section 35. The contents of the gamma correcting table (see FIG. 6) stored in the memory 18 are as shown in the following table 2. A gamma curve obtained by graphing the gamma correcting table is shown in FIG. 15. In the table, "H" indicates that a numeral ahead of "H" is a hexadecimal number.
TABLE 2______________________________________address (WOUT) gamma table (GOUT)______________________________________* * 0 0 H 0 0 H* * 0 1 H 0 0 H* * 0 2 H 0 0 H* * 0 3 H 0 1 H* * 0 4 H 0 2 H* * 0 5 H 0 3 H* * 0 6 H 0 5 H* * 0 7 H 0 7 H* * 0 8 H 0 9 H* * 0 9 H 0 B H* * 0 A H 0 C H* * 0 B H 0 D H* * 0 C H 0 E H* * 0 D H 0 F H* * 0 E H 0 F H* * 0 F H 0 F H______________________________________
When gamma correction is made, the data WOUT from the density adjustment processing section 34 is assigned to lower two digits of an address in the gamma correcting table. A value stored at the address is read out from the memory 18 as data GOUT after gamma correction, thereby to achieve gamma correction.
For example, the data WOUT after density adjustment processing in the matrix with 4.times.4 pixels shown in FIG. 8 (b) are subjected to gamma correction, thereby to obtain data GOUT after gamma correction shown in FIG. 8 (c). Similarly, the WOUT after WOUT after density adjustment processing shown in FIG. 9 (b) and FIG. 11 (b) are subjected to gamma correction, thereby to respectively obtain image data GOUT shown in FIG. 9 (c) and FIG. 11 (c).
The respective data GOUT shown in FIGS. 8 (c), 9 (c) and 11 (c) are subjected to halftone processing using a dither matrix respectively shown in FIGS. 8 (d), 9 (d) and 11 (d), thereby to respectively obtain binary images shown in FIGS. 8 (e), 9 (e) and 11 (e). A hatched portion indicates a black pixel.
In the binary images shown in FIGS. 8 (e), 9 (e) and 11 (e), white pixels and block pixels are mixed with each other in a proper ratio. Accordingly, it is possible to overcome, for example, the problem that the white pixel is defaced by the black pixels in the vicinity of the white pixel. This is particularly effective when the black pixel spreads due to the spread of toner particles when an image is printed by, for example, a laser beam printer.
It is from the result of the density adjustment processing in the density adjustment processing section 34 that a proper ratio of the white pixels to the black pixels is obtained in the image after halftone processing as described above. If the adjustment in the density adjustment processing section 34 is omitted, the density of a halftone image may be insufficiently reproduced.
More specifically, the density data corresponding to the pixels constituting the partial image shown in FIG. 8 (a) all have an intermediate value "6". Consequently, if the density data corresponding to each of the pixels constituting the partial image is directly subjected to gamma correction, all the pixels are converted into the same value. Consequently, this case is not substantially different from a case where only halftone processing using a dither matrix is performed, so that an intermediate density may be insufficiently reproduced.
On the other hand, if density adjustment processing according to the present embodiment is performed, the density data can be varied, as shown in FIG. 8 (b). Therefore, so-called gamma correction for representing an intermediate density for each partial image constituting a matrix with 4.times.4 pixels is made, thereby to make it possible to sufficiently reproduce the intermediate density.
In this case, if addition of the density correcting value WDi is performed under the condition given by the foregoing expression (5) as in the processing shown in FIG. 9, density data corresponding to a pixel which is clearly a black pixel can be prevented from being corrected to data having an intermediate value, thereby to make the reproducibility of the density better.
Furthermore, if a different condition is established for each pixel position to perform density adjustment processing as in the processing shown in FIG. 11, the range in which the reproduction of the density is adjusted becomes wider, thereby to make it possible to reproduce the density more sufficiently.
FIG. 16 is a diagram for explaining another processing technique for density adjustment processing and gamma correction processing. In this example, gamma correcting tables GT0, GT1, GT2, GT3 . . . . , GT5 (only gamma correcting tables GT0 to GT8 are illustrated in FIG. 16 so as to avoid complexity) are respectively provided for pixel positions WP0, WP1, WP2, . . . , WP15 in a matrix with 4.times.4 pixels for density adjustment. For image data FOUT after filtering processing corresponding to the 4.times.4 pixels which are to be subjected to density adjustment processing, a different gamma correcting table is referred to depending on the position in the matrix of the pixel.
In the example shown in FIG. 16, "00H" to "0FH" corresponding to the pixel positions WP0, WP1, WP2, . . . , WP15 are assigned to respective upper two digits of addresses in the gamma correcting table, and data after filtering processing are assigned to respective lower two digits thereof. If the image data FOUT after filtering processing corresponding to, for example, the pixel position WP8 is "06H", therefore, data "05H" stored at an address "0806H" is obtained as data GOUT after gamma correction.
The relationship among the gamma correcting tables GT0 to GT15 is such that the results of such density adjustment as to add the density correcting values WD1 to WD7 to, for example, the pixels W0 to W7 in the matrix with 4.times.4 pixels shown in FIG. 7 and as not to perform addition processing with respect to the remaining pixels in the matrix and gamma correction with respect to data after the density adjustment are obtained.
By such construction, the above described density adjustment processing and gamma correction processing can be performed at a stretch.
FIG. 17 is a diagram for explaining processing in the error diffusion processing section 37. Error diffusion processing is processing for finding, when a given pixel P0 is binary-coded, an error HG between multivalued density data corresponding to the pixel P0 and density data after binary-coding (density data corresponding to a white or black color) and distributing this error HG to pixels in the vicinity of the pixel P0 in a predetermined ratio. For example, if the multivalued density data after binary-coding processing corresponding to the pixel P0 is "30H" and a binary-coding threshold value is "20H", the pixel P0 becomes a white pixel. At this time, if the density of a pure white pixel is "3F", a binary-coded error HG is as follows:
HG=3FH-30H=FH (8)
In the present embodiment, the binary-coded error HG produced in the pixel P0 is multiplied by a coefficient 1/4 and distributed to pixels P1 and P5 respectively adjacent to the pixel P0 on the downstream side in the main scanning direction RM and the subscanning direction RS at the time of reading an image by the image sensor 15. In addition, the binary-coded error HG is multiplied by a coefficient 1/8 and distributed to a pixel P2 adjacent to the pixel P1 on the downstream side in the main scanning direction RM, two pixels P3 and P4 adjacent to the pixel P5 on the upstream side in the main scanning direction RM, and a pixel P6 adjacent to the pixel P5 on the downstream side in the main scanning direction RM.
In the error diffusion processing with respect to a target pixel, errors distributed from pixels in the vicinity of the target pixel are added to density data corresponding to the target pixel, and the target pixel is subjected to binary-coding processing on the basis of the result of the addition. This processing will be described with reference to FIG. 18.
Consideration is given centered with respect to a target pixel A. Binary-coded errors HG (G), HG (E) and HG (D) in pixels G, E and D belonging to the preceding line L1 are multiplied by a coefficient 1/8 and distributed to the target pixel A. In addition, a binary-coded error HG (F) in a pixel F is multiplied by a coefficient 1/4 and distributed to the target pixel A. With respect to the present line L2 including the target pixel A, a binary-coded error HG (B) in a pixel B adjacent to the target pixel A on the upstream side in the main scanning direction RM is multiplied by a coefficient 1/4 and distributed to the target pixel A, and a binary-coded error HG (C) in a pixel C on the upstream side of the pixel B in the main scanning direction RM is multiplied by a coefficient 1/8 and distributed to the target pixel A.
If data applied from the gamma correcting section 35 with respect to the target pixel A is GOUT (A), therefore, binary-coding processing with respect to the target pixel A is performed by comparing a value T (A) expressed by the following equation (9) with a predetermined threshold value: ##EQU3##
The specific procedure for such error diffusion processing is as follows. The error diffusion processing performed in the present embodiment is constituted by the following [processing 1] to [processing 6].
[Processing 1]
A binary-coded error HG (B) produced in processing with respect to a pixel B one pixel ahead of a target pixel A and a binary-coded error HG (C) produced in processing with respect to a pixel C two pixels ahead of the target pixel A are respectively multiplied by coefficients corresponding to the positional relationships with the target pixel A and are added to each other, to operate an accumulated error RG (h) expressed by the following equation (10): ##EQU4## [Processing 2]
An accumulated error RG (m) on the preceding line L1 expressed by the following equation (11) and the accumulated error RG (h) found in the [processing 1] are added to each other, to find an accumulated error RG (i) which is to be added to data corresponding to the target pixel A using an operation expressed by the following equation (12). The accumulated error RG (m) is stored in the memory 18 by the following [processing 6] which has been already terminated with respect to a pixel belonging to the preceding line L1. This accumulated error RG (m) has been stored in the memory 18 (see FIG. 6). ##EQU5## [Processing 3]
Data GOUT (A) after gamma correction corresponding to the target pixel A and the accumulated error RG (i) found in the [processing 2] are added to each other, to find a value T (A) which is to be subjected to binary-coding judgment. This value T (A) becomes a value expressed by the following equation (13):
T(A)=GOUT (A)+RG(i) (13)
[Processing 4]
The above described value T (A) which is to be subjected to binary-coding Judgment and a binary-coding threshold value are compared with each other, to find a binary-coded error HG (A) at the time of binary-coding judgment. Since data corresponding to the density of a pure white pixel and data corresponding to the density of a deep black pixel have been previously found, it is possible to find a binary-coded error HG (A) in the target pixel A if the value T (A) which is to be subjected to binary-coding judgment and the binary-coding threshold value are compared with each other.
[Processing 5]
An accumulated error RG (j) found in the foregoing [processing 1] in error diffusion processing in which the pixel B one pixel ahead of the target pixel A is considered as a target pixel is added to an error diffusion coefficient 1/8 times the found binary-coded error HG (A) in the target pixel A, and a value obtained by the addition is taken as an accumulated error RG (k). The accumulated error RG (j) is expressed by the following equation (14) using a binary-coded error HG (X) produced in error diffusion processing with respect to a pixel X just ahead of the pixel C: ##EQU6##
Consequently, the accumulated error RG (k) is expressed by the following equation (15): ##EQU7## [Processing 6]
An error diffusion coefficient 1/8 times the binary-coded error RG (B) in the pixel B Just ahead of the target pixel A is added to the above described accumulated error RG (k), to find an accumulated error RG (n) expressed by the following equation (16): ##EQU8##
This accumulated error RG (n) is written to an address corresponding to the target pixel A in the memory 18 so as to be used for processing with respect to a pixel Y belonging to the succeeding line. The written value is used in the foregoing [processing 2] when the pixel Y becomes a target pixel.
The [processing 1] to the [processing 6] are performed every time a target pixel is switched, so that error diffusion processing is achieved, thereby to perform pseudo halftone processing.
As described in the foregoing, in the error diffusion processing according to the present embodiment, the accumulated error RG (n) is previously stored in the memory 18 to correspond to the target pixel A, and this accumulated error RG (n) is used for the error diffusion processing with respect to the pixel Y having a predetermined positional relationship with the target pixel A which belongs to the succeeding line. In order to perform the error diffusion processing with respect to the pixel Y, therefore, if the accumulated error RG (n) is read out instead of individually reading out binary-coded errors in the pixels G, F, E and D from the memory 18, the reading of the data corresponding to the pixels belonging to the line L2 which is a line preceding the line to which the pixel Y belongs is completed. Consequently, the number of times of access to the memory 18 is small, thereby to make it possible to perform the error diffusion processing at high speed.
FIG. 19 is a block diagram showing the specific hardware construction which realize the above described shading correction, filtering processing, density adjustment processing, gamma correction processing and error diffusion processing together. The gamma correction processing and the error diffusion processing are performed with respect to only a halftone image. Accordingly, the construction shown in FIG. 19 is construction for performing data processing with respect to a halftone image.
7-bit image data ID from the analog-to-digital converter 17 (see FIG. 1) is applied to respective input terminals A of a first adder 81 and a second adder 82 from a line 80. Data from the memory 18 is also inputted to the input terminals A of the adders 81 and 82 from a line 83, and data from the memory 18 which is held once in a register 91 is also applied thereto. The data read out from the memory 18 is also held in a read register 84, and the contents of the read register 84 can be applied to the input terminals A of the adders 81 and 82.
An output of the first adder 81 is fed back to the input terminal A of the adder 81 through registers 90, 92 and 93, and is directly fed back to an input terminal B of the adder 81. In addition, the output of the first adder 81 is also applied to a divider circuit 86 from a line 85. An output of the divider circuit 86 is applied to the input terminal B of the first adder 81.
The output of the first adder 81 is also applied to an address producing section 87 for producing an address in the memory 18.
On the other hand, an output of the second adder 82 is inputted to a binary-coding Judging circuit 88 for binary-coding judgment in the error diffusion processing through a register 94. Binary data outputted from this binary-coding judging circuit 88 is inputted to a binary-coding output circuit 40 (see FIG. 2) through a register 99. In addition, a binary-coded error produced at the time of binary-coding is outputted to a line 89 from the binary-coding judging circuit 88, and this error is applied to the input terminal A of the second adder 82 through registers 97 and 98. The binary-coded error can be also inputted to the input terminal A of the second adder 82 from the register 97 and a line 100.
The output of the second adder 82 is also directly fed back to an input terminal B of the adder 82. In addition, this output is fed back to the input terminal B of the adder 82 through registers 95 and 96. Furthermore, the output of the second adder 82 is also applied to the binary-coding judging circuit 88.
FIGS. 20 and 21 are timing charts for explaining an operation. Referring now to FIG. 20, description is made of shading correction processing, filtering processing and density adjustment processing. FIG. 20 (a) shows a clock signal CLK for defining a processing operation, FIG. 20 (b) shows image data ID inputted for each pixel from the analog-to-digital converter 17, FIG. 20 (c) shows the contents of processing, FIG. 20 (d) shows read data from the memory 18, FIG. 20 (e) shows write data to the memory 18, FIG. 20 (f) shows a value generated by the address counter 41 (see FIG. 2) which is contained in the address producing circuit 87, and FIG. 20 (g) shows the contents held by the read register 84. In addition, FIG. 20 (h) shows dividend data in the divider circuit 86, FIG. 20 (i) shows divisor data, and FIG. 20 (j) shows quotient data. Furthermore, FIG. 20 (k) shows data accepted from the input terminal A of the first adder 81, FIG. 20 (l) shows data accepted from the input terminal B of the first adder 81, and FIG. 20 (m) shows output data of the first adder 81. Furthermore, FIGS. 20 (n), 20 (o), 20 (p) and 20 (q) respectively show the contents held by the registers 90, 91, 92 and 93.
First, an operation related to the memory 18 will be described with reference to the following table 3.
TABLE 3______________________________________Cyclenumber 1 2 3 4 5 6 7 8______________________________________read/ read read write read write read read readwritecontents WST A B X RGn RGm BST GOUTof pro-cessingaddress -2 +0 -1 +0 +3 +0 +0 +1counter______________________________________
Processing with respect to the respective pixels is terminated in eight cycles from the first cycle to the eighth cycle. In the first cycle (WST), white reference data WST is read out from the memory 18, and the address counter 41 is decremented by two from its value at the present time point.
In the second cycle (A), data after shading correction is read out from the memory 18, and the value of the address counter 41 is not changed. The data after shading correction which is read out in the second cycle (A) is data on a line two lines ahead of the present line which is shown with an initial A in FIG. 5.
In the third cycle (B), data after shading correction is written, and the address counter 41 is decremented by one. The data written at this time is data on the present line which is shown with an initial B in FIG. 5.
In the fourth cycle (X), data after shading correction is read out, and the value of the address counter 41 is not changed, as in the second cycle (A). The data read out in this fourth cycle (X) is data on a line one line ahead of the present line which is shown with an initial X in FIG. 5.
In the fifth cycle (RGn), the accumulated error RGn in the foregoing equation (16) which is produced in the error diffusion processing is written to the memory 18. At this time, the address counter 41 is incremented by three.
In the sixth cycle (RGm), the accumulated error RGm expressed by the foregoing equation (11) which is obtained in the error diffusion processing on the line one line ahead of the present line is read out from the memory 18, and the value of the address counter 41 is not changed.
In the seventh cycle (BST), black reference data BST is read out. At this time, the value of the address counter 41 is not changed.
In the eighth cycle (GOUT), data GOUT after gamma correction which is generated from the gamma correcting table (see FIG. 6) is read, and the address counter 41 is incremented by one.
The image data ID are so sequentially applied that the order is first image data ID1 corresponding to the first pixel, then ID1, ID2, . . . FIG. 20 shows the image data ID8 corresponding to the eighth pixel and the image data corresponding to the subsequent pixels. In a time period during which the image data ID8 corresponding to the eighth pixel is inputted, black reference data WST9 stored in the memory 18 is first read out to correspond to the ninth pixel indicated by the address counter 41 in the first cycle (WST). This data read out is held in the register 91 on the leading edge of the clock signal CLK.
The address counter 41 is decremented by two so that its indicated value becomes "7". In the second cycle (A), data A7 after shading correction corresponding to the seventh pixel belonging to the line two lines ahead of the present line is read out. This data A7 is held in the read register 84, and is further applied to the one input terminal A of the first adder 81. Data SOUT7 after shading correction corresponding to the seventh pixel belonging to the present line which is outputted from the dividing circuit 86 is applied as data B7 to the other input terminal B of the first adder 81. Consequently, the sum (A7+B7) of the data A7 corresponding to the seventh pixel belonging to the line two lines ahead of the present line and the data B7 corresponding to the seventh pixel belonging to the present line is outputted to the output terminal of the first adder 81.
In the second cycle (A), the indicated value of the address counter 41 is held at "7". In the third cycle (B), the data SOUT7 after shading correction corresponding to the seventh pixel is stored in the location where the data A7 has been stored. Specifically, data after shading correction on the present line is written to a memory address from which data after shading correction on a line two lines ahead of the present line has been read out.
The above described operation of (A7+B7) in the first adder 81 is performed in the third cycle (B). This operation corresponds to addition of data corresponding to pixels A.sub.n and B.sub.n in the above described filtering processing. A bit calculation expression for the addition in the third cycle (B) is shown in FIG. 22. Specifically, 7-bit data A and 7-bit data B are added to each other, to obtain 8-bit data (A+B). In FIG. 22, A (0), A (1), . . . , B (0), B (1), . . . , A+B (0), A B (1), . . . represent data "0" or "1" for each bit.
The value (A7+B7) obtained by the addition in the third cycle (B) corresponding to the image data ID8 is stored in the data register 90 and is applied to the input terminal B of the first adder 81 in the fourth cycle (X). In the fourth cycle (X), data (A5+B5) held in the data register 93 is accepted in the input terminal A of the first adder 81. Specifically, in the fourth cycle (X), data (A7+B7) corresponding to the seventh pixel is held in the data register 90, data (A6+B6) corresponding to the sixth pixel is held in the data register 92, and data (A5+B5) corresponding to the fifth pixel is held in the data register 93. If the data A7 and B7 respectively correspond to the data A.sub.n and B.sub.n shown in FIG. 5, therefore, data A5 and B5 respectively correspond to the data A.sub.n-2 and B.sub.n-2.
4AV expressed by the following equation (17) which is the result of the addition in the first adder 81 is outputted to the output terminal of the adder 81:
4AV=(A7+B7)+(A5+B5) (17)
A bit calculation expression for this addition is shown in FIG. 22. 8-bit data (A+B) corresponding to the data (A7+B7) and 8-bit data (A+B)' corresponding to the data (A5+B6) are added to each other, to obtain 9-bit data 4AV which is the result of the addition. This 9-bit data 4AV corresponds to four times the average value AV of the data A7, B7, A5 and B5 corresponding to four pixels which are to be subjected to addition.
Since in the third cycle (B), the address counter 41 is decremented by one, data X6 after shading correction corresponding to the sixth pixel is read out from the memory 18 in the fourth cycle (X). This data X6 corresponds to the data X.sub.n-1 when the data A7 and B7 respectively correspond to the data A.sub.n and B.sub.n shown in FIG. 5.
The data X6 read out from the memory 18 is applied to the input terminal A of the first adder 81 from the read register 84 in the fifth cycle (RGn). At this time, data 2X6 which is two times the data X6 is applied to the input terminal A of the first adder 81 by a bit operation as described later. In addition, a value 2AV obtained by dividing 4AV which is the output of the first adder 81 in the fourth cycle (X) by two by a bit operation as described later is inputted to the input terminal B of the adder 81. 2AV inputted at this time is inverted and inputted. Consequently, an operation expressed by the following equation (18) is performed in the first adder 81. ##EQU9##
It is understood that the value expressed by the foregoing equation (18) is merely a differential value S corresponding to the sixth pixel belonging to the line one line ahead of the present line by comparing the equation (18) with the foregoing equation (3).
A bit calculation expression in the fifth cycle (RGn) is as shown in FIG. 22. Specifically, the data 4AV operated in the fourth cycle (X) is inverted (shown with an overline in FIG. 22), and is further shifted lower by one bit, thereby to generate data-2AV. The least significant bit AV (0) of the data 4AV is added to data X corresponding to the data X6 on the side of the least significant bit thereof, thereby to generate data 2X which is two times the data X. The data 2X and the data-2AV are added to each other, to obtain a 9-bit differential value S by the operation expressed by the foregoing equation (18).
Meanwhile, a random number (R1+R2-1) in the foregoing equation (3) is generated by the bit operations with respect to the above described data 4AV and X.
The differential value S thus operated is applied to the input terminal B of the first adder 81 in the subsequent sixth cycle (RGm), to perform an operation of (X6+S). Data is selected so as to adapt to a data processing method shown in the foregoing table 1 depending on the differential value S and the value (X6+S) which is the result of the addition, and the selected data is written to the data register 90 as data after filtering processing FOUT6 in the seventh cycle (BST).
A bit calculation in the sixth cycle (RGm) is performed so as to add lower seven bits of the data S generated in the fifth cycle and 7-bit data X.sub.n- 1, as shown in FIG. 22. Consequently, 8-bit data XS is obtained.
The data FOUT 6 after filtering processing is also applied to the input terminal B of the first adder 81 in the seventh cycle (BST). At this time, density correction data WD corresponding to a pixel position of the data FOUT6 after filtering processing is applied to the input terminal A of the first adder 81.
Therefore, the output of the first adder 81 becomes data WOUT6 expressed by the following equation (19) which is to be subjected to the density adjustment processing as shown in, for example, FIG. 8:
WOUT6=FOUT6+WD (19)
Gamma correction as described later is performed on the basis of this data WOUT6, to obtain data GOUT after gamma correction.
The addition expressed by the foregoing equation (19) for density adjustment is performed in the seventh cycle (BST), and the gamma correction is performed in the eighth cycle (GOUT). Bit calculation expressions in the seventh and eighth cycles are as shown in FIG. 23.
Since in the eighth cycle (GOUT), the value of the address counter 41 is "9", the black reference data BST9 stored to correspond to the ninth pixel is read out from the memory 18. An offset OFFSET is inverted and applied to the input terminal B of the first adder 81 from a register which is not shown in FIG. 19. In the first adder 81, an operation expressed by the following equation is performed:
BST'9=BST9-OFFSET (20)
A bit calculation expression in the first adder 81 in the eighth cycle (GOUT) is shown in FIG. 24. Specifically, a 7-bit offset OFFSET is subtracted from 7-bit data BST corresponding to the black reference data BST9, to obtain 8-bit data BST' corresponding to the data BST'9.
The value BST'9 obtained by the operation is applied to the input terminal B of the first adder 81 in the first cycle (WST) corresponding to the image data ID9 of the ninth pixel and is also held in the data register 90, as shown in FIG. 20. In this first cycle (WST), white reference data WST9 held in the data register 91 is applied to the input terminal A of the first adder 81. In the first adder 81, an operation given by the following expression (21) is performed:
WST9-BST'9 (21)
A bit calculation expression in the first cycle (WST) is as shown in FIG. 24. Specifically, 7-bit data BST' corresponding to the data BST'9 is subtracted from 7-bit data WST corresponding to the data WST9, to obtain 8-bit data (W-B'). This data (W-B') corresponds to the value (WST9-BST'9) given by the foregoing expression (21).
In the subsequent second cycle (A), the value given by the foregoing expression (21) is accepted as divisor data in the divider circuit 86, as shown in FIG. 20. In addition, the value BST'9 from the data register 90 is applied to the input terminal B of the first adder 81. On the other hand, the image data ID9 is accepted in the input terminal A of the first adder 81. An operation given by the following expression (22) is performed:
ID9-BST'9 (22)
A bit calculation expression for this operation is as shown in FIG. 24. Specifically, 7-bit data BST' corresponding to the data BST'9 is subtracted from 7-bit data ID corresponding to the image data ID9, to obtain 8-bit data (I-B'). This data (1-B') corresponds to data (ID9-BST'9) given by the foregoing expression (22).
In the subsequent third cycle (B), the value given by the foregoing expression (22) is accepted as dividend data in the divider circuit 86, as shown in FIG. 20. In a time period during which seven clocks CLK are inputted, division expressed by the following equation (23) is carried out. The result of the division is data SOUT9 after shading correction corresponding to the ninth pixel. ##EQU10##
It is clear from the comparison with the foregoing equation (1) that the value given by the equation (23) is a value subjected to shading correction.
Meanwhile, the data SOUT9 after shading correction is written to the memory 18 in the third cycle (B) corresponding to image data ID10 of the tenth pixel. The location to which the data is written at this time is the location from which the data A9 after shading correction on the line two lines ahead of the present line which has been read out for filtering processing immediately before the writing has been read out.
A bit calculation expression for the division expressed by the foregoing equation (23) is as shown in FIG. 24. Specifically, lower seven bits of the data (I-B') obtained in the second cycle are taken out and one bit is added to the lower seven bits on the side of the least significant bit thereof, to generate data of a total of eight bits. Lower seven bits of the data (W-B') obtained in the first cycle is subtracted from the 8-bit data (I-B'). As a result of the subtraction, 8-bit data DIV is obtained in the first to eight bit positions, and data SOUT (k) which is "1" or "0" (where 0 .ltoreq.k.ltoreq.7) depending on whether the subtraction is possible is obtained in the ninth bit position.
When the subtraction is possible, the divisor data (W-B') is subtracted from data obtained by shifting the result of the subtraction higher by one bit. On the other hand, when the subtraction is impossible, data obtained by shifting the data (I-B') which is an object of subtraction higher by one bit is used as an object of subtraction again.
Such an operation is repeated seven times, and data SOUT (k) obtained in the respective subtractions are accumulated, thereby to obtain 7-bit data SOUT. This data SOUT corresponds to the data SOUT9 given by the foregoing equation (23), to be data after shading correction.
Referring now to a timing chart of FIG. 21, description is made of gamma correction processing and error diffusion processing. The contents shown in FIGS. 21 (a) to 21 (g) are the same as those shown in FIGS. 20 (a) to 20 (g). FIG. 21 (r) shows data applied to the input terminal A of the second adder 82, FIG. 21 (s) shows data applied to the input terminal B of the second adder 82, and FIG. 21 (t) shows data representing the result of the operation outputted to the output terminal of the second adder 82. In addition, FIGS. 21 (u), 21 (v), 21 (w), 21 (x), 21 (y) and 21 (z) respectively show data held in the registers 94, 95, 96, 97, 98 and 99.
If data WOUT7 after density adjustment (see FIG. 20) is outputted from the first adder 81 in the seventh cycle (BST) corresponding to the image data ID9 of the ninth pixel, the address producing section 87 generates an address in the gamma correcting table. The data WOUT after density adjustment constitutes a part of the address in the gamma correcting table, as described above.
Consequently, in the eighth cycle (GOUT), data GOUT7 after gamma correction is read out from the memory 18, to achieve gamma correction (see FIG. 23).
The data GOUT7 after gamma correction is inputted to the input terminal A of the second adder 82 from the read register 84 as data GOUT (X7) corresponding to a target pixel in error diffusion processing in the first cycle (WST) corresponding to the image data ID10 of the tenth pixel. At this time, an accumulated error RG is applied to the input terminal B of the second adder 82 from the output terminal thereof.
This accumulated error RG corresponds to the accumulated error RG (m) expressed by the foregoing equation (11). Specifically, when a pixel corresponding to the data GOUT (X7) is the target pixel A shown in FIG. 18, the accumulated error RG is a value obtained by adding error diffusion coefficients times the respective errors HG produced in the pixels G, F, E, D, C and B in the vicinity of the target pixel A. If the image data ID inputted is data on the present line, the data GOUT (X7) corresponds to the seventh pixel belonging to a line one line ahead of the present line.
More specifically, a value obtained by adding error diffusion coefficients times binary-coded errors HG respectively produced with respect to data A6 corresponding to the sixth pixel, data A7 corresponding to the seventh pixel, data A8 corresponding to the eighth pixel and data A9 corresponding to the ninth pixel which belong to a line two line ahead of the present line, and data X5 corresponding to the fifth pixel and data X6 corresponding to the sixth pixel which belong to a line one line ahead of the present line, is an accumulated error RG inputted in the first cycle (WST). RAND is a random number. This random number RAND will be described later.
As a result of the foregoing, in the first cycle (WST) and the second cycle (A), data T (X7) expressed by the following equation (24) is outputted to the output terminal of the second adder 82:
T(X7)=GOUT (X7)+RG (24)
In such a manner, the above described [processing 3] in error diffusion processing is performed. Specifically, the above described data T (X7) corresponds to the data T (A) expressed by the foregoing equation (13) which is to be subjected to binary-coding judgment.
A bit calculation expression for this addition is shown in FIG. 25. Specifically, in the first cycle (WST) and the second cycle (A), 6-bit data GOUT and 8-bit data RG are added to each other, to obtain 8-bit data T.
In the third cycle (B), the above described data T (X7) is applied to the binary-coding judging circuit 88 to perform binary-coding judgment processing, so that binary data BIN (X7) is held in the register 99. On the other hand, in the binary-coding judging circuit 88, a binary-coded error HG (X7) corresponding to the data T (X7) is produced on the basis of the comparison between a binary-coding threshold value and the data T (X7), as shown in FIG. 25.
This generated binary-coded error HG (X7) is applied to the input terminal A of the second adder 82, as shown in FIG. 21. At this time, data RG (X4+X5) held in the register 96 is applied to the input terminal B of the second adder 82. When a pixel corresponding to the data X7 is the pixel A shown in FIG. 18, this data RG (X4+X5) corresponds to a value obtained by adding error diffusion coefficients times the binary-coded errors produced with respect to data X4 and the data X5 respectively corresponding to the pixels X and C shown in FIG. 18.
Specifically, if binary-coded errors in the pixels corresponding to the data X4 and X5 are respectively taken as HG (X4) and HG (X5), the data RG (X4+X5) is expressed by the following equation: ##EQU11## A value RG (X4+X5+X7) obtained by adding the above described accumulated error RG (X4+X5) to an error diffusion coefficient 1/8 times the binary-coded error HG (X7) is outputted to the output terminal of the second adder 82.
A bit calculation expression in the third cycle (B) is shown in FIG. 26. Specifically, the 8-bit binary-coded error HG (X7) generated in the second cycle (A) is shifted lower by only three bits to be a value which is one-eighth its original value and then, the value is added to 8-bit accumulated error RG (X4+X5). Consequently, an accumulated error RG (X4+X5+X7) expressed by the following equation (26) is obtained. In such a manner, the above described [processing 5] is performed. ##EQU12##
The accumulated error RG (X4+X5+X7) operated is then applied to the input terminal B of the second adder 82 in the fourth cycle (X). At this time, the binary-coded error HG (X6) in the sixth pixel belonging to the line one line ahead of the present line is applied to the input terminal A of the second adder 82 from the register 98.
In the fourth cycle (X) and the fifth cycle (RGn), the binary-coded error HG (X6) is shifted lower by only three bits to be a value which is one-eighth its original value, and the value is added to the accumulated error RG (X4+X5+X7), as can be seen from a bit calculation expression shown in FIG. 26. Consequently, an accumulated error RG (X4 to X7) expressed by the following equation (27) is obtained. Consequently, the above described [processing 6] in error diffusion processing is performed. ##EQU13##
This accumulated error RG (X4 to X7) operated is written to the register 94 and is written to the memory 18, which is used when error diffusion processing is performed with respect to a pixel belonging to the present line.
In the sixth cycle (RGm), the binary-coded error HG (X7) corresponding to the data X7 held in the register 97 is applied to the input terminal A of the second adder 82. The binary-coded error HG (X6) corresponding to the data X6 held in the register 98 is applied to the input terminal B of the second adder 82. An accumulated error RG (X6+X7) expressed by the following equation (28) is operated by a bit calculation shown in FIG. 25. Consequently, the above described [processing 1] is performed. ##EQU14##
The accumulated error RG (X6+X7) obtained is applied to the input terminal B of the second adder 82 in the subsequent seventh cycle (BST), as Shown in FIG. 21. At this time, an accumulated error RG (A7 to A10) found when error diffusion processing is performed utilizing a line corresponding to the image data ID currently inputted as the present line with respect to a pixel corresponding to the line two lines ahead of the present line is applied to the input terminal A of the second adder 82. This accumulated error RG (A7 to A10) is read out as data RGm from the memory 18 in the sixth cycle (RGm), and is applied to the input terminal A of the second adder 82 from the read register 84 in the seventh cycle (BST).
The accumulated error RG (A7 to A10) is data corresponding to the data X8 which is to be subsequently subjected to error diffusion processing. Specifically, if the data X8 corresponding to the eighth pixel belonging to the line one ahead of the present line corresponds to the pixel A shown in FIG. 18, a value obtained by accumulating binary-coded errors in data A7 to A10 corresponding to the seventh pixel to the tenth pixel belonging to the line two lines ahead of the present line which correspond to the pixels G, F, E and D is an accumulated error RG (AT to A10). Specifically, if the binary-coded errors corresponding to the data A7 to A10 are respectively taken as HG (A7), HG (A8), HG (A9) and HG (A10), the accumulated error RG (A7 to A10) is expressed by the following equation (29): ##EQU15##
Consequently, in the seventh cycle (BST), an accumulated error RG (A7 to A10+X6+X7) expressed by the following equation (30) is operated in the second adder 82, so that the above described [processing 2] is performed:
RG(A7 to A10+X6+X7)=RG(A7 to A10)+RG(X6+X7) (30)
A bit calculation expression for this operation is as shown in FIG. 25. Specifically, a 8-bit accumulated error RG (X6+X7) which is the result of the operation in the sixth cycle (RGm) and a 7-bit accumulated error RGm (=RG (A7 to A10)) read from the memory 18 are added to each other.
The result of the addition in the seventh cycle (BST) is applied to the input terminal B of the second adder 82 again in the eighth cycle (GOUT). At this time, a random number RAND is inputted to the input terminal A of the second adder 82. As a result, an accumulated error RG (A7 to A10+X6+X7+RAND) is outputted to the output terminal of the second adder 82.
The addition of the random number RAND has the following significance. Specifically, it has been known by experience that if error diffusion processing is performed in a case where density data in an image portion having a relatively large area has a particular predetermined value corresponding to an intermediate density, an image after the processing is significantly degraded. The degradation of the image can be eliminated by the above described addition of the random number.
The accumulated error RG (A7 to A10+X6+X7+RAND) operated by the second adder 82 is applied to the register 94, and is applied to the input terminal B of the second adder 82 in the first cycle (WST) corresponding to image data ID11 of the subsequent eleventh pixel.
Thereafter, the same error diffusion processing as that performed with respect to the data X7 in a time period during which the image data ID9 corresponding to the ninth pixel is inputted, is performed with respect to the data X8 corresponding to the eighth pixel belonging to the line one line ahead of the present line.
As described in the foregoing, in the construction shown in FIG. 19, the shading correction processing, the filtering processing and the density adjustment processing are attained mainly by the first adder 81, the dividing circuit 86, the registers 90, 92 and 93, the address producing circuit 87 and the like, and the gamma correction and the error diffusion processing are attained mainly by the second adder 82, the binary-coding judging circuit 88, the registers 95 to 98 and the like.
Description is now made of isolated point removal processing performed in the isolated point removal processing section 39 (see FIG. 2) with respect to a binary image.
FIGS. 27 (a), 27 (b) 28 (a) to 28 (d), and 29 (a) to 29 (d) are diagrams for explaining isolated point removal processing. The isolated point removal processing is processing for converting, when the value of a target pixel which is indicated by a mark "*" is different from the value of any one of pixels in predetermined positions surrounding the target pixel in a binary image processed by the simple binary-coding processing section 36, the value of the target pixel into the value of the pixels around the target pixel.
More specifically, if the target pixel is a white pixel and eight pixels around the target pixel are black pixels as shown in FIG. 27 (a), the target pixel is an isolated white pixel. Therefore, this isolated white pixel is converted into a black pixel. On the other hand, FIG. 27 (b) shows a case where the target pixel is an isolated black pixel. At this time, the target pixel is converted into a white pixel.
Furthermore, FIGS. 28 (a) to 28 (d) and 29 (a) to 29 (d) show cases where pixels having different values from the value of the target pixel surround the target pixel in a "U" shape. Also in this case, the value of the target pixel is converted. Specifically, the value of the target pixel is converted into a black pixel in cases shown in FIGS. 28 (a) and 28 (b) and FIGS. 29 (a) and 29 (b), and the value of the target pixel is converted into a white pixel in cases shown in FIGS. 28 (c) and 28 (d) and FIGS. 29 (c) and 29 (d).
By such isolated point removal processing, noise components remaining in a binary image, the effect of jitter caused by the non-uniformity in conveyance of a document, and the like are removed, thereby to make it possible to reproduce a good binary image. Moreover, an isolated point is removed, thereby to make it possible to improve data compression efficiency. Therefore, the number of transmission codes generated by coding processing such as MH, MR and MRR is reduced, thereby to make it possible to reduce time required for facsimile communication.
FIG. 30 is a block diagram showing the construction related to the isolated point removal processing section 39. A line memory 110 constituted by storage areas in a part of the memory 18 (see FIG. 6) has a storage capacity capable of storing respective binary data corresponding to pixels belonging to two lines. A control circuit 111 is connected to the line memory 110. Address signals AD1 to ADm of m bits (eight bits in the present embodiment) are applied from the control circuit 111 to the line memory 110. The control circuit 111 also applies a write enable signal WE and an output enable signal OE to the line memory 110. An overline attached to a sign representing a signal shall indicate that the signal is a signal having a negative logic, and the description of the overline is omitted in the specification.
An image processing unit 112 comprising components taking charge of respective processing from shading correction processing to simple binary-coding processing before isolated point removal processing is connected to the control circuit 111. This image processing section 112 outputs binary data BID binary-coded for each pixel in series bit by bit.
This binary data BID is applied to a serial input terminal SI of a shift register SRz of n bits (two bits in the present embodiment). This shift register SRz accepts the binary data BID bit by bit on the basis of a clock signal CK3 applied from the control circuit 111. Parallel output terminals PO1 to POn of the shift register SRz are connected to input terminals DI1 to DIn of the line memory 110 through a line 113.
On the other hand, output terminals DO1 to DOn of the line memory 110 are connected to parallel input terminals PI1 to PIn of each of n-bit shift registers SRz and SRy. The shift registers SRx and SRy are respectively provided with control signal input terminals S/P to which a trigger signal for latching n-bit data from the line memory 110 in parallel is inputted, and control signals LO1 and LO2 from the control circuit 111 are respectively applied to the control signal input terminals S/P. Data from the input terminals PI1 to PIn are latched on the trailing edge of each of the control signals LO1 and LO2.
Clock signals CK1 and CK2 for data shifting are respectively inputted to the shift registers STx and SRy from the control circuit 111. If the clock signal CK1 is applied, data is shifted by one bit in the shift register SRx, so that data are outputted bit by bit from a serial output terminal SO. The same is true for the shift register SRy.
Respective serial output signals of the shift registers SRx, SRy and SRz are applied to respective serial input terminals SI of 3-bit shift registers 121, 122 and 123, and are accepted on the basis of the clock signals CK1, CK2 and CK3, respectively.
3-bit data respectively accepted in the shift registers 121, 122 and 123 are applied to input terminals A, B, C, . . . , I of a binary-coding rejudging circuit 115 from respective parallel output terminals POn+1, POn+2 and POn+3 of the shift registers 121, 122 and 123. This binary-coding rejudging circuit 115 performs the above described isolated point removal processing shown in FIG. 27, 28 and 30 utilizing a pixel corresponding to the data applied to the input terminal E as a target pixel, to output data E' after the processing.
A mode register 116 is connected to the binary-coding rejudging circuit 115. Data MO1 to MOk of k bits (two bits in the present embodiment) for selecting a mode for isolated point removal processing are applied from the CPU 14 (see FIG. 1) to the mode register 116. In the present embodiment, three types of modes can be selected. The value of the target pixel is converted if the condition shown in FIG. 27 holds in the first mode, is converted if the condition shown in FIG. 27 or 28 holds in the second mode, and is converted if the condition shown in FIG. 27, 28 or 29 holds in the third mode.
FIG. 31 is a diagram for explaining the relationship among data inputted to the binary-coding rejudging circuit 115. Data ID1z, ID2z and ID3z corresponding to three pixels belonging to the present line which have been subjected to processing in the image processing unit 112 are outputted from the shift register 123. In addition, data corresponding to a line one line ahead of the present line are applied to the shift register 122 from the shift register SRy, and data ID1y, ID2y and ID3y corresponding to three pixels out of the data are outputted from the shift register 122. Furthermore, data corresponding to a line two lines ahead of the present line are applied to the shift register 121 from the shift register SRx, and data ID1x, ID2x and ID3x corresponding to three pixels out of the data are outputted from the shift register 121.
As a result, binary data corresponding to respective pixels constituting a matrix with 3.times.3 pixels as shown in FIG. 31 are inputted in parallel to the binary-coding rejudging circuit 115. At this time, the data ID2x applied to the input terminal E is utilized as data corresponding to the target pixel to perform processing. Since the data are processed in the order read by the image sensor 15 (see FIG. 1), a pixel corresponding to data first inputted to the shift registers 121, 123 and 124 is a pixel close to the head end position of each line.
FIG. 32 is a timing chart for explaining an operation. FIG. 32 (a) shows a cycle number, FIG. 32 (b) shows binary data BID corresponding to the present line which is inputted to the shift register SRz, FIG. 32 (c) shows address signals AD1 to ADm, FIG. 32 (d) shows low active write enable signal WE, FIG. 32 (e) shows a low active output enable signal 0E, FIG. 32 (f) shows data outputted to the output terminals DO1 to DOn of the line memory 110, and FIG. 32 (g) shows data written to the line memory 110 from the input terminals DI1 to DIn of the line memory 110. In addition, FIGS. 32 (h) and 32 (j) respectively show the control signals LO1 and LO2 applied to the shift registers SRx and SRy. Data are respectively written in parallel to the shift registers SRx and SRy on the trailing edges of the signals LO1 and LO2. In addition, FIGS. 32 (i), 32 (k) and 32 (1) respectively show clock signals CK1, CK2 and CK3, and FIG. 32 (m) to 32 (v) respectively show data inputted to the binary-coding rejudging circuit 115.
Binary data ID1z, ID2x, ID3z, . . . , ID(n-1)z corresponding to respective pixels constituting the present line are sequentially inputted to the shift register SRz in a time period from the second cycle to the (n-1)-th cycle. If the data IDnz is inputted to the shift register SRz in the n-th cycle, the output enable signal OE attains a low level at the time t1. At this time, the values of the addresses AD1 to ADm are values (IDny) corresponding to n-bit data ID1y to IDny belonging to a line one line ahead of the present line. Accordingly, the n-bit data ID1y to IDny are outputted to the output terminals DO1 to DOn. The data are latched in parallel to the shift register SRy in synchronization with the trailing edge of the control signal LO2.
If the output enable signal OE rises at the time t2, the addresses AD1 to ADm are switched to values (IDnx) corresponding to n-bit data ID1x to IDnx belonging to a line two lines ahead of the present line. At the time t3 after the addresses are switched, the output enable signal OE attains a low level again. Consequently, the n-bit data ID1x to IDnx corresponding to the line two lines ahead of the present line are outputted to the output terminals DO1 to DOn. The data are written to the shift register SRy in synchronization with the trailing edge of the control signal LO1.
If the output enable signal OE rises at the time t4, the write enable signal WE falls at the time t5 with the addresses being kept invariable at this time. Consequently, n-bit data ID1z to IDnz corresponding to the present line which are held in the shift register SRz are stored in addresses (IDnx) at which the data ID1 to IDnx corresponding to the line two lines ahead of the present line have been stored. Specifically, if the data corresponding to the line two lines ahead of the present line are read out for isolated point removal processing, the data corresponding to the present line are written to the locations from which the data haven been read out. As a result of the foregoing, the isolated point removal processing which is processing with respect to pixels belonging to the three lines can be realized by the line memory 110 having a capacity corresponding to two lines.
On the other hand, the first data ID1y out of the data written to the shift register SRy is written to the first stage of the shift register 122 by the clock signal CK2 applied at the time t6. Similarly, the respective first data ID1x and ID1z out of the data written to the shift registers SRx and SRz are written to the first stages of the shift registers 121 and 123 by the clock signals CK1 and CK3 applied at the time t7.
Thereafter, the data are shifted in the shift registers 121, 122 and 123 by the clock signals CK1, CK2 and CK3. As a result, the data corresponding to the nine pixels constituting the matrix shown in FIG. 31 are inputted in parallel to the input terminals A to I of the binary-coding rejudging circuit 115 in a time period from the time t8.
Data ID'2 representing the result of the judgment by the binary-coding rejudging circuit 115 is outputted from the output terminal E'.
FIG. 33 is a timing chart for explaining the final operation of isolated point removal processing with respect to pixels belonging to one line. Signals or data shown in FIGS. 33 (a) to 33 (x) are the same as those shown in FIG. 32. In this example, a case is assumed where one line is constituted by 99 pixels. In addition, for simplicity of illustration, n is taken as 2 and M is taken as 8.
The image processing unit 112 outputs binary data ID99z corresponding to the last pixel belonging to the present line and then, immediately outputs not data corresponding to the succeeding line but dummy data dummy. This dummy data dummy is data corresponding to, for example, a white pixel.
The dummy data dummy is outputted when the number of pixels constituting one line is different from an integral multiple of the number of pixels read out/written by one access to the line memory 110. Specifically, the image processing unit 112 outputs the dummy data dummy from the time when binary data ID99x corresponding to the last pixel belonging to one line is written to the shift register SRx to the time when data corresponding to n pixels (two pixels in the example shown in FIG. 33) which are not written in the line memory 110 are accumulated in the shift register SRx.
Meanwhile, there arises a problem when continuous addresses are alternately assigned to the respective lines in the line memory 110 capable of storing data corresponding to two lines. For example, a case is assumed where data corresponding to a line one line ahead of the present line are stored in odd addresses . . . , "95", "97", "99", . . . , and data corresponding to a line two lines ahead of the present line are stored in even addresses . . . , "96", "98", . . . At this time, data corresponding to the lines one line and two lines ahead of the present line can be alternately read out by generating continuous addresses.
On the other hand, data corresponding to the present line are written to addresses from which data corresponding to the line two lines ahead of the present line have been read out in the line memory 110, as described above. Specifically, in the above described case, the data corresponding to the present line are written to the even addresses, . . . , "96", "98", . . . As a result, when data corresponding to a line succeeding the present line are applied from the image processing unit 112, data corresponding to a line one line ahead of the succeeding line are stored in the even addresses, . . . , "96", "98", . . . and data corresponding to a line two lines ahead of the succeeding line are stored in the odd addresses, . . . , "95", "97", "99", . . . Specifically, the correspondence between the odd and even addresses and data differs for each processing with respect to one line.
In the present embodiment, therefore, generated addresses are made different for each line. Specifically, continuous addresses as shown in FIG. 33 (c) are generated with respect to a given line, and addresses as shown in FIG. 34 (c) are generated with respect to the succeeding line. Specifically, the even addresses and the odd addresses are exchanged so that addresses at which data are written inevitably become addresses at which data corresponding to a line two lines ahead of the present line have been stored.
The construction provided in the control circuit 111 for generating such addresses is shown in FIG. 35. Specifically, an output of an output terminal Q1 corresponding to the least significant bit of an address counter 125 for generating continuous 8-bit addresses AD1 to AD8 on the basis of a clock signal CKIN becomes the least significant bit AD1 out of the addresses AD1 to AD8 through an exclusive OR-gate 126. A signal ROW which is toggled between "0" and "1" for each line is applied from the image processing unit 112 to the exclusive OR gate 126. A signal of the output terminal Q1 directly becomes the least significant bit AD1 if the signal ROW is "0", being inverted to be the least significant bit AD1 if the signal ROW is "1". Consequently, the continuous addresses shown in FIG. 33 (c) and the discontinuous addresses shown in FIG. 34 (c) are alternately generated.
FIG. 36 is a diagram showing the internal construction of the binary-coding rejudging circuit 115. The binary-coding rejudging circuit 115 comprises a logical operating section 14 constituted by a logic circuit mainly composed of AND gates. Binary data corresponding to pixels arranged in a matrix with 3.times.3 pixels are inputted to the logical operating section 140 from the input terminals A, B, C, . . . , I thereof. In addition, 2-bit mode selection data MO1 and MO2 from the mode register 116 are inputted to the logical operating section 140 through an OR gate 141, an AND gate 142 and a line 146.
The logical operating section 140 are functionally divided into ten logic circuit sections 130, 132, . . . , 139. Each of the logic circuit sections 130 to 139 outputs a signal having a logic: "1" to a line 143 when output signals of the input terminals A to I, the OR gate 141 and the AND gate 142 enter a state shown in FIG. 36. For example, the logic circuit section 130 outputs a signal having a logic "1" to a line 143a when input signals from the input terminal E and the OR gate 141 halve a logic "1" and the remaining input signals have a logic "0".
The signal outputted to the line 143 is applied to one input terminal of an exclusive-OR gate 145 through an OR gate 144. The signal from the input terminal E is applied to the other input terminal of the exclusive-OR gate 145. An output of the exclusive OR gate 145 is outputted to an output terminal E' as data corresponding to a target pixel after binary-coding rejudgment processing. Specifically, input data from the input terminal E which is binary data corresponding to the target pixel is inverted if the output of the OR gate 144 has a logic "1", while being data after binary-coding rejudgment processing without any change if the output of the OR gate 144 has a logic "0".
It is assumed that a white pixel has a logic "1" and a black pixel has a logic "0". In this case, as apparent from the comparison between FIGS. 27, 28 and 29 and FIG. 31, there is the following correspondence between the logic circuit sections 130 to 139 and FIGS. 27, 28 and 29:
logic circuit section 130 . . . FIG. 27 (a)
logic circuit section 131 . . . FIG. 27 (b)
logic circuit section 132 . . . FIG. 28 (a)
logic circuit section 133 . . . FIG. 28 (b)
logic circuit section 134 . . . FIG. 28 (c)
logic circuit section 135 . . . FIG. 28 (d)
logic circuit section 136 . . . FIG. 29 (a)
logic circuit section 137 . . . FIG. 29 (b)
logic circuit section 138 . . . FIG. 29 (c)
logic circuit section 139 . . . FIG. 29 (d)
On the other hand, the correspondence between the above described first, second and third modes and the mode selection data MO1 and MO2 is as follows:
first mode . . . MO1=1, MO2=0
second mode . . . MO1=0, MO2=1
second mode . . . MO1=1, MO2=1
Consequently, in the first mode, only the output signal of the OR gate 141 has a logic "1", so that only the logic circuit sections 130 and 131 are effective. With respect to the images shown in FIG. 27 (a) and 27 (b), therefore, the binary data applied to the input terminal E is inverted.
Furthermore, in the second mode, the output signal of the OR gate 141 and the signal from the line 146 have a logic "1", so that the logic circuit sections 130 to 135 are effective. Therefore, with respect to the images shown in FIG. 27 (a) and 27 (b) and FIGS. 28 (a), 28 (b), 28 (c) and (d), the binary data applied to the input terminal E is inverted.
Additionally, in the third mode, all the output signal of the OR gate 141, the output signal of the AND gate 142 and the signal from the line 146 have a logic "1", so that all the logic circuit sections 130 to 139 are effective. Therefore, with respect to all the images shown in FIGS. 27, 28 and 29, the data from the input terminal E is inverted.
In the above described manner, the binary-coding rejudgment processing in each mode is achieved. The patterns shown in FIGS. 27, 28 and 29 cover all patterns in which an isolated pixel occurs. Accordingly, an isolated pixel existing in a binary image is reliably removed even if it occurs due to any cause. Consequently, compression efficiency in compression coding of the binary image is increased, thereby to make it possible to decrease the amounts of transmission codes. Consequently, it is possible to increase the speed of communication and shorten a time period during which a communication line is occupied.
It may be determined in consideration of a balance between the image quality and the transmission speed which mode of the first, second and third modes is to be selected.
On the other hand, storage areas in a part of the memory 18 are used as the line memory 110 for isolated point removal processing, as described above. Therefore, processing can be performed without preparing high-cost and complicated structures capable of storing binary data corresponding to one line such as a shift register and an FIFO (first-in first-out) memory, thereby to make it possible to contribute to the reduction in cost.
Furthermore, access to the line memory 110 is made in units of a plurality of pixels using a n-bit shift register. Therefore, the number of times of access to the line memory 110 may be small, thereby to make it possible to perform high-speed processing. Moreover, binary data is read/written in units of a plurality of pixels, thereby to make it possible to share common storage areas with filtering processing and error diffusion processing for processing multivalued density data constituted by a plurality of bits (see FIG. 6).
FIG. 37 is a block diagram showing another example of the construction of an isolated point removal processing section 39. In FIG. 37, portions corresponding to the respective portions shown in FIG. 30 are assigned the same reference numerals. In the example of the construction, a line memory 110A capable of storing as one word 2n-bit data which is two times the capacity of shift registers SRx, SRy and SRz and capable of storing binary data corresponding to two lines as a whole is formed in storage areas in a part of the memory 18 (see FIG. 1).
The n-bit data corresponding to the present line which are held in the shift register SRz are applied to terminals DI1 to DIn corresponding to lower n bits out of 2n-bit input terminals DI1 to DI2n of the line memory 110A. In addition, n-bit data corresponding to a line one line ahead of the preset line which are held in the shift register SRy are applied to terminals DIn+1 to DI2n corresponding to higher n bits.
On the other hand, data outputted to terminals DO1 to DOn corresponding to lower n bit out of 2n-bit output terminals DO1 to DO2n of the line memory 110A are applied to the shift register SRy corresponding to a line two lines ahead of the present line. In addition, data outputted to terminals DOn+1 to DO2n corresponding to higher n bits are applied to the shift register SRx corresponding to a line one line ahead of the present line.
A control signal LO1 and a clock signal CK1 from a control circuit 111A are applied to both the shift registers SRx and SRy.
By this construction, the n-bit data corresponding to the present line are written to lower n bits of each of words in the line memory 110A. In a time period during which data corresponding to a line succeeding the present line are applied from an image processing unit 112, the n-bit data corresponding to the present line are applied to the shift register SRy as data corresponding to a line one line ahead of the succeeding line.
The data corresponding to a line one line ahead of the present line which are written in the shift register SRy are written as data corresponding to upper n bits of each of words in the line memory 110A. When processing with respect to the succeeding line is performed, the data corresponding to the line one line ahead of the present line are applied to the shift register SRx as data corresponding to a line two lines ahead of the succeeding line.
FIG. 38 is a timing chart for explaining an operation. The image processing unit 112 so sequentially outputs data corresponding to the present line in a time period from the second cycle that the order is first the data corresponding to the first pixel. At this time, the control circuit 111A sets addresses AD1 to ADm to a value "0" corresponding to the first pixel in a time period elapsed until data ID(n-1)z corresponding to the (n-1)-th pixel is outputted and data IDnz corresponding to the n-th pixel is further outputted.
At the time t11 when data corresponding to n pixels are accumulated in the shift register SRz, an output enable signal OE falls, so that n-bit data are outputted to the output terminals DO1 to DOn of the line memory 110A and are applied to the shift register SRy. The n-bit data correspond to data ID1y to IDny corresponding to the first pixel to the n-th pixel belonging to a line one line ahead of the present line. In addition, n-bit data are also outputted to the output terminals DOn+1 to DO2n of the line memory 110A and are applied to the shift register SRx. The n-bit data correspond to data ID1x to IDnx corresponding to the first pixel to the n-th pixel belonging to a line two lines ahead of the present line.
When the output enable signal OE rises at the time t12, a write enable signal WE alternately falls at the time t13, so that data ID1z to IDnz corresponding to n pixels belonging to the present line which are held in the shift register SRz are written to the line memory 110A from the input terminals DI1 to DIn thereof. At the same time, data ID1y to IDny corresponding to n pixels belonging to the line one line ahead of the present line which are held in the shift register SRy are written to the line memory 110A from the input terminals DIn+1 to DI2n thereof. Addresses at which data are written at this time are addresses to which the data ID1y to IDny and ID1x to IDnx corresponding to the lines one line and two lines ahead of the present line have been written. Specifically, new data are written to addresses from which data have been read out.
After the writing is terminated, the control circuit 111A switches addresses AD1 to ADm to the subsequent value "1" in a time period from the (n+1) cycle.
When a clock signal CK1 is applied at the time t14, a shifting operation is performed in the shift registers SRx and SRy. As a result, the data ID1x and ID1y corresponding to the respective first pixels belonging to the lines one line and two lines ahead of the present line are respectively inputted to input terminals C and F of the binary-coding rejudging circuit 115 which correspond to the respective first stages of shift registers 121 and 122.
Furthermore, when a clock signal CK3 is applied to the shift register SRz at the time t15, the data ID1z corresponding to the first pixel belonging to the present line is held in the first stage of the shift register 123, and is applied to the input terminal I of the binary-coding rejudging circuit 115 as a shifting operation is performed in the shift register SRz.
Thereafter, a shifting operation is performed in the shift registers SRx, SRy and SRz and the shift registers 121, 122 and 123 as the clock signals CK1 and CK3 are inputted. At the time t16, data corresponding to nine pixels for performing binary-coding rejudgment processing of the data ID2y are inputted in parallel to the binary-coding rejudging circuit 115. Consequently, data ID'2y after rejudgment is outputted to the output terminal E'.
In the above described manner, in the example of the construction, data corresponding to adjacent two lines are stored by bit division of each word in the line memory 110A in performing isolated point removal processing using a line memory corresponding to two lines. The shift registers SRx, SRy and SRz and the line memory 110A are connected to each other so that data corresponding to a line ahead of a line corresponding to lower bits of each word are stored in upper bits of the word.
By this construction, if continuous addresses are generated for processing with respect to any line, data corresponding to lines one line and two lines ahead of the present data can be applied to the shift registers SRx and SRy. Accordingly, the necessity of devising addresses applied to the line memory 110A as in the example of the above described first construction shown in FIG. 30 is eliminated. Consequently, the necessity of applying a signal ROW which is toggled for each processing with respect to one line to the control circuit 111A from the image processing unit 112 is also eliminated.
Although description was made in the foregoing, the present invention is not limited to the above described embodiments. For example, although in the above described embodiments, a facsimile is taken as an example, the present invention is widely applicable to a structure for processing image data obtained by optically reading an image, for example, an image scanner and a copying machine.
Although the present invention has been described and illustrated in detail, it is clearly understood that the same is by way of illustration and example only and is not to be taken by way of limitation, the spirit and scope of the present invention being limited only by the terms of the appended claims.

Claims

1. An image data processing apparatus, to which data, representative of pixels on each of a plurality of scanning lines, are sequentially supplied, said apparatus performing processing with data corresponding to N lines including supplied data corresponding to a present line to which pixels represented by the supplied data belong and data corresponding to (N-1) other lines scanned just ahead of the present line, said apparatus comprising:
storing means, having a data capacity corresponding to (N-1) lines, for storing data representative of pixels belonging to the (N-1) lines scanned just ahead of the present line;
means for sequentially reading out from the storing means, data representative of pixels belonging to the (N-1) lines scanned just ahead of the present line to provide read data, the reading means reading out data representative of a pixel belonging to the line scanned (N-1) lines ahead of the present line in parallel with data representative of pixels belonging to other lines scanned ahead of the present line;
processing means, to which the read data representative of the pixels belonging to the (N-1) lines and the data representative of the pixels belonging to the present line are applied, for performing predetermined processing; and
means for writing the supplied data representative of the pixels belonging to the present line to storage locations from which data representative of pixels belonging to a line scanned (N-1) lines ahead of the present line have been read out from said storing means before the reading out means reads out, from the storing means, all data representative of pixels belonging to the line scanned (N-1) lines ahead of the present line.
2. An image data processing apparatus to which data pixels on each of a plurality of scanning lines, are sequentially supplied, said apparatus performing predetermined processing with data corresponding to three lines and representative of nine pixels that constitute a 3.times.3 pixel matrix, the three line corresponding data including data corresponding to a present line to which pixels represented by the supplied data belong, data corresponding to a line scanned one line ahead of the present line, and data corresponding to a line scanned two lines ahead of the present line, said 3.times.3 pixel matrix being centered with respect to a target pixel belonging to said line scanned one line ahead of the present line, said apparatus comprising:
storing means, having a data capacity corresponding to two lines, for storing data representative of pixels corresponding to the line scanned one line ahead of the present line and the line scanned two lines ahead of the present line;
reading means for sequentially reading out, from the storing means, data representative of pixels belonging to the lines scanned one line and two lines ahead of the present line to provide read data, the reading out means reading out data representative of a pixel belonging to the line scanned one line ahead of the present line in parallel with data representative of a pixel belonging to the line scanned two lines ahead of the present line;
processing means, to which said read data representative of the pixels belonging to the lines scanned one line and two lines ahead of the present line and the data representative of the pixels belonging to the present line are applied, for subjecting data representative of the target pixel to the predetermined processing based upon predetermined data from among the data representative of the nine pixels constituting said 3.times.3 pixel matrix; and
writing means for writing the supplied data representative of the pixels belonging to the present line to storage locations from which data representative of the pixels belonging to the line scanned two lines ahead of the present line have been read out from said storing means before the reading means reads out, from the storing means, all data representative of pixels belonging to the line scanned two lines ahead of the present line.
3. An image data processing apparatus according to claim 2, further comprising
means for reading out, in parallel, data representative of a predetermined number of pixels from among pixels belonging to each of the lines scanned one line and two lines ahead of the present line from said storing means,
first shift register means to which the data representative of said predetermined number of pixels belonging to the line scanned two lines ahead of the present line which have been read out from said storing means are written in parallel and from which data representative of each pixel are outputted in series,
second shift register means to which the data representative of said predetermined number of pixels belonging to the line scanned one line ahead of the present line which have been read out from said storing means are written in parallel and from which data representative of each pixel are outputted in series, and
third shift register means for accepting data corresponding to the present line for each pixel to hold data representative of said predetermined number of pixels, said third register means outputting the held data in series in the same order as inputted, and outputting the data corresponding to said predetermined number of pixels in parallel, and wherein
data representative of the pixels belonging to the line scanned two lines ahead of the present line from said first shift register means, data representative of the pixels belonging to the line scanned one line ahead of the present line from said second shift register means, and data corresponding to the pixels belonging to the present line from said third shift register means are applied in parallel to said processing means, and
said writing means writes the data representative of the predetermined number of pixels belonging to the present line which are held in said third shift register means, in parallel, to storage locations in the storing means from which said data representative of the pixels belonging to the line scanned two lines ahead of the present line have been read out to said first shift register means.
4. An image data processing apparatus according to claim 2, wherein
said storing means can store data corresponding to two lines in storage areas assigned continuous addresses and stores data corresponding to pixels belonging to each of the lines in alternate addresses, said apparatus further comprising
first address producing means for sequentially producing continuous addresses to be applied to said storing means,
second address producing means for sequentially producing addresses to be applied to said storing means in an order in which a pair of continuous addresses have been exchanged, and
means for switching the addresses produced by said first address producing means and the addresses produced by said second address producing means with respect to one line and applying the addresses to said storing means, and wherein
said reading means sequentially reads out the data representative of pixels belonging to the lines scanned one line and two lines ahead of the present line in accordance with the addressees applied to said storing means, and
said writing means writes data representative of the pixels belonging to said present line to storage locations from which the data representative of the pixels belonging to the line scanned two lines ahead of the present line have been read out from said storing means in accordance with the addresses applied to said storing means.
5. An image data processing apparatus according to claim 2, wherein
said storing means stores data representative of pixels belonging to different lines in an upper bit portion and a lower bit portion, respectively, in each of said storage locations, and stores data corresponding to two lines as a whole, and
said reading means reads out data representative of pixels belonging to the lines scanned one line and two lines ahead of the present line in parallel from said storing means, said apparatus further comprising
a first register to which data of a first portion, which is one of the upper bit portion and the lower bit portion, from among the data read out in parallel from said storing means is written as data on the line scanned two lines ahead of the present line,
a second register to which data of a second portion, which is the other of the upper bit portion and the lower bit portion, from among the data read out in parallel from said storing means is written as data on the line scanned one line ahead of the present line,
a third register for accepting and holding data corresponding to the present line for each pixel,
means for applying the data held in said second register to the storing means as data of said first portion in said storing means, and
means for applying the data held in said third register to the storing means as data of said second portion in said storing means,
data representative of pixels belonging to the line scanned two lines ahead of the present line from said first register, data representative of pixels belonging to the line scanned one line ahead of the present line from said second register, and data representative of pixels belonging to the present line from said third register being applied in parallel to said processing means,
said writing means writing, in parallel, the data representative of the pixels belonging to the line scanned one line ahead of the present line and the data representative of the pixels belonging to the present line which are respectively held in said second register and said third register to storage locations in the storing means from which the data have been read out to said first register and said second register.
6. An image data processing apparatus according to claim 2, wherein
data corresponding to each of pixels are multivalued data which are a representation of a density of a pixel at a plurality of gray levels, and
said processing means determines whether an image area which is to be processed is a halftone image area or a binary image area on the basis of the data corresponding to the nine pixels constituting said 3.times.3 pixel matrix and subjects a binary image area to processing for emphasizing an edge portion of an image.
7. An image data processing apparatus according to claim 2, wherein
data representative of each of the pixels are binary data, and
when all binary data corresponding to a plurality of pixels in predetermined positions surrounding a target pixel in said 3.times.3 pixel matrix are equal to each other and are different from binary data representative of the target pixel, said processing means inverts the binary data representative of said target pixel.
8. An image data processing apparatus according to claim 7, further comprising
mode selecting means for selecting one or a plurality of groups of pixels from a plurality of groups of pixels respectively formed by extracting a predetermined plurality of pixels from pixels surrounding the target pixel in said 3.times.3 pixel matrix, and wherein
when all binary data representative of the plurality of pixels constituting the group of pixels selected by said mode selecting means are equal to each other and are different from the binary data representative of the target pixel, said processing means inverts the binary data representative of the target pixel.
9. A method for binary-coding multivalued density data representative of each of plural pixels constituting an image wherein each pixel on each of a plurality of scanning lines is sequentially processed as a target pixel, said method comprising the steps of:
obtaining first accumulated error data by accumulating data representative of binary coded-errors associated with pixels that have predetermined positional relationships with respect to a target pixel and that are scanned ahead of said target pixel on a present line to which said target pixel also belongs;
reading out, from a storing means, second accumulated error data previously stored in said storing means as a result of binary-coding of density data associated with a pixel on a line scanned ahead of said present line, said second accumulated error data being representative of accumulated binary-coded errors associated with pixels that have predetermined positional relationships with said target pixel and that are on said line ahead of said present line;
accumulating said first accumulated error data, said second accumulated error data, and density data associated with said target pixel to obtain binary-coding judgement value data;
binary-coding said density data associated with said target pixel by comparing said binary-coding judgement value data with a predetermined binary-coding threshold value and binary-coding said binary-coding judgement value data into a first value data if said binary-coding judgment value data are not less than said predetermined binary-coding threshold value, and into second value data if said binary-coding judgement value data are less than said predetermined binary-coding threshold value;
calculating binary-coded error data of said target pixel as a difference between said binary-coding judgement value data and a value corresponding to said first value data if said binary-coding judgement value data have been binary-coded into said first value data, and as a difference between said binary-coding judgement value data and a value corresponding to said second value data if said binary-coding judgement value data have been binary-coded into said second value data;
obtaining third accumulated error data by accumulating said binary coded-error data of said target pixel and said data representative of binary coded-errors of said pixels scanned ahead of said target pixel on said present line, said third accumulated error data being applicable as a second accumulated error, associated with a pixel that is on a line scanned after said present line and that has a predetermined positional relationship with said target pixel, when density data associated with said pixel on said line scanned after said present line are binary-coded; and
storing said third accumulated error data in said storing means.
10. A method according to claim 9, wherein said step of obtaining said first accumulated error data by accumulating data representative of binary-coded errors includes the steps of:
multiplying binary-coded errors of two pixels, which are scanned ahead of said target pixel, by respective predetermined coefficients, said two pixels being a first pixel that is scanned immediately ahead of said target pixel and a second pixel that is scanned immediately ahead of said first pixel; and
adding multiplied binary-coded errors of said two pixels to obtain said first accumulated error data.
11. A method according to claim 9, wherein said step of obtaining said third accumulated error data by accumulating data representative of binary-coded errors includes the steps of:
multiplying binary-coded errors of said target pixel and three pixels which are scanned ahead of said target pixel by respective predetermined coefficients, said three pixels being a first pixel that is scanned immediately ahead of said target pixel, a second pixel that is scanned immediately ahead of said first pixel and a third pixel that is scanned immediately ahead of said second pixel; and
adding multiplied binary-coded errors of said target pixel and said three pixels to obtain said third accumulated error data.
12. A method according to claim 9, wherein said step of obtaining said third accumulated error data by accumulating data representative of binary-coded errors includes the steps of:
providing accumulated error data for a pixel that is scanned immediately ahead of said target pixel as first accumulated error data for said immediately ahead pixel, and
adding (a) binary-coded errors of said target pixel, (b) binary-coded errors of said immediately ahead pixel, and (c) said first accumulated error data for said immediately ahead pixel.
13. An apparatus for binary-coding multivalued density data representative of each of plural pixels constituting an image wherein each pixel on each of a plurality of scanning lines is sequentially processed as a target pixel, said apparatus comprising:
storing means;
means for obtaining first accumulated error data by accumulating data representative of binary coded-errors associated with pixels that have predetermined positional relationships with respect to a target pixel and that are scanned ahead of said target pixel on a present line to which said target pixel also belongs;
means for reading out, from said storing means, second accumulated error data previously stored in said storing means as a result of binary-coding of density data associated with a pixel on a line scanned ahead of said present line, the second accumulated error data being representative of accumulated binary-coded errors associated with pixels that have predetermined positional relationships with said target pixel and that are on said line ahead of said present line;
means for accumulating first accumulated error data from said first accumulated error data obtaining means, second accumulated error data from said reading out means, and density data associated with said target pixel to obtain binary-coding judgement value data;
means for binary-coding density data associated with said target pixel by comparing binary-coding judgement value data from said first accumulated error data accumulating means with a predetermined binary-coding threshold value and binary-coding such binary-coding judgment value data into first value data if such binary-coding judgment value data are not less than said predetermined binary-coding threshold value and into second value data if such binary-coding judgment value data are less than said predetermined binary-coding threshold value;
means for calculating binary-coded error data of said target pixel as a difference between binary-coding judgement value data from said first accumulated error data accumulating means and a value corresponding to said first value data if such binary-coding judgement value data have been binary-coded into said first value data, and as a difference between such binary-coding judgement value data and a value corresponding to said second value data if such binary-coding judgement value data have been binary-coded into said second value data;
means for obtaining third accumulated error data by accumulating binary coded-error data of said target pixel from said calculating means and data representative of binary coded-errors of said pixels scanned ahead of said target pixel on said present line, said third accumulated error data being applicable as a second accumulated error, associated with a pixel that is on a line scanned after said present line and that has a predetermined positional relationship with said target pixel, when density data associated with said pixel on said line scanned after said present line are binary-coded; and
means for storing third accumulated error data from said third accumulated error data obtaining means in said storing means.
14. An apparatus according to claim 13, wherein said means for obtaining first accumulated error data by accumulating data representative of binary-coded errors includes:
means for multiplying binary-coded errors of two pixels, which are scanned ahead of said target pixel, by respective predetermined coefficients, said two pixels being a first pixel that is scanned immediately ahead of said target pixel and a second pixel that is scanned immediately ahead of said first pixel; and
means for adding multiplied binary-coded errors of said two pixels to obtain said first accumulated error data.
15. An apparatus according to claim 13, wherein said means for obtaining third accumulated error data by accumulating data representative of binary-coded errors includes:
means for multiplying binary-coded errors of said target pixel and three pixels which are scanned ahead of said target pixel by respective predetermined coefficients, said three pixels being a first pixel that is scanned immediately ahead of said target pixel, a second pixel that is scanned immediately ahead of said first pixel, and a third pixel that is scanned immediately ahead of said second pixel; and
means for adding multiplied binary-coded errors of said target pixel and said three pixels to obtain third accumulated error data.
16. An apparatus according to claim 13, wherein said means for obtaining third accumulated error data by accumulating data representative of binary-coded errors includes:
means for providing accumulated error data for a pixel that is scanned immediately ahead of said target pixel as first accumulated error data for said immediately ahead pixel, and
means for adding (a) binary-coded errors of said target pixel, (b) binary-coded errors of said immediately ahead pixel, and (c) first accumulated error data for said immediately ahead pixel from said providing means.

Priority Claims (3)

Number	Date	Country
4-209650	Jul 1992	JPX
4-209674	Jul 1992	JPX
4-209675	Jul 1992	JPX

US Referenced Citations (9)

Number	Name	Date
4509530	Curtis et al.	Apr 1985
5028991	Sekizawa et al.	Jul 1991
5052046	Fukuda et al.	Sep 1991
5157518	Ohtaki et al.	Oct 1992
5224213	Dieffenderfer	Jun 1993
5245678	Eschbach et al.	Sep 1993
5299034	Kanno et al.	Mar 1994
5307426	Kanno et al.	Apr 1994
5381246	Suzuki et al.	Jan 1995

Foreign Referenced Citations (4)

Number	Date	Country
61-225974	Oct 1986	JPX
61-281672	Dec 1986	JPX
62-59513	Dec 1987	JPX
1223878	Sep 1989	JPX

Non-Patent Literature Citations (1)

Entry
Per-Erik-Denielsson, Computer Architectures for Pictorial Information Systems, Nov. 1981/pp. 53-67 (IEEE).

Image data processing apparatus having line memory

Information

Patent Number

Date Filed

Date Issued

Inventors

Original Assignees

Examiners

Agents

CPC

US Classifications

Field of Search

US