JP3280129B2 - Encoding device - Google Patents

Description

DETAILED DESCRIPTION OF THE INVENTION

[0001]

BACKGROUND OF THE INVENTION 1. Field of the Invention The present invention relates to an encoding apparatus having hierarchical encoding means.

[0002]

2. Description of the Related Art Conventionally, encoding systems such as MH, MR, and MMR have been adopted in image communication services such as image database search and communication handling images such as color facsimile, but recently, hierarchical display and A printable hierarchical transfer method and an encoding method suitable for the method are realized.

The memory management means in this type of facsimile apparatus divides the memory means into fixed-length memory units.
Managing the memory block units Tsu, stores the compressed code corresponding to a combination of the hierarchies and the stripe at the time of encoding (block collectively the plurality of scan lines) sequentially in the memory means. On the other hand, in a facsimile apparatus which independently manages a compression code corresponding to a combination of a hierarchy and a stripe, the area from the end of each compressed data to the end of a memory block is unused.

Further, the analysis of the compressed data is performed in page units, and the compressed data stored for outputting the communication result report after the transmission is composed of hierarchized compressed data including the resolution at the time of document storage. Save or save only the first page, other pages have been deleted.

[0005] In this type of facsimile machine,
When moving the display window, the image in the direction
If the data has not been expanded on the
Had been transferred to

[0006]

However, in the above conventional example, since the management of the compressed data is not managed independently for each combination of layers and stripes,
There is a disadvantage that compressed data of a combination of a specific hierarchy and a specific stripe cannot be deleted independently. Furthermore, when compressed data that has been sequentially encoded is stored at the time of image storage, it is necessary to sequentially transmit or decode the data.On the other hand, when the compressed data is stored progressively, the data must be transmitted or decoded progressively. When outputting to a display or printing device,
There was a drawback that sequential and progressive could not be selected.

[0007] In the above conventional example, the number of combinations of each layer and stripe is as follows, and there is a disadvantage that memory is wasted. <Number of layers> × <number of stripes> × (<memory block length> -1) [byte or word] In the above-described conventional example, a document that has been transmitted must be stored in order to output a communication result report. There is a disadvantage that memory is wasted.

The above conventional example Now, move the display window
The screen is switched from pressing the key to the screen requested by the user.
However, there is a disadvantage that it takes a lot of time.

SUMMARY OF THE INVENTION The present invention has been made to solve the above-mentioned problem, and it is possible to suppress waste of memory and to use any of sequential and progressive stripes at the time of transmission and image output regardless of stripe processing at the time of accumulation. An object of the present invention is to provide an encoding device which can perform processing, is easy to use, is flexible, has a large number of stored images, and is inexpensive. Further, in order to solve the above-mentioned problems, the present invention suppresses wasteful use of memory, and it is possible to always allocate a large amount of memory to services such as document storage and memory reception. It is an object of the present invention to provide an encoding device having a high encoding efficiency.

Another object of the present invention is to provide an encoding apparatus which can search and output image data of a desired resolution and image position specified by a user on a display device or a printing device at a high speed. It is an object of the present invention to provide an inexpensive encoding device that requires only a small memory buffer. Further, a further object of the present invention is that, when moving in the sub-scanning direction, the response time of the display to the moving key of the display window becomes constant regardless of whether the stripe in the moving direction has been expanded or not,
An object of the present invention is to provide an encoding device which is easy for a user to use.

[0011]

To achieve the above object, according to the solution to ## the encoding device of the present invention hierarchically marks input image data
Encoding means for-coding, and memory management means for storing and managing hierarchically compressed data encoded by the encoding means, in units of stripes discrete memory blocks for each hierarchical, the memory management Compressed data stored in the means
Decoding means for decoding and outputting
The means is for compressing the compressed data at the desired level of the desired stripe.
When decoding and outputting the data, the desired stripe
Compressed data in the desired layer of the stripe before and after
It is characterized by decoding .

Preferably, the memory management means includes:
Compressed data corresponding to the stripe and the layer is stored.
The discrete memory blocks are linked to manage Te
Cable included . Also preferably, when transmitting the compressed data and outputting the communication result as a report with an image after transmitting the compressed data, the memory management means preferably has a higher resolution than the desired resolution of the compressed data of the second and subsequent pages and the first page. But
Break the link to the stored discrete memory block .

[0013]

[0014]

[0015]

DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENTS A preferred embodiment according to the present invention will be described below in detail with reference to the drawings. FIG. 1 is a block diagram illustrating a configuration of a facsimile apparatus according to the present embodiment. In the figure, 1-1 is a ROM, which is hierarchically encoded /
Control of decoding means, memory management means for compressed data, memory reduction means, display control means for displaying compressed data on the display panel of the operation panel, virtual display window area management control means, stripe buffer management means, sequential build of compressed data It includes control means for printing on a printing device using up-up, and software and data for realizing a buffer / memory management means. 1-2 is C
It is a PU and controls the entire apparatus according to software stored in the ROM 1-1. Reference numeral 1-3 denotes a RAM, which stores data and the like handled when the CPU 1-2 executes the above control. An image memory 1-4 temporarily stores binary image data, compressed data, and the like. 1-5 is an address bus and a data bus.

Reference numeral 1-6 denotes a storage device control unit which exchanges and controls data with the storage device 1-7, and
Reference numeral -7 stores data handled by the storage device controller 1-6, binary image data, compressed data, data handled by the CPU 1-2, and the like. Reference numeral 1-8 denotes a line I / F, which exchanges and controls signals from the line and signals to the line. 1-9 is I / O
The control unit A controls data transfer to the printer unit 1-10 and control of the printer unit 1-10, data transfer from the scanner unit 1-11 and control of the scanner unit 1-11. 1
Reference numeral -12 denotes an I / O control unit B which performs data transfer and control to the operation panel 1-13 and inputs and controls a key signal from the keypad 1-14. A pixel density converter 1-15 enlarges or reduces the binary image data. Reference numeral 1-16 denotes a hierarchical encoder / decoder, which is a hierarchical encoding means and a hierarchical decoding means which are features of the present invention.

FIG. 2 is a diagram showing a management data structure in the memory management means for managing compressed data. In the figure, reference numeral 2-1 denotes a hierarchical compressed data management table group, which is composed of a plurality of hierarchical compressed data management tables 2-2, and manages compressed data of each layer corresponding to a stripe number (i). 2-3 is a compressed data storage memory, for example, 2
The compressed data is discretely stored in a K-byte boundary (hereinafter, for example, a linear memory area in units of 2 Kbytes is referred to as a compressed data block). 2-4 is a page management table, which forms a queue for each document and manages 2-5 compressed data allocation tables.

FIG. 3 is a diagram showing the configuration of the hierarchical compressed data management table 2-2 shown in FIG. As shown
The hierarchical compressed data management table 2-2 includes a forward pointer 3-1 pointing to the hierarchical compressed data management table corresponding to the stripe located next in the sub-scanning direction, and the hierarchical compressed data corresponding to the stripe located ahead in the sub-scanning direction. It is composed of a backward pointer 3-2 indicating a management table, a stripe number 3-3 of a corresponding stripe, and a compressed data block management unit 3-4 corresponding to a hierarchical number.
Then, the compressed data block management unit 3-4 stores the layer number 3-5 and a data start offset indicating the start address in the compressed data storage memory 2-3 of the compressed data block that stores the compressed data corresponding to the layer and the stripe. 3-6, a compressed data size 3-7 of the compressed data corresponding to the layer and the stripe, and a pointer to the compressed data allocate table 2-5.

FIG. 4 shows the page management table 2 shown in FIG.
FIG. 4 is a diagram illustrating a configuration of −4. As shown, the page management table 2-4 is a forward pointer 4-1 pointing to a page management table for managing the next page of the facsimile document.
And 400DPI, 200D of the top layer of hierarchical coding
Closest resolution (highest resolution) 4-2 such as PI, A4, B
Page size 4-3 such as 4; encoding system 4-4 such as MMR and MR; the number of sub-scanning lines 4-5 of the page at the finest resolution; each layer of the page; Compressed data size 4-6 which is the sum of compressed data
2, a stripe width 4-7 indicating the number of sub-scanning lines per stripe at the highest resolution, a stripe number 4-8 per page, a hierarchy number 4-9, and a hierarchy compression data management table (FIG. 2). In the example shown in FIG. 5, a hierarchical compressed data management table pointer 4-10 linking 2-9)
Compressed data allocate table (in the example shown in FIG. 2, 2-
10) manages a compressed data allocate table queue header 4-11 linking the data.

FIG. 5 is a diagram showing a configuration example of the compressed data allocate table 2-5 shown in FIG. As shown in the figure, the compressed data allocation table 2-5 manages one compressed data block, and forward / backward pointers 5-1 and 5-1 for specifying the order of the compressed data block.
5-2, the number of times the block is referred to 5-3, and a compressed data block address 5-4 indicating the address of the compressed data block to be managed.

Next, the processing procedure for deleting the communication result report document will be described below with reference to the flowchart shown in FIG. First, in step S101, the process waits for the transmission of the transmission document to be completed.
In step 02, the first page of the page management table is searched (2-4 in the example shown in FIG. 2). Then, step S1
03 is the initial value “1” in the stripe number selection variable s.
Is set in step S104, referring to the number of stripes 4-8 in the page management table 2-4, to check whether s has searched for the last stripe. Here, if NO, the process proceeds to step S105, and the resolution (corresponding to each layer number) selection variable n is set to the maximum resolution 4-2 which is an initial value. Next, in step S106, n is compared with a preset output resolution of the communication result report. If n is high resolution, the process proceeds to step S107, and the hierarchical compressed data management table corresponding to the stripe s (for example, FIG. 2-2) A compressed data allocate table pointer indicated by a compressed data allocate table pointer (3-8 shown in FIG. 3) of a compressed data block management unit (for example, 3-4 shown in FIG. 3) corresponding to the resolution n. (For example, as shown in FIG.
The reference number (5-3 shown in FIG. 5) of 6) is decremented (−1), and if it is larger than “0”, step S110 is performed.
Move to

On the other hand, if the result is "0", the flow proceeds to step S108, where the compressed data allocate table 2-6 is dequeued from the compressed data allocate table queue and returned to the empty queue. Cade table pointer (in this example, FIG. 3
Is null-cleared. Next, step S1
In step 10, the resolution of n is set to １ ／, and the process returns to step S106.

If n is equal to or smaller than the output resolution of the communication result report in step S106, the process proceeds to step S111, s is incremented (+1), the process returns to step S104, and the above-described process is repeated. And
If s has become larger than the last stripe number in step S104, the process proceeds to step S112, and the resolution of the communication result report is set to the densest resolution 4-2 of the page management table 2-4. Next, in step S113, it is checked whether or not the page management table of the next page exists. If the page management table does not exist, the process is terminated. If there is, the process proceeds to step S114 to allocate the compressed data allocated to the page management table. Return all tables to the empty queue. Then, in step S115,
The entire hierarchical compressed data management table linked to the page management table is returned to the empty queue, and the page management table is returned to the empty queue in step S116, and the process returns to step S113.

FIGS. 7 and 8 show that the above-mentioned memory management means can randomly store or refer to each desired hierarchy of a desired stripe. As a specific example, the compression at the time of sequential encoding and the time of progressive encoding are shown. FIG. 3 is a diagram illustrating a memory image of data. However, compressed data is stored
Each memory block that is discrete blocks, the order is not in the order of memory address is obtained by arranging the order in which the memory blocks are linked. In the figure, a of the compressed data (a, b) indicates a stripe number, and b indicates a hierarchy (resolution) number.

FIG. 9 shows a hierarchical encoder / decoder 1-16.
It is a figure for explaining the concept of. First, when performing hierarchical coding, if the resolution desired by the user is 400 DPI, the raw image data 9 read by the scanner 9-1 is read.
-2 is converted into raw image data 9-4 having a half resolution by a density converter (reduction) 9-3. Then, the raw image data 9-2 and 9-4 are converted into code data 9 by the encoder 9-5.
These conversion processes are repeated up to raw image data 9-7 of 12.5 DPI, and the raw image data 9-7 is independently encoded into encoded data 9-13 by the encoder 9-5.

On the other hand, when performing hierarchical decoding, first, code data 9-13 having the lowest resolution is decoded by a decoder 9-22 and converted into raw image data 9-23, which is converted into a density converter (enlargement). 9) The image may be enlarged to a desired resolution in 9-24 and output to the display device 9-20 or the printer 9-21. Next, the code data 9-12 and the image data 9
-23 is applied to a decoder 9-22, and converted into the next higher resolution image data 9-25, which is converted into a density converter (enlarged) 9
-24, the display is enlarged to a desired resolution, and the display device 9-
20 or the printer 9-21. Hereinafter, similarly, these conversion processes are repeated up to the highest resolution. FIG. 10 is a diagram showing a stripe development image at the start of displaying code data when the number of lines in the vertical direction of the display window (display panel) is equal to or less than the number of lines per stripe of the resolution to be displayed.

In FIG. 1, reference numeral 10-1 denotes one page of binary image data. Reference numeral 10-2 denotes a display stripe developing buffer, from which stripes (i-1) to (i + 1) are decoded and developed. Other stripes remain coded data. Reference numeral 10-3 denotes a virtual display window, which is used to determine whether or not to perform stripe decoding when the display window is moved. 10-
Reference numeral 4 denotes a display window on which binary image data in this area is displayed.

Buf (i) is the buffer ID of the display buffer in stripe units (i: 0 to the number of acquired buffers minus 1).
), DH is the width of the display window (number of dots), DV is the height of the display window (number of lines), and SV (r) is the resolution (r).
, The number of sub-scanning lines per stripe, SH (r) is the number of pixels in the main scanning line at resolution (r), and IV (r) is the resolution (r).
, The number of sub-scanning lines for one page of binary image data, D
Voff is the display start position of the binary image data of the display window in the sub-scanning direction, DHoff is the display start position of the binary image data of the display window in the main scanning direction, and NVoff is the (-) of the sub-scanning direction at the resolution (r). Number of buffer lines, MV to suppress unnecessary stripe decoding in the case of + / (-) direction alternate instruction
Is the unit of movement in the sub-scanning direction (the number of lines), MH is the unit of movement (the number of dots) in the main scanning direction, and CVoff (r) is the offset of the number of stripe-switching sub-scanning lines at the resolution (r).

When the display window moves in the (+) direction of the sub-scan, the last number of lines of the display window,
In the case of the (-) direction, the distance from the top line of the display window to the position of the stripe boundary line in the moving direction is CVo.
When ff (r) is exceeded, encoding of stripes not present in the display buffer in that direction is started. The value of CVoff (r) is
At the resolution (r), (decoding processing time for one stripe)> (display processing time per window moving unit) × x, (xx × (number of window moving unit lines)) [line].

(A) to (c) of FIG. 11 correspond to FIG.
FIG. 10 is a diagram showing an image developed in the display stripe developing buffer 10-2 when the display window 10-4 is moved in the sub-scanning direction (downward) from the state shown in FIG.
In FIG. 11A, the virtual display window 10
When the lower end of -3 does not reach the lower end of the stripe (i + 1) ((b) shown in FIG. 11), the contents of the stripe developing buffer 10-2 are unchanged, but the lower end of the virtual display window 10-3 is the stripe. When reaching the lower end of (i + 1) ((c) shown in FIG. 11), the stripe (i +
The code data of 2) is decoded and stored in the display stripe expansion buffer 10-2.

FIG. 12 shows a display window (display panel).
FIG. 10 is a diagram showing a stripe development image at the start of code data display when the number of lines in the vertical direction exceeds the number of lines per stripe of the resolution to be displayed. As shown in the figure, the display stripe development buffer 12-1 stores, for example, each image data obtained by decoding the code data of the stripe (i) to the stripe (i + 4).

(A) to (c) of FIG.
13 is a diagram showing an image developed in the display stripe developing buffer 12-1 when the display window 10-4 is moved in the sub-scanning direction (upward) from the state shown in FIG.
In FIG. 13A, the virtual display window 10
-3 exceeds the stripe (i) and extends over the stripe (i).
Upon reaching the lower end of (-1) (FIG. 13 (b)), the contents of the lower end of the display stripe developing buffer 12-1 are switched to the image data of the stripe (i-1), and further moved to virtual display. When the upper end of the window 10-3 reaches the lower end of the stripe (i-2) beyond the stripe (i-1) ((c) shown in FIG. 13), the image data is switched to the stripe (i-2) image data.

FIG. 14 shows an operation panel 1-13.
FIG. 3 is a diagram showing the configuration of FIG. In the figure, a display panel 14-1 displays a message and image data. 1
Reference numerals 4-2 to 14-5 denote up, down, left, and right arrow keys, which indicate the respective moving directions with respect to the image data displayed on the display panel 14-1. Reference numeral 14-6 denotes a memory display key, which instructs a user to refer to desired image data. A layer number key 14-7 designates the number of layers to be coded when reading and coding an image. 14-8
A resolution up key (up) is used to increase the resolution of the image data being displayed when the image data is displayed on the display panel 14-1. 14-9 is a stop key.

Next, the operation of the memory display function in this embodiment will be described below with reference to the flowcharts shown in FIGS. In step S201, when a key on the operation panel 1-13 is pressed, the flow advances to step S202 to check whether the key is the memory display key 14-6. Here, the memory display key 14
If it is not -6, the flow advances to step S203 to execute a process corresponding to the input key. If it is the memory display key 14-6, the flow advances to step S204 to execute a display start process described later in detail.

Thereafter, in step S205, the process waits until a key is pressed.
In step 06, it is checked whether the key is the resolution up key 14-8. If “YES” here, the process proceeds to a step S207 to execute a resolution up process described later in detail.
If it is O, the process proceeds to step S208, and the arrow key 14-
It is checked whether 2, 14-3, 14-4, 14-5. Here, if the determination is YES, the process proceeds to step S209, and a display window moving process described in detail below is executed. If the determination is NO, the process proceeds to step S210 and the stop key 14-9.
Check if. Here, if YES, step S2
Then, the process proceeds to step S11, where an end process for clearing the display screen, switching to the standby screen and the like is executed, and the process exits from the memory display process.

FIG. 16 is a flowchart showing the display start process and the resolution up process of FIG. First, in step S301, a document to be displayed is selected. When the selection is completed, the process proceeds to step S302, and the page to be displayed is selected. When the selection is completed, the process proceeds to step S303, and the minimum resolution of the hierarchical coding is set in the variable r. . In step S304, the display stripe development buffer management table 19-1 is initialized. In step S305, variables DVoff and DHoff in the sub-scanning direction and the main scanning direction of the position of the display window with respect to the image data are initialized. Next, in step S306, the number of lines obtained by adding the upper and lower portions of the stripe switching sub-scanning offset line number (CVoff (r)) to the number of lines (DV) of the display window, that is, twice, is added to the number of lines per stripe ( SV (r))
The quotient and remainder divided by are set as variables M (r) and R (r), respectively. Then, in step S307, SV (r)-
Check if R (r) is equal to or greater than the number of buffer lines (NVoff),
If it is ES, the process proceeds to step S308, where "0" is set to a variable B (r) of the number of additional buffers. Otherwise, the process proceeds to step S309 to set "1".

Next, at step S310, V (r) × (M
(r) + 2 + B (r)) A buffer block is acquired by tracing the free buffer management block queue header 19-3 to obtain a display stripe expansion buffer for the line, and the display stripe expansion buffer management block 20-1 is obtained.
Is initialized. In step S311, the number of sub-scanning lines for one page of desired image data (IV (r))
Is less than or equal to SV (r) × (M (r) + 2 + B (r)). If YES, the flow advances to step S312 to decode all the stripes and store them in the display stripe expansion buffer. However, if not, the flow advances to step S313 to decode the stripe including the virtual display window area and store it in the display stripe expansion buffer. next,
In step S314, the image data in the display window area is cut out from the display stripe development buffer, transferred to the display panel, and displayed, and the process ends.

The resolution up processing is performed in step S315.
, The resolution variable (r) is compared with the densest (high) resolution 4-2 of the page management table 2-4 of the desired image data, and if they match, the process proceeds to step S316, and higher resolution display cannot be performed. Is displayed on the display panel, and the process ends. However, if they do not match, step S3
In step S318, SV (r), SH (r), IV (r), and CVoff are set to the next higher resolution.
Each variable of (r), DVoff, and DHoff is doubled, and the process proceeds to the above-described step S306.

FIG. 17 is a flowchart showing the display window moving process of FIG. First, step S40
In step S402, it is checked whether the input key is a left arrow or a right arrow.
3, the process proceeds to S404, and a leftward movement process described in detail below;
Alternatively, the right method movement processing is executed. If both are NO, the process proceeds to step S405, and it is checked whether the arrow is up or not.
If S, the process advances to step S406 to check whether the variable DVoff is equal to or less than "0". If "YES" here, the process proceeds to a step S407 to clear DVoff to "0". In a step S408, it is displayed on the display panel that no further movement is possible at the upper and lower ends of the display position image, and the process is terminated.

On the other hand, in step S406 described above, the variable DVo
If ff exceeds "0", the flow advances to step S409 to subtract the number of lines in the sub-scanning movement direction unit (MV) from DVoff and set it to DVoff. Then, the next step S41
If it is 0, it is checked whether DVoff is equal to or less than "0". If YES, the process proceeds to step S411, and DVoff is cleared to "0". Otherwise, the process skips to step S412. Step S
At 412, it is checked whether DVoff-CVoff (r) is equal to or less than "0". If YES, this process ends. Otherwise, the process proceeds to step S413, and the variable M (r) is set to (DVoff-CVoff (R)).
(r)) Set mod SV (r).

Next, in step S418, the buffer I
D is M (r) rem [number of acquired buffers] The decoded stripe numbers 20-7 and M of the display stripe development buffer
(r), and if they match, the process skips to step S420. If they do not match, the process proceeds to step S419 to encode the stripe of the stripe number M (r) and store the image data in the buffer. Then, step S420
Then, the image data in the display window area is cut out from the display buffer, transferred to the display panel, displayed, and the processing ends.

If the input key is the down arrow in step S405, the flow advances to step S414, where (DVoff + D
It is checked whether (V + 1) is equal to or greater than IV (r). If YES, the process proceeds to step S408 to perform the above-described processing. If NO, the process proceeds to step S415, where MV is added to DVoff,
In the next step S416, (DVoff + DV + CVoff (r) +
Check if 1) is equal to or greater than IV (r). Here, if YES, the process shifts to step S420; if NO, step S4
In step 17, the variable M (r) is assigned a stripe number (DVoff + Dv + C).
Voff (r)) mod SV (R) is set, and step S
The process proceeds to 418.

FIG. 18 is a flowchart showing a leftward movement process and a rightward movement process. First, in the case of the leftward movement process, it is checked in step S501 whether the variable DHoff is "0" or less. Here, if YES, step S502
Then, DHoff is cleared to "0", a message that the display position cannot be moved further at both ends is displayed on the display panel in step S503, and the process is terminated.

On the other hand, in step S501, the variable DHo
If ff exceeds "0", the flow advances to step S504 to subtract the number of lines in the sub-scanning movement direction unit (MH) from DHoff and set it to DHoff. Then, the next step S50
In step 5, it is checked whether DHoff is less than "0". If YES, the process proceeds to step S506, and DHoff is cleared to "0". Otherwise, the process skips to step S507. In this step S507, the image data in the display window area is cut out from the display buffer, transferred to the display panel, displayed, and the processing is terminated.

Next, in the case of rightward movement processing, step S
At 508, it is checked whether (DHoff + DH + 1) is equal to or greater than SH (r). If YES, the process proceeds to step S503, and NO
If so, the process advances to step S507 to perform the above-described processing. FIG. 19 is a diagram showing the format of the display stripe expansion buffer management table. FIG. 20 is a diagram showing a format of a display stripe expansion buffer management block.

According to the embodiment described above, compressed data can be randomly stored for each desired layer of a desired stripe, and compressed data of a desired layer of a desired stripe can be independently referred to or deleted. A memory management means for minimizing an unused area between adjacent compressed data on the memory; a deletion of two pages of compressed data and subsequent pages; and a higher resolution than a desired resolution of the first page of compressed data. By providing means for deleting compressed data, the following effects can be obtained.

1) The use efficiency of the memory is improved. 2) Both sequential and progressive stripe processing can be performed at the time of transmission or image output, which makes it easier to use and more flexible. 3) The cost can be reduced because the amount of mounted memory can be reduced. A display panel for displaying the contents of the compressed data;
A memory display key for displaying the data, an arrow key for moving within the data on a display panel screen (display window), a resolution UP key for instructing an increase in the resolution of the data, and 1 Rather than having a page buffer memory for storing binary image data obtained by decoding compressed data for a page, a stripe expansion buffer memory is provided to manage empty / in use of stripe units and to control the buffer. Means for determining the buffer memory size to keep the size to the minimum necessary, means for managing the buffer memory, and display for determining whether or not to develop a stripe corresponding to the position in the sub-scanning direction in the stripe development buffer memory. By providing virtual display window area means wider in the sub-scanning direction than the window area, Such effects can be obtained.

1) Since the retrieval and output of image data at the desired resolution and image position specified by the user on the display device or the printing device are performed at high speed, the response time of the display to the moving key of the display window becomes constant, and the user can use the device. It will be easier. 2) A small memory buffer for image conversion is required, and the memory efficiency is high and the cost is low.

The present invention may be applied to a system constituted by a plurality of devices or to an apparatus constituted by a single device. Needless to say, the present invention can be applied to a case where the present invention is achieved by supplying a program to a system or an apparatus.

[0050]

As described above, according to the present invention,
It is possible to suppress unnecessary waste of memory and perform high-speed sequential or progressive stripe processing at the time of transmission or image output regardless of the stripe processing at the time of accumulation.

[Brief description of the drawings]

FIG. 1 is a block diagram illustrating a configuration of a facsimile apparatus according to an embodiment.

FIG. 2 is a diagram showing a configuration of a memory management table for managing compressed data.

FIG. 3 is a diagram showing a format of a hierarchical compressed data management table.

FIG. 4 is a diagram showing a format of a page management table.

FIG. 5 is a diagram showing a format of a compressed data allocate table.

FIG. 6 is a flowchart illustrating a process of deleting a communication result report document.

FIG. 7 is a diagram showing a memory image of compressed data at the time of sequential encoding.

FIG. 8 is a diagram showing a memory image of compressed data at the time of progressive encoding.

FIG. 9 is a diagram showing the concept of a hierarchical encoding / decoding means.

FIG. 10 is a diagram showing a striped image at the start of code data display when the number of lines in the vertical direction of the display window is equal to or less than the number of lines per stripe of the resolution to be displayed.

11 is a diagram showing a stripe development image when the display window is moved in the sub-scanning direction (downward) from the state of FIG.

FIG. 12 is a diagram showing a stripe development image at the start of code data display when the number of lines in the vertical direction of the display window exceeds the number of lines per stripe of the resolution to be displayed.

FIG. 13 is a view showing a stripe development image when the display window is moved in the sub-scanning direction (upward) from the state of FIG.

FIG. 14 is a diagram showing a configuration of an operation panel.

FIG. 15 is a flowchart showing an operation of a memory display function.

16 is a flowchart showing a display start process and a resolution UP process of FIG.

17 is a flowchart showing a display window moving process of FIG.

FIG. 18 is a flowchart showing a leftward movement process and a rightward movement process of FIG. 18;

FIG. 19 is a diagram showing a format of a display stripe expansion buffer management table.

FIG. 20 is a diagram showing a format of a display stripe expansion buffer management block.

Claims (3)

(57) [Claims] 1. A and marks <br/> Goka means for hierarchically coding an input image data, discrete hierarchically compressed data encoded by the encoding means, in each layer the stripes unit Memory block
And memory management means for storing and managing the click, at the prescribed stripe stored in the memory management unit
Decoding means for decoding compressed data in a fixed layer;
And the decoding means includes a compressed data in a predetermined stripe.
When decoding and outputting the data,
An encoding device, which also decodes compressed data in preceding and succeeding stripes . Wherein said memory management unit, the stripe
And a discrete method that stores compressed data corresponding to layers.
The encoding device according to claim 1 , further comprising a table for linking and managing memory blocks . 3. After transmitting the compressed data, the memory management means, when outputting the communication result as a report with an image, compresses the compressed data of a higher resolution than a desired resolution of the compressed data of the second and subsequent pages and the first page. Discrete data stored
2. The encoding apparatus according to claim 1 , wherein the link to the memory block is released .