IDEAS home Printed from https://ideas.repec.org/a/igg/jskd00/v12y2020i1p24-48.html
   My bibliography  Save this article

A Robust and Blind 3D Mesh Watermarking Approach Based on Particle Swarm Optimization

Author

Listed:
  • Mourad R. Mouhamed

    (Helwan University, Cairo, Egypt & Scientific Research Group in Egypt (SRGE), Cairo, Egypt)

  • Mona Mohamed Soliman

    (Cairo University, Cairo, Egypt)

  • Ashraf Darwish

    (Helwan University, Cairo, Egypt)

  • Aboul Ella Hassanien

    (Faculty of Computers and Information, Cairo University, Cairo, Egypt)

Abstract

This article presents a robust 3D mesh watermarking approach, which adopts an optimization method of selecting watermark vertices for 3D mesh models. The proposed approach can enhance the imperceptibility of the watermarked model without affecting the robustness and capacity factors. The proposed watermark approach depends on an embedding algorithm that use a clustering strategy, based on K−means clustering algorithm in conjunction with the particle swarm optimization to divide the mesh model vertices into groups. Points of interest set (POIs) are selected from these clustered groups and mark it as watermark vertices where the (POIs) are invariant to most of the geometrical and connectivity attacks. Then, the proposed approach inserts the watermark bit stream in the decimal part of spherical coordinates for these selected watermark vertices. The experimental results confirm that the proposed approach proves its superiority compared with state-of-the-art techniques with respect to imperceptibility and robustness.

Suggested Citation

  • Mourad R. Mouhamed & Mona Mohamed Soliman & Ashraf Darwish & Aboul Ella Hassanien, 2020. "A Robust and Blind 3D Mesh Watermarking Approach Based on Particle Swarm Optimization," International Journal of Sociotechnology and Knowledge Development (IJSKD), IGI Global, vol. 12(1), pages 24-48, January.
  • Handle: RePEc:igg:jskd00:v:12:y:2020:i:1:p:24-48
    as

    Download full text from publisher

    File URL: http://services.igi-global.com/resolvedoi/resolve.aspx?doi=10.4018/IJSKD.2020010102
    Download Restriction: no
    ---><---

    More about this item

    Statistics

    Access and download statistics

    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:igg:jskd00:v:12:y:2020:i:1:p:24-48. 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: Journal Editor (email available below). General contact details of provider: https://www.igi-global.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.