JP3419450B2 - Pixel data processing apparatus and method - Google Patents

Description

Detailed Description of the Invention

[0001]

BACKGROUND OF THE INVENTION 1. Field of the Invention The present invention relates to page units of pixel data for a plurality of pages (pixel data obtained by sampling or encoded data) for a predetermined number of pages in a facsimile or the like. The present invention relates to a pixel data conversion technique for converting data.

[0002]

2. Description of the Related Art As a conventional technique for converting page image information, there is, for example, one disclosed in Japanese Patent Laid-Open No. 3-216370 or one disclosed in Japanese Patent Laid-Open No. 3-163675. In the technique disclosed in Japanese Patent Laid-Open No. 3-216370, if there is a discrepancy between the paper size set by the user and the size of the paper actually set in the printer, the size of the set paper is adjusted so as to match.
The page image information is enlarged or reduced.
In the technique of Japanese Patent Laid-Open No. 3-163675, an area for one sheet is divided into areas corresponding to each emulation mode, and the supplied page image information is enlarged so as to fit the size of the area. Reduced or scaled,
It is printed in the form of being superimposed on one sheet of paper.

[0003]

In consideration of the effective use of paper resources, the compactification of hard copies, and the creation of a handbook of a document with a large number of pages, page image information for a plurality of pages is half of that. It is preferable that the number of pages is printed, and further, the sheets are printed together on one sheet. However, conventionally, for example, in the technique disclosed in Japanese Patent Laid-Open No. 3-216370, the process of simply enlarging or reducing page image information can be performed, and page image information for a plurality of pages is collectively printed out on, for example, one sheet. I couldn't do that. In addition, JP-A-3-1636
In the technology described in Japanese Patent Publication No. 75, although a process of enlarging, reducing, or scaling a plurality of page image information, respectively, and outputting to a set area, a page having an arbitrary number of pages, for example, one sheet However, it is not possible to perform processing such as printing so that they do not overlap each other, and the size of each area and the reference point for image creation must be set from the host computer side one by one, which is troublesome. An object of the present invention is to solve such a problem and to print out page image information for a plurality of pages so as not to overlap a predetermined number of pages, for example, half the number of pages, or even one sheet. It is to provide a page image information processing technology capable of performing the above, particularly, a pixel data processing technology suitable for application to a facsimile machine or a digital copying machine.

[0004]

According to the present invention, in order to achieve the above-mentioned object, the structure as described in the claims is adopted. Here, the description of the claims will be supplementarily described.

According to one aspect of the present invention, the page-up processing means stores page-by-page pixel data for a plurality of pages.
First information for moving the origin of the pixel data of the page unit and conversion of the pixel data of the page unit for converting into the pixel data of the page unit for a predetermined page smaller than the plurality of pages. The second information and the third information for scaling the pixel data in page units are
Add to the page unit pixel data for the plurality of pages,
The page unit pixel data for the plurality of pages is converted into the page unit pixel data for the predetermined page. As a result, for example, the original pixel data for eight pages is printed out on a paper sheet having a size for four pages.

[0006]

BEST MODE FOR CARRYING OUT THE INVENTION Embodiments of the present invention will be described below. Here, first, a configuration example of processing page image information in general will be described prior to the embodiment of the present invention in which sampled pixel data is processed. Below, a 1st structural example and a 2nd structural example are demonstrated as a structural example.

FIG. 2 shows the system configuration of the first configuration example.
In the figure, 1 is a local area network. A workstation 2 is connected to the local area network 1, and an Interpress master is created by this. The Interpress master is page image information described in "Interpress" which is one of PDL (Page Description Language), and corresponds to "page image information for a plurality of pages" in the claims. It should be noted that the Interpress master created by the workstation 2, so to speak, the original page image information is referred to as "original Interpress master" and is designated by reference numeral 3. In the figure, it is abbreviated as "IPM". (For details of Interpress, see US Xero, for example.
Company x Translated by Fuji Xerox Co., Ltd. “Interpress”
(Head 2.3.30) See Maruzen et al. ). Although a plurality of workstations 2 are usually connected to the local area network 1, only one is shown here. Four
Is a print server, which outputs the original Interpress master transmitted from the workstation 2 or the like as a hard copy 5 by applying the same processing (or the same reference numeral "5" is used for the paper). The print server 4 includes a queuing device 41,
The printer control device 42, the editing information setting device 43, the printing mechanism unit 44, etc. are provided (FIGS. 1 and 2). The queuing device 41 is provided with a hard disk, temporarily holds the original interpress master transmitted from each workstation 2, and supplies this to the printer control device 42 according to the priority order.

Details of the printer controller 42 are shown in FIG. The device 42 is a page image information processing device 421.
And bitmap data creation device 422 and marker device 42
3 and (FIG. 1). Page image information processing device 4
21 includes a 2-page-up processing unit 4211 and a recursive processing unit 4212. The 2 page-up processing unit 4211 corresponds to the page-up processing unit of the present invention, and the recursive processing unit 4
212 corresponds to the recursive processing means of the present invention. The edit information setting device 43 includes a display device 431 and a keyboard 432 as shown in FIG. The number of pages of the original Interpress master is set by the editing information setting device 43 as one page. The bitmap data generation device 422 of FIG. 1 expands the interpress master supplied from the page image information processing device 421 into bitmap data. The created bitmap data is supplied to the marker device 423. The marker device 423 supplies the bitmap data to the printing mechanism unit 44 at the scanning timing of the laser beam of the printing mechanism unit 44. As a result, an electrostatic latent image is formed on the photosensitive drum of the printing mechanism unit 44, and this is transferred and fixed on the paper and output as a hard copy 5.

FIG. 3 shows a processing procedure of page image information. This processing is executed by the respective units 4211 to 4212 of the page image information processing device 421. First, the index n of the page-up number 2n is fetched (step S
1). The page-up number refers to the number of pages of the original Interpress master converted into one page. In the present configuration example, this is represented by a power of 2n, and its exponent n
Is set by the editing information setting device 43. For example, when "n = 3" is set, the number of page-ups is "8", and eight pages of the original Interpress master are set as a new one Interpress master. The word "step" will be omitted hereinafter.

With respect to the taken n, it is judged whether the value is "0" (S2). If the answer is “NO”, “n = 0”, that is, the number of page-ups is “2n”.
= 1 ”is set. This means, so to speak, no conversion. The original Interpress master is supplied to the normal bitmap data creating device 422 (S6). When the set value of n is not "0", the answer to S2 is "yes (YES)". One original Interpress master is read from the queuing device 41 (S
3). A recursive process is executed on the original Interpress master (S4). The converted Interpress master, for example, a new Interpress master whose original 8 pages are 1 page, is the bitmap data creation device 4
It is supplied to 22 (S5).

The details of the recursive processing in S4 are shown in FIG. In this process, the 2-page-up process of S13 is repeated the number of times indicated by n. This processing is executed by the recursive processing unit 4212. Note that, for simplicity of explanation, n does not assume a negative value. The 2-page-up processing of S13 is executed by the 2-page-up processing unit 4211. By this processing, each two pages of the Interpress master are converted into one page. In the recursive processing of FIG. 4 (S4 of FIG. 3), this S13 is repeated n times. As a result, the 2n-th page of the Interpress master is converted into a new page. An example is shown in FIG. An outline will be given first by citing this example. Here, it is assumed that the original Interpress master has 8 pages, and n is set to "3" so as to make it one page of Interpress master. At the first page-up process (S13), the original Interpress master Pa of 8 pages
pages 0-1 to Page 0-8 are converted into 4-page interpress masters Page 1-1 to Page 1-4. The number following "Page" is the number of conversions, "-"
The number following "" indicates the page number of the Interpress master. For example, "Page 0-1" is the conversion "0" times, so it is "-1" in the original Interpress master.
Therefore, it refers to the first page. (Note that in the figure, it is represented by a solid-line rectangle like the hard copy 5, but if the code of "Page" is attached, it means the print information (interpress master) of the page.) Second time Then, the four-page Interpress Master Pag
e1-1 to Page1-4 are converted into two-page Interpress masters Page2-1 to Page2-2. Three
At the first time, it is converted into a one-page Interpress master Page3.

The outline of the recursive process in S13 of FIG. 4 has been described above. The entire recursive process will be described with reference to FIG.
The Interpress master to be converted is assumed to be the Interpress masters of Page 0-1 to Page 0-8 shown in the example of FIG. S11 is executed, the queuing device 4
This original Interpress Master is imported from 1. In accordance with the example of FIG. 5, n is set to “3”. Therefore, the answer is "NO" in S12, and S13 is executed. Here, the first 2-page up process is performed. As a result, the 8-page original Interpress Master Page 0-1 to Page
0-8 is a 4-page Interpress master Page1-
1 to Page 1-4. S14 is executed,
These 4-page Interpress masters Page 1-1 to P
ages 1-4 are set as new Interpress masters. S
15 is executed and n is decremented to "2". S11 is executed again. The new Interpress masters Page 1-1 to Page 1-4 are incorporated.
Since n = 2, the answer to S12 is "NO", and the second time of S13 is executed. 4-page original Interpress masters Page 1-1 to Pa
ge1-4 is a two-page Interpress master page
2-1 to Page 2-2. S14 is executed, and the Interpress master Page 2-1 of this 2 page is executed.
~ Page 2-2 is set as a new Interpress master. S15 is executed and n is decremented to "1".
Becomes The processing of S11 to S15 is executed again. This is the original Interpress Master P on page 2
page2-1 to Page2-2 are converted into one-page Interpress master Page3. n = 0 and S
The answer to 12 is "YES", and the processing of FIG. 4 (processing of the recursive processing unit 4212) is ended.

The details of the 2-page-up process (S13) are shown in FIG. By this processing, the Interpress master having a plurality of pages is converted into half the number of pages, for example, the image information of 8 pages is converted into the Interpress master of 4 pages. In order to facilitate understanding, the contents of the original Interpress master (FIG. 7) and the contents of a new Interpress master (FIG. 8) to be generated will be described first. First, in Interpress, a preamble or a token for one page is enclosed by a "{" token and a "}" token (FIG. 7). In addition, "Preamble""P
“Age 1”, “Page 2” and the like are expressed by omitting “preamble token”, “first page token” and the like, and are not themselves tokens of the Interpress master. Further, in the case of this original Interpress master, the number of pages is "n", but the tokens of each page from the fifth page to the nth page are shown in abbreviated form. Two
By the page-up process, the Interpress master shown in FIG. 7 is converted into the Interpress master shown in FIG. Fourth of FIG.
The part (token) from the line to the 18th line is a token for a new page, in the case of the example of FIG.
In the portion corresponding to 1, the first page Page 0-1 and the second page Page 0-2 of the original Interpress master.
Page information (Fig. 7 {Page 1}, {Page 1
2}) is included. Although the original Interpress master of FIG. 5 has 8 pages, this example will be cited as a diagram of the original Interpress master of page n of FIG. 7. Returning to FIG. 8, the portion from the 19th line to the 35th line is the token for the next new page, that is, P in FIG.
The page information of the original third page and the fourth page (see FIG. 7 {Page
3}, {Page 4}) is included. Tokens D1A and D1B in FIG. 8 are "first information for arranging page image information together" in the claims, and token D2 is "second information for adding rotation processing to page image information".
The token D3 corresponds to "third information for applying scaling processing to page image information". Tokens D4A, D
4B is a so-called foolproof, and is not directly related to the principle of the present configuration example, but is practically useful and will be described below.

The token of FIG. 8 is interpreted and executed by the bitmap data creating means 422 of FIG. The contents of the original Interpress master (FIG. 7) and the contents of a new Interpress master (FIG. 8) generated from this point have been described above in order to facilitate understanding of the 2-page-up process of FIG. In order to facilitate understanding of the 2-page-up process of FIG. 6, how the converted Interpress master of FIG. 8 is interpreted and executed will be described first. For this explanation, FIGS. 11 to 23 are cited.
Here, the process in which the first page of Page 0-1 and the second page of Page 0-2 of the original Interpress master are converted into a new page of Interpress master Page 1-1 will be taken as an example. For easy understanding, each page is numbered and an arrow is shown as a print example. When the token D1A is executed, the origin is moved to the lower right of the sheet 5 (FIG. 13, (A) is changed to (B). The same applies to the following figures). At this time, the contents of the stack are shown in FIG.
To (D) in sequence (in other figures, the progress is similarly expressed in alphabetical order). When the CONCATT operator is executed in the state of FIG. 11 (C), the origin movement matrix of FIG. 12 is multiplied by the current transformation and held as a new current transformation. If Page 0-1 of the Interpress master of the first page is printed in this state, the length of the paper in the X direction (mediumXsi) moves from the original position to the right.
The contents are printed at the position moved to the right by ze).

When the token D3 is executed, the scale is changed. (FIGS. 16A and 16B). At this time, the contents of the stack change from FIG. 14 (A) to (E),
When the CONCATT operator is executed in the state of (D), the scale conversion matrix of FIG. 15 is multiplied by the current conversion and held as a new current conversion. If Page 0-1 of the Interpress master of the first page is printed in this state, the paper is moved to the right from the original position by the length of the paper in the X direction (mediumXsize), and the size is X / Y only. The reduced version is printed. Here, X / Y is the length of the paper in the X direction (mediumXsi).
ze) is the length of the paper in the Y direction (mediumYsiz
It is divided by e). When the token D2 is executed, the coordinate axes are rotated. (FIGS. 19 (A) and (B)). At this time, the contents of the stack change from FIG. 17 (A) to (C), and when the CONCATT operator is executed in the state of (B), the rotation matrix of FIG. 18 is multiplied by the current conversion, and the new current conversion is performed. Retained as. If Page 0-1 of the Interpress master is printed in this state, the width of the paper from the original position (mediumXsiz
e) is moved to the right, the size is reduced by X / Y,
Printing is performed in a state of being rotated 90 degrees counterclockwise around the origin P. As is clear from this description, the tokens D1A, D3, and D2 are replaced by the tokens {Page of the original one page of the Interpress master Page 0-1.
1} and then interpret and execute them, the new Interpage master Page 1-1 of the first page is added to the lower half of the new Interpage master Page 1-1 of the first page.
e0-1 is laterally reduced and fitted so as to fit the width of the sheet 5 (FIG. 19 (B), FIG. 5).

Next, the second page (Page 0-2) of the original Interpress master may be fitted into the upper half of the new Interpress master Page 1-1 (FIG. 5). After interpreting and executing the token for the first page (Page 0-1) of the original Interpress master, the current conversion is as follows, as shown in FIG. 19B or FIG. Master (Page
0-1) is laterally reduced to fit the width of the sheet 5 and fitted into the lower half of a new page of the Interpress master Page 1-1. Therefore, in this current conversion, the length of the paper 5 in the Y direction (M
If the current conversion is changed so that the origin P is moved upward by half the value of (ediumYsize), the original second page Interpress master Page0-2 will be over the new page Interpress master Page1-1. The image is printed in a horizontally reduced size (FIG. 22B, FIG. 5). In this case, the scale of the current conversion at this time is reduced to X / Y by executing the token D3 (FIG. 8, line 7 to line 8). Therefore, if the current conversion is changed so that it simply moves Y / 2 upwards, the upward movement is insufficient. Here, a value obtained by multiplying "Y / 2" by "Y / X" is used. It must be the amount of movement in the upward direction. The token D1B is placed for this purpose. When each token is executed, the contents of the stack change as shown in FIGS. 20A to 20J, and the CONCATT operator is executed in the state of (I). Then, the origin movement matrix (FIG. 21) held in the stack at that time is multiplied by the current conversion at that time, and the origin is moved upward by “Y / 2 · Y / X”. In this state, the original second page Interpress master P
If age0-2 is printed, a new one page P
On the upper half of age1-1, the original second page Interpress masters Page0-2 are laterally reduced in size to fit the width of the sheet 5 (FIG. 22 (B), FIG. 5).

The tokens D4A and D4B will be described. These are for the foolproof as described above, and are not directly related to the implementation of this configuration example. However, since it is practically useful, a brief explanation will be given. 23A to 23I show how the stack changes when each token is executed. “MARK” in (B) is an item that can be removed only by the UNMARK operator, and plays a role as a firewall on the stack.
<Any> in (C) means “any type of element (data)”, and represents what may remain on the stack after the token execution in (C). The number of elements remaining on the stack is the token of the first page {Page
1}. FIG. 23C shows a case where two elements remain. By executing the token in (C), the contents of {Page 1} are drawn. At this time, the states of some and all frames of the image creation unit variables are saved and protected. Then, after executing the token of FIG. 23 (C), these are returned to their original values and original states.

When the token (D) is executed, the image creating unit variables 0 and 1 which are not protected by the above "DOSAVESIMPLEBODY" are returned to their initial values. When the token of (E) is executed, the above "DOSA
Image creator variables 2 and 3, which are not protected by VESIMPLEBODY ", are returned to their initial values. The image creation unit variables consist of 25 variables that hold information necessary for drawing and are referred to by an index. This variable holds information such as the current position of the pen on the page, its stroke width, ink color, and font style of the character. Note that No. 0 is the x-coordinate value of the current position of the pen on the page, and No. 1 is the y-coordinate value of the current position of the pen on the page. Numbers 2 and 3 are values of relative movement distances x and y from the start point to the end point of the justified text line. A frame is a storage referred to by an index and is used to store information such as fonts. At least 50 frames are prepared.

"COUNT" in (F) is an operator that counts the number of elements above <mark>. "MAKEVEC" of (G) is an operator that pops the number of elements (here, "2") indicated by the argument from the stack and collects them into one vector. By executing this operator,
The two elements above the mark are combined into one element as shown in (G). "POP" in (H) is an operator that removes one element on the stack, which removes [<any><any>] at the top of the stack. It is an operator that removes the <mark> at the top of the “UNMARK0” stack of (I). By the processing up to this point, the states of the stack, frame, and image creation unit variables are returned to the states before the rendering of the first page.

The contents of the new interpress master (FIG. 8) generated by the page-up process of FIG. 6 have been described above in order to facilitate understanding. The process of FIG. 6 aims to generate this new Interpress master (FIG. 8) from the original Interpress master (FIG. 7). Therefore, the token {Page 1} of each page from the original Interpress master file,
{Page 2}, ..., {Page n} are sequentially read, the token T1 is inserted before the odd page and the token T2 is inserted before the even page to generate a new interpress master (FIG. 8). Is performed. The token T1 is composed of tokens D1A, D3, D2 and D4, and the token T2 is composed of tokens D4B and D1B. A new Interpress master is created on the destination file.

The processing of FIG. 6 will be described step by step. First, initial setting is made in S21. The "}" flag (flag) is off (off), the 1stPage (first page) flag is on (on), and the count value is "1". In step S22, the destination file is created. In step S23, data is read in token units from the Interpress master to be processed. Here, Page 0-1 to Page 0-n of FIG. 7 (Page of FIG.
The original Interpress master (corresponding to 0-1 to Page 0-8) is read. The first line of FIG. 7,
Each token on the second line is written to the same destination file. That is, S24 "END?", S25 "Is the read token"} "token? , S26 "Is the read token"{"token? Both are “NO”. In step S33, the "}" flag is turned off. Then, the process proceeds to S35, and the read token, for example, “Headed” in the first line
r "is written to the destination file. S
Returning to step 23, this process is repeated for all the tokens on the first and second lines in FIG. 7 (first and second lines in FIG. 8).

When the "{" token on the third line in FIG. 7 is read, S26 "Is the read token a"{"token? Becomes "YES". Proceed to S27, c
The value of outt is incremented. Up to here cou
Since the value of nt has not been changed, its value is the initial setting "0", and the value is "1" here. S
28, the "}" flag is on, and (AND)
It is checked whether the value of count is "1". cou
The value of nt is "1" here, but "}" fla
g has been set to “off” in the previous execution of S33. Therefore, S33 and S44 are executed, and the third line "{pr
The tokens up to "eamble" are written in the destination file (line 3 in FIG. 8). When the last "}" token on the third line in FIG. 7 is read, the answer in S25 is "Yes". In S32, the value of count is decremented. Since the value of count was "1" at this time, it becomes "0" by this decrement. S3
In step 4, the "}" flag is turned on. And S3
5, the "}" token read at this time is written in the destination file (3rd line in FIG. 8).

Returning to S23, the "{" token at the beginning of the fourth line in FIG. 7 is read. S25 → S26 → S
27, the count is incremented to "1"
become. In step S28, it is checked whether the "}" flag is on and the count value is "1". cou
The value of nt has been set to "1" in S27 immediately before, and "}".
The flag is also set to "on" in S34. Therefore, the process proceeds to S29, and it is inspected whether 1stPage is on. 1stPage is on by default in S21
It was a defeated person. Proceeding to S36, the "{" token at this time is written in the destination file (4th line in FIG. 8). Next, S37 is executed, and the token T1 is written in the destination file (line 5 to line 12 in FIG. 8). And 1stPag in S38
The e flag is turned off, and the "}" flag is set to o in S39.
It is set to ff, and the process returns to S23. Here, the fourth line “{” in FIG.
The contents of the Interpress master on the first page following the token, that is, the first token (not shown) of "Page 0-1" is read. As described above, the Interpress master for one page is enclosed in {} tokens, and in the case of the original, neither "{" token nor {} token exists therein. Therefore, for this first token and all subsequent tokens in {}, S24, S2
The answer is "NO" in all of S5 and S26. S24 → S25
The loop of → S26 → S33 → S35 is repeatedly executed, and all the tokens of “Page 1” enclosed in {} are sequentially read from the original Interpress master,
Written to the destination file (Fig. 81)
Second line "Page 0-1").

Next, the "}" token following the "Page 0-1" data is read. The answer to S25 is "YES", the count is decremented to 0, and the "}" flag is turned on (S32, S).
34). In step S35, the read token "}" is written in the destination file. Returning to S23, the first "{" token on the fifth line in FIG. 7 is read. S24 is "NO", S25 is "NO", S26 is "YES", and the count is incremented to "1" in S27. Since the "}" flag was turned on in the previous S34, the answer in the next S28 is "YES",
Since 1stPage has been turned off in the previous S38, the answer to the next S29 is "NO", and the process proceeds to S30.
The token T2 is written in the destination file (S30). Proceed to S31, 1stPage is on
To be Then, the process returns to S23. The "{" token read at this time is ignored.

This time, Page 0-2 enclosed in {}
The token is read. As with the previous Page 0-1 token, there is no further {} in {}. Therefore, S24 → S25 → S26 → S33 →
The loop of S35 is repeatedly executed, and all the tokens of "Page 0-2" enclosed in {} are sequentially read from the original Interpress master and are written in the destination file (line 17 in FIG. 8, "Pa
ge 0-2 "). Then, the process returns to S23. Where Pag
The “}” token that encloses each token of e 0-2 is read. As in the case of the “}” token of Page 0-1, the process proceeds to S25 → S32 → S35, and cou
nt is decremented to 0, and "}" flag is turned on. Proceed to S35, and the "{" token at this time is written in the destination file (Fig. 8).
18th line). With this, Page0-1 and Page0-2
New Interpress Page from Interpress Master
1-1 was generated (4th to 12th lines in FIG. 8).

A pair of Page0-3 and Page0-4, P
A pair of age0-5 and Page0-6, and Page0-
For the set of 7 and Page 0-8, this Page 0-
1 and Page 0-2, the same process, that is, token T1
And a process of writing the token T2 into the destination file while inserting the token T2, and new Interpress masters Page 1-2 to Page 1-4 are generated. Note that in FIG. 8, Page 1-1 and Page 1-2
The contents of the destination file for (Page 0-1 to Page 0-4) are shown, and the illustration for Page 1-3 and Page 1-4 (Page 0-5 to Page 0-8) is omitted. Finally, "END" on the last nth row in FIG. 7 is read. The answer to S24 is "YES", and the "END" is written to the destination file (nth line in FIG. 8). This completes the processing of FIG. Page 0-1 to Page 0-8 by the above procedure
The Interpress master (Figs. 5 and 7) of
1 to Page 1-4 are converted into Interpress masters (FIGS. 5 and 8).

The process of FIG. 6 corresponds to S13 of the recursive process of FIG. Proceeding to S14 of FIG. 4, the interpress masters Page 1-1 to Page 1-4 after conversion at this time are set as new processing targets. In step S15, n is decremented to "2". Returning to S11, the new Interpress masters Page1-1 to Page1-4 to be processed are read. In S12, it is checked whether n = 0.
The answer is "NO" and the process proceeds to S13. Page 0-1 to Pa
As in the case of processing for ge0-8, the processing target interpress at this time Page1-1 to Page1-
4, the 2 page up process of FIG. 6 is performed. As a result, the new Interpress Master Page shown in FIG.
2-1 to Page 2-2 are generated (see also FIG. 5).
The 12th line of this new Interpress Master, "Pa
“Ge1-1” means the tokens on the 4th to 12th lines in FIG. 8, and the “Page 1-1” on the 17th line means the tokens on the 19th to 35th lines in FIG. 8. "Page1-3" on the 26th line and "Page1-4" on the 32nd line in FIG.
Has the same meaning, but is not shown in FIG.

Proceeding to S14 in FIG. 6, the interpress masters Page 2-1 to Page 2-2 after conversion at this time are set as new processing targets. In step S15, n is decremented to "1". Returning to S11, the new Interpress masters Page 2-1 to Page 2 to be processed
-2 is read. In S12, it is checked whether n = 0. The answer is "NO" and the process proceeds to S13. Page 0-1
~ Page0-8, the processing target interpress at this time Page2-1 ~ Page
For e2-2, the 2-page-up process of FIG. 6 is performed. As a result, the new Interpress master Page 3 shown in FIG. 10 is generated (see also FIG. 5). Note that, as in the case of FIG. 9, “Page 2-1” on the 12th line indicates 4 in FIG.
Means the tokens on the 12th to 12th lines, and "Pa on the 17th line"
“Ge2-2” means the token on the 19th to 35th lines in FIG.

When the above processing is completed, the process proceeds to S14 in FIG. 6 and the converted interpress master Page3 at this time is shown.
Is a new processing target. In step S15, n is decremented to "0". Returning to S11, the new Interpress master Page 3 to be processed is read. In S12, it is checked whether n = 0. The answer is "YE
S ”, and the recursive processing of FIG. 4 is terminated. Figure 4
The recursive process of is equivalent to S4 of FIG. Proceed to S5 of FIG.
The converted Interpress master (FIG. 10) read at this time is supplied to the bitmap data creation device 422 of FIG. The bitmap data creation device 422 develops the contents of this converted Interpress master into bitmap data and supplies it to the marker device 423. The marker device 423 supplies the bitmap data to the printing mechanism unit 44 in synchronization with the beam scanning timing of the printing mechanism unit 44. As a result, the original eight pages are converted into one page and printed out like Page 3 shown in FIG.

Next, a second structural example will be described. When the Interpress masters converted by this configuration example are interpreted and executed, the pages of the Interpress masters after conversion are arranged substantially in numerical order. In the Interpress master converted by the first configuration example, the page arrangement is not always in order. For example, in Page 3-1, which has been converted three times, the page image information of the fifth page to the eighth page is located on the left side of the page image information of the first page to the fourth page (FIG. 24. FIG. See also, but in Figure 5 Pag
e3. The same shall apply when referring to FIG. 5 below). The conversion method of the first configuration example is sufficient when the number of conversions is small, or when the Interpress master has a content in which the page arrangement is not a problem. This simplifies the process. In the Interpress master converted by the second configuration example,
The page image information is arranged in almost page order (see FIG. 24).
Page 3a-1, Figure 27 Page 3b-1). First
Compared with the configuration example, the number of processing steps is slightly increased, but the visibility is improved. Strictly speaking, by interpreting and executing the Interpress master converted by the first or second configuration example, the page image information is rotated, etc., and the desired hard copy 5 is generated. So
In the following description, the page image information is rotated according to the configuration example itself.

The difference between the first configuration example and the second configuration example is as follows. That is, in the first configuration example, the odd page of the original page image information is always arranged in the lower half of the new page, and the even page is always arranged in the upper half. For example, Page 2-1 was arranged in the lower half of Page 3-1, and Page 2-2 was arranged in the upper half of Page 3-1 (FIG. 24, FIG. 25, FIG. 27, FIG. 5).
This process will be referred to as "conversion (1)" (circled numbers in the figure). In the second configuration example, the process having the opposite positional relationship is sandwiched between the processes of the conversion (1) (FIG. 24, FIG. 26, FIG. 27). This process is called "conversion (2) (circled numbers in the figure)". The number of times the conversion (2) is executed depends on the paper orientation. In portrait (using portrait paper length), conversion (1) and conversion (2) are executed twice from the beginning (FIGS. 29 and 24). In landscape (use paper landscape), conversion (1) is executed only for the first time, and after the second time,
The conversion (2) and the conversion (1) are executed twice (FIG. 29,
FIG. 27).

The details of the conversion (2) will be described. To facilitate understanding, FIG. 25 shows changes in page images (FIGS. 11 to 22) in the case of conversion (1) again. In the conversion (1), the origin of the page image information is first moved to the lower right of the paper 5 (FIG. 25 (A), FIG. 13 (B)). Next, the coordinate scale was reduced (FIG. 25B, FIG.
6). Then, the page image is rotated by 90 degrees (FIG. 25 (C), FIG. 19), and the page image information of an odd page, for example, Page 0-1 is developed here (FIG. 25 (D)). Next, the origin is moved to the right end of the center of the paper 5 in the vertical direction (FIG. 25 (E), FIG.
(B)), where the next even page, eg Page0-
The page image information of No. 2 was expanded (Fig. 25
(F)).

FIG. 26 shows the procedure of conversion (2). The content of the process is the same as the conversion (1), and the order of the processes A and E is only exchanged (however, the specific contents of the token for realizing this process are different (described later)). In the conversion (2), the process of E for moving the origin to the center of the paper 5 in the vertical direction is performed first, and the process of A for moving the origin to the lower right of the paper 5 is performed later. By changing the order of origin movement in this way, the original odd page is arranged in the upper half of the new page. FIG. 28 shows a specific example of the token for performing the conversion (2).
This Interpress master is in a state in which the conversion has been executed three times, that is, the first page is Page 3a-1 in FIG. The tokens of the conversion (2) are basically the same as those of the conversion (1), and the token D1A portion of the conversion (1) is replaced by the token D1 so that the origin movement order is reversed.
1A, and the token D1B portion of the conversion (1) is changed to the token D11B. Token D
11A corresponds to token D1B, and token D11B corresponds to token D1A. Since the contents of the current conversion when moving the origin are different from those of the conversion (1), the contents do not match, but the movement of the origin to each position when this is executed is the same. As in the case of executing the token D1B of the conversion (1), the scale reduction is performed before the execution of the token D11B of the conversion (2). Therefore, here too, the contents of the token are set so that the amount of movement of the origin in the vertical direction is increased accordingly.

The processing procedure of the second configuration example is the same as that of the first configuration example except that the flow of FIG. 4 (S4 of FIG. 3) is changed as shown in FIG. The flow of FIG. 30 is obtained by adding the processes of S51 to S59 to the flow of FIG. Figure 4
The same steps as those in Step 1 are denoted by the same numbers, and description thereof will be omitted. By the newly added step, the page up process of conversion (1) and the page up process of conversion (2) are switched and executed depending on the number of conversions. The page-up process of conversion (1) is the process of FIG. 6 (S13 of FIG. 4) of the first configuration example. The conversion (2) page-up process is the token T2 written in the destination file in S30 and S37 of the process of FIG.
And T1 are replaced with tokens T11 and T12 of FIG. 28, respectively (the flow of which contents have been rewritten is not shown). As is apparent from the above description, this replacement is for arranging the page image information of the odd page in the upper half of the new page, contrary to the case of the first configuration example. The flow of FIG. 30 will be described in order. First orientation (vertical use or horizontal use)
Is taken in (S51). This data is set by the editing information setting device 43. When the captured orientation is the portrait (S52 “YES”), the variable i is set to 0 (S53). If not (S5
2 "NO"), the variable i is set to 1 (S54).
As described earlier with reference to FIG. 29, the conversion (2) and the conversion (1) are executed twice from the third conversion for the portrait and the second conversion for the landscape. If this is done, the pages will be arranged almost in order. In this second configuration example, since the initial value of the variable i is changed according to the orientation as described above,
The same flow can be used for any orientation.

Next, as in the first configuration example, the process target interpress master is loaded (S11), and the value of n at that time is inspected (S12). Here, it is assumed that the portrait (i = 0). In the portrait, the conversion “2” process is performed from the third time. In order to explain that both the conversion (1) and the conversion (2) are performed, n is set to 5 here, and it is assumed that the first conversion will be performed. Since n was assumed to be 5, the answer in S12 is "NO", the flow proceeds to S55, where the value of i is checked. Since it is assumed that the conversion is the first time, i is 0, the answer is “NO”, and the process proceeds to S13, where the same conversion (1) page-up process as the first configuration example is performed. In step S59, i is incremented to "1". Same S1 as in the first configuration example
4, the process of S15 is performed. Steps S11 and S12 are executed again. In S15, n is decremented to 4. Therefore, the process proceeds to S55 and the value of i is inspected. i =
Since it is 1, the conversion (1) page-up process of S13 is executed again. The variable i is incremented to 2 in S59. After execution of S14, n is decremented in S15. n becomes 3. The process again proceeds from S11 and S12 to S55. Since i is 2 here, the answer is "YES",
Proceed to S56. The conversion (2) page-up process is executed. Proceed to S57. Since i is 2, the answer here is "N
O ”, the process proceeds to S59 and i is incremented by 3
become. From S14 to S15, n is decremented to 2. The process proceeds to S11, S12, S55 and S56, and the page up process of conversion (2) is executed again. i
Is 3, so the answer in S57 is "YES",
The process proceeds to S58 and i is returned to 0. Then, in the next two conversions, the page-up process of conversion (1) is executed, and n
Is 0 and the answer in S12 is "YES",
Processing is terminated. If n is a larger value,
After this, the page-up process is repeated twice in the order of conversion (2) and conversion (1). As a result, for example, FIG.
An Interpress master (FIG. 28) having Page 3a-1 as the first page is generated.

If the orientation is landscape, i is first set to 1 and the first conversion S5 is performed.
Since it is incremented by 9 and becomes 2, S in the second conversion
The answer to 55 becomes "YES", and the page up process of conversion (2) is executed. After the page up process of conversion (2) is executed again at the third conversion, i is returned to 0 in S58, and thereafter, conversion (1) and conversion (2) are performed until n becomes 0. The page-up process is repeated twice in this order. As a result, for example, Pag in FIG.
An interpress master (not shown) having a page image like e3b-1 as the first page is generated.

In the configuration example, the page image information for two pages is converted into the page image information for one page.
For example, page image information for three pages may be converted into page image information for one page. In the example of FIG. 5, the conversion is performed three times, but for example, an 8-page conversion may be performed once and the 4-page conversion may be output when the 4-page conversion is performed. In the configuration example, the Interpress master is used as the page description language, but Postscript (Postscript: Adobe, Inc.) or other language may be used. Further, the present invention can be applied to image data (pixel data) handled by, for example, a facsimile, without being particular about the page description language. In this case, for example, a facsimile is provided with a memory capable of storing a plurality of page image data (pixel data in page units; data as sampled or compressed / encoded) may be installed, and received page image data may be stored. The data is reduced and converted, temporarily stored in the memory, and collectively output as one page image data. In the configuration example, the page-up number 2n is set by the editing information setting device 43. However, for example, this information is included in the protocol of the local area network, and this value is set on the workstation side, for example. This may be supplied to an output device such as a print server according to the protocol. The same applies to the case of applying to a facsimile. It is also possible that the parameter relating to this page number is included in the communication protocol so that this page number can be set on the sending side of the facsimile.

Finally, an embodiment in which the above configuration example is applied to a pixel data processing device such as a facsimile will be described.
In this embodiment, as described above, for example, a memory capable of storing a plurality of page image data (pixel data in page units; data as sampled or compression-encoded) in a facsimile. Is installed, the received pixel data in page units is reduced and converted and temporarily stored in a memory, and these are collectively output as pixel data in one page unit. The page-up number 2n may be set by the edit information setting device 43 in the same manner as in the previous configuration example, or this information may be included in the protocol of the local area network, for example, on the workstation side. This value is set,
This may be supplied to an output device such as a print server according to the protocol. The same applies to the case of applying to a facsimile. It is also possible that the parameter relating to this page number is included in the communication protocol so that this page number can be set on the sending side of the facsimile. The configuration is basically the same as that of the above-described configuration except that pixel data is used, and the overall configuration is also the same as that of FIG. 1, and detailed description will not be repeated.

Since the scale conversion, the origin movement, and the rotation of the pixel data are performed in the same manner as described in the above configuration example, detailed description will be omitted. Note that such conversion of pixel data is well known, and also regarding this, "Page Description Language for Interpress Electronic Publishing" (published by Maruzen Co., Ltd., 1989), "Page Description Language POS".
"TSCRIPT Reference Manual" (published by ASCII Corporation, 1988). Regarding the conversion of pixel data, the former pp. 236-247,
The latter pp. 85-89 and the like have detailed description.

[0040]

As described above, according to the present invention,
It is possible to convert pixel data for each page of a facsimile or the like from a plurality of pages into pixel data for one sheet or a smaller number of pages.

[Brief description of drawings]

FIG. 1 is a block diagram showing a configuration example of a page image information processing device which is a premise of the present invention.

FIG. 2 is a block diagram showing the configuration of the entire system including a configuration example of the present invention.

FIG. 3 is a flowchart showing a main routine of a configuration example of the present invention.

FIG. 4 is a flowchart showing details of S4 in the flowchart of FIG.

FIG. 5 is a diagram showing a process of converting original 8-page page image information into 1-page page image information.

FIG. 6 is a flowchart showing details of S13 of the flowchart of FIG.

FIG. 7 is an exemplary data diagram showing an example of original page image information.

8 is an exemplary data diagram showing a state in which the page image information of each two pages in FIG. 7 is converted into a new one page.

9 is an exemplary data diagram showing a state in which the page image information of each two pages in FIG. 8 is converted into a new one page.

10 is an exemplary data diagram showing a state in which the page image information of each two pages in FIG. 9 is converted into a new one page.

11 is a diagram showing the transition of the contents of the stack when the token D1A of FIG. 7 etc. is interpreted and executed.

FIG. 12 is a diagram showing an example of an origin movement matrix.

FIG. 13 is a diagram showing a state of origin movement.

FIG. 14 is a diagram showing the transition of the contents of the stack when the token D3 of FIG. 7 etc. is interpreted and executed.

FIG. 15 is a diagram showing an example of a scale conversion matrix.

FIG. 16 is a diagram showing a state of scale conversion.

FIG. 17 is a diagram showing the transition of the contents of the stack when the token D2 of FIG. 7 etc. is interpreted and executed.

FIG. 18 is a diagram showing an example of a rotation matrix.

FIG. 19 is a diagram showing a state of rotation.

FIG. 20 is a diagram showing the transition of the contents of the stack when the token D1B of FIG. 7 etc. is interpreted and executed.

FIG. 21 is a diagram showing an example of an origin movement matrix.

FIG. 22 is a diagram showing a state of origin movement.

23 is a diagram showing the transition of the contents of the stack when the tokens D4A and D4B of FIG. 7 and the like are interpreted and executed.

FIG. 24 is a first configuration example and a second portrait configuration.
The diagram which shows in comparison the process performed when interpreting and executing the Interpress master each converted by the structural example.

FIG. 25 is a diagram showing a page image processing procedure by conversion (1).

FIG. 26 is a diagram showing a page image processing procedure by conversion (2).

FIG. 27 is a diagram showing, in contrast, a process performed when interpreting and executing the Interpress master converted by the first configuration example and the second configuration example with respect to the landscape.

FIG. 28 is a diagram showing an example of an interpress master converted by the second configuration example.

FIG. 29 is a diagram showing the relationship between the number of conversions and the content of conversions for each orientation.

FIG. 30 is a flowchart showing the procedure of recursive processing in the second configuration example.

[Explanation of symbols]

IPM page image information 421 page image information processing device D1A, D1B First information D2 second information D3 Third information 4211 page-up processing means 4212 Recursive processing means

Claims (8)

(57) [Claims] 1. Information for converting page-unit pixel data for a plurality of pages into page-unit pixel data for one page is added to the page-unit pixel data for the plurality of pages, and the information for the plurality of pages is added. 2. A pixel data processing device, comprising: a page-up processing means for converting the pixel data in page units into the pixel data in page units for one page. 2. Information for converting pixel data of page units of a plurality of pages into pixel data of a page unit of a predetermined page less than the plurality of pages is converted into pixel data of page units of the plurality of pages. And a page-up processing means for converting the page-unit pixel data of the plurality of pages into the page-unit pixel data of the predetermined page, and the converted page-unit pixel data recursive to the page-up processing means. A pixel data processing apparatus, comprising: a recursive processing unit that supplies and recursively supplies the page-wise pixel data for a plurality of pages that have been recursively supplied. 3. A method for moving the origin of pixel data in page units to convert pixel data in page units for a plurality of pages into pixel data in page units for a predetermined number of pages smaller than the plurality of pages. 1 information, 2nd information for rotating the pixel data of the page unit, and 3rd information for scaling the pixel data of the page unit, A pixel data processing apparatus comprising: a page-up processing unit that is added to data and converts the page-unit pixel data for the plurality of pages into the page-unit pixel data for the predetermined page. 4. A method for moving the origin of pixel data in page units to convert pixel data in page units for a plurality of pages into pixel data in page units for a predetermined number of pages smaller than the plurality of pages. 1 information, 2nd information for rotating the pixel data of the page unit, and 3rd information for scaling the pixel data of the page unit, Page-up processing means for adding to the data and converting the page-unit pixel data for the plurality of pages into page-unit pixel data for the predetermined page; and the converted page-unit pixel data for the page-up processing means. And a recursive processing means for further converting the recursively supplied pixel data of page units for a plurality of pages into pixel data of page units for a predetermined page. Pixel data processing apparatus characterized by a. 5. A pixel data processing method in a pixel data processing device, wherein information for converting pixel data of a plurality of pages in page units into pixel data of a page in a unit of one page is included. A pixel data processing method comprising adding to page-unit pixel data and converting the page-unit pixel data for a plurality of pages into the page-unit page-unit pixel data. 6. A pixel data processing method in a pixel data processing device, comprising: information for converting page-by-page pixel data for a plurality of pages into page-by-page pixel data for a predetermined number of pages less than the plurality of pages. The pixel data of the page unit of the plurality of pages, the pixel data of the page unit of the plurality of pages is converted into the pixel data of the page unit of the predetermined page, the pixel of the page unit for the plurality of pages A pixel data processing method comprising recursively repeating a page-up process for converting data into pixel data in page units for the predetermined page. 7. A pixel data processing method in a pixel data processing device, comprising: converting pixel data of a plurality of pages in page units into page data of a predetermined number of pages smaller than the plurality of pages. First information for moving the origin of the pixel data of the page unit, second information for rotating the pixel data of the page unit, and third information for scaling the pixel data of the page unit. And pixel information for each of the plurality of pages, and the pixel data for each of the plurality of pages is converted into the pixel data for each of the predetermined pages. Method. 8. A pixel data processing method in a pixel data processing device, wherein in order to convert pixel data of a plurality of pages in a page unit into page data of a predetermined page less than the plurality of pages, First information for moving the origin of the pixel data of the page unit, second information for rotating the pixel data of the page unit, and third information for scaling the pixel data of the page unit. Information, and add to the pixel data of the page unit of the plurality of pages, the pixel data of the page unit of the plurality of pages is converted into the pixel data of the page unit of the predetermined page, the page unit of the plurality of pages A method for processing pixel data, characterized in that the page-up processing for converting the pixel data of (1) into pixel data in page units for the predetermined page is recursively repeated.