Abhishek Basu

On the Implementation of Robust Copyright Protection Scheme Using Visual Attention Model

ABSTRACT Perceptual watermarking should always take full advantage of the results from human visual system (HVS) studies. Based upon visual saliencys modulation effect which incorporates visual attentions influence on visual sensitivity, this paper proposes an integrated visual saliency modulated HVS model guided least significant bit (LSB) watermarking approach for copyright protection. The proposed algorithm can embed more information into visually non-belligerent areas within the host image, determined by the visual attention model. The region of uninterested (ROU) indicates the most unimportant visible aspects of an image, so distortion within these areas will be less noticeable to any viewer. To resist common signal processing attacks, for each ROU, an improved quantization method is employed to embed the copyright information. Experimental results demonstrate that the proposed method is more robust to various image impairments while minimum effect on the image quality as verified by objective evaluations while compared with the state-of-the-art watermarking schemes. Moreover, we have evaluated the theory of Kurtosis testing to the steganalysis of the host image.

FPGA prototype of visual information hiding

The current explosion of digital media creates threats towards the security in multimedia data broadcasting. Watermarking technique becomes a prospective solution to this coercion by means of Intellectual Property Right Protection, Authentication and Integrity Verification of digital media. In this paper we introduce an approach that enables us to develop a low power, real time, reliable and secure data hiding system. As an effort towards the power efficient system, here we present an oblivious, spatial domain watermarking based authentication algorithm and its FPGA implementation. The low cost data embedding algorithm can hide watermark into original cover image coming from a sensor much faster than software implementation and the embedded image is easily transmitted to PC by using appropriate interface.

On the Implementation of a Saliency Based Digital Watermarking

Digital watermarking at the least significant bit (LSB) for copyright protection is proposed in this paper based on the saliency map. The projected algorithm can embed more information into less perceptive areas within the original image determined by Itti-Koch saliency map. It gives a concept of the areas which has excellent data hiding capacity in an image. The area/region with less perceptibility denotes the most insignificant region from the aspect of visibility in an image, so any modification within these areas will be less evident to any observer. Here the algorithm is being evaluated by means of imperceptibility and robustness. Thus images embed with a watermark will project higher bit capacity.

On the Implementation of a Secured Digital Watermarking Framework

ABSTRACT In this paper, a saliency-based digital watermarking system which employs a higher degree security by means of Symmetric Key Cryptography is proposed. The projected algorithm can implant more information into less perceptive areas within the original image determined by saliency map. The scheme helps to detect the regions that have better data hiding capacity within an image. The locations with less perceptibility specifies the most insignificant location from the view of visibility within an image, so any alteration within these locations will be less apparent to any spectator. Moreover, the watermark is encrypted with Symmetric Key Cryptography to make it secure from the attackers. Here the algorithm is tested by means of imperceptibility and robustness.

On the Implementation of a Digital Watermarking Based on Phase Congruency

In this paper a human visual system (HVS) model guided least significant bit (LSB) watermarking approach for copyright protection is proposed. The projected algorithm can embed more information into less featured surrounded areas within the host image determined by phase congruency. Phase congruency offers a dimensionless quantity which is an excellent measure feature points with high information and low in redundancy within an image. The region with fewer features indicates the most trivial visible aspects of an image, so alteration within these areas will be less noticeable to any viewer. Furthermore the algorithm will be tested by means of imperceptibility and robustness. Thus a new spatial domain image watermarking scheme will be projected with higher bit capacity.

On the implementation of a information hiding design based on saliency map

In this paper, an adaptive spatial domain image watermarking scheme is proposed which embeds watermark information to the uneven bit depth salient image pixels. Watermarked image thus produced has better visual transparency with respect to human visual system (HVS) with high payload capacity. In proposed scheme, salient pixels are determined using the bottom-up Graph-Based Visual Saliency (GBVS) model. Experimental results reveal that proposed scheme has less perceptual error as well as improved robustness than existing spatial domain embedding scheme.

On the implementation of IP protection using biometrics based information hiding and firewall

System-on-chip-based design style creates a revolution in very large scale integration industry with design efficiency, operating speed and development time. To support this process, reuse and exchange of components are essential in electronic form called intellectual property (IP). This, however, increases the possibility of encroachment of IP of the design. So copyright protection of IP against piracy is the most important concern for IP vendors. The existing solutions for IP protection are still not secure enough with flexibility, cost, etc. This paper proposes an information-hiding-based solution for IP protection by embedding a biometric copyright information and firewall inside an IP in the form of a finite state machine with unique configuration. The scheme first introduces biometric signature-based copyright as ownership proof. Second, firewall interrupts the normal functionality of IP at the end of the user time period. The experimental outcomes of field-programmable-gate-array implementation illustrate the efficiency of the proposed method.

Implementation of a spatial domain salient region based digital image watermarking scheme

Digital domain is todays most preferred area for data processing and transmission. In case of data augmentation or authorized replication, copyright protection has become an exigent challenge. Digital watermarking is a conventional procedure to serve this purpose. Here a spatial domain image watermarking scheme is developed through a pixel based saliency map where the inadequate nature of human visual system is utilized. The experimental results and a brief assessment with some existing frameworks confirm that this proposed scheme not only makes the information transparent into the cover object but also provides superior robustness and hiding capacity.

FPGA implementation of Saliency based secured watermarking framework

In this paper authors proposed a secured Digital Biometric based watermarking algorithm and its hardware realization by means of Field Programmable Gate Array (FPGA). The scheme focuses on the Graph Based Visual Saliency (GBVS) technique. Biometric watermarking has been introduced for validity and ultimate security of a digital media. Biometric information which is basically fingerprint is being hidden in a cover image in an efficient way such that the quality of the original information is not corrupted. The result of imperceptibility is promising; moreover several attacks were made to prove the robustness of this technique. The hardware implementation of this algorithm is provided to validate this scheme.

A Cooperative Co-evolutionary Approach for Multi-objective Optimization

In today’s world, the interest on multi-objective optimization through evolutionary algorithms (EAs) is growing day by day. However, most of the relative researches are confined within small scale with relatively fewer number of decision variables limited within 30, though real-world multi-objective optimization problems deal with, most of the times, with more than hundred decision variables. Also, optimization with fully separable decision variables along with non-separable decision variables leads to more optimal solutions than dealing with only any one of the both. In this paper, we have proposed an algorithm, which deals with medium- to large-scale multi-objective decision variables, compares the optimal solutions of separable and non-separable decision variables, and accepts the one having most optimized decision. Here we have adopted the test functions (large-scale multiobjective and many-objective optimization test problems for separable decision variables and Zitzler–Deb–Thiele test suit for non-separable decision variables) that are scalable with more than 100 decision variables and can range the results of both separable and non-separable decision variables.