scholarly journals Reversible and Fragile Watermarking for Medical Images

2018 ◽  
Vol 2018 ◽  
pp. 1-7 ◽  
Author(s):  
Atta-ur-Rahman ◽  
Kiran Sultan ◽  
Nahier Aldhafferi ◽  
Abdullah Alqahtani ◽  
Maqsood Mahmud

A novel reversible digital watermarking technique for medical images to achieve high level of secrecy, tamper detection, and blind recovery of the original image is proposed. The technique selects some of the pixels from the host image using chaotic key for embedding a chaotically generated watermark. The rest of the pixels are converted to residues by using the Residue Number System (RNS). The chaotically selected pixels are represented by the polynomial. A primitive polynomial of degree four is chosen that divides the message polynomial and consequently the remainder is obtained. The obtained remainder is XORed with the watermark and appended along with the message. The decoder receives the appended message and divides it by the same primitive polynomial and calculates the remainder. The authenticity of watermark is done based on the remainder that is valid, if it is zero and invalid otherwise. On the other hand, residue is divided with a primitive polynomial of degree 3 and the obtained remainder is appended with residue. The secrecy of proposed system is considerably high. It will be almost impossible for the intruder to find out which pixels are watermarked and which are just residue. Moreover, the proposed system also ensures high security due to four keys used in chaotic map. Effectiveness of the scheme is validated through MATLAB simulations and comparison with a similar technique.

2020 ◽  
Vol 30 (3) ◽  
pp. 177-192
Author(s):  
Muhammad Tahir Naseem ◽  
Ijaz Mansoor Qureshi ◽  
Atta-ur-Rahman ◽  
Muhammad Zeeshan Muzaffar

Author(s):  
Hassan Kehinde Bello ◽  
Kazeem Alagbe Gbolagade

Smith-Waterman Algorithms (SWA) is becoming popular among researchers especially in the field of bioinformatics. The algorithm performance is better among other known alignment algorithms because of the high level of accuracy it exhibits. However, the algorithm performance is at low speed due to its computational complexity. Researchers are concerned with this problem and are looking for various ways to address the issue. Different approaches are adopted to improve the speed, such as the use of a systolic array to accelerate the algorithm, use of recursive variable expansion (RVE) method approach; some implemented the algorithm on software and hardware, etc. This paper used Residue Number System (RNS) approach to the algorithm of Smith-Waterman and carried out hardware implementation on Quartus II, 64-Bit version 12.1 (Cyclone II family) VHDL application software.  


Author(s):  
Vik Tor Goh ◽  
Mohammad Umar Siddiqi

In this chapter, a watermarking scheme that utilizes error correction codes for added robustness is proposed. A literature survey covering various aspects of the watermarking scheme, such as the arithmetic redundant residue number system, and concepts related to digital watermarking is given. The requirements of a robust watermarking scheme are also described. In addition, descriptions and experimental results of the proposed watermarking scheme are provided to demonstrate the functionality of the scheme. The authors hope that with the completion of this chapter, the reader will have a better understanding of ideas related to digital watermarking as well as the arithmetic redundant number system.


2017 ◽  
Vol 8 (3) ◽  
pp. 189-200 ◽  
Author(s):  
Jean-Claude Bajard ◽  
Julien Eynard ◽  
Nabil Merkiche

Author(s):  
Mikhail Selianinau

AbstractIn this paper, we deal with the critical problem of performing non-modular operations in the Residue Number System (RNS). The Chinese Remainder Theorem (CRT) is widely used in many modern computer applications. Throughout the article, an efficient approach for implementing the CRT algorithm is described. The structure of the rank of an RNS number, a principal positional characteristic of the residue code, is investigated. It is shown that the rank of a number can be represented by a sum of an inexact rank and a two-valued correction to it. We propose a new variant of minimally redundant RNS, which provides low computational complexity for the rank calculation, and its effectiveness analyzed concerning conventional non-redundant RNS. Owing to the extension of the residue code, by adding the excess residue modulo 2, the complexity of the rank calculation goes down from $O\left (k^{2}\right )$ O k 2 to $O\left (k\right )$ O k with respect to required modular addition operations and lookup tables, where k equals the number of non-redundant RNS moduli.


Sign in / Sign up

Export Citation Format

Share Document