EP0612182B1 - Processeur de conversion de format d'éléments d'images et de données pour gravure - Google Patents

Processeur de conversion de format d'éléments d'images et de données pour gravure Download PDF

Info

Publication number
EP0612182B1
EP0612182B1 EP94102434A EP94102434A EP0612182B1 EP 0612182 B1 EP0612182 B1 EP 0612182B1 EP 94102434 A EP94102434 A EP 94102434A EP 94102434 A EP94102434 A EP 94102434A EP 0612182 B1 EP0612182 B1 EP 0612182B1
Authority
EP
European Patent Office
Prior art keywords
data
line
pixels
valued
pixel
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Expired - Lifetime
Application number
EP94102434A
Other languages
German (de)
English (en)
Other versions
EP0612182A3 (fr
EP0612182A2 (fr
Inventor
Kohji C/O Dainippon Screen Mfg. Co. Ltd. Hada
Takumi C/O Dainippon Scr. Mfg. Co. Ltd. Yoshida
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Dainippon Screen Manufacturing Co Ltd
Original Assignee
Dainippon Screen Manufacturing Co Ltd
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Priority claimed from JP2880193A external-priority patent/JP2818528B2/ja
Priority claimed from JP5050420A external-priority patent/JP2854489B2/ja
Priority claimed from JP15009393A external-priority patent/JP2772220B2/ja
Application filed by Dainippon Screen Manufacturing Co Ltd filed Critical Dainippon Screen Manufacturing Co Ltd
Publication of EP0612182A2 publication Critical patent/EP0612182A2/fr
Publication of EP0612182A3 publication Critical patent/EP0612182A3/fr
Application granted granted Critical
Publication of EP0612182B1 publication Critical patent/EP0612182B1/fr
Anticipated expiration legal-status Critical
Expired - Lifetime legal-status Critical Current

Links

Images

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
    • H04N1/00—Scanning, transmission or reproduction of documents or the like, e.g. facsimile transmission; Details thereof
    • H04N1/40—Picture signal circuits
    • H04N1/409—Edge or detail enhancement; Noise or error suppression
    • H04N1/4092—Edge or detail enhancement
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
    • H04N1/00—Scanning, transmission or reproduction of documents or the like, e.g. facsimile transmission; Details thereof
    • H04N1/387—Composing, repositioning or otherwise geometrically modifying originals
    • H04N1/3871—Composing, repositioning or otherwise geometrically modifying originals the composed originals being of different kinds, e.g. low- and high-resolution originals

Definitions

  • the present invention relates to processing of printing data, scanned in a screen of image points from an image pattern which can include both line work and continuous tone portions and computer stored as pixel data in a raster or rasters corresponding to the scanning screen, making the data suitable for use in electromechanical engraving of printing forms with a screen of printing cells arranged in nested or staggered rows different from the screen arrangement of the pixel data raster(s) derived from the scanned image.
  • the invention relates to a gravure data processor by which stored image pixel data comprising tonal density dual-value line work pixels in a higher line-concentration raster, and multiple tone-value picture pixel data in a lower line-concentration raster, are converted into a format of engraving pixel data for realizing a nested- or staggered-row screen of gravure printing cells, image density weighted for high-fidelity reproduction of tone value and line sharpness of the originally scanned image pattern.
  • Half-tone scanning of a printing subject will produce image information corresponding to a screen of scanned image pattern points which can be digitalized and stored as pixel data.
  • the image density of the pixels (corresponding to the point tone values of the scanned image) and the format in which the pixel data are arranged will depend upon the type of printing process for which the pixel data is to be used.
  • the cells electromechanically engraved into a printing form are arranged in lines of lower density, for example, 150 to 200 lines/in, compared with the dots/in density in offset printing, wherein each cell can be cut in a range of sizes (depths) corresponding to multiple tone-value gradations (256 in the case of 8-bit tone value resolution). If each gravure cell is to correspond to pixel data from the half-tone, digitally stored scan, the gravure pixel data must represent cells arranged in a screen substantially different from the offset printing screen.
  • pixels comprising image data for offset printing are arranged in a rectangular raster
  • pixels comprising image data for gravure engraving must be arranged in a format for engraving the cells in nested or staggered rows wherein non-terminal calls are each at the center of a quincunx having rectangular vertices which will not be coincident with the vertices of the offset printing screen.
  • Engraving data input means in the gravure electromechanical engraving system generally includes an input section for data scanned from line work film, and a separate input section for data scanned from half-tone separations, either of which is accordingly used depending upon the nature of the film composite.
  • the input section receiving data scanned from half-tone color separations has a feature which modifies the screen for each separation in order to prevent moire effects; however, this reduces printing fidelity.
  • the image quality from the line work film is superior to that in the color-separation input section from the half-tone films, if half-tone data is input into the line-work input section, moire effects arise. Consequently, data scanned from a film composite combined from an image comprising both line work and continuous tone (picture) portions has to be input into the half-tone input section, degrading the picture quality of the linework.
  • An object of the present invention is to develop, for a gravure electromechanical engraving system, gravure engraving data from half-tone screen data scanned and digitalized from a subject pattern containing line work as well as continuous-tone portions, thereby eliminating need of gravure-specific image scanning processes and separate subject image data input devices.
  • Another object of the present. invention is to enable ready data composition for gravure engraving of image data scanned from a subject image pattern in line-work and continuous-tone separations, to form combined image data convertible to corresponding gravure engraving data, thereby eliminating need of gravure-specific image scanning processes and separate subject image data input devices.
  • An image data conversion processor converts dual-valued line-work data comprising pixels disposed a latticed raster format and having pixel concentration higher than that of picture data, into image data for gravure engraving in which pixels are disposed in stagger.
  • the processor includes line-work data converting means, data composing means, format converting means and data output means.
  • the line-work data converting means converts line-work data into multiple-valued line-work data having the same pixel density as the picture data.
  • the format converting means performs interpolation using a predetermined number of data in the vicinity of virtual pixels disposed in stagger among the multiple-valued linework data, and forms multiple-valued image data for gravure engraving corresponding to the virtual pixels.
  • the data output means outputs to external storage, or to a gravure engraving machine, the image data for gravure engraving.
  • An image data conversion processor converts high pixel density dual-valued line-work data and low pixel density multiple-valued picture data both comprising pixels disposed in latticed raster format, into image data for gravure engraving comprising pixels disposed in a stagger format.
  • the apparatus includes line-work data converting means, data composing means, format converting means and data output means.
  • the line-work data converting means converts line-work data to multiple-valued linework data having the same pixel density as that of the picture data.
  • the data composing means forms composed image data by assembling the multiple-valued line-work data and the picture data.
  • the format converting means performs interpolation using a predetermined number of data in the vicinity of virtual pixels disposed in stagger among the multiple-valued linework data, and forms multiple-valued image data for gravure engraving corresponding to the virtual pixels.
  • the data output means outputs to external storage, or to a gravure engraving machine, the image data for gravure engraving.
  • a preferred embodiment of the apparatus converts high pixel density dual-valued line-work data into multiple-valued line-work data having the same pixel density as that of the picture data, and then multiple-valued image data for gravure engraving is formed using the said multiple-valued linework data.
  • the image data for gravure engraving is formed by performing interpolation using a predetermined number of data in the vicinity of the virtual pixels disposed in staggering. The thus formed image data for gravure engraving is output to an external storage medium or a gravure engraving machine.
  • the image data for gravure engraving is formed by converting a pixel density of the line-work data and performing interpolation using the line-work data, it is not necessary to use a gravure engraving input machine; in particular, need for an input section handling linework film is eliminated.
  • Another embodiment of the apparatus assembles the multiple-valued line-work data and the picture data obtained as described above are assembled and subsequently the image data for gravure engraving is formed by performing interpolation using the composed data.
  • the assembled image is readily formed by the assembling process. Furthermore, since the image data for gravure engraving is formed by interpolation using the assembled image data, use of a gravure electromechanical engraving system input means, in particular, an input section for data scanned from half-tone separations, is unnecessary.
  • an image data pixel conversion processor 1 comprises, as a control unit 3, a computer containing a RAM 2 as well as a CPU, a ROM, and other associated elements.
  • a CRT 4 for informational display to an operator
  • a key board 5 through which the operator can input commands to the control unit 3
  • a floppy disc drive 6 through which the operator can input commands to the control unit 3
  • a hard disc device 7 for line-work data comprising a line memory in a disc body
  • a hard disc device 8 for continuous-tone image half-tone separation data (hereinafter referred to simply as picture data) comprising line memories LM 1 to LM6 in a disc body.
  • a scanning apparatus 10 color separation scanner
  • I/O port 9 as a connection to a gravure engraving machine 11 and associated components for carrying out gravure engraving operations using the gravure data.
  • step S1 it is determined at step S1 whether a command for input of low pixel concentration, multiple-valued picture data is issued.
  • the program proceeds to step S2, in which picture data is obtained from the scanning apparatus 10 through the I/O ports 9, and stored in the hard disc device 8.
  • step S3 it is determined whether a command for input of high pixel concentration, dual-valued line-work data is issued.
  • the program proceeds to step S4, in which line-work data is retrieved from a storage medium, such as an external hard disc device or the like, and stored in the hard disc device 7.
  • step S5 the program proceeds to step S5, in which the pixel concentration of the line-work data is converted to match the pixel concentration of the picture data, converting the retrieved line-work data, and also converting the dual-valued line-work data into multiple-value line-work data. The operation for converting the retrieved line-work data will be described later.
  • step S6 It is determined at step S6 whether a composing command is issued.
  • the program proceeds to step S7, in which a data composing procedure, described later, is carried out.
  • step S8 It is determined at step S8 whether a command for converting offset data to gravure data is issued.
  • the program proceeds to step S9 when the command is issued, in which the offset data in raster format is converted into a pixel format of data for gravure engraving in a staggered format (O-G conversion).
  • step S10 determination is made whether a command for output of the gravure data is issued.
  • the program proceeds to step S11, in which the gravure data are output to an external storage medium, or to the gravure engraving machine 11.
  • step S12 general processes are carried out, whereupon the program returns to step S1.
  • step S20 it is determined at step S20 whether a command is issued for setting (changing) various parameters used during the line-work data conversion to be described later.
  • the program proceeds to step S21, in which a parameter setting subroutine, diagramed in Fig. 4, is carried out.
  • step S22 it is determined at step S22 whether a command for executing the line-work data conversion is issued; if it is, the conversion is carried out at the ensuing step S23 of the program.
  • step S30 it is determined whether pixel concentration LN of the original line-work data is input; upon input the program proceeds to step S37, in which the value LN representing the pixel concentration is stored in the RAM 2.
  • step S31 it is determined whether pixel concentration SN of the converted multiple-valued line-work data is input. Upon input of the pixel concentration represented by the value SN, the program proceeds to step S38, in which SN is stored in the RAM 2.
  • step S32 the program determines whether original line-work data pixel numbers D x and D y in the secondary scanning direction (x-axis) and the main scanning direction (y-axis), respectively, are input; if so the program proceeds to step S39, wherein the pixel numbers D x and D y are stored in the RAM 2.
  • step S33 It is determined at step S33 whether the maximum tonal value Res of the converted multiple-valued line-work data is input or not. When it is input, the program proceeds to step S40 and the maximum tonal value Res is stored in the RAM 2 as an input value.
  • step S34 It is determined at step S34 whether coefficients ⁇ x and ⁇ y for shifting the degree of enhancement between the secondary scanning direction and the main scanning direction.
  • the program proceeds to step S41 and the input values of the coefficients ⁇ x and ⁇ y are stored in the RAM 2.
  • a command is issued for input for a density-gradation conversion function f(n), which converts percent scale of the minimum to maximum density range to 256 tonal value gradations, in the case of 8-bit tonal value resolution.
  • the function is, for example a linear function, and when coefficients of the linear function are input, their values are stored in the RAM 2 at step S42.
  • Step S36 determines whether a Routine Complete command is issued, indicating that the setting/changing of all parameters has been completed. Wherein it is not issued, the program returns from step S36 to step S30; otherwise, when the Routine Complete command is issued, the program returns from step S36 to the routine diagramed in Fig. 3.
  • Figs. 5 to 9 detail a line-work data conversion operation.
  • values K the size of an aperture used in a dual-value into multiple-value converting operation
  • KK the size of a section used in determining an enhancement coefficient for enhancing a fine line
  • pixel numbers ND x and ND y of the converted multiple-valued line-work data are calculated.
  • the aperture size K, the section size KK, and the pixel numbers ND x and ND y are found from the following Equations (1), (2), (3) and (4), respectively.
  • ND y (int) ( ⁇ D y - (KK - K) ⁇ / K]
  • variables I x and I y designating positions along the secondary and main scanning directions, respectively, are initialized, that is, set to "0".
  • step S52 It is determined at step S52 whether the variable I x is equal to or more than the pixel number ND x . Wherein the variable I x is less than ND x , the program proceeds to step S53, at which it is determined whether the variable I x is equal to "0" or not. Wherein it is equal to "0", the program proceeds to step S54.
  • step S54 dual-valued line-work data, corresponding to lines in section size KK along the secondary scanning direction, and thus including the original data block for conversion (i.e., the pixels in the K-sized aperture, hereinafter referred to simply as conversion pixels) together with a surrounding reference data section (i.e., the pixels in the KK-sized section, hereinafter referred to simply as reference pixels), are read from the hard disc device 7 into a buffer area of the RAM 2.
  • conversion pixels i.e., the pixels in the K-sized aperture, hereinafter referred to simply as conversion pixels
  • Fig. 17 illustrates an example of a section of pixels of the line work read as the data group at step S54.
  • the aperture size K is set to "5" (hence, from Equation (2), KK is "13"), and conversion pixels in a 5 ⁇ 5 grid, which will correspond to one pixel of the multiple-valued line-work data, is located in the center of the data group.
  • the reference pixels surround the conversion pixels.
  • step S56 It is determined at step S56 whether the variable I y is equal to or greater than the pixel number ND y . Wherein the variable I y is less than ND y , the program proceeds to step S59 of the flowchart of Fig. 6.
  • step S59 pixel position Id (x,y) of the K ⁇ K conversion pixels are determined according to Formulas [1] and [2] from among those line-work data in the lines corresponding to KK stored in the buffer area of the RAM 2, and the conversion pixels which have said position are copied into a first work area of the RAM 2.
  • variable x is an integer representing a pixel position of the line-work data in the secondary scanning (horizontal) direction
  • variable y is an integer representing a pixel position of the line-work data in the main scanning (vertical) direction.
  • a representative reference pixel is calculated every three pixels in the main and secondary scanning directions, centering around a pixel f 2 , which is the center of the conversion pixels.
  • the nine representative reference pixels f 0 to f 8 including the central pixel f 2 are copied into the first work area of the RAM 2.
  • the positions of the representative reference pixels f 0 to f 4 disposed in the main scanning direction are determined according to the following Equation (5), and the results are copied into a second work area of the RAM 2.
  • the positions of the representative reference pixels f 2 and f 5 to f 8 disposed in the secondary scanning direction are determined according to Equation (6) below, and the results are copied into a third work area of the RAM 2.
  • X (KK - 1) / 2
  • Y K ⁇ I y + (s - 1) ⁇ [(KK - 1) / 4]
  • X (s - 1) ⁇ [( KK - 1) / 4]
  • Y K ⁇ I y + (KK - 1) / 2 wherein the variable s is an integer 1 to 5.
  • a dual-value into multiple-value converting subroutine (Fig. 7), an enhancement coefficient determining subroutine (Fig. 8), and a data enhancing and developing subroutine (Fig. 9), respectively, are carried out.
  • Fig. 7 a dual-value into multiple-value converting subroutine
  • Fig. 8 an enhancement coefficient determining subroutine
  • Fig. 9 a data enhancing and developing subroutine
  • step S65 The thus obtained single-pixel data D ig of the multiple-valued line-work data is stored singly in the line memory LM of the hard disc device 7 at step S64.
  • step S65 the variable I y is incremented (more specifically, the data group to be converted is shifted in the main scanning direction), and then the program returns to step S56 of Fig. 5.
  • step S56 After the line-work data conversion in the main scanning direction is completed, the determination at step S56 is "YES;" hence the program proceeds to step S57.
  • step S57 the series of single-pixel data D ig which have been stored in the line memory LM are stored collectively as one line of data in the body of the hard disc device 7.
  • step S58 the variable I x is incremented and "0" is substituted for the variable I y , and then the program returns to step S52.
  • step S52 wherein the variable I x is less than the number of pixels ND x , the program proceeds to step S53.
  • step S53 since the variable I x is not "0", the program proceeds to step S55.
  • step S55 the line-work data corresponding to lines in K (in the present example, 5 lines) stored in the buffer area of the RAM 2 is shifted in the secondary scanning direction, and new line-work data corresponding to lines in KK is read from the buffer area of the RAM 2, updating the line-work data to be processed.
  • steps S56 to S65 are executed likewise described above, and then the program returns to step S52.
  • step S52 When all line-work data conversion with respect to the main and secondary scanning directions is completed, the determination at step S52 is "YES", and the program then returns to the routine of Fig. 3.
  • a multiple-valued count variable CD and a secondary scanning-direction variable i are initialized to "0" at step S70.
  • a main scanning-direction variable j is initialized to "0" at step S71.
  • step S72 It is determined at step S72 whether the variable i is equal to or greater than the aperture size K. Wherein the variable i is less, the program proceeds to step S73, in which it is determined whether the variable j is equal to or greater than the aperture size K. Wherein the variable j is less, the program proceeds to step S75.
  • step S75 It is determined at step S75 whether the conversion pixel Id (i,j), which was copied into the first work area of the RAM 2, is "1". Wherein the conversion pixel Id is "1", the program proceeds to step S76. At step S76, [1 / (K ⁇ K)] is added to the multiple-valued count variable CD. Wherein the conversion pixel Id is "0" at step S75, step S76 is not executed.
  • step S77 the variable j is incremented, and then the program returns to step S73. Wherein the determination at step S73 is "YES", the program proceeds to step S74, in which the variable i is incremented. Subsequently, the program returns to step S71.
  • the determination at step S72 is "YES", and the program then returns to the subroutine of Fig. 6.
  • the multiple-valued count variable CD is set to a density value (0 ⁇ CD ⁇ 1) based on the ratio of the number of maximum-value pixels (i.e., binary-coded "1") to the total number of pixels within the area of the aperture (K ⁇ K).
  • a fourth-degree function is determined using the line-work data of representative reference pixels f 0 to f 4 , copied into the second work area of the RAM 2 at step S80.
  • the fourth-degree function is written using Lagrangian interpolation, as in the following Equation (7).
  • a linear differential equation based on the fourth-degree function written at step S80 is determined according to the following Equation (8). Furthermore, a second-order differential equation is determined according to the following Equation (9).
  • enhancement coefficient N sigx in a secondary scanning direction is calculated according to the following Equation (10) using the determined linear and second-order differential equations.
  • N sigx (F'' (i-1) ⁇ F'' (i) 3 ⁇ F'' (i+1))/(F' (i-2) ⁇ F' (i+1))
  • the enhancement coefficient component N sigx obtained at step S82 is graduated by correction factor ⁇ x (from step S41), developing a corrected enhancement coefficient component N sigx in the secondary scanning direction.
  • Steps S84 to S87 are the same as steps S80 to S83, with the exception that the representative reference pixels used in determining the equations from which the enhancement coefficient component N sigy are derived are f 2 , and f 5 to f 8 , as copied into the third work area of the RAM 2.
  • enhancement coefficient component N sigy is calculated at step S86 is for enhancement in the main scanning direction.
  • step S88 the enhancement coefficient components N sigx and N sigy are added together, whereby a final enhancement coefficient N sig is obtained. Then, the program returns to step S59 of Fig. 6.
  • the enhancement coefficient N sig (Fig. 8) is added to the multiple-valued count variable CD (Fig. 7) at step S90, and the result is graduated by 100, yielding the density value ND for a single pixel of the multiple-valued line-work data.
  • multiple-valued line-work data elements D ig are derived by evaluating the density-gradation conversion function f(n) (for which coefficients have been set at step S42 of Fig. 4) for each ND and taking the integer portion of the result.
  • step S92 the program determines whether each multiple-valued line-work data element D ig exceeds the maximum tonal value Res (from step S40 of Fig. 4). If so, the program proceeds to step S94, in which the data element D ig is set to the maximum tonal value Res. Alternatively, if the determination at step S92 is "No", the program proceeds to step S93, from which for negative values of data element D ig the program proceeds to step S95. At step S95, the data element D ig is set to "0". On the other hand, wherein the determination at step S93 is "No", D ig accordingly is not changed.
  • a data variation pattern of the conversion pixels and the plurality of representative reference pixels in the reference data section are expressed by the fourth-degree function.
  • the conversion pixels comprise part of fine lines in the image
  • the data variation pattern is corrected according to the function in the direction enhancing the density value of the converted multiple-valued line-work data, reproducibility of the fine lines when the high pixel concentration line-work data is converted to the low pixel concentration multiple-valued line-work data is improved.
  • fine lines in the duplicated image will be clearly distinguishable.
  • step S100 it is determined at step S100 whether a command for selecting a file is issued. Then, it is determined at step S101 and at step S102, respectively, whether a command for layout is issued, and whether a command for data combining is issued. Wherein the determinations at steps S100 to 102 are "No", the program proceeds to step S103 to perform another operation, and then returns to step S100.
  • step S105 a file of multiple-valued line-work data which is to be converted by the line-work converting operation, or a file of picture data input at step S1 is displayed. Then, at step S106, there is a pause until an operator selects a file from the displayed files. When the file is selected, the data is retrieved.
  • a pixel-thinning operation is executed on the multiple-valued line-work data or the picture data retrieved at step S106, whereby thinned-out image data (reference image data) is formed.
  • the reference image data is displayed at the CRT 4, which data is thinned out to be one hundredth.
  • the reference image data is stored in the hard disc device again.
  • step S110 the files of the layout data which have been previously stored are displayed on the CRT, and there is a pause until the operator selects a file. Wherein a file of layout data is newly made, the operator inputs the new file name. Then, at step S111, a layout data developing operation, to be described later, is executed.
  • step S102 the program proceeds from step S102 to step S112.
  • step S112 the files of layout data formed by the layout data developing operation at step S111 are displayed.
  • step S113 in which an image composing operation, to be described shortly, is executed.
  • the layout data is displayed and there is a pause for an operator's instruction at step S115. If the layout data is freshly made, an image of a layout base sheet only is displayed. On the other hand, if there already composed reference-image data is in the layout data, the reference image data is fetched from the hard disc device and displayed according to a predetermined disposition.
  • step S116 It is determined at step S116 whether a command for composing a file of the reference image data in the layout data is issued. Wherein the command is issued, the program proceeds to S116A. Alternatively, wherein the command is not issued, the program proceeds to step S117.
  • step S116A the file of the reference image data stored in the hard disc device is displayed, and there is a pause for an operator's instruction.
  • step S116b the file of the reference image data to be composed is selected by the operator and the disposition data, which can be a change in disposition, or magnification or reduction, or rotation of the reference image data, is input by the operator.
  • step S116c the selected reference image data is fetched and its reference image is displayed on the CRT according to the disposition data. Thereafter the program returns to step S116.
  • step S117 It is determined at step S117 whether a command for executing the layout data developing is issued. Wherein the command is issued, the program proceeds to S117A. Meanwhile, wherein the command is not issued, the program proceeds to step S118. At step S117A, layout data is developed according to the disposition data and selected reference image data. Then, the program returns to step S116.
  • step S118 It is determined at step S118 whether a command for completing the layout data developing routine is issued. Wherein the command is not issued, the program returns to step S116 and wherein it is issued, the program proceeds to step S119.
  • step S119 the thus stored layout data is stored in the hard disc device.
  • step S120 there is a pause until the operator selects the file of the layout data.
  • the layout data corresponding to the selected file is fetched at step S121.
  • step S122 the multiple-valued line-work data and picture data corresponding to the layout data are fetched.
  • step S123 the multiple-valued line-work data and the picture data fetched according to the layout data are combined.
  • the thus obtained composed image data is stored in the hard disc device at step S124.
  • the thus formed multiple-valued image data is raster-format image data for offset. Then, the image data is converted to image data for gravure engraving (gravure data) through O-G conversion.
  • each file of composed image data stored in the hard disc is read and displayed on the CRT display.
  • step S131 there is a pause until the operator selects the file, and the selected file name is stored.
  • step S132 a condition input operation is performed. According to the condition input operation, it is selected whether formed gravure data is output to an external storage medium or directly output to the gravure engraving machine 11, or concentration (the number of cell lines) or the like of the gravure data to be formed is set. After the condition input operation, the program proceeds to step S133.
  • step S133 it is determined at step S133 whether initial values of position information of the image data and gravure data used in interpolation are manually input. Then, it is determined at step S134 whether the key for executing the data conversion is pressed. Wherein the initial value is manually input, the program proceeds from step S133 to step S135. At step S135, the initial value input by the operator is set as the position information of the image data and the gravure data. Wherein the aforementioned key is pressed, the program proceeds to step S136, wherein the format converting operation is carried out.
  • an initial value of a variable Pds is set.
  • the variable Pds specifies image data of a plurality of lines (6 lines) to be processed which run parallel in the secondary scanning direction (horizontal direction in Fig. 31).
  • the variable Pds is the third line among 6 lines to be processed and the initial value is set to "2.0" when automatically set.
  • the initial value is manually input at steps S133 and S135, the initial value is set to the input value.
  • an initial value of a variable Pes virtually showing a position of the gravure data in the secondary scanning direction is set.
  • the initial value is set to "2.5" when automatically set, and it is set to the input value at step S135 when manually set.
  • the gravure pixels corresponding to the gravure data to be formed are referred to as virtual gravure pixels.
  • a variable Ln showing the number of all lines of the image data in the secondary scanning direction is set.
  • the data Ln is written in a disc storing the image data, together with the image data. Reference numbers 0 to Ln-1 are allotted to the lines.
  • a variable CT is set to an initial value "1".
  • the variable CT expresses the line number of the gravure data to be formed thereafter in the secondary scanning direction.
  • step S143 image data of five lines is read from the hard disc device and data of the lines is stored in the corresponding line memories LM1 to LM5.
  • the line numbers of the image data stored in the line memories LM1 to LM5 are (Pds - 2) to (Pds + 2).
  • step S144 it is determined at step S144 whether (Pds + 3) is less than the number Ln of all lines of the image data in the secondary scanning direction. More specifically, it is determined whether the image data of three lines or more is higher than the line shown by, for example the variable Pds in Fig. 31. Wherein it is not, since the image data is recognized as data at a border of the image, the interpolation is completed.
  • step S148 center pitch value Eps (pitch between lines) of the gravure pixels in the secondary scanning direction is added to the variable Pes, and the variable CT is incremented (+1).
  • step S149 the program skips step S147 and step S148 and proceeds from step S146 to step S149.
  • step S149 the contents of the buffer memory 5 are updated by one line.
  • step S150 the variable Pds is incremented (+1) and then, the program returns to step S144.
  • the gravure data is formed while the image data is updated one line at a time.
  • an initial value of a variable Pem showing a position of the virtual gravure pixel in the main scanning direction is set.
  • the initial value of the variable Pem is set to "2.5" when automatically set, and it is set to the initial value input at step S135 when manually set.
  • step S162 half of the center pitch value Epm of the gravure pixels in the main scanning direction is added to the variable Pem.
  • the gravure data is disposed in staggered format, more specifically, disposition of the gravure data of the even number lines in the secondary scanning direction is shifted in the main scanning direction by half of the center pitch value Epm.
  • variable Pn indicating an address of the line memory
  • a variable Dn showing the number of image data of one line, i.e., the number of data in the main scanning direction is set. The value of the variable Dn has been written previously in the hard disc device.
  • step S165 it is determined at step S165 whether (Pn + 3) is less than the number Dn of the image data of one line. More specifically, it is determined whether the image data of three lines or more is higher than the line shown by the variable Pn. Wherein it is, the program proceeds to step S166.
  • step S166 36 image data in its entirety stored in the addresses (Pn - 2) to (Pn + 3) is read for the six lines of the line memories LM1 to LM6.
  • step S167 interpolation is performed using 36 pixels of image data, whereby one gravure pixel of gravure data is formed.
  • step S168 gravure data obtained at step S167 is written once in the line memory.
  • the center pitch value Epm of the gravure pixels in the main scanning direction is added to the variable Pem and then, the program returns to step S165.
  • the center pitch value Epm expresses pixel pitch on each line in the main scanning direction, and is not the pitch of pixels of adjacent lines.
  • step S165 to S169 are repeated, whereby the gravure data of one line is formed.
  • the determination at step S165 is "No" and then the program proceeds to step S170.
  • the gravure data is output from the line memory to the hard disc device 8, or to the gravure engraving machine 11.
  • positions of center of gravity G1 to G4 in first to fourth regions to which the 36 image data is divided are calculated.
  • the positions G1 to G4 are positions of center of gravity as the sum of pixel-weight 2 values WD, Wa and Wb, to be described later, and the first to fourth regions are divided as shown in Fig. 31.
  • Each region includes one image data designated by reference D which is nearest the virtual gravure pixel ES1, three image data designated by reference a which are positioned on the outer peripheral side thereof, and five image data designated by reference b which are farthest from the virtual gravure pixel ES1.
  • representative values Tn1 to Tn4 of the said regions are calculated according to the following equations.
  • Tn1 WD x D1 + Wa x (a11 + a12 + a13) + Wb x (b11 + b12 + b13 + b14 + b15)
  • Tn2 WD x D2 + Wa x (a21 + a22 + a23) + Wb x (b21 + b22 + b23 + b24 + b25)
  • Tn3 WD x D3 + Wa x (a31 + a32 + a33) + Wb x (b31 + b32 + b33 + b34 + b35)
  • Tn4 WD x D4 + Wa x (a41 + a42 + a43) + Wb x (b41 + b42 + b43 + b44 + b45)
  • WD, Wa and Wb are pixel-weight values for weighting image data.
  • each pixel-weight value is set so as to satisfy the following equation.
  • step S182 areas S1, S2, S3 and S4 of rectangles (referring to Fig. 32) whose diagonal vertices are the positions of centers of gravity G1 to G4 in the regions and the center of virtual gravure pixel ES1, respectively, are calculated.
  • the integer portion of the thus obtained value EN becomes the gravure data of the virtual pixel ES1.
  • Figs. 33 and 34 illustrate a case where the image data is converted to the gravure data with regard to the Japanese character " " by a four-point conventional interpolating method, for example, as disclosed in Japanese Patent Publication No. 33060/1980, as well as a case wherein the same image data conversion is performed by the 36-point interpolating method according to the present invention.
  • horizontal lines in " " are large and expressed by a lesser number of cells. In this case, the printed line edges are notched and the character is unsightly. Additionally, since the degree of difference between high-concentration cells and a low-concentration cells is large, the top line of " " can look broken in an extreme case. Meanwhile, according to the example shown in Fig. 34, the horizontal lines of " " are represented by somewhat small cells and very small cells by comparison with the conventional method. In addition, the number of cells is greater. Therefore, the edge of the line diminishes appropriately and the character looks better. In addition, since the difference in concentration between cells is less than the conventional method, the horizontal line looks unbroken.
  • 36 data are divided into the first to fourth regions and a position of center of gravity and a representative value of each region is calculated once, and then the gravure data is formed. Therefore, compared with a case wherein the interpolation is performed at one time using 36 image data which are not divided into regions based upon relative weighting and separation distance, the gravure data can be formed with the same degree of precision as with the foregoing example in a short time. Meanwhile, wherein the position of the image data pixel and the position of the virtual gravure pixel overlap, since distance between the overlapping data is "0" according to the method for performing the interpolation using 36 data atone time, it becomes necessary to perform another operation in this case. However, according to this aspect of the present invention, since the interpolation is performed by dividing regions and calculating their centers of gravity, the position of the virtual gravure pixel does not overlap with the center of gravity, such that the distance cannot become "0", simplifying the operation.

Landscapes

  • Engineering & Computer Science (AREA)
  • Multimedia (AREA)
  • Signal Processing (AREA)
  • Image Processing (AREA)

Claims (15)

  1. Processeur de conversion de données d'image (1) destiné à un système de taille en creux électromécanique de gravure, lequel processeur de conversion de données d'image (1) convertit des données d'image analysées sous un format échantillonné à partir d'un motif d'image d'un sujet, les données d'image comprenant des données d'illustration constituées de pixels à valeurs multiples et des données de graphisme comprenant des pixels à deux valeurs, dans lequel les données de graphisme présentent une concentration en pixels plus élevée que la concentration en pixels des données d'illustration, afin d'élaborer les données de gravure destinées à la taille en creux électromécanique d'alvéoles de gravure suivant un format échelonné qui diffère du format échantillonné des données d'image, le processeur de conversion de données d'image comprenant :
    un moyen de conversion de format (figure 14) destiné à convertir des données d'image en données de gravure pour la taille en creux électromécanique des alvéoles de gravure suivant un format échelonné,
    le processeur de conversion de données d'image étant caractérisé par
    un moyen de conversion de données de graphisme (figures 5 à 9) destiné à convertir lesdites données de graphisme à deux valeurs en des données de graphisme à valeurs multiples comprenant des pixels à valeurs multiples en concentration équivalente à la concentration en pixels desdites données d'illustration,
    un moyen de composition de données (figure 10) destiné à élaborer des données d'image composées en combinant lesdites données d'illustration avec lesdites données de graphisme à valeurs multiples conformément à des données de configuration prédéterminées,
    ledit moyen de conversion de format (figure 14) convertissant lesdites données d'image composées en données de gravure destinées à la taille en creux électromécanique d'alvéoles de gravure suivant un format échelonné, et par :
    un moyen de sortie destiné à fournir en sortie lesdites données de gravure dans une mémoire externe disponible en tant qu'entrée d'une machine de taille en creux de gravure (11).
  2. Processeur de conversion de données d'image selon la revendication 1, ledit moyen de conversion de données de graphisme comprenant :
    un moyen de conversion de valeurs doubles en valeurs multiples sélectionnant à partir desdits pixels à deux valeurs un bloc de pixels de conversion selon une ouverture prédéterminée correspondant à un pixel à valeurs multiples desdites données de graphisme à valeurs multiples, afin d'évaluer une valeur de ton pour ledit pixel à valeurs multiples en dénombrant les pixels de graphisme à deux valeurs présentant la densité de ton d'image maximum parmi ledit bloc de pixels de conversion.
  3. Processeur de conversion de données d'image selon la revendication 2, ledit moyen de conversion de données de graphisme comprenant en outre :
    un moyen de renforcement des données destiné à renforcer lesdites données de graphisme à valeurs multiples lors de la conversion desdites données de graphisme à deux valeurs en lesdites données de graphisme à valeurs multiples, comprenant un moyen destiné à sélectionner des pixels de référence représentatifs parmi lesdits pixels à deux valeurs, afin d'évaluer un coefficient de renforcement, dans lequel ledit coefficient de renforcement est déterminé en résolvant des équations prédéterminées appliquées aux valeurs desdits pixels représentatifs, et un moyen destiné à élaborer des données de graphisme à valeurs multiples renforcées en ajoutant ladite valeur de ton pour ledit un pixel à valeurs multiples, audit coefficient de renforcement.
  4. Processeur de conversion de données d'image selon la revendication 2, ledit moyen de conversion de données de graphisme comprenant en outre :
    un moyen de renforcement de données destiné à renforcer lesdites données de graphisme à valeurs multiples lors de la conversion desdites données de graphisme à deux valeurs en lesdites données de graphisme à valeurs multiples, comprenant un moyen destiné à sélectionner des pixels de référence représentatifs à partir desdits pixels à deux valeurs, afin d'évaluer un coefficient de renforcement, dans lequel ledit coefficient de renforcement est déterminé en se référant à des données de relation obtenues expérimentalement reliant la valeur du coefficient de renforcement aux valeurs des pixels de référence représentatifs sélectionnés, et un moyen destiné à élaborer des données de graphisme à valeurs multiples renforcées en ajoutant ladite valeur de ton pour ledit un pixel à valeurs multiples, audit coefficient de renforcement.
  5. Processeur de conversion de données d'image selon la revendication 3 ou 4, ledit moyen de renforcement de données comprenant en outre :
    un moyen de limitation destiné à limiter la valeur de ton renforcée d'un pixel individuel dans lesdites données de graphisme à valeurs multiples renforcées pour qu'elle se trouve à l'intérieur de valeurs nulle et maximum pouvant être déterminées par un opérateur, dans lequel ledit moyen de limitation modifie la valeur de ton renforcée d'un pixel individuel dans lesdites données de graphisme à valeurs multiples renforcées audit maximum si ladite valeur de ton renforcée dépasse ledit maximum, et
    ledit moyen de limitation modifie la valeur de ton renforcée d'un pixel individuel dans lesdites données de graphisme à valeurs multiples renforcées en une valeur nulle si ladite valeur de ton renforcée est négative.
  6. Processeur de conversion de données d'image selon la revendication 3 ou 4, lesdits pixels de référence représentatifs comprenant une ligne principale de pixels alignés suivant une direction prédéterminée, et une ligne secondaire de pixels alignés suivant une direction perpendiculaire à ladite direction prédéterminée, dans lequel
    les lignes principale et secondaire des pixels comprennent un pixel situé de façon centrale dans ledit bloc de pixels de conversion, et
    des composantes de coefficient de renforcement respectives sont calculées à partir desdites lignes principale et secondaire de pixels, afin de déterminer ledit coefficient de renforcement.
  7. Processeur de conversion de données d'image selon l'une quelconque des revendications 2 à 6, ledit moyen de conversion de valeurs doubles en valeurs multiples comprenant :
    un moyen destiné à déterminer la taille de ladite ouverture conformément à une relation entre la concentration en pixels desdites données de graphisme à deux valeurs et la concentration en pixels desdites données de graphisme à valeurs multiples avant la sélection dudit bloc de pixels de conversion.
  8. Processeur de conversion de données d'image selon l'une quelconque des revendications précédentes, ledit moyen de composition de données comprenant :
    un moyen de traitement de données de configuration destiné à l'élaboration pilotée par l'opérateur des données de configuration, dans lequel lesdites données de configuration définissent une disposition de mise en motif destinée à assembler en correspondance les données d'illustration et les données de graphisme à valeurs multiples sélectionnées lors de la récupération à partir de ladite mémorisation externe, et
    un moyen de combinaison de données destiné à élaborer lesdites données d'image composées en combinant lesdites données d'illustration et lesdites données de graphisme à valeurs multiples conformément auxdites données de configuration.
  9. Processeur de conversion de données d'image selon la revendication 8, ledit moyen de traitement de données de configuration comprenant :
    un moyen destiné à réduire lesdites données d'illustration et lesdites données de graphisme à valeurs multiples pour qu'elles conviennent à un affichage sur un tube -à rayons cathodiques afin d'obtenir des données d'illustration de référence à pixels réduits à partir desdites données d'illustration, et des données de graphisme à valeurs multiples de référence à pixels réduits à partir desdites données de graphisme à valeurs multiples,
    un moyen destiné à déterminer ladite disposition de mise en motif afin de combiner lesdites données d'illustration et lesdites données de graphisme à valeurs multiples grâce à une manipulation de l'opérateur par l'intermédiaire dudit tube à rayons cathodiques desdites données d'illustration de référence et desdites données de graphisme à valeurs multiples de référence, dans lequel ledit moyen de traitement de données de configuration élabore lesdites données de configuration conformément à ladite disposition de mise en motif.
  10. Processeur de conversion de données d'image selon l'une quelconque des revendications précédentes, ledit moyen de conversion de format comprenant :
    un moyen destiné à sélectionner un bloc de pixels d'interpolation correspondant à un pixel de gravure virtuel destiné à tailler en creux une alvéole de gravure à partir des pixels à valeurs multiples des données d'image composées des données de graphisme à valeurs multiples et desdites données d'illustration, et
    un moyen destiné à évaluer une valeur de ton dudit pixel de gravure virtuel en établissant la somme des valeurs de tons desdits pixels d'interpolation, dans lequel lesdits pixels d'interpolation sont pondérés par des pondérations de pixels prédéterminées selon l'emplacement par rapport auxdits pixels de gravure virtuels.
  11. Processeur de conversion de données d'image selon la revendication 10, ledit moyen de conversion de format comprenant en outre :
    un moyen destiné à diviser lesdits pixels d'interpolation en une pluralité de régions,
    un moyen destiné à pondérer indépendamment les valeurs des pixels d'interpolation dans chaque région, et
    un moyen destiné à établir la somme des valeurs de tons des pixels d'interpolation dans chaque région sous forme de sommes partielles, dans lequel ledit moyen de conversion de format établit la somme des valeurs de tons desdits pixels d'interpolation à partir desdites sommes partielles.
  12. Processeur de conversion de données d'image selon la revendication 11, ledit moyen destiné à sélectionner un bloc de pixels d'interpolation comprenant :
    un moyen de prédétermination de nombre de pixels d'interpolation destiné à prédéterminer un nombre de pixels pour qu'ils soient sélectionnés par ledit moyen destiné à sélectionner un bloc de pixels d'interpolation conformément à la concentration en pixels desdites données de graphisme à valeurs multiples et desdites données d'illustration.
  13. Processeur de conversion de données d'image selon la revendication 11, ledit moyen destiné à sélectionner un bloc de pixels d'interpolation comprenant :
    un moyen de prédétermination de nombre de pixels d'interpolation destiné à prédéterminer un nombre de pixels pour qu'ils soient sélectionnés par ledit moyen destiné à sélectionner un bloc de pixels d'interpolation conformément à la concentration en pixels desdites données de gravure.
  14. Processeur de conversion de données d'image selon la revendication 11, ledit moyen destiné à diviser lesdits pixels d'interpolation en une pluralité de régions comprenant un filtre en carré, dans lequel ledit moyen de conversion de format divise lesdits pixels d'interpolation par ledit filtre en carré en régions carrées présentant des limites orthogonalement parallèles à des directions d'ordonnancement desdits pixels d'interpolation, telles que déterminées par le format d'échantillonnage desdites données d'image composées desdites données de graphisme à valeurs multiples et desdites données d'illustration.
  15. Processeur de conversion de données d'image selon la revendication 11, ledit moyen destiné à diviser lesdits pixels d'interpolation en une pluralité de régions comprenant un filtre rhomboïdal, dans lequel ledit moyen de conversion de format divise lesdits pixels d'interpolation par ledit filtre rhomboïdal en régions en losange présentant des limites en biais par rapport aux directions d'ordonnancement desdits pixels d'interpolation, telles que déterminées par le format d'échantillonnage desdites données d'image composées par lesdites données de graphisme à valeurs multiples et lesdites données d'illustration.
EP94102434A 1993-02-18 1994-02-17 Processeur de conversion de format d'éléments d'images et de données pour gravure Expired - Lifetime EP0612182B1 (fr)

Applications Claiming Priority (6)

Application Number Priority Date Filing Date Title
JP28801/93 1993-02-18
JP2880193A JP2818528B2 (ja) 1993-02-18 1993-02-18 グラビア製版用画像データ作成装置及び作成方法
JP50420/93 1993-03-11
JP5050420A JP2854489B2 (ja) 1993-03-11 1993-03-11 画像データ変換装置及び画像データ変換方法
JP15009393A JP2772220B2 (ja) 1993-06-22 1993-06-22 画像データ変換装置及び画像データ変換方法
JP150093/93 1993-06-22

Publications (3)

Publication Number Publication Date
EP0612182A2 EP0612182A2 (fr) 1994-08-24
EP0612182A3 EP0612182A3 (fr) 1995-03-01
EP0612182B1 true EP0612182B1 (fr) 1998-08-26

Family

ID=27286324

Family Applications (1)

Application Number Title Priority Date Filing Date
EP94102434A Expired - Lifetime EP0612182B1 (fr) 1993-02-18 1994-02-17 Processeur de conversion de format d'éléments d'images et de données pour gravure

Country Status (3)

Country Link
US (1) US5602972A (fr)
EP (1) EP0612182B1 (fr)
DE (1) DE69412661T2 (fr)

Families Citing this family (9)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US5663803A (en) * 1993-02-25 1997-09-02 Ohio Electronic Engravers, Inc. Engraving method and apparatus for engraving areas using a shaping signal
DE19720877A1 (de) * 1997-05-17 1998-11-19 Anatolii Dipl Ing Fel Verfahren zur Herstellung von Abbildungen auf Glas, Stein und anderen harten Materialien durch Zerstörung ihrer Oberfläche
US7339699B1 (en) * 1999-02-03 2008-03-04 Minolta Co., Ltd. Image processing apparatus
JP4392082B2 (ja) 1999-08-06 2009-12-24 ヒューレット・パッカード・カンパニー 彫版風ハーフトーン画像生成方法・装置
US6523467B2 (en) * 1999-12-17 2003-02-25 Heidelberger Druckmaschinen Aktiengesellschaft Method for measuring engraving cups
US7663772B2 (en) * 2003-01-24 2010-02-16 Infoprint Solutions Company, Llc Dynamic early preparation of presentation objects for efficient printing
WO2008147527A1 (fr) * 2007-05-23 2008-12-04 Dean Robert Gary Anderson Logiciel pour la création d'images gravées
US20080310747A1 (en) * 2007-05-23 2008-12-18 Dean Robert Gary Anderson As Trustee Of D/L Anderson Family Trust Software for creating engraved images
US20080291212A1 (en) * 2007-05-23 2008-11-27 Dean Robert Gary Anderson As Trustee Of D/L Anderson Family Trust Software for creating engraved images

Family Cites Families (14)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
GB1334529A (en) * 1970-11-04 1973-10-17 Crosfield Electronics Ltd Printing processes
DE2161038C3 (de) * 1971-12-09 1985-06-20 Dr.-Ing. Rudolf Hell Gmbh, 2300 Kiel Verfahren zur Herstellung von gerasterten Druckformen
US4200044A (en) * 1976-11-11 1980-04-29 Vested Harry S Method and apparatus for gravure printing that includes line work
US4150400A (en) * 1977-03-31 1979-04-17 International Business Machines Corporation Methods of a coarse-scan/fine-print character reproduction with compression
DE2805237C3 (de) * 1978-02-08 1984-09-06 Dr.-Ing. Rudolf Hell Gmbh, 2300 Kiel Anordnung zur Kontraststeigerung
US4672466A (en) * 1985-02-05 1987-06-09 R. R. Donnelley & Sons Company Operator selectable multiple gradation scanner and engraver apparatus and method
US4905097A (en) * 1986-09-20 1990-02-27 Canon Kabushiki Kaisha Image processing system capable of processing both binary and multivalue image data and having converters for converting each type of image data into the other type of image data
GB8814288D0 (en) * 1988-06-16 1988-07-20 Crosfield Electronics Ltd Method & apparatus for generating composite images
US4918543A (en) * 1989-01-24 1990-04-17 Eastman Kodak Company Apparatus for thresholding an image signal
JPH02195480A (ja) * 1989-01-25 1990-08-02 Hitachi Ltd 画像データの検索方式
US5289293A (en) * 1989-03-14 1994-02-22 Canon Kabushiki Kaisha Pixel density conversion and processing
US5229861A (en) * 1989-05-24 1993-07-20 Dai Nippon Insatsu Kabushiki Kaisha Electronic gravure engraving apparatus including photo tone and character/solid tone processing
US5215864A (en) * 1990-09-28 1993-06-01 Laser Color Marking, Incorporated Method and apparatus for multi-color laser engraving
US5329381A (en) * 1992-02-20 1994-07-12 Payne John H Automatic engraving method and apparatus

Also Published As

Publication number Publication date
DE69412661T2 (de) 1999-01-07
US5602972A (en) 1997-02-11
EP0612182A3 (fr) 1995-03-01
DE69412661D1 (de) 1998-10-01
EP0612182A2 (fr) 1994-08-24

Similar Documents

Publication Publication Date Title
US4259694A (en) Electronic rescreen technique for halftone pictures
EP0618546B1 (fr) Détermination automatique de bordures entre structures polygonales de couleur différente dans une image graphique planare
EP0618718B1 (fr) Correction d'une fausse régistration de plaques pour impression en couleurs d'images définies dans une langue descriptive de pages
EP0411911B1 (fr) Appareil de traitement d'image
EP0620534B1 (fr) Procédé pour déterminer automatiquement des bordures de couleur pour corriger une fausse régistration de plaques d'impression en coulours
US5515456A (en) Process for providing digital halftone image with random error diffusion, color correction and enlargement
JPH0748795B2 (ja) 画像入出力装置
JPH077617A (ja) 色値処理方法および処理装置
EP0457427B1 (fr) Appareil pour améliorer la netteté d'une image en couleur
EP0612182B1 (fr) Processeur de conversion de format d'éléments d'images et de données pour gravure
EP0631430A2 (fr) Appareil de traitement d'images en couleurs permettant la suppression de moiré
JPH06105129A (ja) 分離可能フィルターを使用する電子ハイファイスクリーンレス変換装置及び方法
JP2877356B2 (ja) 画像データ処理方法
EP0361538A1 (fr) Procédé et système pour l'amélioration des bords dans la reproduction d'images numériques à plusieurs niveaux de gris d'une imprimante à points de dimensions fixes
JP2772220B2 (ja) 画像データ変換装置及び画像データ変換方法
US5502642A (en) HSL neighborhoods in CMY color space
JPS62277855A (ja) 画像処理装置
JPS60136478A (ja) 画調識別方法
JP3783815B2 (ja) 画像処理装置
EP0418844A2 (fr) Procédé pour le traitement de l'information d'images en couleur
JPH11296672A (ja) 画像色情報抽出方法
JP2818528B2 (ja) グラビア製版用画像データ作成装置及び作成方法
JPH077618A (ja) 色値処理方法および装置
JPH06245071A (ja) 画像の明暗補正方法
JP2854489B2 (ja) 画像データ変換装置及び画像データ変換方法

Legal Events

Date Code Title Description
PUAI Public reference made under article 153(3) epc to a published international application that has entered the european phase

Free format text: ORIGINAL CODE: 0009012

17P Request for examination filed

Effective date: 19940217

AK Designated contracting states

Kind code of ref document: A2

Designated state(s): DE FR GB

PUAL Search report despatched

Free format text: ORIGINAL CODE: 0009013

AK Designated contracting states

Kind code of ref document: A3

Designated state(s): DE FR GB

17Q First examination report despatched

Effective date: 19970424

GRAG Despatch of communication of intention to grant

Free format text: ORIGINAL CODE: EPIDOS AGRA

GRAG Despatch of communication of intention to grant

Free format text: ORIGINAL CODE: EPIDOS AGRA

GRAH Despatch of communication of intention to grant a patent

Free format text: ORIGINAL CODE: EPIDOS IGRA

GRAH Despatch of communication of intention to grant a patent

Free format text: ORIGINAL CODE: EPIDOS IGRA

GRAA (expected) grant

Free format text: ORIGINAL CODE: 0009210

AK Designated contracting states

Kind code of ref document: B1

Designated state(s): DE FR GB

ET Fr: translation filed
REF Corresponds to:

Ref document number: 69412661

Country of ref document: DE

Date of ref document: 19981001

PLBE No opposition filed within time limit

Free format text: ORIGINAL CODE: 0009261

STAA Information on the status of an ep patent application or granted ep patent

Free format text: STATUS: NO OPPOSITION FILED WITHIN TIME LIMIT

26N No opposition filed
REG Reference to a national code

Ref country code: GB

Ref legal event code: IF02

PGFP Annual fee paid to national office [announced via postgrant information from national office to epo]

Ref country code: GB

Payment date: 20070214

Year of fee payment: 14

PGFP Annual fee paid to national office [announced via postgrant information from national office to epo]

Ref country code: DE

Payment date: 20070215

Year of fee payment: 14

PGFP Annual fee paid to national office [announced via postgrant information from national office to epo]

Ref country code: FR

Payment date: 20070208

Year of fee payment: 14

GBPC Gb: european patent ceased through non-payment of renewal fee

Effective date: 20080217

REG Reference to a national code

Ref country code: FR

Ref legal event code: ST

Effective date: 20081031

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: DE

Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES

Effective date: 20080902

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: FR

Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES

Effective date: 20080229

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: GB

Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES

Effective date: 20080217