Claims Analysis
Total Claims: 12
Claim 1
Independent Claim
94 words
A method for transmitting a halftone image using an m×n dither matrix for converting said halftone image into a binary image signal, comprising the steps of: dividing an original image to be transmitted into a mesh of regions same in shape as that of said m×n dither matrix, each of said mesh region being further subdivided into subdivisions of predetermined shape; calculating an average value of density level for each of said regions; and subjecting said average values to a predetermined coding scheme to have said average values converted into coded data for transmission.
Claim 2
Independent Claim
94 words
A method for transmitting a halftone image using an m×n dither matrix for converting said halftone image into a binary image signal, comprising the steps of: dividing an original image to be transmitted into a mesh of regions same in shape as that of said m×n dither matrix, each of said mesh region being further subdivided into subdivisions of predetermined shape; calculating an average value of density level for each of said regions; and subjecting said average values to a predetermined coding scheme to have said average values converted into coded data for transmission.
Claim 3
Dependent Claim
25 words
The method of claim 1 wherein said coding scheme is selected from the group consisting of run length coding, bit plane coding and prediction coding.
Claim 4
Dependent Claim
49 words
The method of claim 2 wherein if said coding scheme is carried out based on either one of said run length coding or bit plane coding, a string of said average values is set up one dimensionally or two dimensionally by selecting said average values in a zigzag format.
Claim 5
Dependent Claim
81 words
The method of claim 1 further comprising the steps of: decoding said coded data to produce said average values upon receipt thereof after having been transmitted; comparing each of said produced average values with a group of thresholds of said dither matrix corresponding to said corresponding region whereby each of said subdivisions is set as a black pixel if the corresponding threshold is equal to or lower than (or lower than) the corresponding average value and as a white pixel otherwise.
Claim 6
Dependent Claim
50 words
The method of claim 4 wherein MTF correction is carried out only when a difference between the average value of a region of interest and the average value of another region adjacent to said region of interest has been detected to be equal to or more than a predetermined level.
Claim 7
Independent Claim
173 words
A method for transmitting a halftone image using an m×n dither matrix for converting said halftone image into a binary image signal, comprising the steps of: dividing an original image to be transmitted into a plurality of regions in the form of mesh similar in shape to said dither matrix, each of said regions being subdivided into a predetermined number of subregions of predetermined shape; calculating an average value of density level for each of said regions; comparing each of said average value of said region with each of thresholds in a group in said dither matrix corresponding to said region thereby detecting the position of a maximum threshold among those thresholds which are equal to or smaller than (or smaller than) said average value; converting said position into an address using a pattern of addresses previously determined in relation to the thresholds of said dither matrix region by region thereby forming a string of addresses; and subjecting said string of addresses to a predetermined coding scheme to obtain coded data for transmission.
Claim 8
Independent Claim
173 words
A method for transmitting a halftone image using an m×n dither matrix for converting said halftone image into a binary image signal, comprising the steps of: dividing an original image to be transmitted into a plurality of regions in the form of mesh similar in shape to said dither matrix, each of said regions being subdivided into a predetermined number of subregions of predetermined shape; calculating an average value of density level for each of said regions; comparing each of said average value of said region with each of thresholds in a group in said dither matrix corresponding to said region thereby detecting the position of a maximum threshold among those thresholds which are equal to or smaller than (or smaller than) said average value; converting said position into an address using a pattern of addresses previously determined in relation to the thresholds of said dither matrix region by region thereby forming a string of addresses; and subjecting said string of addresses to a predetermined coding scheme to obtain coded data for transmission.
Claim 9
Dependent Claim
25 words
The method of claim 6 wherein said coding scheme is selected from the group consisting of run length coding, bit plane coding and prediction coding.
Claim 10
Dependent Claim
49 words
The method of claim 2 wherein if said coding scheme is carried out based on either one of said run length coding or bit plane coding, a string of said average values is set up one dimensionally or two dimensionally by selecting said average values in a zigzag format.
Claim 11
Dependent Claim
79 words
The method of claim 6 further comprising the steps of: decoding said coded data upon receipt thereof after having been transmitted to produce addresses; comparing said each of said addresses with the corresponding region of a distribution of addresses similar in patter to said dither matrix whereby said subregion is set as a black pixel if the threshold of said subregion is equal to or less than the threshold designated by said address and as a white pixel otherwise.
Claim 12
Dependent Claim
50 words
The method of claim 9 wherein MTF correction is carried out only when a difference between the average value of a region of interest and the average value of another region adjacent to said region of interest has been detected to be equal to or more than a predetermined level.