J. Chou, S. S. Pradhan, L. E. Ghaoui, K. Ramchandran, A robust optimization solution to the data hiding problem using distributed source coding principles, in: Proc. SPIE Image & Video Communications & Processing, Vol. 3974, 2000.  Home/Search   Document Details and Download   Summary   Related Articles   Check

....have D D2 D and W log i D2 D , asymptotically independent of 2. Achievability of Capacity Bound. In principle, the capacity can be approached using a random binning coding technique [27, 28, 24, 11] Research on structured data hiding codes that approach this capacity bound is currently underway [9, 29, 30, 31]. The optimal decoder for Gaussian channels is a certain minimum distance decoder. 5 Parallel Gaussian Channels In this section, we review recent results from [25] on data hiding capacity under MSE constraints; these results are essential to understanding the remainder of this paper. We use 1 D ....

J. Chou, S. Pradhan, L. E1 Ghaoui and K. Ramchandran, "A Robust Optimization Solution to the Data Hiding Problem using Distributed Source Coding Principles," Proc. SPIE, Vol. 3971, San Jose, CA, Jan. 2000.

....results in values above the Shannon limit. Nevertheless, it should be emphasized that certain versions of the technique proposed by Ramkumar and Akansu show good performance particularly for very low s. SCS outperforms their approach in the range of typical s only slightly [17] Chou et al. [18] exploit the duality of communication with side information at the encoder to source coding with side information at the decoder to derive a watermarking scheme based on trellis coded quantization. This work can be considered as an extension of the research on practical implementations of Costa s ....

....embedding distortion is possible for low attack noise. The performance gap between SCS and ICS has to be bridged by constructing more complicated codebooks and by extending the embedding and detection rule to non scalar operations. Research in this direction has been started, e.g. by Chou et al. [18]. However, SCS might still remain an attractive technique for many information embedding applications due to its simple structure and host signal independent design. ACKNOWLEDGMENTS The authors would like to thank Jonathan Su for the contributions to this work during his stay at the University of ....

J. Chou, S. Pradhan, L. El Ghaoui, and Kannan Ramchandran, "A robust optimization solution to the data hiding problem using distributed source coding principles," in Proc. of SPIE Vol. 3974: Image and Video Communications and Processing 2000.

.... the encoder but not at the decoder [41, 21, 13, 26] Rather than attempting to suppress interference from x####, the communication system employs channel codes designed with the statistics of x#### in mind [13, 12, 45] A few blind watermarking systems based on Costa s result have been proposed [16, 9, 38, 12, 11, 19]. Notably, Chen and Wornell [8] proposed a system that asymptotically approaches capacity. Chou et al. 11] recognized the duality between the blind watermarking problem and that of lossy source coding with side information at the decoder but not at the encoder, and they have applied recent ....

....system employs channel codes designed with the statistics of x#### in mind [13, 12, 45] A few blind watermarking systems based on Costa s result have been proposed [16, 9, 38, 12, 11, 19] Notably, Chen and Wornell [8] proposed a system that asymptotically approaches capacity. Chou et al. [11] recognized the duality between the blind watermarking problem and that of lossy source coding with side information at the decoder but not at the encoder, and they have applied recent results in distributed (lossy) source coding to blind watermarking. A further discussion of this duality appears ....

[Article contains additional citation context not shown here]

J. Chou, S. Pradhan, L. El Ghaoui, and K. Ramchandran, "A robust optimization solution to the data hiding problem using distributed source coding principles," in Proc. SPIE Image and Video Communications and Processing 2000.

....research was supported in part by a grant from ONR # N001401 1 0380. similar ideas. A scalar quantization based data hiding scheme, together with turbo coding to protect the hidden data, is considered in [5] while a trellis coded vector quantization scheme is considered by Ramchandran et al. [6]. In this paper, we consider scalar quantization based hiding schemes (as in [4] in the Discrete Cosine Transform (DCT) domain. According to information theoretic prescriptions for parallel Gaussian models of images in the DCT domain [3] data should be hidden in the low and mid frequency ranges ....

....straightforward to add standard error correction (including the use of soft decisions and iterative decoding [5] to make our methods robust to non JPEG attacks, such as the AWGN attack or wavelet compression. Another extension is the use of vector quantization techniques such as those in [6]. Our use of perceptual criteria to determine the embedding locations (rather than only statistical criteria which may specify which frequency bands to embed in) however, result in a new requirement in terms of error correction coding. Since the decoder must now decide which blocks or ....

J. Chou, S. S. Pradhan, and K. Ramchandran, "A robust optimization solution to the data hiding problem using distributed source coding principles," in Proceedings of Conference on Information Sciences and Systems (CISS), Mar. 2000.

.... at the encoder but not at the decoder [41, 21, 13, 26] Rather than attempting to suppress interference from x[ the communication system employs channel codes designed with the statistics of x[ in mind [13, 12, 45] A few blind watermarking systems based on Costa s result have been proposed [16, 9, 38, 12, 11, 19]. Notably, Chen and Wornell [8] proposed a system that asymptotically approaches capacity. Chou et al. 11] recognized the duality between the blind watermarking problem and that of lossy source coding with side information at the decoder but not at the encoder, and they have applied recent ....

....system employs channel codes designed with the statistics of x[ in mind [13, 12, 45] A few blind watermarking systems based on Costa s result have been proposed [16, 9, 38, 12, 11, 19] Notably, Chen and Wornell [8] proposed a system that asymptotically approaches capacity. Chou et al. [11] recognized the duality between the blind watermarking problem and that of lossy source coding with side information at the decoder but not at the encoder, and they have applied recent results in distributed (lossy) source coding to blind watermarking. A further discussion of this duality appears ....

[Article contains additional citation context not shown here]

J. Chou, S. Pradhan, L. E1 Ghaoui, and K. Ramchandran, "A robust optimization solution to the data hiding problem using distributed source coding principles," in Proc. SPIE Image and Video Communications and Processing 2000.

....that such good performance can be obtained only for large blocks of host signal samples. The mutual information results and detection error rates re veal that a significant performance gap remains between the suboptimal scalar codebook and schemes with the host signal at the decoder. Chou et al. [7] have shown that duality between blind watermarking and distributed source coding exists, which can be exploited to design better codebooks. Fig. 3. Comparison of mutual information for different blind watermarking schemes. detection with original 0.5, 1 . 1 41. 1 I . DM ....

J. Chou, S. Pradhan, L. E1 Ghaoui, and Kannan Ramchandran, "A robust optimization solution to the data hiding problem using distributed source coding principles," in Proc. of SPIE Vol. 3974: Image and Video Communications and Processing 2000.

....However, we can conclude at least that HCS does not give the expected gain. Note that this result is most probably due to the host signal independent design of the transmission scheme. Thus, these results do not contradict to the gains reported for higher dimensional signal constel lations in [4]. o.5 o 20 . Capacity I , SCS 5 ary 1D I HCS 9 ary 2DJ 15 10 5 0 5 10 15 20 Figure 9. Achievable rate for 5 ary signaling per dimension using a scalar uniform CB and for 9 ary signaling per two dimensions using an hexagonal lattice CB. 4.3. Spreading of the ....

....scheme performs better than previously proposed schemes and not much worse than the theoretical limit suggests. Closing the remaining gap to the theoretical limit is subject for future research. For this, the transmission scheme must be made dependent on the host signal distribution. Chou et al. [4] have shown that duality between blind watermarking and distributed source coding exists, which can be exploited to design better structured codebooks. ....

J. Chou, S. Pradhan, L. E1 Ghaoui, and Kannan Ram- chandran. A robust optimization solution to the data hiding problem using distributed source coding principles. In Proceedings of SPIE Vol. 3974: Image and Video Communications and Processing 2000, San Jose, Ca, USA, January 2000.

....However, we can conclude at least that HCS does not give the expected gain. Note that this result is most probably due to the host signal independent design of the transmission scheme. Thus, these results do not contradict to the gains reported for higher dimensional signal constellations in [4]. 20 15 10 5 0 5 10 15 20 0 0.5 1 1.5 2 2.5 3 3.5 achieveable rate SCS 5 ary 1D HCS 9 ary 2D Figure 9. Achievable rate for 5 ary signaling per dimension using a scalar uniform CB and for 9 ary signaling per two dimensions using an hexagonal lattice CB. 4.3. Spreading of the ....

....scheme performs better than previously proposed schemes and not much worse than the theoretical limit suggests. Closing the remaining gap to the theoretical limit is subject for future research. For this, the transmission scheme must be made dependent on the host signal distribution. Chou et al. [4] have shown that duality between blind watermarking and distributed source coding exists, which can be exploited to design better structured codebooks. ....

J. Chou, S. Pradhan, L. El Ghaoui, and Kannan Ramchandran. A robust optimization solution to the data hiding problem using distributed source coding principles. In Proceedings of SPIE Vol. 3974: Image and Video Communications and Processing 2000, San Jose, Ca, USA, January 2000.

....that such good performance can be obtained only for large blocks of host signal samples. The mutual information results and detection error rates reveal that a significant performance gap remains between the suboptimal scalar codebook and schemes with the host signal at the decoder. Chou et al. [7] have shown that duality between blind watermarking and distributed source coding exists, which can be exploited to design better codebooks. 0 0.2 0.4 0.6 0.8 1 achieveable rate Capacity DM CP SNS SCS Fig. 3. Comparison of mutual information for different blind watermarking ....

J. Chou, S. Pradhan, L. El Ghaoui, and Kannan Ramchandran, "A robust optimization solution to the data hiding problem using distributed source coding principles," in Proc. of SPIE Vol. 3974: Image and Video Communications and Processing 2000.

.... at the encoder but not at the decoder [13,21,26,41] Rather than attempting to suppress interference from x[ n o ] the communication system employs channel codes desigK3 with the statistics of x[ n o ] in mind [12,13,45] A few blind watermarking systems based on Costa s result have been proposed [9,11,12,16,19,38]. Notably, Chen and Wornell [8] proposed a system that asymptotically approaches capacity. Chou et al. 11] recogqqBz the duality between the blindwatermarking problem and that of lossy sourcecoding with side information at the decoder but not at the encoder, and they have applied recent results ....

....system employs channel codes desigK3 with the statistics of x[ n o ] in mind [12,13,45] A few blind watermarking systems based on Costa s result have been proposed [9,11,12,16,19,38] Notably, Chen and Wornell [8] proposed a system that asymptotically approaches capacity. Chou et al. [11] recogqqBz the duality between the blindwatermarking problem and that of lossy sourcecoding with side information at the decoder but not at the encoder, and they have applied recent results in distributed (lossy) sourcecoding to blindwatermarking A further discussion of this duality appears in ....

[Article contains additional citation context not shown here]

J. Chou, S. Pradhan, L. El Ghaoui, . Ramchandran, A robust optimization solution to the datahiding problemusing distributed sourcecoding principles, Proceeding of the SPIE Imag and Video Communications andProcessing

....the capacity expression is asymptotically independent of # 2 . Achievability of Capacity Bound. In principle, the capacity can be approached using a random binning coding technique [8, 9, 15, 31] Research on structured data hiding codes that approach this capacity bound is currently underway [5, 6, 13, 17, 23, 33]. The optimal decoder for Gaussian channels is a certain minimum distance decoder. 5 Parallel Gaussian Channels In this section, we review recent results from [34] on data hiding capacity under MSE constraints; these results are essential to understanding the remainder of this paper. We use 1 D ....

J. Chou, S. Pradhan, L. El Ghaoui and K. Ramchandran, "A Robust Optimization Solution to the Data Hiding Problem using Distributed Source Coding Principles," Proc. SPIE, Vol. 3971, San Jose, CA, Jan. 2000.

.... watermarking systems [3, 2] and research is under way to close the gap on this achievable capacity[3, 2, 4, 5] In this paper, we consider the problem of source coding with side information at the decoder and relate it to the dual problem of channel coding with side information at the encoder [6, 7, 4]. The key insight is that data hiding can be posed as a problem of channel coding with side information at the encoder and is therefore amenable to solutions which are in many senses the dual of the solution to the distributed source coding problem. We thus construct two different solutions to the ....

....( Delta is the quantizer step size) andC ff ; C fi are diagonal, positive semi definite matrices determined by the parameters used for the Lagrange relaxation. The above problem is now clearly convex and can be solved using a variety of generic methods. Details on the above result can be found in [7]. Upon solving the above SDP, it can be shown that for any feasible U and t, the lattice point which is closest to U will also satisfy the constraints defined in (6) 3.3. Summary As a result, we have two constructive approaches for encoding watermarks into a given signal (which is Gaussian) ....

J. Chou, S. SandeepPradhan, L. El Ghaoui, and K. Ramchandran, "A robust optimization solution to the data hiding problem using distributed source coding principles," Proceedings of SPIE, San Jose, 2000.

No context found.

J. Chou, S. S. Pradhan, L. E. Ghaoui, K. Ramchandran, A robust optimization solution to the data hiding problem using distributed source coding principles, in: Proc. SPIE Image & Video Communications & Processing, Vol. 3974, 2000.

No context found.

J. Chou, S. Pradhan, L. El Ghaoui and K. Ramchandran, "A Robust Optimization Solution to the Data Hiding Problem using Distributed Source Coding Principles," Proc. SPIE, Vol. 3971, San Jose, CA, Jan. 2000.

No context found.

J. Chou, S. Pradhan, L. E. Ghaoui, and K. Ramchandran. A robust optimization solution to the data hiding problem using distributed coding techniques. In Proc. SPIE Image, Video Communications & Processing Conference, volume 3974, pages 301--310, San Jose, USA, January 2000.

No context found.

J. Chou, S. S. Pradhan, L. E. Ghaoui, and K. Ramchandran, "A robust optimization solution to the data hiding problem using distributed source coding principles," in Proc SPIE: Image and Video Communications and Processing, 2000, vol. 3974.

No context found.

J. Chou, S. Pradhan, L. E. Ghaoui, and K. Ramchandran, "A robust optimization solution to the data hiding problem using distributed coding techniques," in Proc. SPIE Image, Video Communications & Processing Conference, 3974, pp. 301--310, (San Jos e, USA), January 2000.

No context found.

J. Chou, S. S. Pradhan, L. E. Ghaoui and K. Ramchandran, \A Robust Optimization Solution to the Data Hiding Problem using Distributed Source Coding Principles," Proc SPIE: Image and Video Communications and Processing, Vol. 3974, 2000.

No context found.

J. Chou, S. Pradhan, L. E. Ghaoui, and K. Ramchandran, "A robust optimization solution to the data hiding problem using distributed source coding principles," in Proc. of SPIE Vol. 3974: Image and Video Communications and Processing 2000, (San Jose, Ca, USA), January 2000.

No context found.

J. Chou, S. S. Pradhan, L. E. Ghaoui, and K. Ramchandran, "A robust optimization solution to the data hiding problem using distributed source coding principles," in Proc. SPIE, 3974, Jan. 2000.

No context found.

J. Chou, S. Pradhan, L. E. Ghaoui, and K. Ramchandran, "A robust optimization solution to the data hiding problem using distributed source coding principles," in Proc. of SPIE Vol. 3974: Image and Video Communications and Processing 2000, (San Jose, Ca, USA), January 2000.

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