Cropping-Resilient Segmented Multiple Watermarking

(Extended Abstract)
  • Keith Frikken
  • Mikhail Atallah
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2748)


Watermarking is a frequently used tool for digital rights management. An example of this is using watermarks to place ownership information into an object. There are many instances where placing multiple watermarks into the same object is desired. One mechanism that has been proposed for doing this is segmenting the data into a grid and placing watermarks into different regions of the grid. This is particularly suited for images and geographic information systems (GIS) databases as they already consist of a fine granularity grid (of pixels, geographic regions, etc.); a grid cell for watermarking is an aggregation of the original fine granularity cells. An attacker may be interested in only a subset of the watermarked data, and it is crucial that the watermarks survive in the subset selected by the attacker. In the kind of data mentioned above (images, GIS, etc.) such an attack typically consists of cropping, e.g. selecting a geographic region between two latitudes and longitudes (in the GIS case) or a rectangular region of pixels (in an image). The contribution of this paper is a set of schemes and their analysis for multiple watermark placement that maximizes resilience to the above mentioned cropping attack. This involves the definition of various performance metrics and their use in evaluating and comparing various placement schemes.


Geographic Information System Geographic Information System Range Query Watermark Scheme Placement Scheme 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Abdel-Ghaffar, K.A.S., El Abbadi, A.: Optimal allocation of two-dimension data. In: Int. Conf. on Database Theory, Delphi, Greece, pp. 409–418 (January 1997)Google Scholar
  2. 2.
    Atallah, M.J., Prabhakar, S.: (Almost) optimal parallel block access for range queries. In: Proc. of the 19th ACM Symposium on Principles of Database Systems (PODS), Dallas, Texas (May 2000)Google Scholar
  3. 3.
    Bhatia, R., Sinha, R.K., Chen, C.-M.: Declustering using golden ratio sequences. In: Proc. of Int’l. Conference On Data Engineering (ICDE), San Diego, California (March 2000)Google Scholar
  4. 4.
    Brisbane, G., Safavi-Naini, R., Ogunbona, P.: Region-based Watermarking for Images. In: Zheng, Y., Mambo, M. (eds.) ISW 1999. LNCS, vol. 1729, pp. 154–166. Springer, Heidelberg (1999)Google Scholar
  5. 5.
    Chen, C., Cheng, C.: From Discrepancy to Declustering: Near-optimal multidimensional declustering strategies for range queries. In: ACM Symposium On Principles of Database Systems (PODS), pp. 29–38 (2002)Google Scholar
  6. 6.
    Du, H.C., Sobolewski, J.S.: Disk allocation for cartesian product files on multiple-disk Systems. ACM Trans. of Database Systems 7(1), 82–101 (1982)zbMATHCrossRefGoogle Scholar
  7. 7.
    Faloutsos, C., Bhagwat, P.: Declustering using fractals. In: Proc. of the 2nd Int. Conf. On Parallel und Distributed Information Systems, San Diego, CA, pp. 18–25 (January 1993)Google Scholar
  8. 8.
    Frikken, K., Atallah, M., Prabhakar, S., Safavi-Naini, R.: Optimal Parallel 1/0 for Range Queries through Replication. In: Hameurlain, A., Cicchetti, R., Traunmüller, R. (eds.) DEXA 2002. LNCS, vol. 2453, pp. 669–678. Springer, Heidelberg (2002)CrossRefGoogle Scholar
  9. 9.
    Gray, J., Horst, B., Walker, M.: Parity striping of disc arrays: Low-cost reliable Storage with acceptable throughput. In: Proceedings of the Int. Conf. On Very Large Data Bases, Washington DC, pp. 148–161 (August 1990)Google Scholar
  10. 10.
    Itai, A., Rosberg, Z.: A golden ratio control policy for a multiple-access channel. IEEE Transactions On Automatic Control AC-29, 712–718 (1984)CrossRefMathSciNetGoogle Scholar
  11. 11.
    Kim, M.H., Pramanik, S.: Optimal file distribution for partial match retrieval. In: Proc. ACM SIGMOD Int. Conf. On Management of Data, Chicago, pp. 173–182 (1988)Google Scholar
  12. 12.
    Li, J., Srivastava, J., Rotem, D.: CMD: a multidimensional declustering method for parallel database Systems. In: Proceedings of the Int. Conf. On Very Large Data Bases, Vancouver, Canada, pp. 3–14 (August 1992)Google Scholar
  13. 13.
    Mintzer, F., Braudaway, G.: If one watermark is good, are more better? In: Proceedings of the International Conference on Acoustics, Speech, and Signal Processing, Phoenix, Arizona, vol. 4 (May 1999)Google Scholar
  14. 14.
    Mintzer, F., Braudaway, G., Yeung, M.: Effective and Ineffective Digital Watermarks. In: IEEE ICIP, Santa-Barbara, Cal, vol. 111, pp. 9–12 (October 1997)Google Scholar
  15. 15.
    Prabhakar, S., Abdel-Ghaffar, K., Agrawal, D., El Abbadi, A.: Cyclic allocation of two-dimensional data. In: Proc. of the International Conference On Data Engineering (ICDE 1998), Orlando, Florida, pp. 94–101 (February 1998)Google Scholar
  16. 16.
    Sinha, R.K., Bhatia, R., Chen, C.-M.: Asymptotically optimal declustering schemes for range queries. In: Proc. of 8th International Conference On Database Theory (ICDT), London, UK, pp. 144–158 (January 2001)Google Scholar
  17. 17.
    Sanders, P., Egner, S., Korst, J.: Fast concurrent access to parallel disks. In: 11th ACM-SIAM Symposium On Discrete Algorithms (2000)Google Scholar
  18. 18.
    Sheppard, N., Safavi-Naini, R., Ogunbona, P.: On multiple watermarking. In: ACM Multimedia Conference, ACM Multimedia, pp. 3–6 (2001)Google Scholar
  19. 19.
    Tosun, A., Ferhatosmanoglu, H.: Optimal Parallel 1/0 Using Replication. OSU Technical Report OSU-CISRC-ll/Ol-TR26 (2001)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2003

Authors and Affiliations

  • Keith Frikken
    • 1
  • Mikhail Atallah
    • 1
  1. 1.Purdue University 

Personalised recommendations