Patent US5912995A successfully refreshed from Google Patents.
← Back to Patent Explorer
US5912995A Expired / Lapsed US ⏱️ 0.0 years remaining

Method and apparatus for rotating or transposing a binary image

Assignee: Oracle America Inc
•
Filing: 1996-06-06
•
Granted: 1999-06-15
•
Expires: 2016-06-06
📄 Original PDF 🌐 Google Patents 🔄 Sync Now

Abstract

Abstract A method which may be implemented in a library routine for performing an image transformation. First, a plurality of groups of bits are selected, with each group being from a different row and the rows being aligned in the same column in an image. Next, a logical operation is performed to set to zero all of the bits in the group except for the designated position of the column to be transformed. Finally, each of the groups or rows are compared to a template, and a single bit indicating the result of such comparison is stored in a result register.

Inventors

  • 👤 Liang He

Bibliographic Details

Application Number —
Jurisdiction US
Data Source google_patents
Last Synchronized 2026-11-09 15:54
CPC Classifications
G; G06; G06T; G06T3/00; G06T3/60

Claims Analysis

Total Claims: 24
Claim 1
Independent Claim 106 words
In a computer system, a method comprising the steps of: providing an image; selecting a plurality of groups of bits representing pixels, each group being from a different row of said image, each group having pixels in the same column; performing a logical operation to set to zero all bits of each group except a bit at a designated position; comparing each group to a template, and storing a bit, indicating a result of said comparing, in a bit position in a result group corresponding to a position of said group in said column; and displaying a transformed image with pixels represented by said result group.
Claim 2
Dependent Claim 106 words
In a computer system, a method comprising the steps of: providing an image; selecting a plurality of groups of bits representing pixels, each group being from a different row of said image, each group having pixels in the same column; performing a logical operation to set to zero all bits of each group except a bit at a designated position; comparing each group to a template, and storing a bit, indicating a result of said comparing, in a bit position in a result group corresponding to a position of said group in said column; and displaying a transformed image with pixels represented by said result group.
Claim 3
Dependent Claim 28 words
The method of claim 1 further comprising the steps of repeating said steps for each bit in said group of bits, and for each group in said image.
Claim 4
Dependent Claim 35 words
The method of claim 1 wherein said selecting step further comprises storing said plurality of groups of bits into a single register in an order corresponding to an order of said groups in said column.
Claim 5
Dependent Claim 36 words
The method of claim 1 wherein said logical operation is an AND operation of said group of bits with a template having all zeros except for a bit corresponding to a position of said designated position.
Claim 6
Dependent Claim 50 words
The method of claim 1 wherein said comparing step compares a plurality of groups of bits in a single register with a template having a value at said designated position which will cause a result of said comparing step to reproduce said bit at said designated position in said groups.
Claim 7
Dependent Claim 70 words
The method of claim 1 wherein: said selecting step uses an align data instruction for placing a group at a desired location in a register; said logical operation uses an AND instruction which simultaneously ANDs a plurality of groups in parallel; and said comparing step utilizes a compare instruction which compares a plurality of groups in parallel and stores a single bit result of each comparison in a mask register.
Claim 8
Dependent Claim 24 words
The method of claim 1 wherein said transformation is one of a +90 degree rotation, a -90 degree rotation, and an X-Y axis transposition.
Claim 9
Dependent Claim 190 words
In a computer system, a method comprising the steps of: providing an image; selecting a plurality of groups of bits representing pixels, each group being from a different row of said image, each group having pixels in the same column; storing said plurality of groups of bits into a single register in an order corresponding to an order of said groups in said column; performing an AND operation of said group of bits with a first template having all zeros except for a bit corresponding to a position of said designated position in each group; comparing each group to a second template, and storing a bit, indicating a result of said comparing, in a bit position in a result group corresponding to a position of said group in said column, said second template having a value at said designated position which will cause a result of said comparing step to reproduce said bit at said designated position in said groups; repeating said steps for each bit in said group of bits, and for each group in said image; and displaying a transformed image with pixels represented by said result group.
Claim 10
Dependent Claim 190 words
In a computer system, a method comprising the steps of: providing an image; selecting a plurality of groups of bits representing pixels, each group being from a different row of said image, each group having pixels in the same column; storing said plurality of groups of bits into a single register in an order corresponding to an order of said groups in said column; performing an AND operation of said group of bits with a first template having all zeros except for a bit corresponding to a position of said designated position in each group; comparing each group to a second template, and storing a bit, indicating a result of said comparing, in a bit position in a result group corresponding to a position of said group in said column, said second template having a value at said designated position which will cause a result of said comparing step to reproduce said bit at said designated position in said groups; repeating said steps for each bit in said group of bits, and for each group in said image; and displaying a transformed image with pixels represented by said result group.
Claim 11
Dependent Claim 106 words
A memory storing a library routine for execution by a program on a processor to transform an image, said library routine comprising instructions for: selecting a plurality of groups of bits representing pixels, each group being from a different row of said image, each group having pixels in the same column; performing a logical operation to set to zero all bits of each group except a bit at a designated position; and comparing each group to a template, and storing a bit, indicating a result of said comparing, in a bit position in a result group corresponding to a position of said group in said column.
Claim 12
Dependent Claim 106 words
A memory storing a library routine for execution by a program on a processor to transform an image, said library routine comprising instructions for: selecting a plurality of groups of bits representing pixels, each group being from a different row of said image, each group having pixels in the same column; performing a logical operation to set to zero all bits of each group except a bit at a designated position; and comparing each group to a template, and storing a bit, indicating a result of said comparing, in a bit position in a result group corresponding to a position of said group in said column.
Claim 13
Dependent Claim 28 words
The memory of claim 9 further comprising an instruction for repeating said steps for each bit in said group of bits, and for each group in said image.
Claim 14
Dependent Claim 34 words
The memory of claim 9 further comprising an instruction for storing said plurality of groups of bits into a single register in an order corresponding to an order of said groups in said column.
Claim 15
Dependent Claim 36 words
The memory of claim 9 wherein said logical operation is an AND operation of said group of bits with a template having all zeros except for a bit corresponding to a position of said designated position.
Claim 16
Dependent Claim 50 words
The memory of claim 9 wherein said comparing instruction compares a plurality of groups of bits in a single register with a template having a value at said designated position which will cause a result of said comparing instruction to reproduce said bit at said designated position in said groups.
Claim 17
Dependent Claim 70 words
The memory of claim 9 wherein: said selecting instruction uses an align data instruction for placing a group at a desired location in a register; said logical operation uses an AND instruction which simultaneously ANDs a plurality of groups in parallel; and said comparing instruction utilizes a compare instruction which compares a plurality of groups in parallel and stores a single bit result of each comparison in a mask register.
Claim 18
Dependent Claim 124 words
A computer system comprising: a processor; a bus coupled to said processor; a memory coupled to said bus, said memory storing a library routine for execution by a program on a processor to transform an image, said library routine comprising instructions for selecting a plurality of groups of bits representing pixels, each group being from a different row of said image, each group having pixels in the same column; performing a logical operation to set to zero all bits of each group except a bit at a designated position; and comparing each group to a template, and storing a bit, indicating a result of said comparing, in a bit position in a result group corresponding to a position of said group in said column.
Claim 19
Dependent Claim 124 words
A computer system comprising: a processor; a bus coupled to said processor; a memory coupled to said bus, said memory storing a library routine for execution by a program on a processor to transform an image, said library routine comprising instructions for selecting a plurality of groups of bits representing pixels, each group being from a different row of said image, each group having pixels in the same column; performing a logical operation to set to zero all bits of each group except a bit at a designated position; and comparing each group to a template, and storing a bit, indicating a result of said comparing, in a bit position in a result group corresponding to a position of said group in said column.
Claim 20
Dependent Claim 32 words
The system of claim 15 wherein said library routine further comprises an instruction for repeating said steps for each bit in said group of bits, and for each group in said image.
Claim 21
Dependent Claim 38 words
The system of claim 15 wherein said library routine further comprises an instruction for storing said plurality of groups of bits into a single register in an order corresponding to an order of said groups in said column.
Claim 22
Dependent Claim 36 words
The system of claim 15 wherein said logical operation is an AND operation of said group of bits with a template having all zeros except for a bit corresponding to a position of said designated position.
Claim 23
Dependent Claim 50 words
The system of claim 15 wherein said comparing instruction compares a plurality of groups of bits in a single register with a template having a value at said designated position which will cause a result of said comparing instruction to reproduce said bit at said designated position in said groups.
Claim 24
Dependent Claim 68 words
The system of claim 15 wherein: said selecting instruction uses an align data instruction for placing a group at a desired location in a register; said logical operation uses an AND instruction which simultaneously ANDs a plurality of groups in said comparing instruction utilizes a compare instruction which compares a plurality of groups in parallel and stores a single bit result of each comparison in a mask register.

References Cited (Backward Citations)

US4168488A Cited
US4271476A Cited
US4627020A Cited
US4837845A Cited
US5111192A Cited
US5598181A Cited
US5670982A Cited

USPTO Annuity & Maintenance Windows

Annuity Stage Window Opens Payment Deadline Surcharge Period Until Estimated Fee Status
3.5 Years (Year 4) 2002-06-14 2002-12-14 2003-06-15 $2000.00 Window Closed / Lapsed
7.5 Years (Year 8) 2006-06-14 2006-12-14 2007-06-15 $3760.00 Window Closed / Lapsed
11.5 Years (Year 12) 2010-06-14 2010-12-14 2011-06-15 $7700.00 Window Closed / Lapsed

Assigned Categories & Tags

No categories assigned to this patent yet.

Assign Category Tag