J. Fridrich, "Applications of data hiding in digital images," in Tutorial for the ISSPA'99 Conference, Brisbane, Australia, August 1999, pp. 22--25.  Home/Search   Document Details and Download   Summary   Related Articles   Check

....These requirements include transparency, robustness, maximum capacity, universality, oblivious detection, solution of ownership deadlock and so on. In the following paragraph, we will briefly review some existing watermarking methods. Other surveys regarding watermarking can also be found in [5] [9], 13] 14] 30] 35] 40] In the literature, Koch and Zhao [16] transformed an image by using block discrete cosine transform (block DCT) and then utilized a pseudorandom number generator to select a subset of blocks. A triplet of blocks with midrange frequencies was slightly revised to ....

J. Fridrich, "Applications of data hiding in digital images," presented at the Tutorial for the ISPACS Conference, 1998.

....These requirements include transparency, robustness, maximum capacity, universality, oblivious detection, solution of ownership deadlock and so on. In the following paragraph, we will briefly review some existing watermarking methods. Other surveys regarding watermarking can also be found in [5, 9, 13, 14, 30, 35, 40]. In the literature, Koch and Zhao [16] transformed an image by using block discrete cosine transform (block DCT) and then utilized a pseudorandom number generator to select a subset of blocks. A triplet of blocks with midrange frequencies was slightly revised to yield a binary sequence watermark. ....

J. Fridrich, "Applications of Data Hiding In Digital Images", Tutorial for The ISPACS Conference, 1998.

....requirements include transparency, robustness, maximum capacity [27] universality, oblivious detection, and resolution of ownership deadlock [5, 32] In the following paragraph, we will briefly review some existing watermarking methods. Other surveys regarding watermarking can also be found in [3, 4, 7, 10, 11, 24, 29, 33]. In the literature, Koch and Zhao [13] transformed an image by using block DCT transform and then utilized a pseudorandom number generator to select a subset of blocks. A triplet of blocks with midrange frequencies was slightly revised to yield a binary sequence watermark. This seems reasonable ....

J. Fridrich, "Applications of Data Hiding In Digital Images", Tutorial for The ISPACS Conference, 1998.

....watermarking techniques cannot resist their attacks. To the best of our knowledge, there is still no research report in the watermarking literature that provides any results of robustness evaluation under attacks from StirMark and unZign. Some surveys regarding watermarking methods can be found in [4, 8, 10, 22, 32, 38]. In this chapter, we propose an HVS based watermarking algorithm with both gray scale and binary watermarks taken into consideration. Our method will attain the following goals: ffl the watermark is as large as possible and as strong as possible; ffl embedded watermarks are meaningful and ....

J. Fridrich, "Applications of Data Hiding In Digital Images", Tutorial for The ISPACS Conference, 1998.

No context found.

J. Fridrich, "Applications of data hiding in digital images," in Tutorial for the ISSPA'99 Conference, Brisbane, Australia, August 1999, pp. 22--25.

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