Reversible Data Hiding VIA Optimal Code for Image
Journal Title: International Journal of Modern Engineering Research (IJMER) - Year 2013, Vol 3, Issue 3
Abstract
Digital watermarking often referred to as data hiding for assuring the information. Data hiding in image processing may occur the permanent distortion and hence the original cover medium may not be able to be reversedexactly, after the hidden data have been extracted out. In our previous work, generalize the method of decompressionalgorithm as the coding schem for embedding data and prove the codes can reach the rate–distortion bound as long asthe compression algorithm reaches entropy and uses a binary covers for embedding messages. A codeconstructionforrecursivereversibledatadingestablished a rate–distortion model. In our work presents a novel lossless data-embedding technique, which enables the exact recovery of the original image upon the extractionoftheembeddedinformation.AfterheDecompression, the original message will retrieved. The marked coverisreconstructedandextracting the original message from the cover. In our research work, improve the histogram shifting of compressing features and to construct the recursive code for gray scale covers.
Authors and Affiliations
Senthil Rani D
Keywords
Related Articles
- EP ID EP104119
- DOI -
- Views 98
- Downloads 0
Electrocoagulation: A Novel Waste Water Treatment Method
ABSTRACT: A renewed interest in electrocoagulation has spurred by the search for reliable, cost effective method for the treatment of polluted water. Electrocoagulation present a robust novel and innovative alterna...
Optimal Placement of Distributed Generation on Radial Distribution System for Loss Minimisation & Improvement of Voltage Profile
This project implements the IDENTIFICATION OF OPTIMAL DG LOCATIONS BY SINGLE DG PLACEMENT algorithm. This method first evaluates the voltage profile using the Newton-Raphson method and then it calculates the tota...
Calibration Estimator Using Different Distance Measures in Stratified Random Sampling
Abstract: Calibration estimators of finite population mean with different weights are considered. We define some new weights by using various loss functions. The estimators derived are compared by simulation.
BER Performance for Convalutional Code with Soft & Hard Viterbi Decoding
Viterbi decoding has a fixed decoding time. It is well suited to hardware decoder. Hear we proposed Viterbi algorithm with Decoding rate 1/3. Which dynamically improve performance of the channel.
Optimal Location and Sizing of DG using Fuzzy logic
Introduction of distributed generation modifies the structure of power system network. High levels of penetration of distributed generation (DG) are new challenges for traditional electric power systems. A powe...