Patent US4675831A successfully refreshed from Google Patents.
US4675831A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Method of processing gradation information
Assignee: Ricoh Co Ltd
•
Filing: 1984-08-31
•
Granted: 1987-06-23
•
Expires: 2004-08-31
Abstract
Abstract A mother matrix pattern MMP is divided into (m×n) child matrix patterns CMP 11 -CMP mn comprising m patterns in the main scanning direction and n patterns in the sub-scanning direction, where the first foot-character denotes the position of each child matrix pattern within the mother matrix pattern in the main scanning direction and the latter foot-character denotes the position thereof in the sub-scanning direction, the mother matrix pattern being expressed by; ##EQU1## and image information corresponding to one mother matrix pattern is obtained with (m×n) gradation data ##EQU2## comprising ICD 11 -ICD mn similarly, information of the child matrix pattern CMP ij in the mother matrix pattern specified with the gradation data ICD ij is obtained as information in the form of bit distribution for the gradation data ICD ij . In other words, the position of each of the child matrix patterns for obtaining image information in accordance with both array of one mother matrix pattern and (m×n) gradation data is located in a position corresponding to the position of the gradation data within the mother matrix pattern. The reproduced image is thus formed in such a fashion that (m×n) child matrix patterns having information of the respective mother matrix patterns in accordance with the respective gradation data and locating in predetermined positions to constitute one mother matrix pattern are arrayed in an area of the reproduced image corresponding to one mother matrix pattern.
Inventors
- 👤 Masahiro Ito
- 👤 Noboru Murayama
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-10-27 20:04
CPC Classifications
H; H04; H04N; H04N1/00; H04N1/40; H04N1/405; H04N1/4055; H04N1/4058
Claims Analysis
Total Claims: 13
Claim 1
Independent Claim
118 words
A method of processing gradation image information for producing printed forms, said method comprising the steps of: scanning individual picture elements of a picture original; determining the gradation values of each picture element; retrieving a predetermined mother matrix pattern from a storage memory, said mother matrix pattern having the same gradation value as the determined gradation value of the original picture element; forming a plurality of sub-matrix patterns made up of displayable patterns, each of said sub-matrix patterns forming part of said mother matrix pattern; substituting the sub-matrix patterns for parts of said mother matrix pattern in accordance with a predetermined set of rules; and reproducing said sub-matrix patterns in eye-readable form to duplicate said individual picture elements.
Claim 2
Independent Claim
118 words
A method of processing gradation image information for producing printed forms, said method comprising the steps of: scanning individual picture elements of a picture original; determining the gradation values of each picture element; retrieving a predetermined mother matrix pattern from a storage memory, said mother matrix pattern having the same gradation value as the determined gradation value of the original picture element; forming a plurality of sub-matrix patterns made up of displayable patterns, each of said sub-matrix patterns forming part of said mother matrix pattern; substituting the sub-matrix patterns for parts of said mother matrix pattern in accordance with a predetermined set of rules; and reproducing said sub-matrix patterns in eye-readable form to duplicate said individual picture elements.
Claim 3
Independent Claim
145 words
A method for reproducing picture forms using predetermined patterns corresponding to gradation values, said method comprising the steps of: determining the gradation value of a picture element of a picture original; selecting from a storage memory for each one of the gradation values of the picture elements of the picture original, a predetermined mother matrix pattern having at least the same gradation value corresponding to the gradation value of an original picture element; forming, for each one of said gradation values, a sub-matrix pattern which is a part of the mother matrix pattern; substituting the part of said mother matrix pattern with said sub-matrix pattern in accordance with a predetermined set of rules; and reproducing in eye-readable form the formed sub-matrix patterns in a combination in which each one of the sub-matrix patterns corresponds to each one of said picture elements of the picture original.
Claim 4
Independent Claim
145 words
A method for reproducing picture forms using predetermined patterns corresponding to gradation values, said method comprising the steps of: determining the gradation value of a picture element of a picture original; selecting from a storage memory for each one of the gradation values of the picture elements of the picture original, a predetermined mother matrix pattern having at least the same gradation value corresponding to the gradation value of an original picture element; forming, for each one of said gradation values, a sub-matrix pattern which is a part of the mother matrix pattern; substituting the part of said mother matrix pattern with said sub-matrix pattern in accordance with a predetermined set of rules; and reproducing in eye-readable form the formed sub-matrix patterns in a combination in which each one of the sub-matrix patterns corresponds to each one of said picture elements of the picture original.
Claim 5
Dependent Claim
146 words
A method of processing gradation information as claimed in claim 2, wherein, assuming that a mother matrix pattern MMP is divided into (m×n) child matrix patterns CMP 11 -CMP mn comprising m patterns in the main scanning direction and n patterns in the sub-scanning direction, where the first foot-character denotes the position of each child matrix pattern within the mother matrix pattern in the main scanning direction and the latter foot-character denotes the position thereof in the sub-scanning direction, said mother matrix pattern being expressed by: ##EQU7## and image information corresponding to one mother matrix pattern is obtained with (m×n) gradation data ##EQU8## comprising ICD 11 -ICD mn similarly, information of said child matrix pattern CMP ij in the mother matrix pattern specified with said gradation data ICD ij is obtained as information in the form of bit distribution for said gradation data ICD ij .
Claim 6
Dependent Claim
73 words
A method of processing gradation information as claimed in claim 3, wherein information of said child matrix pattern CMP ij in the mother matrix pattern specified with said gradation data ICD ij is obtained through logical processing of both information of said mother matrix pattern and mask data which has extraction information in its parts corresponding to said child matrix pattern CMP ij and has non-extraction information in its parts not corresponding thereto.
Claim 7
Dependent Claim
21 words
A method of processing gradation information as claimed in claim 4, wherein said logical processing is performed on a Byte-to-Byte basis.
Claim 8
Dependent Claim
112 words
A method of processing gradation information as claimed in claim 4 or 5, wherein, when the number of bits of said mother matrix pattern in the main scanning direction corresponds to a fraction of Byte and the number of bits a of said child matrix pattern in the main scanning direction also corresponds to a fraction of Byte, assuming the equation of a×b=c Byte, where b and c are both minimum integers, a bits of said child matrix pattern CMP ij in the main scanning direction is written in a c Byte memory successively b times, and the content of said memory and said mask data are then subjected to logical processing.
Claim 9
Dependent Claim
146 words
A method of processing gradation information as claimed in claim 1, wherein, assuming that a mother matrix pattern MMP is divided into (m×n) child matrix patterns CMP 11 -CMP mn comprising m patterns in the main scanning direction and n patterns in the sub-scanning direction, where the first foot-character denotes the position of each child matrix pattern within the mother matrix pattern in the main scanning direction and the latter foot-character denotes the position thereof in the sub-scanning direction, said mother matrix pattern being expressed by: ##EQU9## and image information corresponding to one mother matrix pattern is obtained with (m×n) gradation data ##EQU10## comprising ICD 11 -ICD mn similarly, information of said child matrix pattern CMP ij in the mother matrix pattern specified with said gradation data ICD ij is obtained as information in the form of bit distribution for said gradation data ICD ij .
Claim 10
Dependent Claim
73 words
A method of processing gradation information as claimed in claim 7, wherein information of said child matrix pattern CMP ij in the mother matrix pattern specified with said gradation data ICD ij is obtained through logical processing of both information of said mother matrix pattern and mask data which has extraction information in its parts corresponding to said child matrix pattern CMP ij and has non-extraction information in its parts not corresponding thereto.
Claim 11
Dependent Claim
21 words
A method of processing gradation information as claimed in claim 8, wherein said logical processing is performed on a Byte-to-Byte basis.
Claim 12
Dependent Claim
22 words
A method of processing gradation information as claimed in claim 8 or 9, wherein said logical processing is of logical product processing.
Claim 13
Dependent Claim
112 words
A method of processing gradation information as claimed in claim 8 or 9, wherein, when the number of bits of said mother matrix pattern in the main scanning direction corresponds to a fraction of Byte and the number of bits a of said child matrix pattern in the main scanning direction also corresponds to a fraction of Byte, assuming the equation of a×b=c Byte, where b and c are both minimum integers, a bits of said child matrix pattern CMP ij in the main scanning direction is written in a c Byte memory successively b times, and the content of said memory and said mask data are then subjected to logical processing.
References Cited (Backward Citations)
US4485397A
Cited
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 1990-06-22 | 1990-12-22 | 1991-06-23 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 1994-06-22 | 1994-12-22 | 1995-06-23 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 1998-06-22 | 1998-12-22 | 1999-06-23 | $7700.00 | Window Closed / Lapsed |