US4447882A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Method and apparatus for reducing graphic patterns
Assignee: Siemens AG
•
Filing: 1981-07-20
•
Granted: 1984-05-08
•
Expires: 2001-07-20
Abstract
Abstract A method and apparatus are disclosed for reducing graphic patterns, coded by binary characters and represented in rows and columns of a prescribed grid, by purely electronic techniques. The reduction occurs by decrement of the binary characters. First, the binary characters representing the rows and, subsequently, the binary characters representing the columns are decremented in accordance with the desired reduction ratio. In the decrement of the binary characters, it is seen that the structure of the graphic patterns is retained to as great an extent as possible.
Inventors
- 👤 Joachim Walz
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-10-25 20:26
CPC Classifications
B; B32; B32B; B32B38/00; B32B38/08; G; G06; G06T; G06T3/00; G06T3/40
Claims Analysis
Total Claims: 23
Claim 1
Independent Claim
219 words
A method for reducing graphic patterns which are represented by binary characters in rows and columns of a prescribed grid, comprising the steps of: (a) for each row, combining a plurality m of successive binary characters of a row into a first data word D1; (b) for each first data word D1, forming a second data word D2 having n binary characters, with the number n being less than the number m and the binary value distribution of the second data word DZ being as similar as possible to the binary value distribution of the first data word D1; (c) storing the second data words D2; (d) for each column represented by the stored second data words D2, forming a third data word D3 by combining a plurality k of successive binary characters; (e) for each third data word D3, forming a fourth data word D4 having l binary characters with the number l being less then the number k and the binary value distribution of the fourth data word D4 being as similar as possible to the binary value distribution of the third data word D3; (f) storing the data words D4, which now represent a reduction of the original graphic pattern in the same prescribed grid; and (g) applying the data words D4 to a utilization device.
Claim 2
Independent Claim
219 words
A method for reducing graphic patterns which are represented by binary characters in rows and columns of a prescribed grid, comprising the steps of: (a) for each row, combining a plurality m of successive binary characters of a row into a first data word D1; (b) for each first data word D1, forming a second data word D2 having n binary characters, with the number n being less than the number m and the binary value distribution of the second data word DZ being as similar as possible to the binary value distribution of the first data word D1; (c) storing the second data words D2; (d) for each column represented by the stored second data words D2, forming a third data word D3 by combining a plurality k of successive binary characters; (e) for each third data word D3, forming a fourth data word D4 having l binary characters with the number l being less then the number k and the binary value distribution of the fourth data word D4 being as similar as possible to the binary value distribution of the third data word D3; (f) storing the data words D4, which now represent a reduction of the original graphic pattern in the same prescribed grid; and (g) applying the data words D4 to a utilization device.
Claim 3
Dependent Claim
24 words
The method of claim 1, and further defined by the step of: (h) selecting the number m to be equal to the number k.
Claim 4
Dependent Claim
24 words
The method of claim 1, and further defined by the step of: (h) selecting the number n to be equal to the number l.
Claim 5
Dependent Claim
37 words
The method of claim 1, and further defined by the steps of: (h) selecting the number m to be equal to the number k; and (i) selecting the number n to be equal to the number l.
Claim 6
Dependent Claim
34 words
The method of claim 1, for reducing multicolor graphic patterns, and further comprising the step of: (h) generating fifth data words DS having binary values representing the colors to be retained in the reduction.
Claim 7
Dependent Claim
22 words
The method of claim 5, and further comprising the step of: (i) applying the fifth data words DS to a utilization device.
Claim 8
Dependent Claim
297 words
Apparatus for reducing graphic patterns which are represented in a prescribed grid of elements disposed in columns and rows said apparatus comprising: scanning means for scanning a graphic pattern row-by-row and producing binary characters representing the respective element content; a memory for storing data words; utilization means connected to said memory for utilizing the data words stored in said memory; and reduction means connected to said scanning means and said memory and operable to provide data words to said second memory representing a reduction of the graphic pattern, said reduction means comprising first means connected to said scanning means and operable to receive binary characters therefrom and form first data words D1 having m successive binary characters, second means connected between said first means and said memory, and operable to form second data words D2 of n binary characters from the first data words D1 with the number n being less than the number m and with a binary value distribution which is as similar as possible to the binary value distribution of the first data words D1 and to store the second data words D2 in said memory on a row-by-row basis, said first means connected to said memory and operable to form from successive binary values of the second data words D2, on a column-by-column basis, third data words D3 having k binary characters and to apply the same to said second means which is further operable to form from the third data words D3 fourth data words D4 each having l binary characters with the number l being less than the number k and a binary value distribution which is as similar as possible to the binary value distribution of the respective third data words D3, and to store the same in said memory.
Claim 9
Dependent Claim
297 words
Apparatus for reducing graphic patterns which are represented in a prescribed grid of elements disposed in columns and rows said apparatus comprising: scanning means for scanning a graphic pattern row-by-row and producing binary characters representing the respective element content; a memory for storing data words; utilization means connected to said memory for utilizing the data words stored in said memory; and reduction means connected to said scanning means and said memory and operable to provide data words to said second memory representing a reduction of the graphic pattern, said reduction means comprising first means connected to said scanning means and operable to receive binary characters therefrom and form first data words D1 having m successive binary characters, second means connected between said first means and said memory, and operable to form second data words D2 of n binary characters from the first data words D1 with the number n being less than the number m and with a binary value distribution which is as similar as possible to the binary value distribution of the first data words D1 and to store the second data words D2 in said memory on a row-by-row basis, said first means connected to said memory and operable to form from successive binary values of the second data words D2, on a column-by-column basis, third data words D3 having k binary characters and to apply the same to said second means which is further operable to form from the third data words D3 fourth data words D4 each having l binary characters with the number l being less than the number k and a binary value distribution which is as similar as possible to the binary value distribution of the respective third data words D3, and to store the same in said memory.
Claim 10
Dependent Claim
52 words
The apparatus of claim 7, wherein: said second means comprises read only memory means storing the second data words D2 and the fourth data words D4 and operable to emit the same in response to the receipt of the first data words D1 and the third data words D3, respectively, as addresses.
Claim 11
Dependent Claim
20 words
The apparatus of claim 7, and further comprising: a further memory connected between said scanning means and said first means.
Claim 12
Dependent Claim
36 words
The apparatus of claim 7, wherein said utilization means comprises: an output unit requiring a predetermined data format; and an output control for converting the binary characters of the fourth data words into the required format.
Claim 13
Dependent Claim
13 words
The apparatus of claim 10, wherein said output means comprising: a display unit.
Claim 14
Dependent Claim
12 words
The apparatus of claim 10, wherein said output means comprises: a memory.
Claim 15
Dependent Claim
14 words
The apparatus of claim 10, wherein said output means comprises: a floppy disk unit.
Claim 16
Independent Claim
202 words
A method for changing the size of graphic patterns which are represented by binary characters in rows and columns of a prescribed grid, comprising the steps of: (a) for each row, combining a plurality m of successive binary characters of a row into a first data word D1; (b) for each first data word D1, forming a second data word D2 having n binary characters, with the binary value distribution of the second data word D2 being as similar as possible to the binary value distribution of the first data word D1; (c) storing the second data word D2; (d) for each column represented by the stored second data words D2, forming a third data word D3 by combining a plurality k of successive binary characters; (e) for each third data word D3, forming a fourth data word D4 having l binary characters, with the binary value distribution of the fourth data word D4 being as similar as possible to the binary value distribution of the third data word D3; (f) storing the data words D4, which now represent a reduction of the original graphic pattern in the same prescribed grid; and (g) applying the data words D4 to a utilization device.
Claim 17
Independent Claim
202 words
A method for changing the size of graphic patterns which are represented by binary characters in rows and columns of a prescribed grid, comprising the steps of: (a) for each row, combining a plurality m of successive binary characters of a row into a first data word D1; (b) for each first data word D1, forming a second data word D2 having n binary characters, with the binary value distribution of the second data word D2 being as similar as possible to the binary value distribution of the first data word D1; (c) storing the second data word D2; (d) for each column represented by the stored second data words D2, forming a third data word D3 by combining a plurality k of successive binary characters; (e) for each third data word D3, forming a fourth data word D4 having l binary characters, with the binary value distribution of the fourth data word D4 being as similar as possible to the binary value distribution of the third data word D3; (f) storing the data words D4, which now represent a reduction of the original graphic pattern in the same prescribed grid; and (g) applying the data words D4 to a utilization device.
Claim 18
Independent Claim
214 words
A method for changing the size of graphic patterns which are represented by binary characters in rows and columns of a prescribed grid, comprising the steps of: (a) for each row, combining a plurality m of successive binary characters of a row into a first data word D1; (b) for each first data word D1, forming a second data word D2 having n binary characters, with the binary value distribution of the second data word D2 being as similar as possible to the binary value distribution of the first data word D1; (c) storing the second data words D2; (d) for each column represented by the stored second data words D2, forming a third data word D3 by combining a plurality k of successive binary characters including selecting the number k to be equal to the number m; (e) for each third data word D3, forming a fourth data word D4 having l binary characters, with the binary value distribution of the fourth data word D4 being as similar as possible to the binary value distribution of the third data word D3; (f) storing the data words D4, which now represent a reduction of the original graphic pattern in the same prescribed grid; and (g) applying the data words D4 to a utilization device.
Claim 19
Independent Claim
214 words
A method for changing the size of graphic patterns which are represented by binary characters in rows and columns of a prescribed grid, comprising the steps of: (a) for each row, combining a plurality m of successive binary characters of a row into a first data word D1; (b) for each first data word D1, forming a second data word D2 having n binary characters, with the binary value distribution of the second data word D2 being as similar as possible to the binary value distribution of the first data word D1; (c) storing the second data words D2; (d) for each column represented by the stored second data words D2, forming a third data word D3 by combining a plurality k of successive binary characters including selecting the number k to be equal to the number m; (e) for each third data word D3, forming a fourth data word D4 having l binary characters, with the binary value distribution of the fourth data word D4 being as similar as possible to the binary value distribution of the third data word D3; (f) storing the data words D4, which now represent a reduction of the original graphic pattern in the same prescribed grid; and (g) applying the data words D4 to a utilization device.
Claim 20
Independent Claim
225 words
A method for changing the size of graphic patterns which are represented by binary characters in rows and columns of a prescribed grid, comprising the steps of: (a) for each row, combining a plurality m of successive binary characters of a row into a first data word D1; (b) for each first data word D1, forming a second data word D2 having n binary characters, with the binary value distribution of the second data word D2 being as similar as possible to the binary value distribution of the first data word D1; (c) storing the second data words D2; (d) for each column represented by the stored second data words D2, forming a third data word D3 by combining a plurality k of successive binary characters including the number k to be equal to the number m; (e) for each third data word D3, forming a fourth data word D4 having l binary characters including selecting the number l to be equal to the number n, and the binary value distribution of the fourth data word D4 being as similar as possible to the binary value distribution of the third data word D3; (f) storing the data words D4, which now represent a reduction of the original graphic pattern in the same prescribed grid; and (g) applying the data words D4 to a utilization device.
Claim 21
Independent Claim
225 words
A method for changing the size of graphic patterns which are represented by binary characters in rows and columns of a prescribed grid, comprising the steps of: (a) for each row, combining a plurality m of successive binary characters of a row into a first data word D1; (b) for each first data word D1, forming a second data word D2 having n binary characters, with the binary value distribution of the second data word D2 being as similar as possible to the binary value distribution of the first data word D1; (c) storing the second data words D2; (d) for each column represented by the stored second data words D2, forming a third data word D3 by combining a plurality k of successive binary characters including the number k to be equal to the number m; (e) for each third data word D3, forming a fourth data word D4 having l binary characters including selecting the number l to be equal to the number n, and the binary value distribution of the fourth data word D4 being as similar as possible to the binary value distribution of the third data word D3; (f) storing the data words D4, which now represent a reduction of the original graphic pattern in the same prescribed grid; and (g) applying the data words D4 to a utilization device.
Claim 22
Dependent Claim
280 words
Apparatus for changing the size of graphic patterns which are represented in a prescribed grid of elements disposed in columns and rows, said apparatus comprising: scanning means for scanning a graphic pattern row-by-row and producing binary characters representing the respective element content; a memory for storing data words; utilization means connected to said memory for utilizing the data words stored in said memory; and reduction means connected to said scanning means and said memory and operable to provide data words to said second memory representing a reduction of the graphic pattern, said reduction means comprising first means connected to said scanning means and operable to receive binary characters therefrom and form first data words D1 having m successive binary characters, second means connected between said first means and said memory and operable to form second data words D2 of n binary characters from the first data words D1 and with a binary value distribution which is as similar as possible to the binary value distribution of the first data words D1 and to store the second data words D2 in said memory on a row-by-row basis, said first means connected to said memory and operable to form from successive binary value of the second data words D2, on a column-by-column basis, third data words D3 having k binary characters and to apply the same to said second means which is further operable to form from the third data words D3 fourth data words D4 each having l binary characters and a binary value distribution which is as similar as possible to the binary value distribution of the respective third data words D3, and to store the same in said memory.
Claim 23
Dependent Claim
280 words
Apparatus for changing the size of graphic patterns which are represented in a prescribed grid of elements disposed in columns and rows, said apparatus comprising: scanning means for scanning a graphic pattern row-by-row and producing binary characters representing the respective element content; a memory for storing data words; utilization means connected to said memory for utilizing the data words stored in said memory; and reduction means connected to said scanning means and said memory and operable to provide data words to said second memory representing a reduction of the graphic pattern, said reduction means comprising first means connected to said scanning means and operable to receive binary characters therefrom and form first data words D1 having m successive binary characters, second means connected between said first means and said memory and operable to form second data words D2 of n binary characters from the first data words D1 and with a binary value distribution which is as similar as possible to the binary value distribution of the first data words D1 and to store the second data words D2 in said memory on a row-by-row basis, said first means connected to said memory and operable to form from successive binary value of the second data words D2, on a column-by-column basis, third data words D3 having k binary characters and to apply the same to said second means which is further operable to form from the third data words D3 fourth data words D4 each having l binary characters and a binary value distribution which is as similar as possible to the binary value distribution of the respective third data words D3, and to store the same in said memory.
References Cited (Backward Citations)
US3769442A
Cited
US3967243A
Cited
US4107780A
Cited
US4153896A
Cited
US4168488A
Cited
US4181956A
Cited
US4330834A
Cited
US4366475A
Cited
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 1987-05-08 | 1987-11-07 | 1988-05-08 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 1991-05-08 | 1991-11-07 | 1992-05-08 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 1995-05-08 | 1995-11-07 | 1996-05-08 | $7700.00 | Window Closed / Lapsed |