9
views
0
recommends
+1 Recommend
0 collections
    0
    shares
      • Record: found
      • Abstract: found
      • Article: found
      Is Open Access

      A Secured Frame Selection Based Video Watermarking Technique to Address Quality Loss of Data: Combining Graph Based Transform, Singular Valued Decomposition, and Hyperchaotic Encryption

      1 , 2 , 1 , 3 , 1
      Security and Communication Networks
      Hindawi Limited

      Read this article at

      Bookmark
          There is no author summary for this article yet. Authors can add summaries to their articles on ScienceOpen to make them more accessible to a non-specialist audience.

          Abstract

          The advancement of Internet technologies has led to the availability of audios, images, and videos in different forms. The unauthorized users are exploiting the use of multimedia by transmitting them on various Internet sites to earn money unethically without the intervention of the original copyright holder. Watermarking is a technique used to hide the signal known as watermark inside multimedia data that is not visible to the intruder to manipulate any information. In this paper, a secured watermarking approach is developed to tackle issues related to copyright protection and ownership identification. A Secured Graph Based Transform, Singular Valued Decomposition, and Hyperchaotic Encryption hybrid techniques are proposed. The watermark cannot be embedded in every frame of the video as it adds to the size of the video and watermark can be easily retrieved by an intruder. Therefore, the frame selection algorithm has been proposed in the given work. Adding watermark in the frame adds to the challenge of quality loss. The quality loss is addressed in this work. Various attacks have been applied on the watermarked frames to calculate the performance of the proposed technique using quality metrics: Peak Signal to Noise Ratio, Structural Similarity Index, Normalized Correlation, and Bit Error Rate. The results indicate that the proposed technique is effective against various attack scenarios.

          Related collections

          Most cited references11

          • Record: found
          • Abstract: not found
          • Article: not found

          Parallel strength Pareto evolutionary algorithm‐II based image encryption

            Bookmark
            • Record: found
            • Abstract: found
            • Article: found
            Is Open Access

            A Novel Hyperchaotic Image Encryption System Based on Particle Swarm Optimization Algorithm and Cellular Automata

            In this paper, we propose a hyperchaotic image encryption system based on particle swarm optimization algorithm (PSO) and cellular automata (CA). Firstly, to improve the ability to resist plaintext attacks, the initial conditions of the hyperchaotic system are generated by the hash function value which is closely related to the plaintext image to be encrypted. In addition, the fitness of PSO is the correlation coefficient between adjacent pixels of the image. Moreover, On the basis of hyperchaotic system, cellular automata technology is adopted, which can enhance the randomness of population distribution and increase the complexity and diversity of the population so that the security of the encryption system can be improved and avoid falling into local optimum. The simulation results and security analysis of the proposed encryption system demonstrate that the hyperchaotic image encryption system has high resistance against plaintext attack and statistical attack.
              Bookmark
              • Record: found
              • Abstract: found
              • Article: found
              Is Open Access

              A Robust Watermarking Scheme for Online Multimedia Copyright Protection Using New Chaotic Map

              The protection of copyrights of digital media uploaded to the Internet is a growing problem. In this paper, first, we present a unified framework for embedding and detecting watermark in digital data. Second, a new robust watermarking scheme is proposed considering this concern. The proposed work incorporates three chaotic maps which specify the location for embedding the watermark. Third, a new chaotic map, the Extended Logistic map, is proposed in this work. The proposed map has a bigger range than logistic and cubic maps. It has shown good results in a bifurcation, sensitivity to initial conditions, and randomness tests. Furthermore, with the detailed analysis of initial parameters, it is justified that Extended Logistic map can be used in secure communication, particularly watermarking. Fourth, to check the robustness of proposed watermarking scheme, we have done a series of analyses and standard attacks. The results confirm that the proposed watermarking scheme is robust against visual and statistical analysis and can resist the standard attacks.
                Bookmark

                Author and article information

                Contributors
                (View ORCID Profile)
                (View ORCID Profile)
                (View ORCID Profile)
                (View ORCID Profile)
                (View ORCID Profile)
                Journal
                Security and Communication Networks
                Security and Communication Networks
                Hindawi Limited
                1939-0122
                1939-0114
                March 6 2021
                March 6 2021
                : 2021
                : 1-19
                Affiliations
                [1 ]Department of Computer Science and Engineering, Lovely Professional University, Punjab, India
                [2 ]Department of Computer Application, Lovely Professional University, Punjab, India
                [3 ]Arba Minch University, Arba Minch, Ethiopia
                Article
                10.1155/2021/5536170
                c8f8a987-3a3e-4894-bd91-93dcf5518335
                © 2021

                https://creativecommons.org/licenses/by/4.0/

                History

                Comments

                Comment on this article