Source: http://www.google.com/patents/US7471838?ie=ISO-8859-1&dq=7,134,016
Timestamp: 2014-03-08 19:02:44
Document Index: 181338816

Matched Legal Cases: ['Application No. 2003', 'application No. 2003', 'Application No. 04252470', 'application No. 2003', 'application No. 2005', 'application No. 2003']

Patent US7471838 - Image data processing apparatus, image data processing method, and computer ... - Google PatentsSearch Images Maps Play YouTube News Gmail Drive More »Sign inAdvanced Patent SearchPatentsTo reduce the processing required to embed a code into image data and decode the code. The present invention includes a block dividing section 101 that divides original image data 10 into a plurality of blocks (M�N); an averaging section 103 that extracts each average density (characteristic amount)...http://www.google.com/patents/US7471838?utm_source=gb-gplus-sharePatent US7471838 - Image data processing apparatus, image data processing method, and computer readable mediumAdvanced Patent SearchPublication numberUS7471838 B2Publication typeGrantApplication numberUS 11/842,928Publication dateDec 30, 2008Filing dateAug 21, 2007Priority dateMay 20, 2003Fee statusPaidAlso published asEP1480163A2, EP1480163A3, US7280701, US20040234139, US20080253674Publication number11842928, 842928, US 7471838 B2, US 7471838B2, US-B2-7471838, US7471838 B2, US7471838B2InventorsJun Moroo, Tsugio NodaOriginal AssigneeFujitsu LimitedExport CitationBiBTeX, EndNote, RefManPatent Citations (20), Non-Patent Citations (11), Classifications (11), Legal Events (1) External Links: USPTO, USPTO Assignment, EspacenetImage data processing apparatus, image data processing method, and computer readable mediumUS 7471838 B2Abstract To reduce the processing required to embed a code into image data and decode the code. The present invention includes a block dividing section 101 that divides original image data 10 into a plurality of blocks (M�N); an averaging section 103 that extracts each average density (characteristic amount) in a plurality of blocks; and an encoding section 106 that embeds a code C (a plurality of bits) into a plurality of blocks by relating one code (one bit out of the code C) to each pair of blocks mutually located in near position in the plurality of blocks based on a magnitude relation of the average density.
CROSS-REFERENCE TO RELATED APPLICATIONS This application is a continuation of U.S. application Ser. No. 10/824,528 filed Apr. 15, 2004, now U.S. Pat. No. 7,280,701 and claims the benefit of Japanese Application No. 2003-142582 filed May 20, 2003 in the Japanese Patent Office, the contents of which are incorporated herein by reference.
At operation SA8, the comparing section 105 obtains �1� that is the leftmost bit (corresponding to n=1) of the code C, and a difference between the left-side average density data Dl11, and the right-side average density data Dr11 and executes the bit decision based on the difference in the densities (i.e., magnitude relation).
Concretely, if the left-side average density data Dl11, is equal to or larger than the right-side average density data Dr11, the comparing section 105 sets �1� as a result of the decision made for the pair of blocks based on the above magnitude relation.
At operation SA10, the comparing section 105 increments n by 1. As a result, n becomes 17. At operation SA1, the comparing section 105 decides whether n (=17) is larger than nend (=16). In this case, the comparing section 105 sets �Yes� as a result of the decision made.
At operation SA12, the comparing section 105 decides whether the processing concerning the last pair of blocks (the blocks Bl168 and Br168) in the image data 11 ends, and, in this case, sets �No� as a result of the decision made.
Thereafter the above operation is repeated until when the result of the decision made at operation SA12 becomes �Yes�.
A comparing section 206 compares a magnitude relation between the left-side average density data and the right-side average density data stored in the register 205, and the register 205 r respectively, thereby making a bit decision. The comparing section 206 outputs a code group CG (candidate codes C1 to C8: refer to FIG. 10) corresponding to the result of the bit decision (bit decided as �0� or �1� from the expression described above), to a decoding section 207.
At operation SC8, the comparing section 206 compares a magnitude relation between the left-side average density data and the right-side average density data stored in the register 205 l and the register 205 rrespectively, thereby making a bit decision. The comparing section 206 outputs the result of the bit decision (bit decided as �0� or �1� from the expression described above), to the decoding section 207.
The comparing section 302 compares the nth bit of the error-correction-coding code CE with the result of a bit decision made from the magnitude relation between the left-side average density data Dl and the right-side average density data Dr stored in the register 104 l and the register 104 r respectively (a bit decision is made as �0� or �1� from the relational expression described in the first embodiment: refer to FIG. 3).
At operation SD11 the comparing section 401 decides whether the processing concerning the last pair of blocks (two blocks) in the image data divided into blocks ends, and, in this case, sets �No� as a result of the decision made.
For example, in the case of the leftmost bit of the candidate error-correction-coding code CE1 to CE8, �0� is 2, �1� is 5, and �2� is 1. Therefore, the leftmost bit of the error-correction-coding code CE′ is decided as �1� based on the majority decision.
Third Embodiment In the first and the second embodiments, the configuration example of encoding and decoding using the average density of the total block (for example, the block Bl18) as illustrated in FIG. 3 is explained. It is also possible to have a configuration that uses the average density of only some portion (for example, the center portion) of the blocks. This configuration example is explained below as a third embodiment of the present invention.
At operation SE4, the image cut-out section 201 decides whether the four corners of the image coded data 13 are searched, and, in this case, sets �No� as a result of the decision made. Thereafter, the processing at operation SE3 is executed for the other three corners. When the four corners (the yellow marks ME1 to ME4) illustrated in FIG. 19 are searched, the image cut-out section 201 sets �Yes� as a result of the decision made at operation SE4.
Patent CitationsCited PatentFiling datePublication dateApplicantTitleUS5636292May 8, 1995Jun 3, 1997Digimarc CorporationSteganography methods employing embedded calibration dataUS5841978Jul 27, 1995Nov 24, 1998Digimarc CorporationNetwork linking method using steganographically embedded data objectsUS6522766Mar 15, 1999Feb 18, 2003Seiko Epson CorporationWatermarking with random zero-mean patches for copyright protectionUS6600828May 26, 1999Jul 29, 2003Canon Kabushiki KaishaImage processing method and apparatus, and storage medium thereforUS6898297Jun 20, 2001May 24, 2005Matsushita Electric Industrial Co., Ltd.Digital watermark embedding method, digital watermark extracting method, recording medium, image recording device, and image replaying deviceUS20030021442Jul 17, 2002Jan 30, 2003Masahiko SuzakiWatermark Information embedment device and watermark information detection deviceUS20030063319Sep 27, 2002Apr 3, 2003Canon Kabushiki KaishaImage processing apparatus and method, computer program, and recording mediumUS20040120546Dec 12, 2003Jun 24, 2004Hiroshi YoshiuraMethod of judging digital watermark informationJP3784825B2 Title not availableJP2000050057A Title not availableJP2000059743A Title not availableJP2000216983A Title not availableJP2000228720A Title not availableJP2000299779A Title not availableJP2001103284A Title not availableJP2002010058A Title not availableJP2002135736A Title not availableJP2003101762A Title not availableJP2003110846A Title not availableJPH11205577A Title not availableNon-Patent CitationsReference1Ching-Tang Hsieh et al., "A Study of Enhancing the Robustness of Watermark", Dept of Electrical Engineering Tamkang University Taipei, Hsien, Taiwan, pp. 325-327 (Dec. 11, 2000).2Decision to Grant a Patent for Japanese patent application No. 2003-142582 (Japan patent No. 3784781) from which the present above-identified US patent application claims priority, dated Mar. 14, 2006, 1 page, including English language translation thereof (1 page).3European Search Report issued Feb. 24, 2006 in European Application No. 04252470.2-2218 related to the present above-identified US patent application.4Kineo Matsui, "Basics of Digital Watermark", Morikita Shuppan, K. K., Aug. 1998 pp. 94-97, English translation pp. 1-5.5Notification of Reason(s) for Refusal issued by the Japanese Patent Office on Dec. 13, 2005 in Japanese patent application No. 2003-142582 (Japan patent No. 3784781) from which the present above-identified US patent application claims priority, 3 pages, including English translation thereof (4 pages).6Notification of Reason(s) for Refusal issued by the Japanese Patent Office on Dec. 13, 2005 in Japanese patent application No. 2005-276561 (Japan patent No. 378425, which is a Japanese divisional application of priority Japanese application No. 2003-142582 from which the present above-identified US patent application claims priority, 3 pages, Including English translation thereof (4 pages).7Seiji Kobayashi, et al., "Data Hiding using Nature of Neighboring Pixels-Statistical Nature of Neighboring Pixels," Information Processing Society of Japan 56th Annual Conference (First Half of 1998), vol. 3-37 to 3-38 (2 pages), including English translation thereof 6 pages).8Shuichi Shimizu et al., "Still Picture Data Hiding By Pixel Block", IMB Japan Ltd., Tokyo Research Laboratory, Information Society of Japan, 1966, pp. 2-257 and 2-258, English translation pp. 1-6.9U.S. Appl. No. 10/824,528, filed Apr. 15, 2004, Jun Moroo, et al., Fujitsu Limited Kawasaki, Japan.10W. Wesley Peterson et al., "Bose-Chaudhuri-Hocquenghem Codes", pp. 269-309 (1988).11Wolfgang Funk, "Image Watermarking in the Fourier Domain based on global features of concentric ring areas", Proceedings of the SPIE vol. 4675, pp. 596-599, (2002).Classifications U.S. Classification382/239International ClassificationG06T1/00, H04N1/387, H04N7/08, G06K9/36, H04N7/081Cooperative ClassificationG06T2201/0083, G06T2201/0061, G06T2201/0051, G06T1/0021European ClassificationG06T1/00WLegal EventsDateCodeEventDescriptionMay 30, 2012FPAYFee paymentYear of fee payment: 4RotateOriginal ImageGoogle Home - Sitemap - USPTO Bulk Downloads - Privacy Policy - Terms of Service - About Google Patents - Send FeedbackData provided by IFI CLAIMS Patent Services©2012 Google