Recursive histogram modification establishing equivalency between reversible data hiding and lossles

ZEBROS PROJECTS

WAY TO YOUR GOAL

MATLAB PROJECTS FINAL YEAR PROJECTS IEEE PROJECTS 2013-2014 CONTACT: 9940098300, 9500075001 E-Mail:zebrosprojects@gmail.com

Office Address: No 4 / Flat No 3D, Sai Kiran Apts, First Main Road, Kasturba Nagar, Chennai-20 web: www.zebros.in e mail : zebrosprojects@gmail.com mob: 99400 98300,9500075001

ZEBROS PROJECTS Recursive Histogram Modification: Establishing Equivalency Between Reversible Data Hiding and Lossless Data Compression Abstract State-of-the-art schemes for reversible data hiding (RDH) usually consist of two steps: first construct a host sequence with a sharp histogram via prediction errors, and then embed messages by modifying the histogram with methods, such as difference expansion and histogram shift. In this system, we focus on the second stage, and propose a histogram modification method for RDH, which embeds the message by recursively utilizing the decompression and compression processes of an entropy coder. We prove that, for independent identically distributed (i.i.d.) gray-scale host signals, the proposed method asymptotically approaches the rate-distortion bound of RDH as long as perfect compression can be realized, i.e., the entropy coder can approach entropy. Therefore, this method establishes the equivalency between reversible data hiding and lossless data compression. Experiments show that this coding method can be used to improve the performance of previous RDH schemes and the improvements are more significant for larger images. ZEBROS PROJECTS SOFTWARE BASED Networking

HARDWARE BASED VLSI

Data Mining

Mat lab

Grid Computing

Robotics

Network Security

Embedded

Image Processing

Bio Medical

Web Applications

Power Systems

Mobile Computing

Power Electronics

Software Engineering

Java with Embedded

Cloud Computing

Android

Office Address: No 4 / Flat No 3D, Sai Kiran Apts, First Main Road, Kasturba Nagar, Chennai-20 web: www.zebros.in e mail : zebrosprojects@gmail.com mob: 99400 98300,9500075001

ZEBROS PROJECTS What is IEEE? The Institute of Electrical and Electronics Engineers or IEEE (read eye-triple-e) is Incorporated in the State of New York, United States. It was formed in 1963 by the merger of the Institute of Radio Engineers (IRE, founded 1912) and the American Institute of Electrical Engineers (AIEE, founded 1884). A membership organization comprised of engineers, scientists and students that sets standards for computers and communications. It is a nonprofit organization with more than 365,000 members in around 150 countries. The IEEE describes itself as "the world's largest technical professional society -promoting the development and application of electro technology and allied sciences for the benefit of humanity, the advancement of the profession, and the well-being of our members." Why IEEE based projects?   

It grantees for standard It assured latest solution for problems It delivers new patented technologies at an ever-increasing pace

It access world-class technical information provided by the IEEE and cut down your research time.

OUR FEATURES

 24*7 Call Support  Project Execution through Remote System  20 Days Technical classes taken by Corporate Trainer  Unlimited Project & Technical Support through your academic  Project software Installation support

Office Address: No 4 / Flat No 3D, Sai Kiran Apts, First Main Road, Kasturba Nagar, Chennai-20 web: www.zebros.in e mail : zebrosprojects@gmail.com mob: 99400 98300,9500075001

ZEBROS PROJECTS PROJECT SUPPORT 0th Review        

Abstract Existing System Disadvantages Proposed System Advantages Objective System Requirements System Architecture 2nd Review

       

Use case Diagram Class Diagram Collaboration Diagram Sequence Diagram Activity Diagram Testing & test cases Partial Code Screenshot for First two module  Review Document Explanation Final Review

1st Review        

Literature Survey Module List Module Description Data Flow Diagram Level DFD Module Wise DFD Problem Definition Review Document Explanation 3rd Review

      

Conclusion References Future Enhancement 65% code (Executable Format) Required Software Review Document Explanation

 Complete Code with Enhancement  Final Document (University Standard Format)  Complete Explanation for Project Concept & Code

Office Address: No 4 / Flat No 3D, Sai Kiran Apts, First Main Road, Kasturba Nagar, Chennai-20 web: www.zebros.in e mail : zebrosprojects@gmail.com mob: 99400 98300,9500075001

Turn static files into dynamic content formats.

Create a flipbook

Recursive histogram modification establishing equivalency between reversible data hiding and lossles

Published on Nov 14, 2013Technology & Computing

zebrosprojects

Abstract State-of-the-art schemes for reversible data hiding (RDH) usually consist of two steps: first construct a host sequence with a sharp histogram via prediction errors, and then embed messages by modifying the histogram with methods, such as difference expansion and histogram shift. In this system, we focus on the second stage, and propose a histogram modification method for RDH, which embeds the message by recursively utilizing the decompression and compression processes of an entropy coder. We prove that, for independent identically distributed (i.i.d.) gray-scale host signals, the proposed method asymptotically approaches the rate-distortion bound of RDH as long as perfect compression can be realized, i.e., the entropy coder can approach entropy. Therefore, this method establishes the equivalency between reversible data hiding and lossless data compression.