Orthogonal Data Embedding for Binary Images in Morphological Transform Domain – A Hig
Thread Rating:
  • 0 Vote(s) - 0 Average
  • 1
  • 2
  • 3
  • 4
  • 5
project report helper
Active In SP

Posts: 2,270
Joined: Sep 2010
27-09-2010, 12:47 PM

.doc   project[1].doc (Size: 628 KB / Downloads: 64)
Orthogonal Data Embedding for Binary Images in Morphological Transform Domain – A High – Capacity Approach

Submitted For the Partial Fulfillment of the Requirement
For the Degree of Master of Computer Applications
Under the Guidance of

study tips
Super Moderator

Posts: 10,180
Joined: Feb 2013
07-09-2013, 04:29 PM


.docx   ORTHOGONAL DATA EMBEDDING.docx (Size: 12.62 KB / Downloads: 10)


This paper proposes a data-hiding technique for binary images in morphological transform domain for authentication purpose. To achieve blind watermark extraction, it is difficult to use the detail coefficients directly as a location map to determine the data-hiding locations. Hence, we view flipping an edge pixel in binary images as shifting the edge location one pixel horizontally and vertically. Based on this observation, we propose an interlaced morphological binary wavelet transform to track the shifted edges, which thus facilitates blind watermark extraction and incorporation of cryptographic signature. Unlike existing block-based approach, in which the block size is constrained by 3 *3 pixels or larger, we process an image in 2* 2 pixel blocks. This allows flexibility in tracking the edges and also achieves low computational complexity. The two processing cases that flipping the candidates of one does not affect the flip ability conditions of another are employed for orthogonal embedding, which renders more suitable candidates can be identified such that a larger capacity can be achieved. A novel effective Backward-Forward Minimization method is proposed, which considers both backwardly those neighboring processed embeddable candidates and forwardly those unprocessed flip able candidates that may be affected by flipping the current pixel.
Watermarking and data-hiding techniques have found wide applications in ownership identification, copy protection, fingerprinting, content authentication and annotation. The design requirements for a data-hiding or watermarking system are different catering for different applications. Recently authentication of digital documents has aroused great interest due to the wide applications in handwritten signatures, digital books, business documents, personal documents, maps, and engineering drawings. On the other hand, editing an image becomes easier with the powerful image editing tools and digital cameras. Authentication to detect tampering and forgery is thus of primary concern. To ensure the authenticity and integrity of these digital documents has increased the confidence level from the user point of view. Most data-hiding techniques for binary images are based on spatial domains the goal of authentication is to ensure that a given set of data comes from a legitimate sender and the content integrity is preserved.
Hard authentication rejects any modification made to a multimedia signal, whereas soft authentication differentiates legitimate processing from malicious tampering. This paper focuses on hard authenticator watermark-based authentication. Specifically, we investigate the problem of data hiding for binary images in morphological transform domain. Generally speaking, data hiding in real-valued transform domain does not work well for binary images due to the quantization errors introduced in the pre/post-processing. In addition, embedding data using real-valued coefficients requires more memory space. We observe that the morphological binary wavelet transform can be used to track the transitions in binary images by utilizing the detail coefficients. One rather intuitive idea in employing the morphological binary wavelet transform for data hiding is to use the detail coefficients as a location map to determine the data-hiding locations.
However, this makes it difficult to achieve blind watermark extraction due to the fact that once a pixel is flipped, the horizontal, vertical and diagonal detail coefficients will change correspondingly. This problem will be discussed in more detail in Section II. The idea of designing an interlaced transform to identify the embeddable locations is motivated by the fact that some transition information is lost during the computation of a single transform and there is a need to keep track of transitions between two and three pixels for binary images data hiding .

Important Note..!

If you are not satisfied with above reply ,..Please


So that we will collect data for you and will made reply to the request....OR try below "QUICK REPLY" box to add a reply to this page

Quick Reply
Type your reply to this message here.

Image Verification
Please enter the text contained within the image into the text box below it. This process is used to prevent automated spam bots.
Image Verification
(case insensitive)

Possibly Related Threads...
Thread Author Replies Views Last Post
  Privacy-Preserving Public Auditing for Data Storage Security in Cloud Computing PPT project girl 1 1,027 21-10-2015, 01:52 PM
Last Post: Guest
  Data Hiding in Video using Least Bit Technique seminar tips 1 600 18-10-2014, 05:40 AM
Last Post: wayan sukadana
  data mining full report project report tiger 35 199,294 03-10-2014, 04:30 AM
Last Post: kwfEXGu
  A Novel Data Embedding Method Using Adaptive Pixel Pair Matching Report project girl 4 1,876 18-09-2014, 03:49 PM
Last Post: Radhika.m
  Cooperative Provable Data Possession for Integrity Verification in Multi-Cloud Storag seminar flower 3 3,193 23-05-2014, 10:04 AM
Last Post: seminar project topic
  Cross-Domain Privacy-Preserving Cooperative Firewall Optimization Vasudevan313 0 388 24-10-2013, 11:11 PM
Last Post: Vasudevan313
  Discrete Wavelet Transform-Based Satellite Image Resolution Enhancement seminar girl 2 1,668 30-09-2013, 04:39 PM
Last Post: Guest
  Image Data Acquisition and compression using K-RLE Algorithm on Embedded ARM ppt seminar projects maker 0 616 28-09-2013, 04:36 PM
Last Post: seminar projects maker
  The Use of Interval-Related Expert Knowledge in Processing 2-D and 3-D Data seminar projects maker 0 340 26-09-2013, 02:13 PM
Last Post: seminar projects maker
  Data Hiding in Motion Vectors of Compressed Video Based on Their Associated pdf seminar projects maker 0 398 19-09-2013, 03:37 PM
Last Post: seminar projects maker