JPS60118946A - Write and read method of picture processing memory - Google Patents

Abstract

PURPOSE:To read easily the area of a picture plane to be read by forming a storage position on a matrix to a picture processing memory and writing either column or row to picture planes individually while they are corresponded thereto. CONSTITUTION:The screen of a display device is square and each coordinate of corners F1-F4 is scanned laterally from the corner F1 in unidirection in the order of lines l1, l2... and the entire picture plane is scanned. An area AR desired to be read in said plane is square or rectangular and has coordinates of corners G1-G4. The 1st-qth bits exist in the column direction 13 in a random access memory for picture data, each column corresponds individually to each plural pattern to be displayed and a picture data at scanning in the direction 9 of the pattern corresponding to each bit location along the direction 13 is written and stored in the row direction 14. The area AR decides one bit (t) of the column corresponding to the pattern to be read and reads data based on coordinates a-d and (n).

Description

DETAILED DESCRIPTION OF THE INVENTION The present invention relates to a method for embedding and directly outputting one-nokizuka data into an image processing memory.

：jfJ1 is a block diagram for explaining an inventive example and optical technology. The processing circuit 1 realized by a microcomputer etc. follows the program stored in the read-only memory 2! I/IfIl: No whole village, random access memory 3
, 4 are used. LL! The data from the second data transfer data collection 5 is extracted one screen at a time. IU 14
1 data sending means 5. Image data from the 70-bit disc 6 or the mechanical drum 7 is stored in the random access memory 3. The storage capacity of the random access memory 3 is calculated by the processing circuit 1. The calculation result is stored in another random access memory 4 and visually displayed by display means 8. Display means 8
is, for example, a cathode ray tube.

FIG. 2 shows the first view of the display means 8. This curve is a right angle or a rectangle, and the valley edge 61≦Fl.

Mago Taniza of F2, F3, F4 is (010)l(nTO
), (0, m), (n, m). When displaying um, scan from the corner point F1 in the first direction horizontally in Figure 2 as shown by the line 21, and after reaching the circumferential end F2 and completing the travel in the first direction, the bullet Shifted in the second direction, which is vertical in Figure 2 and perpendicular to the first direction, through line 12, and again in the %1 direction 9
Scanning is performed as shown by line 13 in FIG. By repeating this operation, the il surface area is scanned. The Utaki AR that you want to translate on this screen is square or minroku-shaped, and its peripheral edges Gl, G2 . Grit, (a+b)y(c+b)+(a+d),(c
, d).

FIG. 3 shows the storage loading of the random access memory 3. Conventionally, the store position is rewritten from the 1st bit to the qth bit in the column direction of the matrix, and from the Oth address to the Xth address in the column direction 12.
T&ed. The image data of one page for each of the 11 full-open images is stored sequentially along the column direction 11, and for example, from the 1st focus to the 4Q in the 0th nourishment position.
After the bit is stored, the 1st bit of the 1st address or 5) 56q pinto is stored, and thereafter, the data is stored in the same way in the direction of 12. The store is performed.

In order to read out the image data of the area AR included in the predetermined lIM area of FIG. 2 when using the conventional storage format shown in FIG. 3, the method shown in FIG. It is necessary for the processing circuit 1 to perform the operations shown in FIG. 4B.

Steps n1 to n2 contain the maximum coordinate 1+a n of the 10,000th 9th screen and the maximum value q of the column direction 11 of the memory, and also the coordinate value a of Suzaka AR to be read,
The letters b, c, and d are inserted in step n3. In step n4, the coordinate value is set as work, and in step n5
The value is compared with the coordinate value d. In step n6, the remainder T is calculated. In step n7, d-b+1 remainder V is calculated. Therefore, in step n8, T+d-b
+1≦q...(3) Perform the calculation. In step n9, it is determined whether 1 shift v=0 or not, and if so, the process moves to step nlO, and T-
It is determined whether the value is 0 or not. When T=0, the process moves to step nil, and the following calculation is performed: W=S+U-1 (4). In such a step nil,
When the calculation is performed, K is, for example, S21, T=0, U=3, V=O, as shown in FIG. 5 (1), and W=1+3-1=3. ...(5) becomes.

When T=0 is not determined in step nlO, step n14 is entered, and +NM- of W=S+U (6) is performed. In this way, when moving from step nlO to step n14, as shown in the fifth case (2), for example, S=1, T=5, U=3, V=O, and W=4.

When it is not V-o in step n9, V≦Q −T (7) in step n13! FIJ prayers will be held. When this seventh equation holds true, for example, S=1, T
=0, U=3, V=5, and step n14
As a result, in the case shown in FIG. 5(3), W=4.

In step n13, when the seventh equation does not hold rL, the calculation of W=S+U+1 (8) is performed, which is moved to step n15. At this time, for example, as shown in Fig. 5 (4 notes), 5KS = 1. S is replaced with J. In step n20, the waterfall J is compared with W, and if J does not exceed W, the data at the first address is read out in step n21.

In step n22, 1st shift J is equal to SK, but
If so, the process moves to step n23 and retrieves the data from (T+l) to q bits at the first address. In step n24, J is incremented by 1, and the process returns to step n20.

In step n22, if 1 direct J is not equal to direct S, in step n25 it is checked whether T=V=0 or not. The data up to the bit is extracted and the process proceeds to step n24.

If "1" = O, V = 0 does not hold in step n25, the process moves to step n26, and it is checked whether the values J and W are equal, and if so, in step n27, when (V+T) is less than or equal to q, The 1st bit of the J location~
Step n
There are 24 people. 2. In step n27, (V+T
) exceeds q, output the value from the first bit of the JJ position to the A(V+T-q) focus, and proceed to the next step n.
24 VCφru.

In step n26, if l1m J and W are not equal, the process moves to step n28.

In step n20, when it is prayed q4J that 11 ears J surpasses the next W, step n29 progresses, ■
is incremented by 1 and returns to step n5.

In step n8, when the above-mentioned formula 63 is established, the data τ at the 5ill location is continuously outputted in step n16, and in step n17, the data τ at the 45th address (T
*(T+d-b+1) bits of data are extracted from the +1) bit. Therefore, step n18 [Place, 1ll
Increment I by 1 and return to step n5.

In step n5, when the first shift I exceeds the position g% deviation d, the process moves to step n19, and the d output young crop is stopped.

According to such prior art, the line area AR of the knee plane shown in FIGS. 1 and 62 is selected from the memory shown in FIG. Therefore, it takes time to complete the process.

Motomoto's 1st major feature was the ability to read out image data in a specific range in one of the temporary self-examinations. The purpose is to provide a method.

Figure 6 is a book! FIG. 3 is a diagram illustrating the poor storage condition of the random access memory 3 in one embodiment of An. The Gronk area P'i of this embodiment is as shown in FIG. 1, and the display device d
11 represented by 8 is shown in Figure 2 as n and 2.
Therefore, the explanation will be omitted. In the store-like seat shown in FIG. 6, the store stands are distributed in a matrix. Either the column or the column (column in this example) has the 1st bit to q focus, and the valley column is the created valley that should be displayed by the clothing setting 8Vc. It corresponds to fil Lll individually. The second storage position mVcFi in the 11" box corresponding to the 6-bit position along the column direction 13 is located along the direction 14 of the column or position (in this example, the position). 2 at the time of the 10,000th and 9th gold production of
Kiren Ren data? Store the items in sequence. tj
As mentioned in 11, the -th Gekisho-gun Fl, F2. F3. F4
The 6th heron 1d(0,0) + (n*')
+ (or In) r (''rm), and the target area AR for Tonden is Kakutachibana-gun Gl.

Each coordinate of G2, G3, G4 (a, b), (c
r b), (a, d), (c, d).

To read this Suzaka AR, one of the seventh causes is the processing circuit l.
It is carried out by In the store state & shown in FIG. 6, one of the 1st to qth bits of the column 13 corresponding to the screen to be moved, for example, the tth bit, is determined. Therefore, moving from step m1 to step m2,
1 shift n, and in step m3 seat 446Fm a
, b, C, d filx. step m
In step 4, set if I, and in step m5, 1m1
It is determined whether I exceeds the calm d. If it does not exceed the calmness d, the process moves to step m6.

In step m6, [I (n
+1n+a +1) from s (I(n+1)+c+
1 Collect data up to JJ location. Thus Cm f
il AR's first mho G1 (a, b) ~
G2 The data up to (c, b) is diagonal f in the direction of Roku 14
It is read out as shown in the example below. Next, in step m7, +m I is incremented by 1, and the process moves to step m5. As a result, data in the range AR along the gyrus gyrus shifted downward in FIG. 2 by one horizontal line from the angular pharynx G1 is read out. Transferring this previous work to f, the coordinates G1
〜G4-E is read, step m5
Then, the process moves to step m8, and the first starting operation r is completed.

According to the store state shown in Figure 6, the seventh
By the simple separate work shown in the figure, it becomes Noh by putting out +IJ(,) in the ARI TANIYI of Machihiki in the - plane.

According to Honbyoshu, as shown in I-hi, the memory for processing the ID sphere has a storage position mtjβ on the matrix, and either the column switch or the roku is individually stored on the 11th surface of the temporary valley. They are opposite to each other, and in the store position placed above along the VC in either the column or the direction of the column, the eyes of the column f or Roku are opposite to one side. I stored the image data of the set meals one after another so that it becomes more and more old, so 11! The area to be read can easily be specified by changing the column or specifying the storage position of the column or the other side! 'C will make you feel better.

4. The first situation in the car during the section is shown in Figure 1, which is Kazuo h! , a block diagram for illustrating an example and explaining the prior art, FIG. 2 is a diagram showing the display means 8, third diagram is a diagram showing the storage area of the random access memory 3, FIGS. 4A and 4B. Figure 5 is a flowchart showing the previous work of the processing circuit l in the prior art, Figure 5 is a diagram showing the store part used in the optical technique, Figure 6
7 is a diagram showing the storage state of the random access memory 3 according to an embodiment of the present invention, and FIG. 7 is a flowchart illustrating the previous operation of the processing circuit 1 in the storage state trace in FIG. 6.

1... Processing circuit, 2... Read-only memory, 3゜4-Random access memory, 5...lL! ! l Hun data source, 6... Frombidesf, 7... Pregnancy drum,
8 Kawagi Jiyoku Nao, 9 Liro 1 time, 1o... 2 sides same,
13... Column force same, 14. Roku million times, AR...
-Tanabeki Printing Agent, Patent Attorney Kei Nishi, Part 1, Figure 4B, Figure 5 (1) (2) (3) (4)

Claims (1)

[Claims] 1 Asazuka was eclipsed for the 10,000th time, and after it had finished grazing in the first direction, it shifted to the second direction perpendicular to the first direction and became the 1st car.
Eat a set meal, repeat this operation, scan the entire screen [mkf, and store the memory with the store location on the matrix by 1$i'+
u L/, either column or lok is i′i
The store position 1 key, which corresponds individually to the direction of the valley 1￥1llll, and which is arranged along either the column or the other direction, has a pair 16 in the said one of the column or the direction.
I did it! Data at the time of the set meal in the first direction in ill field /l, 1li1. Next, write and read +
1! A method for loading and unloading an image processing memory, characterized by specifying and emptying a column in the one of the force 2m or the locator, and the storage position of the other of the cursor or the locator, which corresponds to the interval between the two. .