K. Tanaka, Y. Nakamura, and K. Matsui. Embedding Secret Information into a Dithered Multi-level Image. In Proceedings of 1990.  Home/Search   Document Not in Database   Summary   Related Articles   Check

.... selected DCT blocks to satisfy certain linear or circular constraint [15] Some selects from some pre defined pairs or triplets of DCT coefficients and uses their relative strength to encode a bit of the watermark pattern [16] Some embeds watermark patterns in the quantization module after DCT [17] or in selected blocks based on human visual models [18] Some utilizes inter block correlation by forcing DCT coefficients of a block to be greater or smaller than the average of the neighboring blocks [19] Some modifies selected DCT coefficients by random shuffling and table lookup embedding ....

K. Tanaka, et al., "Embedding Secret Information into a Dithered Multilevel Image", Proc. of IEEE Military Communication Conf., pp. 216-220, 1990.

....as through CDROMs or DVDs) with only small amounts of on line information being transferred to each consumer. We call it bulk tagging. 1 Introduction The science of inserting hidden marks in digital data has advanced from steganographic uses [Kah96] and first primitive watermarking approaches [TNM90], Car95] to a field of much research interest. Many ways have been proposed on how to insert tags (aka watermarks) into digital media such as audio and video streams, digital images, text of various formats, source code [ST98] and even program binaries [SHKQ99] Distribution channels were ....

K. Tanaka, Y. Nakamura, and K. Masui. Embedding secret information into a dithered multilevel image. In Proceedings of the 1990 IEEE Military Communications Conference, pp. 216220, September 1990. 9

....(3) altering text features such as the vertical endlines of individual characters. Unfortunately, all three proposals are easily defeated, as discussed by the authors. Moreover, these techniques are restricted exclusivelytoimagescontaining text. 3.1. 3 Quantization Noise Embedding Tanaka et al. [24, 15] describe several watermarking schemes that rely on embedding watermarks that resemble quantization noise. Their ideas hinge on the notion that quantization noise is typically imperceptible to viewers. Their first scheme injects a watermark into an image by using a predetermined data stream to ....

....in a certain way. There are several drawbacks to these schemes. The most important is that they are susceptible to signal processing, especially requantization, and geometric attacks such as cropping. Furthermore, they degrade an image in the same way that predictive coding and dithering can. In [24], the authors also propose a scheme for watermarking facsimile data. This scheme shortens or lengthens certain runs of data in the run length code used to generate the coded fax image. This proposal is susceptible to digital to analog and analog to digital attacks. In particular, randomizing the ....

K. Tanaka, Y. Nakamura, and K. Matsui. Embedding secret information into a dithered multilevel image. In Proc.

....and maximum acceptable level of embedding distortion, the more efficient an embedding method is, the higher the robustness that can be achieved. A great many information embedding algorithms have been proposed [1] in this still emerging field. Some of the earliest proposed methods [8] [9], 7] employ a quantize and replace strategy: after first quantizing the host signal, these systems change the quantization value to embed information. A simple example of such a system is the so called low bit(s) modulation (LBM) where the least significant bit(s) in the quantization of the host ....

K. Tanaka, Y. Nakamura, and K. Matsui, "Embedding secret information into a dithered multi-level image," in Proc.

....was produced, and perhaps even the artisan who smoothed the paper with a calender stone. Kutter and Hartung, 2000] Over the next seven hundred years, watermarking found many further applications. In 1990, the first digital watermarks were invented as a protectivemeasure for digital imagery [Tanaka et al. 1990], cited in [Kutter and Hartung, 2000] Image watermarking has received an ever increasing level of attention since then# a recentsurvey contains references to fifty four articles on this topic [Dugelay and Roche, 2000] Watermarking of software is an even more recent development, with a ....

Tanaka, K., Nakamura, Y., and Matsui, K. (1990). Embedding secret information into a dithered multi-level image. In Conference Record of the Military Communications Conference, MILCOM '90: A New Era, Vol. 1, pages 216--220. IEEE.

....at Miletus with instructions to shave again the slave s head. Obviously, bandwidth was not a concern at those times, but methods haven t changed so much when compared with the state of the art in digital watermarking. Since the publication of a seminal work by Tanaka et al. in 1990 [2], we have witnessed an extraordinary growth of techniques for copyright protection of different types of data, especially multimedia information. This interest is not surprising in view of the simplicity of digital copying and dissemination: digital copies can be made identical to the original ....

K. Tanaka, Y. Nakamura, and K. Matsui, "Embedding secret information into a dithered multi-level image," in Proc. 1990 IEEE Military Communications Conference, pp. 216--220, 1990.

....on the resulting cross correlation to determine the binary value of the embedded data bits. Some of the hidden data may be lost if the phase of the modulated carrier is recovered in error. A data hiding scheme using the statistical properties of dithered imagery is proposed by Tanaka et al. [14]. With this method, the dot patterns of the ordered dither pixels are controlled by the information bits to be concealed. This system accommodates 2 kB of hidden information for a bilevel 256 256 image, yielding a payload of data or informationhiding ratio of one information bit to four cover ....

K. Tanaka, Y. Nakamura, and K. Matsui, "Embedding secret information into a dithered multi-level image," in Proc. IEEE Military Communications Conf., Monterey, CA, 1990, pp. 216--220.

....distribution path of digital data. Watermarking is the process of encoding hidden copyright information into digital data by making small modifications to the data samples, e.g. pixels. Many watermark algorithms have been proposed. Some techniques modify spatial temporal data samples (e.g. 1] [5]) while others modify transform coefficients (e.g. 2] 6] 10] Unlike encryption, watermarking does not restrict access to the data. Once encrypted data is decrypted, intellectual property rights are no longer protected. A watermark is designed to permanently reside in the host data. When ....

K. Tanaka, Y. Nakamura, and K. Matsui, "Embedding secret information into a dithered multilevel image," in Proc. 1990 IEEE Military Commun. Conf., 1990, pp. 216--220.

....rate requirement and maximum acceptable level of embedding distortion, the more e#cient an embedding method is, the higher the robustness that can be achieved. A great many information embedding algorithms have been proposed [1] in this still emerging field. Some of the earliest proposed methods [8, 9, 7] employ a quantize and replace strategy: after first quantizing the host signal, these systems change the quantization value to embed information. A simple example of such a system is so called low bit(s) modulation (LBM) where the least significant bit(s) in the quantization of the host signal ....

K. Tanaka, Y. Nakamura, and K. Matsui, "Embedding secret information into a dithered multi-level image," in Proceedings of the 1990 IEEE Military Communications Conference, pp. 216--220, 1990.

....fingerprint assigned to each user will be the user s serial number. There has been much research investigating the Marking Assumption in a variety of domains. Wagner [15] gives a taxonomy of fingerprints and suggests subtle marks for computer software. Marks have been embedded in digital images [13, 4], in documents [3] and in computer programs [7] In all of these domains, our scheme allows these marks to be combined to form secure fingerprints. Thus our results are general, allowing a variety of digital data to be fingerprinted. Throughout the paper we use the following notation. Given an ....

K. Tanaka, Y. Nakamura and K. Matsui. Embedding secret information into a dithered multi-level image, Proceedings of the 1990 IEEE Military Communications Conference, pp. 216--220, September 1990.

....by readers, yet may be reliably identified even from a photocopy This paper will appear in Infocom 95, Boston, Massachusetts, April 1995. The authors can be reached at fslow, nfm, jtb, logg research.att.com of the document. Along the same line but for different medium, schemes are described in [3, 4] to embed unique marking on images to deter illicit copying. Watermarking of optical documents to combat counterfeiting is considered in [5] General discussion of fingerprinting can be found in [6] This paper is motivated by an experiment we performed to measure the distortions on a document in ....

K. Tanaka, Y. Nakamura, and K. Matsui. Embedding secret information into a dithered multilevel image. Proceedings of the 1990 IEEE Military Communications Conference, pages 216--220, September 1990.

....and added to the media. To maintain fidelity, the power constraint is kept very low. Spread spectrum techniques are often employed to make the signal detectable in the resulting low signal to noise ratio channel 7 . Examples of Category 1 watermarking methods can be found in [Tur89, Car95, TNM90, MT94, HW96, Rho95, BGML96, HMW88, SC96] Note that this approach to watermarking makes no distinction between the media content, C 0 , and the attack noise, N. 7 Spread spectrum communications was originally developed as a military communications system that would be resistant to enemy ....

K. Tanaka, Y. Nakamura, and K. Matsui. Embedding secret information into a dithered multi-level image. In Proc, 1990 IEEE Military Communications Conference, pages 216--220, 1990.

....so that the original cover 3D model can be recovered. In the past, a multimedia content typically meant a content that includes text, image, video, and audio data types. As a result, data embedding techniques for these traditional digital content data types has been studied by many groups [4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14]. In addition to these content data types, 3D polygonal model of geometry is becoming an important member of multimedia data types, prompted by increasing popularity of Virtual Reality Modeling Language [15] and imminent standardization of MPEG 4 [16] Our group added 3D polygonal model of ....

K. Tanaka, Y. Nakamura, and K. Matsui, Embedding Secret Information into a Dithered Multilevel Image, Proc. 1990 IEEE Military Communications Conference, pp. 216-220, IEEE, Piscataway, NJ, USA, 1990.

....can be used to manage the contents, in order, for example, to add annotations, to detect tampering, or to authenticate rightful purchasers. Previous studies have focused on data embedding techniques for traditional digital multimedia content data types, such as text, image, video, and audio [22, 26, 1, 3, 15, 21, 4, 8, 14, 25]. Recently, as 3D models gain status as an important multimedia data type [8, 9] data embedding algorithms for embedding data into 3D models have been published. We have published methods for embedding data into 3D model shape [16, 17, 18] Out algorithms mainly targeted shapes defined by using ....

....and that of retrieving the information encoded in the watermark for perusal extraction. An object into which information is embedded is a called cover datatype , an object with an embedded watermark is called a stego datatype , and the information embedded is called embedded datatype [22]. The suffix datatype varies according to the data type, such as image, text, or 3D model. For example, an embedded text is embedded in a cover NURBS surface to result in a stego NURBS surface with an embedded text. Traditionally, watermarks have been classified by their visibility (or, more ....

K. Tanaka, Y. Nakamura, and K. Matsui, Embedding Secret Information into a Dithered Multilevel Image, Proc. 1990 IEEE Military Communications Conference, pp. 216-220, 1990.

No context found.

K. Tanaka, Y. Nakamura, and K. Matsui. Embedding Secret Information into a Dithered Multi-level Image. In Proceedings of 1990.

No context found.

K. Tanaka, Y. Nakamura, and K. Matsui. Embedding Secret Information into a Dithered Multi-level Image. In Proceedings of 1990.

No context found.

K. Tanaka, Y. Nakamura, and K. Matsui. Embedding secret information into a dithered multi-level image. In Proc. 1990.

No context found.

K. Tanaka, Y. Nakamura, and K. Matsui, \Embedding Secret Information into a Dithered Multi-level Image," in Proceedings of 1990 IEEE Military Communications Conference, pp. 216-220, 1990.

No context found.

K. Tanaka, Y. Nakamura, and K. Matsui. Embedding secret information into a dithered multilevel image. In IEEE Military Communications Conference, pages 216--220, 1990.

No context found.

K. Tanaka, Y. Nakamura, and K. Matsui. Embedding secret information into a dithered multilevel image. In IEEE Military Communications Conference, pages 216--220, 1990.

No context found.

K. Tanaka, Y. Nakamura, and K. Matsui. Embedding secret information into a dithered multilevel image. In IEEE Military Communications Conference, pages 216--220, 1990.

No context found.

K. Tanaka, Y. Nakamura, and K. Matsui, "Embedding secret information into a dithered multilevel image," in Proc. 1990.

No context found.

K. Tanaka, Y. Nakamura, and K. Matsui, Embedding Secret Information into a Dithered Multilevel Image, Proc. 1990 IEEE Military Communications Conference, pp. 216-220, 1990.

No context found.

K. Tanaka, Y. Nakamura, and K. Matsui. Embedding secret information into a dithered multilevel image. In Proceeding of the

No context found.

K. Tanaka, Y. Nakamura, and K. Matsui. Embedding secret information into a dithered multi-level image. In MILCOM'90: A New Era. 1990 IEEE Military Communications Conference, volume 1, pages 216--220, 1990.

First 50 documents

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC