Выделить слова: 


Патент США №

8085976

Автор(ы)

Rhoads

Дата выдачи

27 декабря 2011 г.


Digital watermarking video captured from airborne platforms



РЕФЕРАТ

Digital watermarking technology is used in conjunction with video captured from airborne platforms (e.g., satellites, remotely controlled aerial vehicles and aircraft). One claim recites an airborne platform comprising: a camera for capturing video depicting at least a portion of the earth's surface; and an electronic processor. The electronic processor is programmed for: obtaining geographical metadata associated with captured video; encoding first digital watermarking in the captured video through alterations to data representing the captured video, in which the first digital watermarking is generally imperceptible to a human observer of the captured video when rendered to the human observer in real time, and in which the first digital watermarking comprises or links to the geographical metadata; and controlling transmission of digital watermarked video to a remotely located receiver on or in the earth's surface. Another claim recites: that the electronic processor is further programmed for: hiding second digital watermarking in data representing the captured video, the second digital watermarking comprising a plural-bit payload that includes data representing a refinement relative to at least some of the geographical metadata. Other claims and combinations are provided too.


Авторы:

Geoffrey B. Rhoads (West Linn, OR)

Заявитель:

Digimarc Corporation (Beaverton, OR)

ID семейства патентов

25177465

Номер заявки:

12/687,687

Дата регистрации:

14 января 2010 г.

Prior Publication Data

Document IdentifierPublication Date
US 20100226528 A1Sep 9, 2010

Отсылочные патентные документы США


Application NumberFiling DatePatent NumberIssue Date
11465405Aug 17, 20067650008
10778762Feb 13, 20047099492
09800093Mar 5, 20017061510

Класс патентной классификации США:

382/100

Класс совместной патентной классификации:

G06F 16/7854 (20190101); G06F 16/58 (20190101); H04N 1/32203 (20130101); H04N 1/32299 (20130101); G06T 1/0021 (20130101); G06F 16/29 (20190101); H04N 1/32304 (20130101); G01C 11/00 (20130101); H04N 1/32154 (20130101); H04N 2201/3253 (20130101); H04N 2201/3252 (20130101)

Класс международной патентной классификации (МПК):

G06K 9/00 (20060101)

Область поиска:

;382/100

Использованные источники

[Referenced By]

Патентные документы США

4232313November 1980Fleishman
4504910March 1985Araki et al.
4631678December 1986Angermiiller
4789962December 1988Berry et al.
4805020February 1989Greenberg
4807031February 1989Broughton et al.
4969041November 1990O'Grady et al.
5113445May 1992Wang
5214757May 1993Mauney et al.
5280537January 1994Sugiyama et al.
5329108July 1994Lamoure
5385371January 1995Izawa
5410598April 1995Shear
5481294January 1996Thomas et al.
5499294March 1996Friedman
5502576March 1996Ramsay et al.
5640193June 1997Wellner
5664018September 1997Leighton
5748362May 1998Delacourt et al.
5748763May 1998Rhoads
5761606June 1998Wolzien
5764770June 1998Schipper et al.
5799082August 1998Murphy et al.
5809139September 1998Girod et al.
5812962September 1998Kovac
5822436October 1998Rhoads
5825892October 1998Braudaway et al.
5841978November 1998Rhoads
5848373December 1998DeLorme et al.
5861841January 1999Gildea et al.
5864623January 1999Messina et al.
5875249February 1999Mintzer et al.
5889868March 1999Moskowitz et al.
5889898March 1999Koren et al.
5901178May 1999Lee et al.
5909673June 1999Gregory
5919730July 1999Gasper et al.
5943422August 1999Van Wie et al.
5958051September 1999Renaud et al.
5964821October 1999Brunts et al.
5987136November 1999Schipper et al.
5990826November 1999Mitchell
5995681November 1999Lee et al.
6005501December 1999Wolosewicz
6005936December 1999Shimizu
6031914February 2000Tewfik et al.
6069914May 2000Cox
6081827June 2000Reber et al.
6088394July 2000Maltby
6122403September 2000Rhoads
6130741October 2000Wen et al.
6148091November 2000DiMaria
6175639January 2001Satoh et al.
6181802January 2001Todd
6185312February 2001Nakamura et al.
6199048March 2001Hudetz et al.
6205249March 2001Moskowitz
6243480June 2001Zhao et al.
6246777June 2001Agarwal et al.
6249226June 2001Harrison
6263438July 2001Walker et al.
6266430July 2001Rhoads
6282362August 2001Murphy et al.
6282648August 2001Walker et al.
6286036September 2001Rhoads
6289453September 2001Walker
6301360October 2001Bocionek et al.
6310956October 2001Morito et al.
6311214October 2001Rhoads
6320829November 2001Matsumoto et al.
6324573November 2001Rhoads
6332149December 2001Warmus et al.
6332193December 2001Glass et al.
6341350January 2002Miyahara et al.
6343138January 2002Rhoads
6351439February 2002Miwa et al.
6381418April 2002Spurr et al.
6389151May 2002Carr et al.
6401206June 2002Khan et al.
6408082June 2002Rhoads et al.
6408331June 2002Rhoads
6411725June 2002Rhoads
6418232July 2002Nakano et al.
6427020July 2002Rhoads
6448979September 2002Schena
6463416October 2002Messina
6493514December 2002Stocks et al.
6496802December 2002van Zoest
6498984December 2002Agnew et al.
6504571January 2003Narayanaswami et al.
6505160January 2003Levy et al.
6507890January 2003Morley et al.
6512835January 2003Numao et al.
6512857January 2003Hsu et al.
6522770February 2003Seder et al.
6526155February 2003Wang et al.
6529615March 2003Hendrickson et al.
6532541March 2003Chang et al.
6542927April 2003Rhoads
6556688April 2003Ratnakar
6611607August 2003Davis et al.
6614914September 2003Rhoads et al.
6625297September 2003Bradley
6636249October 2003Rekimoto
6650761November 2003Rodriguez et al.
6650877November 2003Tarbouriech et al.
6664976December 2003Lofgren et al.
6674993January 2004Tarbouriech
6675165January 2004Rothschild
6694043February 2004Seder et al.
6741790May 2004Burgess
6748362June 2004Meyer et al.
6811113November 2004Silansky et al.
6829430December 2004Ashizaki et al.
6894794May 2005Patton et al.
6947571September 2005Rhoads et al.
6950519September 2005Rhoads
6961441November 2005Hershey et al.
6987862January 2006Rhoads
6993152January 2006Patterson et al.
7010144March 2006Davis et al.
7042470May 2006Rhoads et al.
7061510June 2006Rhoads
7084903August 2006Narayanaswami et al.
7088843August 2006Pelly
7095871August 2006Jones et al.
7098931August 2006Patterson et al.
7099492August 2006Rhoads
7184572February 2007Rhoads et al.
7197160March 2007Rhoads et al.
7209571April 2007Davis et al.
7249257July 2007Brundage et al.
7254249August 2007Rhoads et al.
7289643October 2007Brunk et al.
7321667January 2008Stach
7333957February 2008Levy et al.
7349552March 2008Levy et al.
7372976May 2008Rhoads et al.
7437430October 2008Rhoads
7450734November 2008Rodriguez et al.
7460726December 2008Levy et al.
7502489March 2009Rhoads
7502490March 2009Rhoads et al.
7506169March 2009Brundage et al.
7532741May 2009Stach
7562392July 2009Rhoads et al.
7590259September 2009Levy et al.
7650008January 2010Rhoads
7650010January 2010Levy et al.
7657057February 2010Davidson et al.
7702511April 2010Rhoads
7711564May 2010Levy et al.
7792325September 2010Rhoads et al.
7930546April 2011Rhoads et al.
2001/0001854May 2001Schena et al.
2001/0019611September 2001Hilton
2001/0022667September 2001Yoda
2001/0023421September 2001Messina
2001/0026377October 2001Ikegami
2001/0026616October 2001Tanaka
2001/0026629October 2001Oki
2001/0030759October 2001Hayashi et al.
2001/0031064October 2001Donescu et al.
2001/0033674October 2001Chen et al.
2001/0034835October 2001Smith
2001/0039546November 2001Moore et al.
2001/0046307November 2001Wong
2001/0051964December 2001Warmus et al.
2002/0001395January 2002Davis et al.
2002/0002679January 2002Murakami et al.
2002/0006212January 2002Rhoads et al.
2002/0009209January 2002Inoue et al.
2002/0044690April 2002Burgess
2002/0046178April 2002Morito et al.
2002/0057340May 2002Fernandez
2002/0059520May 2002Murakami et al.
2002/0065844May 2002Robinson
2002/0069370June 2002Mack
2002/0075298June 2002Schena et al.
2002/0080396June 2002Silverbrook et al.
2002/0095586July 2002Doyle et al.
2002/0095601July 2002Hind et al.
2002/0106105August 2002Pelly et al.
2002/0122564September 2002Rhoads et al.
2002/0124171September 2002Rhoads
2002/0124173September 2002Stone
2002/0126869September 2002Wang et al.
2002/0135600September 2002Rhoads et al.
2002/0136531September 2002Harradine
2002/0147910October 2002Brundage et al.
2002/0159765October 2002Maruyama et al.
2002/0168069November 2002Tehranchi et al.
2002/0191810December 2002Fudge et al.
2003/0011684January 2003Narayanaswami et al.
2003/0012562January 2003Lawandy et al.
2003/0032033February 2003Anglin et al.
2003/0040326February 2003Levy et al.
2003/0048908March 2003Hamilton
2003/0053654March 2003Patterson et al.
2003/0063319April 2003Umeda et al.
2003/0069693April 2003Snapp et al.
2003/0074556April 2003Chapman et al.
2003/0083098May 2003Yamazaki et al.
2003/0090690May 2003Katayama et al.
2003/0120940June 2003Vataja
2003/0215110November 2003Rhoads et al.
2004/0005078January 2004Tillotson
2004/0046774March 2004Rhoads et al.
2004/0162981August 2004Wong
2004/0201676October 2004Needham
2004/0221244November 2004Baldino
2004/0223626November 2004Honsinger et al.
2005/0025335February 2005Bloom et al.
2005/0030588February 2005Reese et al.
2005/0086585April 2005Walmsley et al.
2005/0154924July 2005Scheidt et al.
2005/0276440December 2005Rhoads et al.
2006/0026140February 2006King et al.
2007/0052730March 2007Patterson et al.
2007/0116325May 2007Rhoads et al.
2008/0025561January 2008Rhoads et al.
2008/0080737April 2008Rhoads et al.
2010/0067734March 2010Rhoads
2010/0205445August 2010Anglin et al.

Зарубежные патентные документы

0 947 953Oct 1999EP
0 953 938Nov 1999EP
935 872Nov 2001EP
1220152Jul 2002EP
2371934Aug 2002GB
2000 41144Feb 2000JP
WO99/17537Apr 1999WO
WO 2000/56058Sep 2000WO
WO 01/05075Jan 2001WO
WO01/24113Apr 2001WO
WO01/39121May 2001WO
WO01/76253Oct 2001WO
WO02/03328Jan 2002WO
WO02/33650Apr 2002WO

Другие источники


Notice of Allowance (dated Dec. 17, 2004), Appeal Brief (dated Sep. 20, 2004) and Office Action (dated May 7, 2004) from parent U.S. Appl. No. 09/800,093. cited by other .
Notice of Allowance (dated Dec. 17, 2004), Appeal Brief (dated Sep. 20, 2004) and Office Action (dated May 14, 2004) from assignee's patent U.S. Appl. No. 10/002,954. cited by other .
Apr. 27, 2006 Appeal Brief and Nov. 25, 2005 final Office Action, each from assignee's U.S. Appl. No. 09/833,013. cited by other .
Aug. 30, 2006 Amendment and Aug. 23, 2006 Office Action, each from Assignee's U.S. Appl. No. 10/423,489 (published as US 2004-0046774 A1). cited by other .
Jan. 5, 2007 Amendment and Oct. 6, 2006 Office Action, each from Assignee's U.S. Appl. No. 10/371,995 (published as US 2003-0215110 A1). cited by other .
Bender et al., "Techniques for Data Hiding," SPIE vol. 2420, Jan. 1995, pp. 164-173. cited by other .
Berger, et al., "Watermarking in JPEG Bitstream," in Security, Steganography, and Watermarking of Multimedia Contents VII, edited by Edward J. Delp III, Ping Wah Wong, Proceeding of SPIE-IS&T Electronic Imaging, SPIE vol. 5681, pp. 539-548, 2005. cited by other .
Caronni, "Assuring Ownership Rights for Digital Images," Published in the Proceedings of 'Reliable IT Systems,' VIS '95, HH. Bruggemann and W. Gerhardt-Hackl (Ed.), Vieweg Publishing Company, Germany, 1995, Jun. 14, 1994, 10 pages. cited by other .
Carp, "Seven wonders of the imaging world", International Contact, Oct./Nov. 2000, pp. 36/I-36/IV. cited by other .
"Digital Watermarking, The Unseen Advantage," Geo Informatics, Jun. 2001 (3 pages). cited by other .
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. cited by other .
http://web.archive.org/web/20010305033241/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). cited by other .
Jauregui et al., "A procedure for map updating using digital mono-plotting and DTMs," IAPRS, vol. 32, Part 4 "GIS-Between Visions and Application," Stuttgart, 1998. cited by other .
Koch et al., "Digital Copyright Labeling: Providing Evidence of Misuse and Tracking Unauthorized Distribution of Copyrighted Materials," OASIS Magazine, Dec. 1995, 3 pages. cited by other .
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. cited by other .
Seybold Seminars: Keynote: Digital Imaging Day, comments from panel including Daniel Carp, panel discussion occurring on Aug. 28, 2000 (8 pages). cited by other .
Yeung et al., "Digital Watermarks: Shedding Light on the Invisible," Nov.-Dec. 1998, IEEE Micro vol. 18, No. 6, pp. 32-41. cited by other .
Zhao et al., "Embedding Robust Labels Into Images for Copyright Protection," Proc. of the International Congress on Intellectual Property Rights for Specialized Information, Knowledge and New Technologies (Vienna, Austria) Aug. 21-25, 1995, 10 pages. cited by other .
Zhao, "Digital Watermark Mobile Agents," Proc. of NISSC'99, Arlington, VA, Oct. 18-21, 1999, pp. 138-146. cited by other .
Zhao, "A WWW Service to Embed and Prove Digital Copyright Watermarks," In Proc. of the European Conf. on Multimedia Applications, Services and Techniques, Louvain-La-Neuve, Belgium, May 1996, 15 pages. cited by other.

Главный эксперт: Bella; Matthew C
Assistant Examiner: Rosario; Dennis

Текст решения-прецедента




RELATED APPLICATION DATA

This application is a continuation of U.S. patent application Ser. No. 11/465,405, filed Aug. 17, 2006 (now U.S. Pat. No. 7,650,008) which is a continuation of U.S. patent application Ser. No. 10/778,762, filed Feb. 13, 2004 (now U.S. Pat. No. 7,099,492). The Ser. No. 10/778,762 application is a division of U.S. patent application Ser. No. 09/800,093, filed Mar. 5, 2001 (now U.S. Pat. No. 7,061,510). The above U.S. Patent documents are hereby incorporated by reference.

ФОРМУЛА ИЗОБРЕТЕНИЯ



What is claimed is:

1. A method of controlling an airborne platform, comprising: controlling capture of video depicting at least a portion of the earth's surface, wherein the video is captured by a camera on the airborne platform; obtaining geographical metadata associated with at least captured video; controlling encoding of first digital watermarking in the video through alterations to data representing the captured video, wherein the first digital watermarking is generally imperceptible to a human observer of the captured video when rendered to the human observer, and wherein the first digital watermarking comprises or links to the geographical metadata; controlling encoding of second digital watermarking in the video, wherein the second digital watermarking comprises a plural-bit payload that includes data representing a refinement to the geographical metadata; and controlling transmission of the second digital watermarked video to a remotely located receiver on or in the earth's surface.

2. The method of claim 1, wherein the first digital watermarking comprises a plural-bit payload including at least some of the geographical metadata associated with the captured video.

3. The method of claim 1, wherein the geographical metadata comprises at least a camera viewing angle.

4. The method of claim 1, wherein the geographical metadata comprises at least camera attributes.

5. The method of claim 1, wherein the geographical metadata comprises at least an acquisition date and time.

6. The method of claim 1, wherein the geographical metadata comprises at least an identifier associated with the airborne platform.

7. The method of claim 1, wherein the geographical metadata comprises at least a geo-referenced position.

8. The method of claim 7, wherein the geo-referenced position is conveyed in terms of at least latitude and longitude.

9. The method of claim 7, wherein the geo-referenced position corresponds to at least some of the portion of the earth's surface depicted in the video.

10. The method of claim 1, wherein the geographical metadata comprises a first geolocation and a second geolocation, and wherein the first geolocation and the second geolocation respectively correspond to a first location and a second location depicted in the video.

11. The method of claim 1, wherein the airborne platform comprises a satellite, unmanned aerial vehicle, or aircraft.

12. The method of claim 1, wherein the data representing the captured video comprises data representing compressed captured video.

13. An airborne platform comprising: a camera configured to capture video depicting at least a portion of the earth's surface; and a processor configured to: obtain geographical metadata associated with captured video; encode first digital watermarking in the captured video through alterations to data representing the captured video, wherein the first digital watermarking is generally imperceptible to a human observer of the captured video when rendered to the human observer in real time, and wherein the first digital watermarking comprises or links to the geographical metadata; hide second digital watermarking data representing the captured video, wherein the second digital watermarking comprises a plural-bit payload that includes data representing a refinement relative to at least some of the geographical metadata; and control transmission of the second digital watermarked video to a remotely located receiver on or in the earth's surface.

14. The airborne platform of claim 13, wherein the geographical metadata comprises a first geolocation and a second geolocation, and wherein the first geolocation and the second geolocation respectively correspond to a first location and a second location depicted in the captured video.

15. The airborne platform of claim 13, wherein the airborne platform comprises a satellite, unmanned aerial vehicle, or aircraft.

16. The airborne platform of claim 13, wherein the data representing the captured video comprises data representing compressed captured video.

17. The airborne platform of claim 13, wherein the first digital watermarking comprises a plural-hit payload including at least some of the geographical metadata associated with the captured video.

18. The airborne platform of claim 13, wherein the geographical metadata comprises at least camera attributes.

19. The airborne platform of claim 13, wherein the geographical metadata comprises at least an identifier associated with the airborne platform.

20. The airborne platform of claim 13, wherein the geographical metadata comprises at east a geo-referenced position.


ОПИСАНИЕ




ОБЛАСТЬ ТЕХНИКИ, К КОТОРОЙ ОТНОСИТСЯ ИЗОБРЕТЕНИЕ



The present invention relates to image management and processing, and is particularly illustrated in the context of near real-time management of satellite and other aerial imagery, and automatic revision of map data based on such imagery.

BACKGROUND AND SUMMARY OF THE INVENTION

Acquisition of aerial imagery traces its history back to the Wright brothers, and is now commonly performed from satellite and space shuttle platforms in addition to aircraft.

While the earliest aerial imagery relied on conventional film 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.

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.

For expository convenience, the present invention is particularly illustrated in the context of a Digital Elevation Model (DEM). A DEM, essentially, is an "elevation map" of the earth (or part thereof). One popular DEM is maintained by the U.S. Geological Survey and details terrain elevations at regularly spaced intervals over most of the U.S. More sophisticated DEM databases are maintained for more demanding applications, and can consider details such as the earth's pseudo pear shape, in addition to more localized features. Resolution of sophisticated DEMs can get well below one meter cross-wise, and down to centimeters or less in actual elevation. DEMs--with their elevation data--are sometimes supplemented by albedo maps (sometimes termed texture maps, or reflectance maps) that detail, e.g., a grey scale value for each pixel in the image, conveying a photographic-like representation of an area.

There is a large body of patent literature that illustrates DEM systems and technology. For example:

U.S. Pat. No. 5,608,405 details a method of generating a Digital Elevation Model from the interference pattern resulting from two co-registered synthetic aperture radar images.

U.S. Pat. No. 5,926,581 discloses a technique for generating a Digital Elevation Model from two images of ground terrain, by reference to common features in the two images, and registration mapping functions that relate the images to a ground plane reference system.

U.S. Pat. Nos. 5,974,423, 6,023,278 and 6,177,943 disclose techniques by which a Digital Elevation Model can be transformed into polygonal models, thereby reducing storage requirements, and facilitating display in certain graphics display systems.

U.S. Pat. Nos. 5,995,681 and 5,550,937 detail methods for real-time updating of a Digital Elevation Model (or a reference image based thereon), and are particularly suited for applications in which the terrain being mapped is not static but is subject, e.g., to movement or destruction of mapped features. The disclosed arrangement iteratively cross-correlates new image data with the reference image, automatically adjusting the geometry model associated with the image sensor, thereby accurately co-registering the new image relative to the reference image. Areas of discrepancy can be quickly identified, and the DEM/reference image can be updated accordingly.

U.S. Pat. No. 6,150,972 details how interferometric synthetic aperture radar data can be used to generate a Digital Elevation Model.

From systems such as the foregoing, and others, a huge quantity of aerial imagery is constantly being collected. Management and coordination of the resulting large data sets is a growing problem.

In accordance with one aspect of the present invention, digital watermarking technology is employed to help track such imagery, and can also provide audit trail, serialization, anti-copying, and other benefits.

In accordance with another aspect of the invention, incoming imagery is automatically geo-referenced and combined with previously-collected data sets so as to facilitate generation of up-to-date DEMs and maps.

The foregoing and additional features and advantages of the present invention will be more readily apparent from the following detailed description.


КРАТКОЕ ОПИСАНИЕ РИСУНКОВ



FIG. 1 shows a flow chart of steganographically embedding auxiliary data in imagery.

FIG. 2 shows a flow chart of steganographically hiding information in media.

FIG. 3 shows a flow chart of steganographically hiding or embedding information in an image or media, including an act of decoding first information hidden or embedded in the media or image.

FIG. 4 shows a flow chart of steganographically hiding or embedding second information in media or an image, including overlaying the first information.

FIG. 5 shows a flow chart of steganographically hiding or embedding second information in media or an image, including overwriting the first information.


ПОДРОБНОЕ ОПИСАНИЕ



(For expository convenience, the following specification focuses on satellite "imagery" to illustrate the principles of the invention. The principles of the invention, however, are equally applicable to other forms of aerial surveillance data and other topographic/mapping information. Accordingly, the term "image" should be used to encompass all such other data sets, and the term "pixel" should be construed to encompass component data from such other data sets.)

When new aerial imagery is received, it is generally necessary to identify the precise piece of earth to which it corresponds. This operation, termed "georeferencing" or "geocoding," can be a convoluted art and science.

In many systems, the georeferencing begins with a master reference system (e.g., latitude and longitude) that takes into account the earth's known deformities from a sphere. Onto this reference system the position of the depicted region is inferred, e.g., by consideration of the satellite's position and orientation (ephemeris data), optical attributes of the satellite's imaging system, and models of the dispersion/refraction introduced by the earth's atmosphere.

In applications where precise accuracy is required, the foregoing, "ephemeris," position determination is refined by comparing features in the image with the placement of known features on the earth's surface (e.g., buildings and other man-placed objects, geological features, etc.) and compensating the georeference determination accordingly. Thus, for example, if the actual latitude and longitude of a building is known (e.g., by measurement from a ground survey--"ground truth"), and the corresponding latitude and longitude of that building as indicated in the georeferenced satellite imagery is different, the reference system applied to the satellite data can be altered to achieve a match. (Commonly, three or more such ground truth points are used so as to assure accurate correction.)

Ground-truthing is a tedious undertaking. While computer methods can be used to facilitate the process, the best ground truth correction of imagery generally requires some human involvement. This is impractical for many applications.

Let us consider the basic principle of cost/meter as a useful metric, and imagine that various applications for exploiting satellite data are willing to pay different amounts in order to achieve given levels of geocoding accuracy. The following disclosure hypothesizes that there are ways (possibly novel, alluding to the idea that the author lacks detailed knowledge of the state of the art, and presumes no novelty nor lack thereof) to utilize all collected satellite data, properly identified and stored as a huge intercorrelated reference system--itself anchored by ground truth data--as a means to automatically geocode incoming raw pixels to the massive overall data set. The accuracy of this automated geocoding would hopefully be higher than that obtainable from ephemeris-type systems alone, but would probably be less accurate than "manually instigated" precision geocoding based directly on ground truth. The hope and goal would be that a lower core cost/meter geocoding accuracy could be achieved.

Such a system may involve the following elemental components: 1) An ideal sphere with an arbitrary time origin (as the starting point for the DEM model) 2) A time-evolving DEM 3) A time-evolving master-correlate albedo texture map

3A) A finite layered index map, organizing current raw data contributors to map 4) Ground Truth Data 5) Nominal ephemeris data per contiguous datastream

The ongoing automation process includes: 1) Creating initial sphere, DEM, and texture map using existing ground truth 2) Creating a layered index map 3) Each newly acquired datastream is cloud-masked, DEM-projection-and refraction-corrected 4) The masked-corrected data--using nominal ephemeris data as a starting point--is correlated to a master DEM/albedo map, itself projected along nominal ephemeris 5) The quality of the new data is evaluated, and incrementally added to the master albedo map and index map if it is deemed acceptable

5A) a pseudo infinite impulse response (based on time and quality of data) in coming up with current albedo map pixel value (omnidirectional pixel value)

At the core of building the albedo-map (and also the DEM) is the need to always track its inputs for several reasons: redundant checking for accuracy and veracity of inputs; indexing of what data is contributing to the master albedo map; coordination of data from similar or even vastly different sources, all contributing to either the master maps or to existing relational databases. As detailed below, watermarking can play an important role in the achieving these objects.

The foregoing will be clearer from the following.

Consider an illustrative DEM system with a 10 meter horizontal resolution, and featuring continual refresh and georeferencing. At two bytes per pixel, and a model size of 4M by 2M pixels, the model comprises 16 Terabytes of data. The albedo map is on the same order of resolution, with the same data storage requirements. The database storing this information desirably is arranged to easily graph necessary correlation scenes.

Presume an existing master DEM and albedo map. These may have been formed by a dozen or more redundant component data sets (e.g., aerial images, ground surveys), acquired over the previous days, months or years, that have been composited together to yield the final DEM/map ("model").

Now imagine a new satellite image is acquired corresponding to part of the region represented by the master model. The particular terrain depicted by the satellite image can be inferred from ephemeris and other factors, as noted above. By such techniques, the location of the depicted image on the earth's surface (e.g., the latitude and longitude of a point at the center of the image) may be determined within an error of, say 5-500 meters. This is a gross geo-referencing operation.

Next a fine geo-referencing operation is automatically performed, as follows. An excerpt of the master model is retrieved from the database--large enough to encompass the new image and its possible placement error (e.g., an area centered on the same latitude/longitude, but extending 250 meters further at each edge). A projective image is formed from this master DEM/map excerpt, considering, e.g., the satellite's position and atmospheric effects, thereby simulating how the master model would look to the satellite, taking into account--where possible--the particular data represented by the satellite image, e.g., the frequency bands imaged, etc. (The albedo map may be back-projected on the 3D DEM data in some arrangements to augment the realism of the projective image.)

The projective image formed from the master DEM/map excerpt differs somewhat from the image actually acquired by the satellite. This difference is due, in part, to the error in the gross geo-referencing. (Other differences may arise, e.g., by physical changes in the region depicted since the master DEM/map was compiled.)

The projective image is next automatically correlated with the satellite image. A variety of known mathematical techniques can be utilized in this operation, including dot product computation, transforming to spatial frequency domain, convolution, etc. In a lay sense, the correlation can be imagined as sliding one map over the other until the best registration between the two images is obtained.

From the correlation operation, the center-to-center offset between the excerpt of the master DEM/map, and the satellite image, is determined. The satellite image can thereby be accurately placed in the context of the master model. Depending on system parameters, a fine placement accuracy of, e.g., between 5 cm and 5 meters (i.e., sub-pixel accuracy) may be achieved.

(In some embodiments, affine transformations can be applied to the satellite data to further enhance the correlation. E.g., particular geological or other features in the two data sets can be identified, and the satellite data (e.g., map or image) can then be affine-transformed so that these features correctly register.)

With the satellite image thus finely geo-referenced to the master DEM/map, it can be transformed (e.g., resampled) as necessary to correspond to the (typically rectilinear) reference system used in the master model, and then used to refine the data represented in the model. Buildings or other features newly depicted in the satellite image, for example, can be newly represented in the master model. The master model can be similarly updated to account for erosion and other topological changes revealed by the new satellite image.

Part of the finely geo-referenced satellite data may be discarded and not added to the master model, e.g., due to cloud cover or other obscuring phenomena. The remaining data is assessed for its relative quality, and this assessment is used in determining the relative weight that will be given the new satellite data in updating the master model.

In one embodiment, the finely geo-referenced satellite data is segmented into regions, e.g., rectangular patches corresponding to terrain 1000 meters on a side, and each patch is given its own weighting factor, etc. In a system with 10 meter resolution (i.e., a pixel size of 10 m.sup.2, the patch thus comprises an array of 100.times.100 pixels. (In some embodiments, the fine geo-referencing is done following the segmentation of the image, with each patch separately correlated with a corresponding area in the master model.) Each patch may take the form of a separate data file.

When the new satellite data is added to update the master model, old data may be discarded so that it no longer influences the model. Consider an area that is imaged monthly by a satellite. Several months' worth of image data may be composited to yield the master model (e.g., so cloud cover that obscured a region in the latest fly-over does not leave part of the model undefined). As each component image data gets older, it may be given less and less weight, until it no longer forms any part of the master model. (Other component data, in contrast, may be retained for much longer periods of time. Map information collected by ground surveys or other forms of "ground truth" information may fall into this category.)

The master model may be physically maintained in different ways. In one exemplary arrangement, a database stores the ten sets of data (e.g., acquired from different sources, or at different times) for each 1000.times.1000 meter patch. When interrogated to produce a map or other data, the database recalls the 10 data sets for each patch, and combines them on the fly according to associated weighting factors and other criteria (e.g., viewing angle) to yield a net representation for that patch. This composite patch is then combined (e.g., graphically stitched) with other adjoining, similarly-formed composite patches, to yield a data set representing the desired area.

In another embodiment, the component sets of image data are not separately maintained. Rather, each new set of image data is used to update a stored model. If the new image data is of high quality (e.g., good atmospheric seeing conditions, and acquired with a high resolution imaging device), then the new data may be combined with the existing model with a 20/80 weighting (i.e., the existing model is given a weight four-times that of the new data). If the new image data is of low quality, it may be combined with the existing model with a 5/95 weighting. The revised model is then stored, and the new data needn't thereafter be tracked.

(The foregoing examples are gross simplifications, but serve to illustrate a range of approaches.)

The former arrangement--with the component data stored--is preferred for many applications, since the database can be queried to yield different information. For example, the database can be queried to generate a synthesized image of terrain as it would look at a particular time of day, imaged in a specified IR frequency band, from a specified vantage point.

It will be recognized that a key requirement--especially of the former arrangement--is a sophisticated data management system. For each data set representing a component 1000.times.1000 meter patch stored in the database, a large quantity of ancillary data (meta data) must be tracked. Among this meta data may be a weighting factor (e.g., based on seeing conditions and sensor attributes), an acquisition date and time (from which an age-based weighting factor may be determined), the ID of the sensor/satellite that acquired that data, ephemeris data from the time of acquisition, the frequency band imaged, the geo-referenced position of the patch (e.g., latitude/longitude), etc., etc. (Much of this Data May be Common to all Patches from a Single Image.)

Classically, each component source of data to the system (here referred to as an "image" for expository convenience) is associated with a unique identifier. Tapes and data files, for example, may have headers in which this identifier is stored. The header may also include all of the meta data that is to be associated with that file. Or the identifier can identify a particular database record at which the corresponding meta data is stored. Or hybrid approaches can be used (e.g., the header can include a file identifier that identifies a data base record, but also includes data specifying the date/time of data acquisition).

In the final analysis, any form of very reliable image identification may suffice for use in such a system. The header approach just-discussed is straightforward. Preferable, however, is to embed one or more identifiers directly into the image data itself (i.e., "in band" steganographic encoding using digital watermarking). A well-designed watermarking name-space can in fact become a supra-structure over several essentially independent serial numbering systems already in use across a range of satellite sources. Moreover, rudimentary georeferencing information can actually be embedded within the watermark name-space.

For example, on initial acquisition, an initial watermark can be applied to satellite imagery detailing the ephemeris based gross georeferencing. Once the image has been finely georeferenced, the existing watermark can either be overlaid or overwritten with a new watermark containing the georeferencing information (e.g., "center lat: N34.432-4352, long: W87.2883134; rot from N/S: 3.232; x2.343, y2.340, dx0.123, dy493, etc."). These numbers essentially encode georeferencing info including projective and atmospheric distortions, such that when this image is DEM-projection corrected, high accuracy should be achieved.

Another way to explain the need for watermarking might be the following: Pity the first grade teacher who has a class of young upstarts who demand a lengthy dissertation on why they should simply put their names on their papers. The uses defy even common sense arguments, and it is no different with watermarks . . . sear in a serial number and just keep track of it.

The assignee's U.S. Pat. No. 6,122,403, and pending application Ser. No. 09/503,881, detail suitable digital watermarking techniques in which values of pixels, e.g., in a 100.times.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 50-250 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 is a less robust fashion, or by making the encoding more relatively visible.)

The watermark payload can convey an image identifier, and may convey other meta data as well. In some systems, 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.

Watermarking may be performed in stages, at different times. For example, an 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.)

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).

In some multiple-watermarking approaches, a first watermark is applied before the 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.)

A watermark can be applied by the 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.) Or the watermarking can be effected by systems in the satellite 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.

The 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.

As indicated, the watermark(s) can identify the imaging system, the date/time of data acquisition, satellite ephemeris data, the identity of intervening systems through which the data passed, etc. One or more watermarks can stamp the image with unique identifiers used in subsequent management of the image data, or in management of meta data associated with the image.

A watermark can also serve a function akin to a hyperlink, e.g., as detailed in application Ser. No. 09/571,422. For example, a user terminal can permit an operator to right-click on a region of interest in a displayed image. In response, the system can respond with a menu of options--one of which is Link Through Watermark(s). If the user selects this option, a watermark detection function is invoked that decodes a watermark payload from the displayed image (or from a portion of the image in which the operator clicked). Using data from the decoded watermark payload, the terminal interrogates a database for a corresponding record. That record can return to the terminal certain stored information relating to the displayed image. For example, the database can present on the terminal screen a listing of hyperlinks leading to other images depicting the same area. By clicking on such a link, the corresponding image is displayed. Or the database can present, on the user terminal screen, the meta-data associated with the image.

In some embodiments, watermarks in component images may carry-through into the master DEM/map representation. If an excerpt of the master DEM/map is displayed, the user may invoke the Link Through Watermark(s) function. Corresponding options may be presented. For example, the user may be given the option of viewing each of the component images/data sets that contributed to the portion of the master model being viewed.

(It will be recognized that a variety of user interface techniques other than right-clicking, and selecting from a menu of options thereby displayed, can be employed. That interface is illustrative only.)

In some embodiments, a watermark can be applied to each DEM/map from the master database as it is retrieved and output to the user. The watermark can indicate (i.e., by direct encoding, or by pointing to a database record) certain data related to the compiled data set, such as the date/time of creation, the ID of the person who queried the database, the component datasets used in preparing the output data, the database used in compiling the output data, etc. Thereafter, if this output data is printed, or stored for later use, the watermark persists, permitting this information to be later ascertained.

Watermarks can be applied to any data set (e.g., a satellite image, or a map generated from the master database) 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.

Some watermarks used in the foregoing embodiments can be "fragile." That is, they can be designed to be lost, or to degrade predictably, when the data set into which it is embedded is processed in some manner. Thus, for example, a fragile watermark may be designed so that if an image is JPEG compressed and then decompressed, the watermark is lost. Or if the image is printed, and subsequently scanned back into digital form, the watermark is corrupted in a foreseeable way. (Fragile watermark technology is disclosed, e.g., in application Ser. Nos. 09/234,780, 09/433,104, 09/498,223, 60/198,138, 09/562,516, 09/567,405, 09/625,577, 09/645,779, and 60/232,163.) By such arrangements it is possible to infer how a data set has been processed by the attributes of a fragile watermark embedded in the original data set.

Assuming that early testing proves out that the addition of "watermarking energy" into the normal workflow of satellite imaging systems does not materially disturb the function of most of the output of that system, nevertheless certain "watermark removal" tools can be built to alleviate any problems in cases where unacceptable impact is identified. This can either be a generic tool or one highly specialized to the particular application at hand (perhaps employing secret data associated with that application). In a second generation system (without too much fanfare) a fairly simple "remove watermark before analyzing this scene" function could be automatically included within analysis software such that 99% of image analysts wouldn't know or care about the watermarking on/off/on/off functionality as a function of use/transport.

As will be apparent, the technology detailed herein may be employed in reconnaissance and remote sensing systems, as well as in applications such as guidance of piloted or remotely piloted vehicles.

To provide a comprehensive disclosure without unduly lengthening this specification, applicant incorporates by reference, in their entireties, the disclosures of the above-cited patents and applications.

It should be understood that the technology detailed herein can be applied in the applications detailed in the cited DEM patents, as well as in other mapping and image (or audio or video or other content) asset management contexts (Likewise, the technologies detailed in the cited patents can be advantageously used in embodiments according to the present invention.)

While particular reference was made to Digital Elevation Models and albedo maps, the same principles are likewise applicable to other forms of maps, e.g., vegetative, population, thermal, etc., etc.

While the illustrated embodiment correlated the incoming imagery with a projective image based on the master DEM/map, in other embodiments a reference other than the master DEM/map may be used. For example, a projection based just on part of the historical data from which the DEM/map was compiled can be used (e.g., one or more component data sets that are regarded as having the highest accuracy, such as based directly on ground truths).

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 registration, watermarking, and other 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.)

Certain of the techniques detailed above find far application beyond the context in which they are illustrated. For example, equipping an imaging instrument with an optical shutter that impart a watermark to an image finds application in digital cinema (e.g., in watermarking a theatrical movie with information indicating the theatre, date, time, and auditorium of screening).

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, I claim as my invention all such modifications as may come within the scope and spirit of the following claims and equivalents thereof. (For expository convenience, the term "map" as used in the claim should be construed to encompass terrain models, such as DEMs.)

* * * * *