IP Library Granted Patent US 7,853,887
Granted Patent B2
US 7,853,887 · App. 11/768,325 · Granted Dec 14, 2010

Detection and preview of graphical elements within a graphic

View Patent ↗
Loading inventors, assignments & file history…
Monitor This Case
Get email alerts when status or documents change.
Order Certified Copies
Most orders are placed with the USPTO same day — all within 24 business hours.
Order via The Patent Place →
Pre-filled with this patent's details
Quick Facts
Patent No.
US 7,853,887
App. No.
11/768,325
Granted
Dec 14, 2010
Kind
B2
Abstract

In an embodiment, hidden graphical elements in a graphic are detected by generating a first bitmap based on a plurality of graphical elements and a second bitmap based on a first subset of the plurality of graphical elements where the first subset omits a first graphical element of the plurality of elements and includes a second graphical element of the plurality of elements. The first bitmap is then compared with the second bitmap to determine if they match. If they match, the first graphical element is considered to be hidden by the second graphical element.

Claims (65)

1. A method comprising:

generating a first bitmap based on a plurality of graphical elements;

generating a second bitmap based on a subset of the plurality of graphical elements, the subset omitting a graphical element of the plurality of graphical elements; and

comparing the first bitmap with the second bitmap to determine if the graphical element is hidden.

2. A method as defined in claim 1 wherein comparing further comprises:

comparing pixels in the first bitmap with corresponding pixels in the second bitmap; and

based on the compared pixels, determining if the graphical element is hidden.

3. A method as defined in claim 2 further comprising:

identifying a number of compared pixels that match; and

using the identified number of compared pixels that match to determine an amount by which the graphical element is hidden.

4. A method as defined in claim 3 further comprising:

concluding the graphical element is hidden if the amount exceeds a predetermined threshold.

5. A method as defined in claim 1 , wherein the subset is a first subset, the graphical element is a first graphical element and, wherein comparing further comprises:

generating a third bitmap based on a second subset of the plurality of graphical elements, the second subset including the first graphical element and omitting a second graphical element of the plurality of graphical elements; and

comparing pixels in the first bitmap with pixels in the second bitmap, the compared pixels corresponding to a location of the first graphical element in the third bitmap.

6. A method as defined in claim 5 further comprising:

generating a fourth bitmap based on a third subset of the plurality of graphical elements, the third subset including the first graphical element and omitting the second graphical element; and

setting pixels in the fourth bitmap that are associated with the first graphical element to indicate the first graphical element is hidden if it is determined that the first graphical element is hidden.

7. A method as defined in claim 5 further comprising:

generating a fourth bitmap based on a third subset of the plurality of graphical elements, the third subset including the first graphical element and omitting the second graphical element; and

setting pixels in the fourth bitmap that are associated with the first graphical element to indicate the first graphical element is visible if it is determined if the first graphical element is visible.

8. A method as defined in claim 7 , wherein one or more pixels in the third bitmap that are associated with the first graphical element indicate a location of the first graphical element in the fourth bitmap.

9. A method as defined in claim 8 further comprising:

using the one or more pixels that indicate the location of the first graphical element in the fourth bitmap to update a data structure to indicate whether the first graphical element is hidden or visible.

10. A method comprising:

generating a first bitmap based on a plurality of graphical elements, the plurality of graphical elements including one or more textual elements and one or more non-textual elements;

generating a second bitmap based on a first subset of the plurality of graphical elements, the first subset omitting the one or more textual elements and including the one or more non-textual elements;

generating a third bitmap based on a second subset of the plurality of graphical elements, the second subset including the one or more textual elements and omitting the one or more non-textual elements, each textual element included in the second subset being associated with one or more background pixels and one or more non-background pixels contained in the third bitmap; and

for each textual element included in the second subset:

identifying one or more non-background pixels that are associated with the textual element,

for each identified non-background pixel, comparing a corresponding pixel contained in the first bitmap with a corresponding pixel contained in the second bitmap, and

concluding the textual element is hidden based on the results of the compared pixels.

11. A method as defined in claim 10 further comprising:

identifying a number of compared pixels that match; and

using the identified number of compared pixels that match to determine an amount by which the textual element is hidden.

12. A method as defined in claim 11 wherein concluding further comprises:

comparing the amount to a threshold; and

concluding the textual element is hidden if the amount exceeds the threshold.

13. An apparatus comprising:

a bitmap memory; and

a processor configured to:

generate a first bitmap in the bitmap memory, the first bitmap being generated based on a plurality of graphical elements,

generate a second bitmap in the bitmap memory, the second bitmap being generated based on a subset of the plurality of graphical elements, the subset omitting a graphical element of the plurality of graphical elements, and

compare the first bitmap with the second bitmap to determine if the graphical element is hidden.

14. An apparatus as defined in claim 13 wherein the processor is further configured to:

compare pixels in the first bitmap with corresponding pixels in the second bitmap; and

based on the compared pixels, determine if the graphical element is hidden.

15. An apparatus as defined in claim 14 wherein the processor is further configured to:

identify a number of compared pixels that match, and

use the identified number of compared pixels that match to determine an amount by which the graphical element is hidden.

16. An apparatus as defined in claim 15 wherein the processor is further configured to:

conclude the graphical element is hidden if the amount exceeds a predetermined threshold.

17. An apparatus as defined in claim 15 , wherein the subset is a first subset, the graphical element is a first graphical element and, wherein the processor is further configured to:

generate a third bitmap based on a second subset of the plurality of graphical elements, the second subset including the first graphical element and omitting a second graphical element of the plurality of graphical elements; and

compare pixels in the first bitmap with pixels in the second bitmap, the compared pixels corresponding to a location of the first graphical element in the third bitmap.

18. An apparatus as defined in claim 17 wherein the processor is further configured to:

generate a fourth bitmap in the bitmap memory, the fourth bitmap being generated based on a third subset of the plurality of graphical elements, the third subset including the first graphical element and omitting the second graphical element, and

set pixels in the fourth bitmap that are associated with the first graphical element to indicate the first graphical element is hidden if it is determined that the first graphical element is hidden.

19. An apparatus as defined in claim 17 wherein the processor is further configured to:

generate a fourth bitmap in the bitmap memory, the fourth bitmap being generated based on a third subset of the plurality of graphical elements, the third subset including the first graphical element and omitting the second graphical element, and

set pixels in the fourth bitmap that are associated with the first graphical element to indicate the first graphical element is visible if it is determined if the first graphical element is visible.

20. A computer program product including a computer-readable medium having instructions stored thereon for processing data information, such that the instructions, when carried out by a processing device, enable the processing device to perform the operations of:

generating a first bitmap based on a plurality of graphical elements;

generating a second bitmap based on a subset of the plurality of graphical elements, the subset omitting a graphical element of the plurality of graphical elements; and

comparing the first bitmap with the second bitmap to determine if the first graphical element is hidden.

Assignments (2)
CHANGE OF NAME Recorded Mar 6, 2019
From: ADOBE SYSTEMS INCORPORATED
To: ADOBE INC.
Reel/Frame 048525/0042 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Jun 26, 2007
From: OSSESIA, MICHEL G.
To: ADOBE SYSTEMS INCORPORATED
Reel/Frame 019479/0388 →