← Back to Patent Explorer
US5818962A Expired / Lapsed US ⏱️ 0.0 years remaining

Coordinate transformation method for binary image

Assignee: Mitsubishi Electric Corp
•
Filing: 1996-03-20
•
Granted: 1998-10-06
•
Expires: 2016-03-20
📄 Original PDF 🌐 Google Patents 🔄 Sync Now

Abstract

Abstract A binary image coordinate transformation method can simplify the transformation processing for those portions consisting of pixels having the same single color value, thereby increasing the processing speed of binary image transformation overall. The original image is divided into a plurality of sub-regions. For each sub-region, it is detected whether or not the sub-region consists of pixels having the same color value of two color values of a binary image. The post-transformed image is divided into a plurality of sub-blocks. For each sub-block, all the sub-regions containing pixels corresponding to those pixels included in a sub-block are detected. When it is determined that the all the detected sub-regions corresponding to the sub-block have the same color value, the sub-block of the post-transformed image is covered with that single color in one go.

Inventors

  • 👤 Satoshi Mizukami

Bibliographic Details

Application Number —
Jurisdiction US
Data Source google_patents
Last Synchronized 2026-11-08 21:21
CPC Classifications
G; G06; G06T; G06T3/00

Claims Analysis

Total Claims: 9
Claim 1
Independent Claim 185 words
A coordinate transformation method for an original binary image comprising the steps of: dividing the original binary image into a plurality of pre-defined sub-regions, wherein each sub-region includes a plurality of pixels of the original binary image; detecting, for each sub-region, whether or not the sub-region consists of pixels defined by a single color value, the single color value being one of the two color values of the original binary image; labelling each sub-region with a label value indicating the color state of that sub-region based on the detection results; storing the label value of each sub-region; dividing a post-transformed binary image into a plurality of sub-blocks, each of the sub-blocks including a plurality of pixels and being associated with at least one sub-region; detecting, for each sub-block, all sub-regions which contain pixels corresponding to those pixels included in a sub-block of the post-transformed binary image; and covering an entire sub-block with a single color in one operation when all of the detected sub-regions associated with the sub-block have the same label value, indicating that all the pixels of the sub-region have the single color.
Claim 2
Dependent Claim 185 words
A coordinate transformation method for an original binary image comprising the steps of: dividing the original binary image into a plurality of pre-defined sub-regions, wherein each sub-region includes a plurality of pixels of the original binary image; detecting, for each sub-region, whether or not the sub-region consists of pixels defined by a single color value, the single color value being one of the two color values of the original binary image; labelling each sub-region with a label value indicating the color state of that sub-region based on the detection results; storing the label value of each sub-region; dividing a post-transformed binary image into a plurality of sub-blocks, each of the sub-blocks including a plurality of pixels and being associated with at least one sub-region; detecting, for each sub-block, all sub-regions which contain pixels corresponding to those pixels included in a sub-block of the post-transformed binary image; and covering an entire sub-block with a single color in one operation when all of the detected sub-regions associated with the sub-block have the same label value, indicating that all the pixels of the sub-region have the single color.
Claim 3
Dependent Claim 31 words
The method according to claim 1, wherein the number of sub-blocks of the post-transformed image is determined on the basis of a ratio of two colors occupying the original binary image.
Claim 4
Dependent Claim 70 words
The method according to claim 1, further comprising the steps of: transforming vertex coordinates of each sub-block of the post-transformed image into the original binary image to form a temporary region defined by the transformed vertex coordinates in the original binary image; and detecting all the sub-regions overlapping the temporary region, thereby detecting all the sub-regions containing pixels corresponding to those pixels included in a sub-block of the post-transformed image.
Claim 5
Dependent Claim 31 words
The method according to claim 3, wherein the number of sub-blocks of the post-transformed image is determined on the basis of a ratio of two colors occupying the original binary image.
Claim 6
Dependent Claim 51 words
The method according to claim 3, wherein, in the case that the temporary region is rotated with respect to the sub-region of the original binary image, those sub-regions located on the outlines defining the temporary region are first detected, based on which all the sub-regions overlapping the temporary region are detected.
Claim 7
Dependent Claim 30 words
The method according to claim 5, wherein the number of sub-blocks of the post-transformed image is determined on the basis of a ratio of two colors occupying the original image.
Claim 8
Dependent Claim 46 words
The method according to claim 3, wherein, in the case that the temporary region is not rotated with respect to the sub-region of the original binary image, all the sub-regions overlapping the temporary region are directly detected based on the vertex coordinates of the temporary region.
Claim 9
Dependent Claim 33 words
The method according to claim 7, wherein the number of the sub-blocks of the post-transformed image is determined on the basis of the ratio of the two colors occupying the original binary image.

References Cited (Backward Citations)

US4783829A Cited
JPH0498371A Cited
JPH04239980A Cited

USPTO Annuity & Maintenance Windows

Annuity Stage Window Opens Payment Deadline Surcharge Period Until Estimated Fee Status
3.5 Years (Year 4) 2001-10-05 2002-04-06 2002-10-06 $2000.00 Window Closed / Lapsed
7.5 Years (Year 8) 2005-10-05 2006-04-06 2006-10-06 $3760.00 Window Closed / Lapsed
11.5 Years (Year 12) 2009-10-05 2010-04-06 2010-10-06 $7700.00 Window Closed / Lapsed

Assigned Categories & Tags

No categories assigned to this patent yet.

Assign Category Tag