IDEAS home Printed from https://ideas.repec.org/a/gam/jftint/v9y2017i3p33-d104497.html
   My bibliography  Save this article

Robust Image Embedded Watermarking Using DCT and Listless SPIHT

Author

Listed:
  • J. L. Divya Shivani

    (Department of ECE, K L University, Vaddeswaram, Guntur dist, Andhra Pradesh 522502, India)

  • Ranjan K. Senapati

    (Department of ECE, K L University, Vaddeswaram, Guntur dist, Andhra Pradesh 522502, India)

Abstract

This paper presents a DCT-based (DCT: discrete cosine transform) listless set partitioning in hierarchical trees (SPIHT) digital watermarking technique that is robust against several common attacks such as cropping, filtering, sharpening, noise, inversion, contrast manipulation, and compression. The proposed technique is made further robust by the incorporation of the Chinese remainder theorem (CRT) encryption technique. Our scheme is compared with the recently proposed CRT-based DCT technique, CRT-based spatial domain watermarking, and DCT-based inter block correlation techniques. Extensive simulation experiments show better robustness in common image manipulations and, at the same time, the proposed technique successfully makes the watermark perceptually invisible. A better Tamper Assessment Function (TAF) value of 2–15% and a better Normalized Correlation (NC) is achieved compared to some of the above techniques. In particular, the proposed technique shows better robustness on compression attacks at moderate to higher compression ratios. It is possible to maintain the imperceptibility and low TAF for various values by doubling the capacity of the watermark.

Suggested Citation

  • J. L. Divya Shivani & Ranjan K. Senapati, 2017. "Robust Image Embedded Watermarking Using DCT and Listless SPIHT," Future Internet, MDPI, vol. 9(3), pages 1-16, July.
  • Handle: RePEc:gam:jftint:v:9:y:2017:i:3:p:33-:d:104497
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/1999-5903/9/3/33/pdf
    Download Restriction: no

    File URL: https://www.mdpi.com/1999-5903/9/3/33/
    Download Restriction: no
    ---><---

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:gam:jftint:v:9:y:2017:i:3:p:33-:d:104497. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: MDPI Indexing Manager (email available below). General contact details of provider: https://www.mdpi.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.