US 6,664,976 B2Grant
Image management system and methods using digital watermarks
Issue Date:2003-12-16
•19 Claims
•8 Drawing Sheets
Abstract
Digital watermarking technology is used in an image management system. Images are identified by digital watermarks. The images are stored so as to be indexed according to their unique identifiers. In the preferred embodiment, related images are grouped into a set of images through a common watermark identifier. A particular image within the set of images is identified through a hash of the particular image.
Metadata
Assignee
- Digimarc Corporation
Inventors
- Neil E. Lofgren
- Geoffrey B. Rhoads
Application Information
Application Number:US 10/100,233
Filing Date:2002-03-13
Priority Date:2001-04-18
Art Unit:7
Classifications
IPC:
G09G 500G06K 900
Field of Search:
380 51380 54382100382232713176
Patent Drawings (8 sheets)
Description
Related Application Data
[0002] This application is a continuation in part of U.S. patent application Ser. No. 09/858,336, filed May 15, 2001, titled “Image Management System and Methods Using Digital Watermarks.” This patent application also claims the benefit of U.S. Provisional Application No. 60/284,776, filed Apr. 18, 2001, titled “Using Embedded Identifiers with Images.” Each of these applications is herein incorporated by reference.
[0003] This patent application is also related to assignee's U.S. patent application Ser. No. 09/833,013, titled “Digitally Watermarked Maps and Signs and Related Navigational Tools,” filed Apr. 10, 2001, and Ser. No. 09/800,093, filed Mar. 5, 2001, titled “Geo-Referencing of Aerial Imagery Using Embedded Image Identifiers and Cross-Referenced Data Sets,” and U.S. Provisional Patent Application No. 60/284,163, filed Apr. 16, 2001, titled “Watermark Systems and Methods.” These applications are herein incorporated by reference.
Field of the Invention
[0004] The present invention relates to image management and processing, and is particularly illustrated in the context of a satellite and other aerial imagery management system.
Background and Summary of the Invention
[0005] Aerial imagery has vastly improved since the Wright brothers first took to the sky. Indeed, there have been many improvements in the photography and digital imaging fields.
[0006] While the earliest aerial imagery relied on conventional film and optics technology, a variety of electronic sensors are now more commonly used. Some collect image data corresponding to specific visible, UV or IR frequency spectra (e.g., the MultiSpectral Scanner and Thematic Mapper used by the Landsat satellites). Others use wide band sensors. Still others use radar or laser systems (sometimes stereo) to sense topological features in 3 dimensions. Some satellites even collect ribbon imagery (e.g., a raster-like, 1-demensional terrestrial representation, which is pieced together with other such adjacent ribbons).
[0007] The quality of the imagery has also constantly improved. Some satellite systems are now capable of acquiring image and topological data having a resolution of less than a meter. Aircraft imagery, collected from lower altitudes, provides still greater resolution.
[0008] A vast amount of aerial imagery is constantly being generated and collected. Management of the resulting large data sets is a growing problem. In today's digital world, images are routinely manipulated, even on home computers. Management of resulting image ancestry, image derivatives and related metadata is increasingly difficult.
[0009] According to one aspect of the present invention, a digital watermark-based image management system helps solve these and other problems. A digital watermark is ideally employed as link or bridge to group a related family of images. An image family can be associated in a database (or other data structure) via a parent's digital watermark identifier. Individual images within the image family are identified by a unique image hash (or fingerprint).
[0010] Digital watermarking is a form of steganography that encompasses a great variety of techniques by which plural bits of digital data are hidden in some other object without leaving human-apparent evidence of alteration.
[0011] Digital watermarking may be used to modify media content to embed a message or machine-readable code into the content. The content may be modified such that the embedded code is imperceptible or nearly imperceptible to the user, yet may be detected through an automated detection process.
[0012] Most commonly, digital watermarking is applied to media such as images, audio signals, and video signals. However, it may also be applied to other types of data, including documents (e.g., through line, word or character shifting, through texturing, graphics, or backgrounds, etc.), software, multi-dimensional graphics models, and surface textures of objects.
[0013] The assignee's U.S. Pat. No. 6,122,403, and co-pending U.S. patent application Ser. No. 09/503,881, each herein incorporated by reference, detail suitable digital watermarking techniques in which values of pixels, e.g., in a 100×100 pixel patch, can be slightly altered so as to convey a plural-bit payload, without impairing use of the pixel data for its intended purpose. The payload may be on the order of 2-256 bits, depending on the particular form of encoding (e.g., convolution, turbo, or BCH coding can be employed to provide some error-correcting capability), and the number of bits per pixel. Larger payloads can be conveyed through larger image patches. (Larger payloads can also be conveyed by encoding the information in a less robust fashion, or by making the encoding more relatively visible.). The watermark payload can convey an image identifier, and may convey other metadata as well. In some embodiments, the component image files are tagged both by digital watermark identifiers and also by conventional out-of-band techniques, such as header data, thereby affording data redundancy. Of course, there are many watermarking techniques known to those skilled in the art, and such may be suitably interchanged with the present invention.
[0014] Digital watermarking systems typically have two primary components: an embedding component that embeds the watermark in the media content, and a reading component that detects and reads the embedded watermark. The embedding component embeds a watermark pattern by altering data samples of the media content. The reading component analyzes content to detect whether a watermark pattern is present. In applications where the watermark encodes information, the reading component extracts this information from the detected watermark. Commonly assigned U.S. application Ser. No. 09/503,881 discloses various encoding and decoding techniques. U.S. Pat. No. 5,862,260 discloses still others. Each of these U.S. Patent documents is herein incorporated by reference.
[0015] Watermarking may be performed in stages, at different times. For example, a unique identifier can be watermarked into an image relatively early in the process, and other information (such as finely geo-referenced latitude/longitude) can be watermarked later. A single watermark can be used, with different payload bits written at different times. (In watermark systems employing pseudo-random data or noise (PN), e.g., to randomize some aspect of the payload's encoding, the same PN data can be used at both times, with different payload bits encoded at the different times.).
[0016] Alternatively, different watermarks can be applied to convey different data. The watermarks can be of the same general type (e.g., PN based, but using different PN data). Or different forms of watermark can be used (e.g., one that encodes by adding an overlay signal to a representation of the image in the pixel domain, another that encodes by slightly altering DCT coefficients corresponding to the image in a spatial frequency domain, and another that encodes by slightly altering wavelet coefficients corresponding to the image. Of course, other watermarking techniques may be used as suitable replacements for those discussed above.).
[0017] In some multiple-watermarking approaches, a first watermark is applied before a satellite image is segmented into patches. A later watermark can be applied after segmentation. (The former watermark is typically designed so as to be detectable from even small excerpts of the original image.)
[0018] A watermark can even be applied by an imaging instrument. In some embodiments, the image is acquired through an LCD optical shutter, or other programmable optical device, that imparts an inconspicuous patterning to the image as it is captured. (One particular optical technique for watermark encoding is detailed in U.S. Pat. No. 5,930,369, herein incorporated by reference.). Or the watermarking can be effected by systems in a satellite (or other aerial platform) that process the acquired data prior to transmission to a ground station. In some systems, the image data is compressed for transmission—discarding information that is not important. The compression algorithm can discard information in a manner calculated so that the remaining data is thereby encoded with a watermark.
[0019] A ground station receiving the satellite transmission can likewise apply a watermark to the image data. So can each subsequent system through which the data passes, if desired.
[0020] Preferably, such watermarking processes are secure and cannot be replicated by unauthorized individuals.
[0021] The foregoing and additional features and advantages of the present invention will be even more readily apparent from the following detailed description with reference to the following figures.
Brief Description of the Drawings
[0022] FIG. 1 is a functional block diagram illustrating image capture and a digital watermarking process.
[0023] FIG. 2 illustrates components of an image management system.
[0024] FIG. 3 illustrates associating related images and information with a digital watermark identifier.
[0025] FIG. 4 is a functional block diagram illustrating gatekeepers in a network.
[0026] FIGS. 5 and 6 are flow diagrams illustrating gate-keeping methods and processes.
[0027] FIGS. 7 and 8 variously illustrate a digital watermark identifier and an image hash used to identify and image family and images and metadata with the image family.
Detailed Description
[0028] For expository convenience, the following discussion focuses on satellite and other aerial “imagery” to illustrate the principles of the invention. The principles of the invention, however, are equally applicable to other forms of imagery, including non-aerial imagery. Accordingly, the term “image” should be used to encompass other data sets, and the term “pixel” should be construed to encompass component data from such other data sets. The term “image” should also be construed to include both digital and analog data sets.
[0029] Watermarking Images
[0030] With reference to FIG. 1, an image 10 is captured from an aerial platform 11, such as an aircraft, satellite, balloon, unmanned aircraft, etc. The image 10 is communicated to a receiving or ground station 12. (In some instances, the image signal may be relayed through various aerial and/or other ground stations before reaching ground station 12.). Ground station 12 preferably includes a digital watermark embedder 12a, which embeds a digital watermark within the image 10, to produce a digitally watermarked image 13.
[0031] A digital watermark is typically embedded in a digital representation of the image 10. Although not required, the digital watermark preferably survives transformation to various analog representations (e.g., printing) as well. The digital watermark includes a watermark identifier (ID). In a first embodiment, each image is digitally watermarked to include a unique watermark ID. The ID typically includes plural-bit data, e.g., in the range of 2-256 bits. In one implementation of this first embodiment, a digital watermark (and identifier) is redundantly embedded within an image to improve robustness. For example, an image is divided into tiles or sections, and each tile or section is embedded with the digital watermark (and ID). Alternatively, a subset of the sections are embedded. Such techniques help to ensure the robustness of a watermark, particularly when an image is to be manipulated (e.g., clipped, cut-and-pasted, resized or scaled, rotated, etc.).
[0032] Digitally watermarked image 13 is stored in a database 14. (A watermarked image can be directly communicated to database 14, transferred via a storage medium and/or otherwise relayed to database 14.). Database 14 preferably manages images and/or related data. Database software, e.g., such as provided by Microsoft, Oracle, Sun Microsystems, etc., can be executed by a computer or server to help maintain database 14. Of course, database 14 can be maintained by a ground station 12 system, or can be maintained in a remotely located network. In one implementation, database 14 communicates with a network, such as a LAN, WAN, dedicated network, wireless network, private network, etc. In some implementations, database 14 includes a plurality of databases. In such an implementation, at least one database maintains image data, while at least a second database maintains related image information (e.g., metadata, related files, comments, file history, edit history, and/or security clearance information, etc.). Here, metadata is broadly defined to include a variety of information such as creation data, geo-location information, ancestry data, security information, access levels, copyright information, security classifications, usage rights, and/or file history, etc.
[0033] Image 13 and/or any related metadata is preferably stored and indexed according to watermark IDs. For example, a watermark ID provides a thread by which images and related information are grouped, stored and/or indexed.
[0034] Optionally, original image data is communicated to a second database 15. Database 15 can be used to maintain original image 10 and/or an original watermarked image 13. (The dashed lines in FIG. 1 represent this optional embodiment.).
[0035] Image and Derivative Image Management Using Digital Watermarks
[0036] A problem faced by image management systems is how to efficiently manage an image's ancestry and related metadata. Normal image processing (e.g., scaling, cropping, rotating, clipping, resizing, cut-and-pasting image blocks, editing, annotating, and/or marking, etc.) of an “original” image results in a “derivative” image. In conventional systems, derivative images frequently retain minimal, if any, related metadata. The metadata, such as that stored in header or footer files, is easily separable from derivative images. Separation results in a significant loss of information, particularly for a derivative image. One conventional solution is to manually record an image identifier as an image moves through an exploitation (or derivative) process. This manual recording process is labor intensive and cumbersome at best.
[0037] A better solution, as disclosed in this application, is to place a unique digital watermark ID within an image to enable database linking and indexing. Metadata contained within the database can be then associated with a specific image, or with a family of images, via the unique watermark ID. With reference to FIG. 2, a user terminal 18 retrieves a digitally watermarked image 001 from database 14. User terminal 18 preferably includes a processor, memory and suitable software instructions to facilitate digital watermark detection and/or embedding. The user terminal 18 will preferably include an operating system, such as Windows, Windows NT, Linux, etc., and image-handling (and editing) software. Suitable image-handling software can be obtained from Microsoft, Adobe, SRI and Erdas, among others. Preferably, both the watermark detecting software and the image-handling software are compatible with various types of image formats, such as bit-maps, JPEG files, TIF files, etc. (However, such compatibility is not required.).
[0038] Digital watermark detection software executing in user terminal 18 analyzes image 001. The watermark detection software can be called by the imaging software, may operate as a plug-in, or may be even integrated with the image-handling software, operating system, or other software module. The watermark detection software extracts the unique watermark identifier (e.g., ID-1) embedded within image 001. Having obtained the identifier (ID-1), the user terminal 18 can optionally communicate with database 14 to retrieve related information, such as metadata, files, and related images. For example, the watermark ID-1 is used to interrogate database 14 to retrieve information regarding the geo-coordinates for the image, the time and date the image was taken, analyst comments, and/or analyst information, etc. Preferably, the watermark ID-1 is used to index any derivative images, e.g., derivative 001. (In this case, derivative 001 is an image derived from image 001.).
[0039] In a preferred embodiment, since each image includes a unique identifier, derivative 001 includes a watermark identifier (e.g., ID-5) that is unique from the corresponding original image 001 (e.g., identifier ID-1). Derivative 001 and image 001 are associated (e.g., linked) together in database 14, via identifier ID-1 (and, optionally, via ID-5).
[0040] In some instances, user terminal 18 will create additional derivatives. Take for instance, an example when user terminal 18 enlarges the derivative 001 image, thus creating a new derivative image 001a. This new derivative image 001ais preferably uniquely identified with a digital watermark. A process of digitally watermarking a derivative image typically involves removing the original watermark from the derivative and replacing that original digital watermark with a new digital watermark having a unique identifier. Thus, upon creating derivative image 001a, the digital watermarking software removes the derivative 001 watermark (or at least a portion of the watermark, e.g., identifier ID-5) from the derivative 001 image. Assignees' U.S. application Ser. No. 09/503,881 discusses relevant digital watermarking techniques. Artisans know others still that may be suitably interchanged with the present invention. Derivative 001ais then embedded with a digital watermark having a unique identifier (e.g., ID-10). (In an alternative implementation, the original watermark is altered, e.g., by changing one or more message bits, to create the new unique identifier, instead of replacing the original watermark with a new watermark. In another embodiment, a second watermark is added to the derivative image to complement the first (or more) watermark, instead of replacing the first watermark. In this case, the first watermark identifies the original image, and the second watermark identifies the derivative.).
[0041] The watermark embedding software can determine an appropriate identifier in a number of ways. In one embodiment, the embedding software queries database 14 for an appropriate, or available, identifier. In another case, embedding software (or user terminal 18) is assigned a range of identifiers, and an identifier is chosen from the available range. In still another embodiment, the embedding software randomly or pseudo-randomly selects the identifier, or alters a portion of the original image identifier, e.g., 2-32 bits of the original watermark identifier.
[0042] An image and a watermark identifier are combined to produce a digitally watermarked image (or derivative image). As an optional feature, software provides an indicator to signal success or failure in the watermarking effort. For example, the software can analyze whether the watermark was embedded, and/or whether the image contains the same format and density as the original input image. Upon a failure, user terminal 18 re-embeds the digital watermark or aborts the process.
[0043] Derivative image 001ais stored in database 14. Related information can also be stored in database 14. (As discussed above, database 14 may include a plurality of databases. One such database may manage images, while another database manages related information. Preferably, however, the unique identifiers are used consistently between the plurality of databases to link related images, derivatives and any associated metadata.). Database 14 links derivative 001awith image 001, derivative 001 and any related information (e.g., metadata, comments, files, history, security, etc.). Accordingly, image ancestry and any related information is efficiently maintained.
[0044] FIG. 3 is a diagram further illustrating linking images, derivatives and related information via watermark identifiers. An original image 20 is digitally watermarked with a unique identifier 22. A first derivative image 24 (e.g., perhaps an enlarged or cropped image corresponding with area 20a) and a second derivative 26 (e.g., corresponding to area 20b) are created. Each of the first derivative 24 and second derivative 26 are encoded with a unique watermark identifier 22aand 22b, respectively. The derivative identifiers 22aand 22bare associated with the identifier 22 in database 14. Such linking effectively groups image families together, permitting a user to gain access to image ancestry. Similarly, related information can be linked via unique identifier 22. Returning to FIG. 3, related information 28 corresponding to first derivative 24 are linked to identifier 22. Files 30 corresponding to the original image 20, as well as files 32 for the second derivative 26, are likewise linked. Accordingly, entire image families (and related information) are efficiently maintained by linking via the unique identifier 22. Of course, files 28 and 30 optionally can be separately, and respectively, linked to derivatives 24 and 26, via the derivatives' unique identifiers 22aand 22b(e.g., as shown by the dashed lines in FIG. 3).
[0045] Digital Watermarks and Image Hashes
[0046] In a related embodiment, we use an image hash to uniquely identify a derivative image and a digital watermark to identify the image family, image family line or image parent. We define the term “hash” broadly herein. Most generally, a hash is an algorithm that converts a signal (e.g., image) into a lower number of bits. The term “hash” can also represent the output or result of such a hashing algorithm. Of course our hash definition is broad enough to include so-called image fingerprints. A hashing algorithm may be applied to the whole image or to a selected portion of an image (e.g., image block(s), high frequency components of an image, frequency-domain characteristics, perceptually relevant image characteristics, etc.) to create a hash. Some hashing algorithm examples include MD5, MD2, SHA and SHA1. See assignee's U.S. patent application Ser. No. 10/027,783, filed Dec. 19, 2001 for a further discussion of hashing, digital signatures and fingerprinting techniques. The Ser. No. 10/027,783 application is herein incorporated by reference. Of course, there are many other conventional hashing algorithms and techniques that may be suitably interchanged with the hashing aspect of this embodiment of our present invention.
[0047] With reference to FIG. 7, a parent image 002 is digitally watermarked. The digital watermark includes an identifier (e.g., WM 002). The digital watermark is preferably robust, e.g., it survives signal processing such as scaling, rotation, cropping, editing, etc. Accordingly, a derivative image 002 “inherits” the digital watermark including the identifier WM 002. There are advantages inherent with this implementation, such as the preservation of a persistent link (e.g., the WM 002 identifier) between derivative 002 and its parent image 002. However, used alone a solution of a persistent watermark identifier may not always be sufficient to distinguish the parent image 002 from the child derivative image 002—complicating a situation where information (or metadata) that is related to only the parent or to the derivative might not be relevant to the other.
[0048] We combine digital watermarking and fingerprinting to solve this problem. A digital watermark identifier is used to identify a family (or set) of images. Each family member preferably includes the same watermark identifier. We also determine an image hash (or fingerprint) for each image (including derivatives). These hashes are used to uniquely identify an image within the family or set of images. Any new derivatives that are encountered can be added to a database with a new hash to uniquely identify the derivative in that image family.
[0049] Consider FIG. 7 again. A hash 1 is computed for image 002. Hash 1 is associated with image 002, e.g., within the database image family defined (or identified) by WM 002, to uniquely identify image 002. Metadata that is uniquely associated with image 002 can be linked to image 002 via hash 1 (see FIG. 8). Derivative 002 is associated with the image 002 family since it includes the digital watermark identifier WM 002. A hash 2 is computed for derivative 002. This hash 2 uniquely identifies the derivative 002. Derivative images 002a, 003 and 003aare similarly associated with the WM 002 family via their embedded digital watermark identifier WM 002. Each of these derivative images 002a, 003 and 003a(and any related metadata) can be uniquely identified within the WM 002 family via image hashes 3, 4 and 5, respectively.
[0050] Once an image database is populated as discussed above, our image lookup process will typically involve two main steps: 1) after extracting a digital watermark identifier from an image, the extracted identifier is used to locate in a database a corresponding image family, and then 2) after calculating a hash of the image, the calculated hash is used to match or otherwise identify an image from a hash(es) associated with the image family. (We note that the calculated hash is calculated using the same or related hashing algorithm that was used to calculate the original hash stored in the database. We also note that since the number of derivatives within an image family will be relatively smaller than the entire population of database images, a calculated hash can be matched with the “closest” comparable hash, and in at least one implementation of our present invention, need not be an exact match.). Thus, a digital watermark identifier provides a link to a family of images, while an image hash identifies a particular image within the family. Any image with the same watermark identifier preferably links to related family data (metadata, analysts notes, etc.) but image specific data is preferably registered against a particular hash, allowing the differentiation of derivatives from each other and their parent.
[0051] This inventive implementation has an added benefit of being able to verify whether a particular image is an original image. For example, an image hash can be associated with metadata, e.g., to indicate that “this image is a derivative,” “this image is a derivative of image X,” “here is a link to the parent,” “here is a link to other derivatives,” “here is information that was registered against this derivative,” “this image is an original or parent” and/or “here is information that was registered against the parent,” etc., etc.
[0052] We note that as an alternative implementation, we can configure our database and database interrogation routines to locate in the database an image via an image hash, instead of first identifying an image family through the digital watermark identifier. In such an implementation, however, we preferably use a digital watermark identifier to link to other, related images and metadata.
[0053] These implementations can reduce the number of unique identifiers required for a large image/derivative management system. As a further improvement, we can include an image hash as part of a unique image digital watermark identifier. For example, a first digital watermark payload field may include an image identifier and a second digital watermark identifier may include the hash. Or the hash may comprise the entire digital watermark identifier/payload.
[0054] Security and Rewritable Watermarks
[0055] In another embodiment, a digital watermark provides information related to a permission level or a security clearance level. Such information can be reflected in a unique identifier or in a payload message. Alternatively, the watermark identifier can be used to interrogate a database to retrieve related security level requirements. Such security information can be used to regulate access to images, files, metadata and related information. For example, only users (or user terminals) having a corresponding permission level or security clearance are allowed to access the corresponding image. Suitable software instructions can examine the permission level (or security clearance) to determine whether a user (or terminal) has the necessary clearance.
[0056] One aspect of the present invention is to employ “rewritable” watermarks. A rewritable watermark includes a watermark of which all or a portion of which may be changed. In a preferred embodiment, only a portion (e.g., a portion of the payload) of a watermark is rewritten to update permission levels, reflect derivative work, etc.
[0057] There are often situations where it is desirable to carry some form of security access indicator in an image, e.g., via a digital watermark. The security access indicator defines a level of security required to view, edit or comment with respect to an image. Access to the image is then controlled by appropriately enabled software, which extracts the indicator (or receives the indicator from a watermark decoder) and determines a security level needed to handle the image. In one embodiment, the indicator indicates defines a required level. If a user's security level is equal to or greater than (e.g., as determined from a password, user terminal identifier, login, linked security clearance level, etc.) that carried in a security access indicator, then a user is allowed access to the image or data. In another embodiment, a security code may indicate that a particular user can view the image, but cannot edit or store comments regarding such.
[0058] Consider the following example. An image “A” is defined to include an “unclassified” security classification. Image A's watermark then includes a unique identifier and additional plural-bits set to a predetermined number, e.g., all set to zero (or to a predetermined number or pattern). These additional plural-bits define the unclassified security classification. An image “B” is a derivative of image A, and has a “secret” security classification encoded in the plural-bits. Before either image A or B is opened (or requested) the security level contained within the watermark is validated against the security level of the individual requesting access, and permission is only granted to those with adequate clearance. In one implementation, local software (e.g., executing on a user terminal) validates the security access by decoding the watermark, extracting the security bits, and comparing the security bits (or corresponding security level) with the security clearance of a user (or terminal). In another implementation, software running on a central server monitors and validates security access. Or in another implementation software associated with the database regulates the security access.
[0059] Application Interface
[0060] Application interface software, residing on a user terminal, helps to facilitate communication between image-handling software and database 14. The interface can be incorporated in such image-handling software, operate as a plug-in, be integrated with the operating system, or may even be called by certain operations (e.g., data retrieval, editing, saving, etc.). Preferably, the interface generates (or works in connection with) a graphical user interface (GUI) for a user. The GUI helps to facilitate user login, data retrieval, and image creation and saving. Creation is defined broadly to include any alteration to an existing image, or generation of a new image. Initially, a user is requested to enter a password or pass code to interact with database 14. After a successful log in, user access is preferably regulated based on security clearance. In other embodiments, permission levels or payment schedules are used to regulate access. An image, and related metadata, files, etc., should only be accessible when security access is permitted. In one implementation, an image is selected from a directory, and the selected image is examined for watermarks. A watermark is extracted and security bits are determined. The security bits are validated against a corresponding security access allowed for the logged-on user. A user is permitted to access (e.g., retrieve, open, or edit) the image if she has an appropriate clearance. In an alternative arrangement, a database is queried to determine the security level required for all (or a subset of all) possible images in a directory or list. Only those images corresponding to the user's security clearance (or permission) are presented as options to open for the user. Even the names of the images can be screened from a user if her security clearance is insufficient.
[0061] The interface also facilitates communication in a normal image editing and creation processes. Preferably, the interface will be invoked as part of a saving process.
[0062] The creation process typically involves determining a new image identifier. As discussed above, there are many ways to determine an image identifier. In one case, the interface queries the database 14 to obtain a new image identifier. The retrieved image identifier is embedded in the newly created image as a portion of a digital watermark. The embedded image is then saved in database 14. Optionally, the database will signal that the save operation has been successfully completed. In the case of derivatives, the database is preferably updated to indicate that the new image identifier is related (or linked) to the identifier of an original image.
[0063] In one embodiment, the above-mentioned steps (e.g., creating, watermarking, and saving) are considered a transaction, e.g., where all of the steps must be carried out for the transaction to be complete.
[0064] Sentry
[0065] Another aspect of the present invention is a gatekeeper module. With reference to FIG. 4, a gatekeeper (or “sentry”) 42 (e.g., including 42aand 42b) resides on network terminals 40 and 44. Terminals 40 and 44 communicate, e.g., via a network, direct link, e-mail, etc. Sentry 42 monitors the flow of digital watermarked images and related information by extracting digital watermark identifiers or embedded security information from transmitted images. The sentry 42 can compare extracted information against user (or terminal) security clearance information. In one implementation, sentry is a software module, although sentry 42 may be incorporated into other software components (e.g., applications, operating system, etc.) of a network terminal 40 and 44. Sentry 42 monitors and controls the flow of images at various points in a network system. Such activity is logged (e.g., recorded, stored, etc.) in database 46. To monitor an image transmitted from user terminal 40 to user terminal 44, sentry 42adecodes an embedded watermark identifier from an image to be transferred (step S10, FIG. 5). The identifier, destination address, and optionally a date/time stamp are communicated to database 46 (step S12), where such information is recorded as a data record (or file, log, table, database entry, history, etc.) as in step S14. Preferably such transmission activity is associated with the unique identifier of the transferred image.
[0066] Sentry 42 is also gatekeeper in that it analyzes whether a user's security or permission level is sufficient to receive a watermarked image into or from a workstation (e.g., whether terminal 44 can receive the image transmitted from terminal 40). Sentry 42bpreferably includes (or communicates with) watermark-decoding software, which extracts unique identifiers (and any security bits) from digitally watermarked images (step S20, FIG. 6). If the security level of an image is stored in a database, sentry 42bqueries the database with the identifier to determine the required access level. Or if the watermark includes security bits, then sentry 42bdetermines an access level directly from extracted security bits. Sentry 42bdetermines whether the user's security clearance sufficiently corresponds with the received image's clearance requirements (step S22). If so, sentry 42ballows terminal 44 to receive and open the subject image (step S24). If not, sentry 42bdenies terminal 44 access to the image (step S26). In either case, sentry 42bpreferably communicates such information to database 46 (step S28). For example, sentry 42brecords whether the image is passed to terminal 44, or whether the image is denied. (As an optional function, sentry 42bnotifies terminal 42 regarding the delivery status of the image.).
[0067] Preferably, sentry 42 does not performed the function of managing the relationship between images and their derivatives, as this is the function of the file save software associated with the image editing application. However, in one embodiment, sentry 42 is combined with an application interface.
[0068] Sentry 42 can be deployed in a number of ways. In one embodiment, sentry 42 is integrated (or stored, or connected) to a workstation or server in such a way that all image data must first pass through the sentry 42. In another embodiment, sentry 42 includes a separate hardware (or hardware/software) device inserted between a network (or network connection) and a user terminal. As such, sentry 42 decodes watermarks and intercepts passwords from image traffic before the user terminal receives the image, or directly after transmitting an image.
[0069] In another embodiment, e.g., in a TCP/IP environment, a sentry 42 is deployed as software within a TCP/IP stack in the user station or server. In yet another embodiment, a sentry is incorporated in (or called by) an image-handling program's open, save and close operations.
[0070] When used in connection with a database history or other record, sentry 42 provides efficient tracking and tracing. Since the history file reveals each use (and printing, transmission, etc.) of a watermarked image, the image can be efficiently tracked as it passes from terminal to terminal, or from database to terminal, etc.
[0071] Fragile Watermarks
[0072] Some images may include at least two watermarks. A first watermark includes a unique identifier, as discussed above. This identifier allows database inquires and association as discussed above. A second watermark can be applied prior to printing, faxing, etc. This second watermark preferably includes a so-called fragile watermark. That is, it is designed to be lost, or to degrade predictably, when the data set into which it is embedded is processed in some manner. (Fragile watermark technology is disclosed, e.g., in applications Ser. Nos. 09/234,780, 09/433,104, 09/498,223, No. 60/198,138, Ser. Nos. 09/562,516, 09/567,405, 09/625,577, 09/645,779, and No. 60/232,163. Each of these patent applications is herein incorporated by reference.).
[0073] Once an image is printed, it then includes both the first and second watermarks. If the image is subsequently scanned back into a digital form, e.g., via a scanner, photocopier, web cam, digital camera, etc., the fragile watermark is corrupted (or lost) in a foreseeable manner. Printed copies can be tracked and traced accordingly. For example, a photocopied image is scanned into a digital form. The first watermark is used to identify the image and retrieve an image history (e.g., as created by a sentry or other logging method). Since the fragile watermark is lost (or predictably degraded) in the copy process, the photocopy is determined to be an unauthorized copy. The history log can be used to determine which user (or user terminal) printed the copy.
[0074] Conclusion
[0075] Watermarks can be applied to any data set (e.g., an image, map, picture, document, etc.) for forensic tracking purposes. This is particularly useful where several copies of the same data set are distributed through different channels (e.g., provided to different users). Each can be “serialized” with a different identifier, and a record can be kept of which numbered data set was provided to which distribution channel. Thereafter, if one of the data sets appears in an unexpected context, it can be tracked back to the distribution channel from which it originated.
[0076] In an alternative embodiment, with reference to FIG. 1, a digital watermark embedder is included in aerial platform 11. The aerial embedder embeds images (e.g., after or during capture) and relays such to ground station 12. In yet another embodiment, an image is digitally watermarked downstream from ground station 12, such as in a user terminal, or an embedder associated with the databases 14 and/or 15.
[0077] Although not belabored, artisans will understand that the systems described above can be implemented using a variety of hardware and software systems. One embodiment employs a computer or workstation with a large disk library, and capable database software (such as is available from Microsoft, Oracle, etc.). The watermarking and database operations can be performed in accordance with software instructions stored in the disk library or on other storage media, and executed by a processor in the computer as needed. (Alternatively, dedicated hardware, or programmable logic circuits, can be employed for such operations.). We note that while we have described our hashing and digital watermarking management implementation with reference to images, the present invention is not so limited. Indeed, we can similarly manage audio and video as well with our inventive techniques.
[0078] The various section headings in this application are provided for the reader's convenience and provide no substantive limitations. The features found in one section may be readily combined with those features in another section.
[0079] To provide a comprehensive disclosure without unduly lengthening this specification, the above-mentioned patents and patent applications are hereby incorporated by reference. The particular combinations of elements and features in the above-detailed embodiments are exemplary only; the interchanging and substitution of these teachings with other teachings in this application and the incorporated-by-reference patents/applications are also contemplated.
[0080] It should be appreciated that the present invention is not limited to managing satellite and other aerial imagery. Indeed, other imagery may be managed with the present invention. Also, the present invention encompasses a “non-secure” type of system. In one such embodiment, watermark identifiers are used to link images and/or related information. A security or permission level is not required in such a system.
[0081] In view of the wide variety of embodiments to which the principles and features discussed above can be applied, it should be apparent that the detailed embodiments are illustrative only and should not be taken as limiting the scope of the invention. Rather, we claim as our invention all such modifications as may come within the scope and spirit of the following claims and equivalents thereof.
Claims
What is claimed is:
1. A method of managing images in a database, wherein a first image includes a first identifier steganographically embedded therein, said method comprising the steps of:
providing a first hash of the first image:
uniquely identifying the first image in the database with the first hash of the first image, wherein a second image includes the first identifier steganographically embedded therein; and
in the database, associating the second image with the first image via the first identifier.
2. The method according to claim 1, further comprising the steps of:
providing a first hash of the second image; and
in the database uniquely identifying the second image with the first hash of the second image.
3. The method according to claim 2, wherein the second image comprises a derivative of the first image.
4. A method according to claim 3, wherein related information is associated with at least the first image by the first hash of the first image.
5. The method according to claim 4, wherein the related information comprises at least one of user usage, creation time, transmission, printing, analyst notes, an audit trail, depicted geographic location, image capture time and image checkout.
6. The method according to claim 4, wherein the database comprises a plurality of databases.
7. The method according to claim 4, wherein the related information comprises at least one of metadata, location, date, permission level, security access levels, analyst comments, an audit trail, notes, files, and past usage information.
8. A method of managing a set of images, the set of images including a first image comprising a first identifier steganographically embedded therein in the form of a digital watermark and a second image comprising the first identifier steganographically embedded therein in the form of a digital watermark, said method comprising the steps of:
associating the first image with the set of images by the first identifier;
uniquely identifying the first image within the set of images with a hash of the first image;
associating the second image with the set of images by the first identifier; and
uniquely identifying the second image within the set of images with a hash of the second image.
9. The method according to claim 8, wherein the second image is a derivative of the first image.
10. The method according to claim 9, further comprising the step of storing information related to the first image in the database, wherein the information related to the first image is stored according to the hash of the first image.
11. The method according to claim 10, wherein the information related to the first image comprises at least one of metadata, location, date, permission level, security access levels, an audit trail, analyst comments, notes, files and past usage information.
12. The method according to claim 10, further comprising the step of storing information related to the second image in the database.
13. The method according to claim 12, wherein the information related to the second image is stored according to the hash of the second image.
14. The method according to claim 13, wherein the information related to the first image comprises at least one of metadata, location, date, permission level, security access levels, an audit trail, analyst comments, notes, files and past usage information.
15. A method of managing images, the images including a first image comprising a first identifier steganographically embedded therein in the form of a digital watermark and a second image comprising the first identifier steganographically embedded therein in the form of a digital watermark, said method comprising the steps of:
in a database registry, associating a first hash of the first image with a first data record associated with the first image;
in the database registry, associating a first hash of the second image with a second data record associated with the second image; and
linking the first data record and the second data record with the first digital watermark identifier.
16. A method of indexing a database managed according to the method of claim 15, said method comprising the step of:
interrogating the database registry with the first hash of the first image to locate the first data record.
17. The method of claim 16, further comprising the step of accessing the second data record through the first digital watermark identifier.
18. The method of claim 16, wherein the first data record and the second data record each respectively comprises the first image and the second image.
19. The method of claim 16, wherein the second image is a derivative of the first image.
Patent Citations (104)
| Patent | Date | Inventor | Cited By |
|---|---|---|---|
| US4504910(A) | 1985-03-01 | Araki et al. | Applicant |
| US4631678(A) | 1986-12-01 | Angermuller | Applicant |
| US5214757(A) | 1993-05-01 | Mauney et al. | Applicant |
| US5329108(A) | 1994-07-01 | Lamoure | Applicant |
| US5385371(A) | 1995-01-01 | Izawa | Applicant |
| US5502576(A) | 1996-03-01 | Ramsay et al. | Applicant |
| US5664018(A) | 1997-09-01 | Leighton | Examiner |
| US5812962(A) | 1998-09-01 | Kovac | Applicant |
| US5825892(A) | 1998-10-01 | Braudaway et al. | Applicant |
| US5861841(A) | 1999-01-01 | Gildea et al. | Applicant |
| US5875249(A) | 1999-02-01 | Mintzer et al. | Examiner |
| US5889868(A) | 1999-03-01 | Moskowitz et al. | Examiner |
| US5889898(A) | 1999-03-01 | Koren et al. | Applicant |
| US5901178(A) | 1999-05-01 | Lee et al. | Applicant |
| US5919730(A) | 1999-07-01 | Gasper et al. | Applicant |
| US5958051(A) | 1999-09-01 | Renaud et al. | Applicant |
| US5964821(A) | 1999-10-01 | Brunts et al. | Applicant |
| US5990826(A) | 1999-11-01 | Mitchell | Applicant |
| US6005936(A) | 1999-12-01 | Shimizu et al. | Applicant |
| US6031914(A) | 2000-02-01 | Tewfik et al. | Applicant |
| US6122403(A) | 2000-09-01 | Rhoads | Examiner |
| US6175639(B1) | 2001-01-01 | Satoh et al. | Applicant |
| US6181802(B1) | 2001-01-01 | Todd | Applicant |
| US6185312(B1) | 2001-02-01 | Nakamura et al. | Applicant |
| US6243480(B1) | 2001-06-01 | Zhao et al. | Applicant |
| US6246777(B1) | 2001-06-01 | Agarwal et al. | Applicant |
| US6263438(B1) | 2001-07-01 | Walker et al. | Applicant |
| US6282362(B1) | 2001-08-01 | Murphy et al. | Examiner |
| US6289453(B1) | 2001-09-01 | Walker et al. | Applicant |
| US6301360(B1) | 2001-10-01 | Bocionek et al. | Applicant |
| US6310956(B1) | 2001-10-01 | Morito et al. | Applicant |
| US6311214(B1) | 2001-10-01 | Rhoads | Applicant |
| US6320829(B1) | 2001-11-01 | Matsumoto et al. | Applicant |
| US6324573(B1) | 2001-11-01 | Rhoads | Applicant |
| US6332149(B1) | 2001-12-01 | Warmus et al. | Applicant |
| US6332193(B1) | 2001-12-01 | Glass et al. | Applicant |
| US6341350(B1) | 2002-01-01 | Miyahara et al. | Applicant |
| US6343138(B1) | 2002-01-01 | Rhoads | Applicant |
| US6351439(B1) | 2002-02-01 | Miwa et al. | Applicant |
| US6408082(B1) | 2002-06-01 | Rhoads et al. | Applicant |
| US6408331(B1) | 2002-06-01 | Rhoads | Applicant |
| US6411725(B1) | 2002-06-01 | Rhoads | Applicant |
| US6427020(B1) | 2002-07-01 | Rhoads | Applicant |
| US6493514(B1) | 2002-12-01 | Stocks et al. | Applicant |
| US6498984(B2) | 2002-12-01 | Agnew et al. | Applicant |
| US6504571(B1) | 2003-01-01 | Narayanaswami et al. | Examiner |
| US6505160(B1) | 2003-01-01 | Levy et al. | Applicant |
| US6522770(B1) | 2003-02-01 | Seder et al. | Applicant |
| US6532541(B1) | 2003-03-01 | Chang et al. | Applicant |
| US6542927(B2) | 2003-04-01 | Rhoads | Applicant |
| US2001/0001854(A1) | 2001-05-01 | Schena et al. | Applicant |
| US2001/0019611(A1) | 2001-09-01 | Hilton | Applicant |
| US2001/0022667(A1) | 2001-09-01 | Yoda | Applicant |
| US2001/0026377(A1) | 2001-10-01 | Ikegami | Applicant |
| US2001/0026616(A1) | 2001-10-01 | Tanaka | Applicant |
| US2001/0026629(A1) | 2001-10-01 | Oki | Applicant |
| US2001/0030759(A1) | 2001-10-01 | Hayashi et al. | Applicant |
| US2001/0031064(A1) | 2001-10-01 | Donescu et al. | Applicant |
| US2001/0033674(A1) | 2001-10-01 | Chen et al. | Applicant |
| US2001/0034835(A1) | 2001-10-01 | Smith | Applicant |
| US2001/0039546(A1) | 2001-11-01 | Moore et al. | Applicant |
| US2001/0046307(A1) | 2001-11-01 | Wong | Applicant |
| US2001/0051964(A1) | 2001-12-01 | Warmus et al. | Applicant |
| US2002/0001395(A1) | 2002-01-01 | Davis et al. | Applicant |
| US2002/0002679(A1) | 2002-01-01 | Murakami et al. | Applicant |
| US2002/0006212(A1) | 2002-01-01 | Rhoads et al. | Applicant |
| US2002/0009209(A1) | 2002-01-01 | Inoue et al. | Applicant |
| US2002/0044690(A1) | 2002-04-01 | Burgess | Applicant |
| US2002/0046178(A1) | 2002-04-01 | Morito et al. | Applicant |
| US2002/0059520(A1) | 2002-05-01 | Murakami et al. | Applicant |
| US2002/0069370(A1) | 2002-06-01 | Mack | Applicant |
| US2002/0080396(A1) | 2002-06-01 | Silverbrook et al. | Applicant |
| US2002/0095586(A1) | 2002-07-01 | Doyle et al. | Applicant |
| US2002/0095601(A1) | 2002-07-01 | Hind et al. | Applicant |
| US2002/0122564(A1) | 2002-09-01 | Rhoads et al. | Applicant |
| US2002/0124171(A1) | 2002-09-01 | Rhoads | Applicant |
| US2002/0124173(A1) | 2002-09-01 | Stone | Applicant |
| US2002/0135600(A1) | 2002-09-01 | Rhoads et al. | Applicant |
| US2002/0136531(A1) | 2002-09-01 | Harradine | Applicant |
| US2002/0147910(A1) | 2002-10-01 | Brundage et al. | Applicant |
| US2002/0159765(A1) | 2002-10-01 | Maruyama et al. | Applicant |
| US2002/0168069(A1) | 2002-11-01 | Tehrachi et al. | Applicant |
| US2003/0011684(A1) | 2003-01-01 | Narayanaswami | Applicant |
| US2003/0012562(A1) | 2003-01-01 | Lawandy et al. | Applicant |
| US2003/0032033(A1) | 2003-02-01 | Anglin et al. | Applicant |
| US2003/0040326(A1) | 2003-02-01 | Levy et al. | Applicant |
| US2003/0048908(A1) | 2003-03-01 | Hamilton | Applicant |
| US2003/0053654(A1) | 2003-03-01 | Patterson et al. | Applicant |
| US2003/0069693(A1) | 2003-04-01 | Snapp et al. | Applicant |
| US2003/0074556(A1) | 2003-04-01 | Chapman et al. | Applicant |
| US2003/0090690(A1) | 2003-05-01 | Katayama et al. | Applicant |
| DE953938(A2) | 1999-03-01 | Examiner | |
| EP947953 | 1999-10-01 | Applicant | |
| EP953938 | 1999-11-01 | Applicant | |
| EP935872 | 2001-11-01 | Applicant | |
| GB947953(A2) | 1999-06-01 | Examiner | |
| JP200041144 | 2000-02-01 | Applicant | |
| WO99/17537 | 1999-04-01 | Applicant | |
| WO1/05075 | 2001-01-01 | Applicant | |
| WO1/24113 | 2001-04-01 | Applicant | |
| WO1/39121 | 2001-05-01 | Applicant | |
| WO1/76253 | 2001-10-01 | Applicant | |
| WO2/03328 | 2002-01-01 | Applicant | |
| WO2/33650 | 2002-04-01 | Applicant |
Non-Patent Literature (16)
- Natarjan, The Watermarking of Digital Object, Apr. 8, 1999, PCT, H04N 1/32.Applicant
- Seybold Seminars: Keynote: Digital Imaging Day, comments from panel including Daniel Carp, panel discussion occurring on Aug. 28, 2000 (8 pages).Applicant
- http://web.archive.org/web/2001030503324/http://www.kodak.com/country/US/en/corp/researchDevelopment/technologyFeatures/digitalWatermarking.shtml, “Invisible Watermarking”, archive date of Mar. 5, 2001 (4 pages, including Internet Archive Wayback Machine cover page).Applicant
- Daniel A. Carp, “Seven wonders of the imaging world”, International Contact, Oct./Nov. 2000, pp. 36/I-36/IV.Applicant
- “Digiital Watermarking, The Unseen Advantage” Geo Informatics, Jun. 2001 (3 pages).Applicant
- U.S. patent application Ser. No. 09/571,422, Rhoads et al., filed May 15, 2000.Applicant
- U.S. patent application Ser. No. 09/503,881, Rhoads et al., filed Feb. 14, 2000.Applicant
- U.S. patent application Ser. No. 10/371,995, Rhoads et al., filed Feb. 20, 2003.Applicant
- Bender et al., “Techniques for Data Hiding,” SPIE vol. 2420, Jan. 1995, pp. 164-173.Applicant
- Caronni, “Assuring Ownership Rights for Digital Images,” Published in the Proceedings of ‘Reliable IT Systems,’ VIS '95, HH. Brüggemann and W. Gerhardt-Häckl (Ed.), Vieweg Publishing Company, Germany, 1995, Jun. 14, 1994, 10 pages.Applicant
- Friedman, “The Trustworthy Digital Camera: Restoring Credibility to the Photographic Image,” IEEE Transactions on Consumer Electronics, vol. 39, No. 4, Nov., 1993, pp. 905-910.Applicant
- Koch et al., “Digital Copyright Labeling: Providing Evidence of Misuse and Tracking Unauthorized Distribution of Copyrighted Materials,” OASIS Magazine, Dec. 1995, 3 pages.Applicant
- Manjunath, “Image Processing in the Alexandria Digital Library Project,” Proc. IEEE Int. Form on Research and Tech. Advances in Digital Libraries—ADL '98, pp. 180-187.Applicant
- Yeung et al., “Digital Watermarks: Shedding Light on the Invisible,” Nov.-Dec. 1998, IEEE Micro vol. 18, No. 6, pp. 32-41.Applicant
- Zhao et al., “Embedding Robust Labels Into Images for Copyright Protectioon,” Proc. of the International Congress on Intellectual Property Rights for Specialized Information, Knowledge and New Technologies (Vienna, Austria) Aug. 21-25, 1995, 10 pages.Applicant
- Zhao, “Digital Watermark Mobile Agents,” Proc. of NISSC'99, Arlington, VA, Oct. 18-21, 1999, pp. 138-146.Applicant