3 Phase Systems

1.
Introduction
1.1 Introduction…………………………………………………. 1
1.2 Problem definition …………………………………………. 2
1.3 Motivation …………………………………………………... 4
1.4 Literature survey ………………………………………........ 6
1.5 Plan of the report ………………………………………….... 8
2. Feasibility analysis and srs
2.1 Feasibility analysis ……………………………………….. 10

2.2 Srs documentation …………………………………………11
3. System design
3.1 Introduction ………………………………………………. 15

3.2 Modules description ……………………………………… 16
3.3 Interface description……………………………………… 34
3.4 Use case diagram …………………………………………. 35
4. Detail design
4.1 UML diagrams……………………………………………..36
5. Implementation
5.1 Class ………………………………………………...………42

5.2 Methods ………………………………………………...…..43
5.3 Cardinality …………………………………...….. ………..45
5.4 Interface ……………………………………...……….. …. 45
5.5 Other procedures ……………………………...………..… 46
 Anti-spy Image Transmission

0
6. Testing
6.1 What is testing? …………………………… ………………47

6.2 Unit testing ………………………………. ………….…… 47
6.3 Integration testing …………………………..…………….. 48
6.4 Validation testing…………………………….……..…….. 49
6.5 System testing …………………………………….…….…..51
6.6 Example test cases …………………………………………54
7. Result analysis and conclusion
7.1 Result analysis ………………………………………..…….56

7.2 Conclusion ……………………………………………….…57
7.3 Future enhancement ………………………………………58
8. Appendix A
8.1 UML diagrams ……………………………………..….…...59
9. Appendix B
9.1 Interfaces ………………………………………………
10. Appendix C
10.1 Input/output windows …………………………….………64
11. Appendix D
11.1 Snapshots ……………………………………………..…...67
12. Bibliography
12.1 Websites ……………………………………………...……77
12.2 Textbooks ………………………………………………….78
12.3 Generals …………………………………………...………79

1
12.4 Paper References……………………………………..……79
Chapter-1
Introduction

2
1.1Introduction
Enormous technical growth in multimedia and networking causes severe problems for
transmitting data (image, video, text e.t.c).we are developing our product with enhanced
capabilities of image transmission from host to host with high transmission speed. Generally
image will be sent entirely but we transmit the divided image to different hosts within the
network then all the frames are concatenated without sacrificing the image quality for secured
transmission.
In multimedia exploitation there is a need for new business models, supported by new and
advanced technology. Digital multimedia content (text, images, audio and video) is made
available via many different channels, of which the Internet is becoming more and more
important. Besides the opportunities of the Internet for multimedia distribution there are also
serious threats for the multimedia industry. Modern computer networks make it possible for
consumers to (illegally) copy and distribute multimedia at almost no cost. The existing legal
institutions for protecting the intellectual property owned by the content creators do not provide
sufficient protection against this. Digital watermarking is a new but rapidly developing
technology, especially as a mean of copyright protection of digital multimedia properties, such as
digital images and video. Currently, there is no internationally recognized tool to assess the
performance of watermarking algorithm, which hampers its standardization and
commercialization process.
The increase in the availability of digital data (e.g. video, audio, and images) on the Web has led
to large-scale unauthorized copying and increased the opportunity for violation of copyright and
tampering with (or the modification of) content. The reason is simple digital representation of
media facilitates access and potentially improves the portability, efficiency, and accuracy of the
information presented. As a result, there is a pressing need to manage and protect visual material
against manipulation and illegal duplication .One approach to address this problem involves
embedding an invisible structure into a host multimedia data to mark ownership of them. To
accomplish this, a large number of information hiding techniques have been proposed in the
literature. The results achieved in the last 6 years, in a number of application areas involving

3
audio, video, and digital images, have pointed to information hiding as one important topic
related to the area of information security.
The information hiding area brings together researchers with very die rent backgrounds: electrical
engineering, signal and image processing, computer science, and cryptography. The main
disciplines studied so far have focused on covert channels, steganography, anonymity, and
watermarking. This classification of information hiding techniques was first proposed by Bauer.
However, other researchers consider steganography, digital watermarking, and fingerprinting at
the same level. Recent research has pointed to steganography and digital watermarking as two
areas which are generally referred to as information hiding. We outline the major disciplines
related to information hiding and the applications driving interest in them, focusing on digital
watermarking in particular. First, we present the watermarking principles and then a
watermarking taxonomy based on the domain of insertion, applications area, and types of existing
algorithms. We also analyze the current status of watermarking techniques, focusing on
technological progress, limitations, and some challenges for future research. We do not
investigate state-of-art of steganography because recent work has already been done in this area.
1.2Problem description
Earlier in networks we don’t have enough security and confidentiality while transmitting the
image. Even though we have so many encryption techniques, they are implemented only on the
particular system i.e. we don’t run the same on different machines .illegal copying or hacking is
main deficiency in the network transmission, so we managed to develop this project in order to
solve the mentioned problems by using some advanced features of technology. This product is to
provide security from illegal copying, malicious access (hacking) and virus infested applications
during the transmission of image in the network. Introducing java (byte code) based system
enhances portability of this software.

4
1.3 Motivation
For telecommunication systems, various compression and encryption techniques are proposed to
satisfy a fast and secure transmission. Most block-cipher image encryption schemes based on
chaos theory have independent modules for confusion and diffusion processes. None of the
current schemes use partition concept in the image transmission - thus not utilizing the
capabilities of partition and slicing to the fullest extent. We can do better: we integrate these
mechanisms into a single step, thus making the encryption process efficient. This paper presents
three novelties: (a) we extend normal encryption method to partition and encrypt (b) we embed
the 128 bit encryption process one of the application of watermarking techniques and (c) we
extend the proposed method to greater compression in image transmission by using the
compression algorithm. Color image encryption is usually performed by encrypting each channel
independently and then combining these to get the encrypted image. We demonstrate that with
this simplistic approach, decrypting even a single channel would reveal reasonable information
contained in the image. In our approach, this drawback is eliminated because of the inherent
dependence between the data contained in all the channels, thus highlighting the inherent
superiority of the proposed algorithm for color image security .
Motivation for JPEG
Despite the success of JPEG in the 1990s, a growing number of new applications such as high-
resolution imagery, digital libraries, high-fidelity color imaging, multimedia and Internet
applications, wireless, medical imaging, etc., require additional, enhanced functionalities from a
compression standard that other image formats cannot satisfy due to some of its inherent
shortcomings and design points that were beyond the scope of other image formats when it was
developed in the previous decade. The shortcomings of JPEG can be seen in a number of areas:
distortion and artifacts, ineffective handling of high-quality images, poor compression for lossless
images, lack of effective color-space support, and lack of resolution scaling. Distortion and
artifacts introduced by JPEG in compressing large images, especially at high compression rates,
manifest in the well known blocking or tiling artifacts where each 8-by-8-pixel region developed
well-defined edges, and ringing artifacts where small waves appear next to sharp edges in the
image. The limitation of JPEG's 64-kilopixel sample size and the limitation to either 8- or 12-b
samples have proven to be too restrictive for many new imaging applications such as medical and
high-resolution imagery. The lack of effective color-space support in Gif ,Tiff, Raw ,Ping ,Bmp
and other formats severely hinders its adoption in prepress and other graphics arts applications

5
where consistent color information from image capture to editing, display, or printing has to be
tightly managed. Finally, poor compression for lossless images is also seen as a limitation
because the lossless mode in JPEG is accomplished by a completely different method than the
lossy mode, and moving from one to the other requires completely decoding and recoding the
image. While the extended JPEG systems (such as FlashPix and other proprietary file formats)
could address some of these shortcomings, their results were mixed and widespread adoptions
were not seen. Some of these solutions were driven by industry consortia that are operating based
on business needs as the first objective and lacked the wide reaching development process of a
formal standards approach such as the ISO standardization process.
1. 4 LITERATURE SURVEY
Image Transmission Techniques (Advances in Electronics and Electron Physics Supplement

12)
Pratt, William K
Academic Press, 1979. First Edition. Hard Cover. Good/No Jacket. From the Preface: "An
attempt has been make to produce a volume that will serve as a practical guide to the designer of
image transmission systems and provide answers to pertinent questions". Published by Academic
Press. 1979. Hardback lacking dustjacket. 281 pages. CONDITION: Ex-library copy from a
company library with pocket, label remains, stamping and markings to front endpapers. Pages are
clean and bright with no other markings, and no tears. A couple pages have light wrinkling. Cover
is clean with scuffing, rubbing and light edge wear. Binding is tight. 8vo - over 7¾" - 9¾" tall.
Ex-Library.
Introduction to Data Compression
By Khalid Sayood
This important new multimedia book concentrates on the significance of data compression for
storing and transmitting large masses of information for all media types. Algorithms, examples,
and discussions of official data compression standards for each medium allow practicing
engineers and computer scientists to efficiently manipulate these growing masses of information.

6
Cryptography And Network Security
By William Stallings
In this age of viruses and hackers, of electronic eavesdropping and electronic fraud, security is
paramount. This solid, up-to-date tutorial is a comprehensive treatment of
Cryptography and network security is ideal for self-study. Explores the basic issues to be
addressed by a network security capability through a tutorial and survey of cryptography and
network security technology. Examines the practice of network security via practical applications
that have been implemented and are in use today. Provides a simplified AES (Advanced
Encryption Standard) that enables readers to grasp the essentials of AES more easily. Features
block cipher modes of operation, including the CMAC mode for authentication and the CCM
mode for authenticated encryption. Includes an expanded, updated treatment of intruders and
malicious software. A useful reference for system engineers, programmers, system managers,
network managers, product marketing personnel, and system support specialists.
http://www.ulg.ac.be/telecom/publi/Keyword/IMAGE-PROCESSING.html
The method we propose for the selective encryption of JPEG images is based on the encryption
of DCT coefficients. The encryption of the quantified coefficients prior to the HUFFMAN
entropy coding would be inefficient in terms of compression. But it is possible to modify the way
coefficients are encoded.

7
1.5 Plan of the Report
In this report the Chapter 1 gives details about the problem description of the project
motivation literature survey and plan of the report.
In the Chapter 2 feasibility analysis and Software Requirements Specification document

is given that includes all the software and hardware requirements, external interface requirements,
performance requirements and other requirements of the project.
In the Chapter 3 the system design is given in that module, interface description is given
and along with that use case diagrams are also included.
In the Chapter 4 the detailed design gives description about UML diagrams.
In the Chapter 5 the implementation containing class description. (Method, cardinality

interfaces and other procedures)
In chapter 6 different types of testing strategies (unit, integration, validation and system
testing) and applicable test cases are given.
In chapter 7 Result Analysis, future enhancements are provided and conclusion of the
project is specified.

8
CHAPTER-2
Feasibility Analysis

9
2.1.1 Technical Feasibility
As per the technology is considered it is advanced in terms of manpower, intelligence,

machine requirements, the company has Tomcat Server, Daffodil Database, Window XP
Professional operating system, J2EE as technology, hence the system is found to be technically
feasible.
2.1.2 Economical Feasibility
Regarding the cost and benefits, the application, which is to be developed and implemented,
will give large benefits to the company as it saves time and reduces efforts of interaction
between various users. Thus this project is considered economically feasible.
2.1.3 Operational Feasibility
Operational feasibility is a consideration about the working of the application after the
product being installed on to any system. The company, which will use the product, can also use
the application to interact with its own people as well as its clients. This is meant to increase
productivity in the long run. Thus this project is considered operational feasible.

10
2.2. SOFTWARE REQUIREMENT SPECIFICATION
2.2.1 Problem definition
Aim: The main aim of the project is to transmission of the image securely in the network.
2.2 .2 Project scope
The main goal of this product is to introduce an efficient technique for image transmission
in the network. We use Java for developing this product because it enhances portability i.e. we
can run this product on different remote systems, special characteristics of Java web applications,
copyright protection faces new challenge and ease of developing. Adobe Image ready is one of
the important tool to partition the image.
2.2.3 Problem description
This Software Requirements Specification provides a complete description of all the

functions and specifications of the Anti-spy Image Transmission. Earlier in networks we don’t
have enough security and confidentiality while transmitting the image. Even though we have so
many encryption techniques, they are implemented only on the particular system i.e. we don’t run
the same on different machines .illegal copying or hacking is main deficiency in the network
transmission, so we managed to develop this project in order to solve the mentioned problems by
using some advanced features of technology. This product is to provide security from illegal
copying, malicious access (hacking) and virus infested applications during the transmission of
image in the network. Introducing java (byte code) based system enhances portability of this
software.

11
2.3 Overall Description
2.3.1 Product Perspective
The growth of networked multimedia systems has created a need for the copyright
protection of digital images and video. In ancient systems java byte code technique provides high
portability that poses large dangers To defend the data against a malicious client, we enhanced
the existing System by new technology called partition and encrypt technique which will provide
secured data transmission.
2.3.2 Product Features
This product on following
 Retrieved Image doesn’t sacrifice the quality of the transmitted image.

 Prevents the unauthorized access.
 Portability.
2.4 External Interface Requirements
2.4.1 Hardware Requirements
The selection of hardware is very important in the existence and proper working of any
software. In the selection of hardware, the size and the capacity requirements are also important.
The Digital Watermarking Algorithm (FHT) can efficiently run on System with minimum
requirements, of at least 128 MB RAM and Hard disk drive having 20 GB that can be driven by a
processor of 600 MHz suits the information system operation.

12
 Processor - PIII, 600MHz
 RAM Capacity - 128MB or above
 Hard Disk - 20GB or above
2.4.2 Software Requirements
One of the most difficult tasks is that, the selection of the software, once system
requirement is known is determining whether a particular software package fits the requirements.
This section first summarizes the application requirement question and then suggests more
detailed comparisons.
 Operating System - Windows 2000 or later

 Software - Java
 Adobe Image Ready
2.4.3 Functional requirements
This sub section of the SRS provides a summer of the functions that the individual modules
should perform.
2.4.3.1 Algorithms
Here different types of algorithms for encryption, decryption and image slicing.
This best should be considered on basis of importance and services provides to the project which
is used to provide user friendliness to user while executing algorithms for extreme reference.
2.4.3.2 Results
Here results are nothing but the encrypted image to transfer to other target device, decrypted
image to retrieve the actual image.

13
2.5 Communications Interfaces
 We are intended to transmit image or data through a network for this we have to maintain
communication between the clients by using the TCP/IP communication protocol.
 Prominent technique to blur the image is done by the DIGITAL WATERMARKING
ALGORITHM.
2.6 Safety Requirements
Make sure that all transmitting and receiving hosts are under proper working condition if
not, we have to use the any ARQ technique.

14
CHAPTER-3
SYSTEM DESIGN

15
3.1 Introduction
This System contains the following modules:
 1.Partition & Extraction

 2.Encryption
 3.Channelization
 4.Decryption
3.2 Module Description
3.2.1 Partition & Extraction
3.2.1.1 Slicing and Linking with ImageReady
With the advent of huge arrays such as that used in the SBIG STL 11000M camera, no monitor in
existence can display all of the detail present in an image. Even if one had such a monitor,
making it a reasonable desktop size would make the detail almost too small to see with normal
eyesight. That is the reason we have discussed how to do rollover zooms and image maps and
these techniques are quite good if the master image has only a few areas of interest (AOI). For
some images, however, there are AOI that cover nearly the entire image. For such images, neither
image maps nor rollovers are practical. For these images we need a technique that gives the

16
viewer easy access to a full scale zoom of any part of the image. One such technique is what I call
slice and link. This tutorial will demonstrate how to create a slice and link image page using
ImageReady.
3.2.1.2 Set Up
Load the image you wish to use for the slice and link into Photoshop first. Instead of sizing it to
fit the webpage that it will be used on, this time we need to start with the FULL SIZED IMAGE.
To avoid degrading the image unnecessarily, it is best to save the image in a loss-less format such
as .TIFF or .PSD. Only when doing a final save should it be placed in .JPG mode. For this
tutorial, I will use a small, four-slice ST10 image as a simple example. The starting image is
shown in figure one.
3.2.1.3 Slice it up
Now you may close Photoshop and use ImageReady to open the image you just saved. The first
step in ImageReady is to "slice" the image. The important thing here is to make your slices the
right size to display on the most commonly used monitor resolution (1024 x 768). To allow space
for text and other auxiliary items on the webpage, I recommend keeping the size of the slices
under 1000 wide and 700 high. This size is further reduced to 944 wide and 688 high if you are
going to use a graphical pan feature as described in "Pan-Handling". You will need to do a little
math to decide how many slices across and down you will need. Instead of using the slice
creation tool as we did for rollovers to divide the image into slices, we will use a feature that is
designed to do just what we want to do and do it easily. Go to [Slices], and [Divide Slice]. You
will see the dialog shown in figure two appear. All you have to do is input the result of your
calculations into the "slices down" and "slices across" boxes and your image will be magically
and perfectly sliced! This is shown in figure two. In this case, the image is divided into four total
slices shown by the yellow lines. Also note that the slices have appeared in the Web
Content/Slices palette.
3.2.1.4 Configuring Slice Links

17
Next we will configure the links that clicking on each part of the main image will take the user to.
This is shown in figure three. First activate the slice selection tool on the right side of the tool
palette (blue arrow). Then select the fist slice. For the URL (red arrow), I feel it is simplest to
stick with the number that ImageReady assigns to the slice. These are assigned left to right and
top to bottom. The slice shown is the upper left slice so is slice 01. I have found that you can
simply copy the "name" (green arrow) and paste it into the "URL" (red arrow) and add the
extension ".htm". This helps to avoid confusion later. For the target (yellow arrow), decide how
you want the new page to display and choose the appropriate option. For "Alt" (purple arrow), I
generally use "Click to Zoom" since it serves as a reminder for the user. The same applies to the
"Status Bar Message" shown by the orange arrow. The slice size is just a bit bigger than the 1000
x 700 that I recommended, but this should suffice for the tutorial demo.
3.2.1.5 Resizing
Now that the full-sized sliced images that will be used on our zoomed pages are safely out of the
way in a new directory, go to [Image], [Image Size] and resize the main image to fit on a normal
webpage. This is shown in figure seven. Next, re-save both the HTML and the images. Note that
ImageReady will ask you to allow an overwrite of the HTML, but not of the images (since they
were moved). Since we want to overwrite the HTML, this is OK. If ImageReady asks to
overwrite of the images, they have not been moved and should do so. What we will now have is
TWO sets of smaller images. One of these will be full sized, the other will be smaller and make
up our smaller main.
3.2.2 Encryption
Watermarking is the process of electronically attaching the identity (secret, analogue or digital) of
the owner of a copyright in a way that is difficult to erase. This process is comparable to placing
an electronic stamp on the document. In some cases, the word \watermark" is used exclusively for
a hidden identity code. This new research area is a multidisciplinary field that combines image
and signal processing with cryptography, communication theory, coding theory, signal
compression, and the theory of visual perception. Interest in this field has recently increased
because of the wide spectrum of applications it addresses.
3.2.2.1 Digital Watermarking

18
Watermarking is not a new technique. It is descendent of a technique known as steganography
which had been in existence for at least a few hundred years.
Steganography is a technique for concealed communication. In contrast to cryptography where

the content of a communicated message is secret, in steganography the very existence of the
message that is communicated is a secret and its presence is known only by parties involved in
the communication. Steganography is technique where a secret message is hidden within another
unrelated message and then communicated to the other party. Some of the techniques of
steganography like use of invisible ink, word spacing patterns in printed documents, coding
messages in music compositions, etc., have been used by military intelligence since the times of
ancient Greek civilization
Watermarking can be considered as a special technique of steganography where one message is

embedded in another and the two messages are related to each other in some way. The most
common examples of watermarking are the presence of specific patterns in currency notes which
are visible only when the note is held to light and logos in the background of printed text
documents. The watermarking techniques prevent forgery and unauthorized replication of
physical objects.
Digital watermarking is similar to watermarking physical objects except that the watermarking
technique is used for digital content instead of physical objects. In digital watermarking a low-
energy signal is imperceptibly embedded in another signal. The low-energy signal is called
watermark and it depicts some metadata, like security or rights information about the main signal.
The main signal in which the watermark is embedded is referred to as cover signal since it covers
the watermark. The cover signal is generally a still image, audio clip, video sequence or a text

19
document in digital format.
The digital watermarking system essentially consists of a watermark embedder and a watermark
detector (see Figure 1). The watermark embedder inserts a watermark onto the cover signal and
the watermark detector detects the presence of watermark signal. Note that an entity called
watermark key is used during the process of embedding and detecting watermarks. The
watermark key has a one-to-one correspondence with watermark signal (i.e., a unique watermark
key exists for every watermark signal). The watermark key is private and known to only
authorized parties and it ensures that only authorized parties can detect the watermark. Further,
note that the communication channel can be noisy and hostile (i.e., prone to security attacks) and
hence the digital watermarking techniques should be resilient to both noise and security attacks.
3.2.2.2 Features of Digital Watermarking
As mentioned earlier, digital watermarking techniques are useful for embedding metadata in
multimedia content. There are alternate mechanisms like using the header of a digital file to store
meta-information. However, for inserting visible marks in images & video and for adding

20
information about audio at the beginning or end of the audio clip etc. the digital watermarking
technique is appealing, since it provides following main features and does not require out-of-band
data as in other mechanisms.
Imperceptibility:
The embedded watermarks are imperceptible both perceptually as well as statistically and do not
alter the aesthetics of the content that is watermarked. The watermarks do not create visible
artifacts in still images, alter the bit rate of video or introduce audible frequencies in audio
signals.
Robustness:
Depending on the application, the digital watermarking technique can support different levels of
robustness against changes made to the watermarked content. If digital watermarking is used for
ownership identification, then the watermark has to be robust against any modifications. The
watermarks should not get degraded or destroyed as a result of unintentional or malicious signal
and geometric distortions like analog-to digital conversion, digital-to-analog conversion,
cropping, resampling, rotation, dithering, quantization, scaling and compression of the content.
On the other hand, if digital watermarking is used for content authentication, the watermarks
should be fragile, i.e., the watermarks should get destroyed whenever the content is modified so
that any modification to content can be detected.
Inseparability:
After the digital content is embedded with watermark, separating the content from the watermark
to retrieve the original content is not possible.
Security:
The digital watermarking techniques prevent unauthorized users from detecting and modifying
the watermark embedded in the cover signal. Watermark keys ensure that only authorized users
are able to detect/modify the watermark.

21
Requirements of watermarks
To be effective in the protection of the ownership of intellectual property, the invisibly

watermarked document should satisfy several criteria:
1. the watermark must be difficult or impossible to remove, at least without visibly

degrading the original image,
2. the watermark must survive image modifications that are common to typical image-
processing applications (e.g., scaling, color requantization, dithering, cropping, and
image compression),
3. an invisible watermark should be imperceptible so as not to affect the experience of

viewing the image, and
4. For some invisible watermarking applications, watermarks should be readily detectable

by the proper authorities, even if imperceptible to the average observer. Such decodability
without requiring the original, un-watermarked image would be necessary for efficient
recovery of property and subsequent prosecution.
3.2.2.3 Applications of Digital Watermarking
Digital watermarking techniques have wide ranging applications. Some of the applications are
enlisted below.
Copyright Protection:
Digital watermarks can be used to identify and protect copyright ownership. Digital content can
be embedded with watermarks depicting metadata identifying the copyright owners.
Copy Protection:
Digital content can be watermarked to indicate that the content cannot be illegally replicated.
Devices capable of replication can then detect such watermarks and prevent unauthorized
replication of the content.
Tracking:

22
Digital watermarks can be used to track the usage of digital content. Each copy of digital content
can be uniquely watermarked with metadata specifying the authorized users of the content. Such
watermarks can be used to detect illegal replication of content by identifying the users who
replicated the content illegally. The watermarking technique used for tracking is called as
fingerprinting.
Tamper Proofing:
Digital watermarks, which are fragile in nature, can be used for tamper proofing. Digital content
can be embedded with fragile watermarks that get destroyed whenever any sort of modification is
made to the content. Such watermarks can be used to authenticate the content.
Broadcast Monitoring:
Digital watermarks can be used to monitor broadcasted content like television and broadcast radio
signals. Advertising companies can use systems that can detect the broadcast of advertisements
for billing purposes by identifying the watermarks broadcast along with the content.
Concealed Communication:
Since watermarking is a special technique of steganography, it can be used for concealed

communication also.
3.2.2.4 Classification of Digital Watermarking Techniques: -
Digital Watermarking techniques can be classified in a number of ways depending on

different parameters. Various types of watermarking techniques are enlisted below. Each of the
different types mentioned below have different applications.
1. Robust & Fragile Watermarking

2. Visible & Transparent Watermarking
3. Public & Private Watermarking
4. Asymmetric & Symmetric Watermarking

23
5. Steganographic & Non-Steganographic Watermarking.
Robust & Fragile Watermarking:
Robust watermarking is a technique in which modification to the watermarked content will not
affect the watermark. As opposed to this, fragile watermarking is a technique in which watermark
gets destroyed when watermarked content is modified or tampered with.
Visible & Transparent Watermarking:
Visible watermarks are ones which are embedded in visual content in such a way that they are
visible when the content is viewed. Transparent watermarks are imperceptible and they cannot be
detected by just viewing the digital content.
Public & Private Watermarking:
In public watermarking, users of the content are authorized to detect the watermark while in
private watermarking the users are not authorized to detect the watermark.
Asymmetric & Symmetric Watermarking:
Asymmetric watermarking (also called asymmetric key watermarking) is a technique where

different keys are used for embedding and detecting the watermark. In symmetric watermarking
(or symmetric key watermarking) the same keys are used for embedding and detecting
watermarks.
Steganographic & Non-Steganographic watermarking:
Steganographic watermarking is the technique where content users are unaware of the presence of
a watermark. In non-steganographic watermarking, the users are aware of the presence of a
watermark.
Steganographic watermarking is used in fingerprinting applications while non steganographic

watermarking techniques can be used to deter piracy
3.2.2.5 Terminology

24
Although digital watermarking has gained a lot of attention and has evolved very quickly, there is
no consensus on the terminology used in this field. As a result, it is necessary to clarify some
definitions in order to avoid any ambiguity. Unlike steganography, watermarking has the
additional characteristic of robustness against attacks.
While steganographic data can usually be removed, an additional requirement for watermarking
is that this is not possible, even if the algorithmic principles are known. Even if the existence of
the hidden information is known, it is hard for an attacker to destroy the embedded watermark
without destroying the data itself or without knowledge of a key. In cryptography, this is known
as Kerkho’s law: a cryptosystem should be secure, even if an attacker knows the cryptographic
principles and methods used, but does not have the appropriate key. Therefore, steganography and
watermarking are complementary sub-disciplines rather than competitive approaches.
Watermarking diers from authentication or digital signatures, which prove to a receiver that the
message could only have come from one particular transmitter. Usually, authentication messages
are in the form of conventional hash functions that can easily be deleted by a pirate who wishes to
use copyrighted material for illegal purposes. The goal is to give the copyright owner of a digital
image (or other piece of information) the possibility to prove technically the origin of the image.
Watermarking does not address authentication explicitly.
Fingerprinting refers to a particular characteristic of an object which tends to distinguish it from

another similar one. Although fingerprinting has various applications (e.g. information retrieval)
in digital watermarking this technique can be used for copyright protection of data. Fingerprinting
does not rely on tamper-resistance, and as a result, it does not prevent users from making copies
of data; however, fingerprinting enables the owner to trace authorized users distributing copies
illegally. Fingerprinting is a special case of watermarking applications. Bit stream watermarking
is also a term used for watermarking applied to compressed data, such as compressed video. For
video broadcast applications, watermarking schemes operating on compressed video are
desirable. For instance, a robust watermark can be embedded into an MPEG bit stream
Without increasing the bit-rate and can be retrieved even from the decoded video without
knowledge of the original, unwatermarked video. Embedded signatures" was a widely used term
in early publications instead of watermarking, but it is usually not used anymore because it
sometimes leads to confusion with cryptographic signatures.

25
Cryptographic signatures are used for authentication purposes in the sense that they detect any
alteration of the signed data and authenticate the sender, while watermarks are only used for
authentication in special applications and are usually designed to resist alterations and
modifications.
3.2.2.6 Basic Framework
The process of digital watermarking involves modifying the original data to embed a
Watermark containing key information, such as authentication or copyright codes. The

embedding method must keep the original information data perceptually unchanged, and the
watermark data should be detected by an extraction algorithm. Watermarking methods share the
same generic scenarios used for hiding messages: a watermark embedding system and a
watermark recovery system. The latter is also called watermark extraction or watermark
decoding. The input to this scheme is the original data (also called cover-data) and an optional
public or secret key. This key may be used to enforce security measures, such as prevention of
unauthorized access to the watermark through recovery and manipulation. The original data can
be of any nature, including audio, video, images, formatted text, or 3D models. In general,
practical systems employ at least one key, or even a combination of several keys. In combination
with a secret or a public key, watermarking techniques are referred to as secret and public
watermarking techniques.
In the first stage of the watermark embedding scheme, the watermark production algorithm is
applied. Its input parameters are the key and the original data. This algorithm transforms each
pair (key, original data) into a watermark digital signal. By doing so, the algorithm achieves the
statistical invisibility of the watermark. Generally, this production algorithm is based on pseudo-
random number generators or chaotic systems. For this reason, the determination of a key which
produces a preened watermark signal is impossible, as this is a non-invertible process developed
to prevent unauthorized parties from denying counterfeit watermarks. Regarding the second
stage, a watermark embedding algorithm is used. This algorithm requires as parameters both the
original data and the produced watermark. The watermark embedding scheme in a
Digital product consists of producing alterations in the luminance of the pixels (e.g. video and
images), and alterations in the sonority (e.g. audio). These alterations are designed to take into
account the main characteristics of the human visual and auditory system. Watermarking
embedding algorithms can be grouped into two classes: transform domain methods, which embed

26
the data by modulating the transform domain cosecants and spatial domain techniques, which
embed the data by directly modifying the pixel values of the original image. Finally, the output of
the watermark embedding scheme is the watermarked data. Detection is the trickiest part in the
watermarking framework. The inputs of this scheme are watermarked data, the secret or public
key, and, depending on the method, the original data generates a watermark signal in the first
stage. The purpose of this stage is to feed the detection procedure, which is the most important
stage of the detection scheme.
The next stage, the detection process, can be achieved by using a watermark detection algorithm.
This algorithm should be trustworthy, producing an insignificant number of false alarm errors.
Consequently, the detector should present results concerning the ownership of a digital product.
This kind of algorithm relies on statistical hypothesis testing. For this reason, the output of this
scheme is either the recovered watermark or some kind of condense measure which provides a
certain indication for a given watermark at the input under inspection. According to Kutter and
Hartung, two types of watermarking systems can be identified based on the nature and
combination of inputs and outputs: private watermarking (also called non-blind watermarking),
and public watermarking (also called blind or oblivious watermarking). The former systems
extract the watermark from the watermarked data using the original data as a hint to where the
watermark is. The latter systems remain the most challenging because they require neither the
secret original data nor the embedded watermark. We discuss the basic idea behind this
watermarking system. Depending on the application, the input to embedding and detection
schemes can be either in the form of uncompressed or compressed data. For instance, in a
watermarking scheme for video, the best input option is in an uncompressed form since this
process reduces computational costs with decoding and re-encoding procedures.
Desirable Properties
There are some important properties desirable in a watermark design. These properties are related
to difficulty of detection, robustness to common distortions, resilience to malicious attacks,
support of a sufficient data rate commensurate with the application, edibility to allow multiple
watermarks to be embedded, and others. The relative importance of these properties depends on
the application. Some of these properties are discussed in the following section.
Imperceptibility:

27
This property, also called delity or invisibility, means that the watermark should not be noticeable
to the viewer nor to the human auditory system. In addition, the watermark should not degrade
the quality of the content. The embedded information is transparent and it is independent of the
application and purpose of a watermarking system. Moreover, a transparent watermark does not
create any artifacts or quality loss.
Robustness:
The embedded information is said to be robust if it is still available intact after the image has
been modified but not destroyed beyond recognition. In other words, the watermark must be
difficult to remove. Watermarks in image, video and audio les should resist any kind of distortion
introduced by standard or malicious data processing. For instance, in image and video, it is
desirable that the watermark survives geometric distortions such as translations, scaling, and
cropping. The term \robustness" is usually used in the sense of resistance to non-targeted
modifications or common image operations.
Security or Key Restrictions:
In applications such as copyright protection, the secrecy of the embedded information has to be
assured. If secrecy is a requirement, a secret key has to be used for the embedding and extraction
process. Security is a property that describes whether the embedded watermarking information
cannot be removed beyond reliable detection by targeted attacks. Such attacks are based on a full
knowledge of the embedding algorithm and the detector, except the key, and the knowledge of at
least one watermarked data. Two levels of secrecy can be indented. In the first level, an
unauthorized user can neither read nor decode an embedded watermark. The second level allows
any user to detect if data are watermarked, but the embedded data cannot be read without the
secret key.
Computational cost:
In commercial applications, the computational costs of encoding and decoding are decisive.
Depending on the application, the insertion is only done once and can be performed o-line. As a
result, the cost of encoding plays a less important role than the cost of decoding. For instance, the
cost of decoding may have to occur at real-time video or audio rates. So the speed requirements
are highly dependent on the application. For this reason, computational requirements compel a

28
watermark to be designed in a simple form. On the other hand, this simplicity may reduce the
resistance to tampering significantly. Further, scalability is another relevant issue related to
computational cost. Therefore, it is desirable to design a watermark whose decoder and/or inserter
is scalable to each generation of computers.
Modification and Multiple Watermarks:
In some applications, it is necessary to alter the watermarks after the insertion process. A typical
example is the case of a DVD that may be watermarked to allow for only a single copy to be
made of it. Once this copy has been made, it is then necessary to alter the watermark on the
original disc for the purpose of discouraging further copies. To do so, one of the following
alternatives can be applied. The first watermark can be removed and a new one inserted. This
alternative does not allow a watermark to be tamper-resistant, as it is easily removable. On the
other hand, multiple watermarks facilitate the tracking of content from manufacturing to
distribution to eventual sale. A second watermark can be inserted so that both are readable, but
one must override the other.
False Alarm Probability:
In some applications, it is necessary to distinguish between data that contain watermarks and data
that do not. Even in the absence of attacks or signal distortions, the probability of failing
watermark detection (false-negative error probability) and detecting a watermark when, in fact,
one does not exist (false-positive error probability), must be very small to allow the use of
watermarking systems as unambiguous evidence of ownership on a legal basis. To accomplish
this, statistically-based algorithms can be used.
Data Payload:
This characteristic is related to the amount of information that a watermark contains. In general,
methods of storing data express data payload as a number of bits that indicate the number of
distinct watermarks that might be inserted into a signal. For instance, in a watermark that carries
N bits, there are 2 N different possible watermarks. However, there are 2 N + 1 possible values
returned by a watermark detector because there is the possibility that no watermark is present...
Depending on the application, the watermark algorithm should allow a predefined number of bits
to be hidden. This number of bits is not unlimited, and very often is fairly small because the
higher the number of bits embedded, the more perceivable the watermark will be.

29
3.2.2.7 Embedding a watermark
Digital watermarking Using Fast Hadamard Transform
A great deal of research efforts has been focused on digital image watermarking in the
recent years. FHT (Fast Hadamard Transform) is one of the blind and symmetric digital
watermarking techniques. FHT is a robust and efficient digital image watermarking algorithm for
copy right protection of digital images. This algorithm can embed or hide entire image or pattern
as a watermark such as company’s logo or trademark directly into the original image.
Fast Hadamard transform (FHT) based watermarking approach that embeds grayscale image
as a watermark. The watermark use grayscale image as a watermark. The watermark grayscale
image is decomposed into Hadamard coefficients for embedding. To increase the invisibility of
the watermark, a visual model based on the original image characteristics, such as edges and
textures are incorporated to determine the watermarking strength factor.
This factor is used to scale the watermark coefficients to a similar range to the coefficients from
the Hadamard coefficients of the sub-blocks of the container image. The FHT embedding
algorithm was found to provide a robust and efficient approach to perform digital watermarking
of digital image data for copyright protection and proof of rightful ownership. The simplicity of
FHT offers a significant advantage in shorter processing time and ease of hardware
implementation than most orthogonal transform techniques such as DCT and DWT.
2D-Hadamard transform of signal
The 2D-Hadamard transform has been used extensively in image processing and image
compression.
Let [U] represents the original image and [V] the transformed image, the 2D-Hadamard
transform is given by
[V]= Hn [U] Hn

30
Where H n represents and NxN Hadamard matrix, N=2n, n=1, 2, 3….with element
values either +1 or -1.
The advantages of Hadamard transform are that the elements of the transform matrix H n are
simple: they are binary, real numbers and the rows or columns of H n are orthogonal. Hence the
Hadamard transform matrix has the following property:
Hn=Hn*=HT=H-1
Since Hn has N orthogonal rows HnHn=NI (I is identity matrix) and HnHn=NHnHn-1, thus
H-1=Hn/N
The inverse 2D-fast Hadamard transform (IHFT) is given as
[U]=Hn-1[V]Hn*=Hn[V]Hn/N
The Hadamard matrix of the order n is generated in terms of Hadamard matrix of order n-1
using Kronecker product , as
Hn = Hn-1 H1
Or
H
� H n-1 �
H n = � n -1
H n -1 - H n -1 �
� �
In our algorithm, the processing is performed based on 8x8 sub-blocks of the whole image,
the third order Hadamard transform matrix H3 is used.

31
1
� 1 1 1 1 1 1 1 �
�
1 -1 1 -1 1 -1 1 -1 �
� �
�
1 1 -1 -1 1 1 -1 -1 �
� �
1 -1 -1 1 1 -1 -1 1 �
Hn = �
�
1 1 1 1 -1 -1 -1 -1�
� �
1
� -1 1 -1 -1 1 -1 1�
�
1 1 -1 -1 -1 -1 1 1�
� �
1
� -1 -1 1 -1 1 1 -1�
For a H3 matrix, the no of transitions for row1 to row 8 is 0,7,3,4,1,6,2 and 5.The number of sign
changes is referred to as sequency .The concept of sequency is analogous to frequency for the
Fourier Transform. Zero sign transitions correspond to a DC component. While a large number of
sign transitions correspond to high frequency components. For a Hadamard matrix H3, the
elements are not arranged in an increasing sequency, such that the transitions are 0,1,2,3,4,5,6 and
7.
Watermark Insertion process
Copyright information in the form of a trademark or logo can be used as an image

watermark. In the watermarking embedding process, the watermark image, w (x, y) is first
transformed into FHT coefficients .We use a grey scale image of size 64x64 as a watermark for
our testing. As such, a Hadamard transformation matrix H6 is used. After transformation, 64x64
Hadamrd transform coefficients are obtained. The DC component is stored in the key file and AC
components are then selected for embedding.
The original image, f(x , y) is also decomposed into a set of non-overlapped blocks of hxh
,denoted by fk (x’ , y’),k=0,1,……..K-1,where the subscript k denotes the index of blocks and K
denotes total number of blocks. In our experiment, a test image of size 256x256and sub-block
size of 8x8 is used. The algorithm pseudo-randomly selects the sub-blocks for watermark
insertion using an m-sequence random number generator.
The seed of this m-sequence and initial state are also stored in the key file. After that, a FHT is
performed on each selected sub-blocks of original image. Since the sub-block size is 8x8 a

32
Hadamard transform of matrix size H3 is used. For each 8x8 sub-block, 64 Hadamard transform
coefficients are obtained.
Let the watermark FHT coefficients denote by m i. The AC components of FHT coefficients
of the original image sub-blocks, before and after inserting watermark are denoted by x i and xi*
respectively. Where i Є (0, n], with n the number of watermarked co-efficients. The embedding
formula is
Xi*=Bmi
Image Image
+LOGO
Original Image watermark watermarked image
Watermark embedding process
3.2.2.3 Channelize
The following illustrate different ways to send images across a network.

The first example converts an image to an array, flattens it to a string, and then it's ready to send
across a network where it will be unflatten and the 2-D array will be converted to an image. This
method can quickly convert image to array, compress, uncompress, and convert array to image,
but the amount of data it sends across the network is the full size of the image. This method can

33
do all the non network related processing in about 29ms/imageon a 1.5 GHz machine.
The second method is only support with LabVIEW 7.0 or higher and Vision 7.0 or higher. It uses
the flatten to string with the image and achieve very good compression. The amount of data sent
across the network is about 3% of the image size. It does take about 67ms/image to compress, but
the network transfer time will be much faster. The transfer speed across a network depends on the
compression quality, the network traffic and the speed of the network. Compressing images takes
processing power, and the faster you can compress the images the faster you can begin to send
them across the network.
The third method uses a JPEG compression algorithm to convert the image to a binary string. It
achieves a similar compression ratio as the previous method, and it is supported on older versions
of LabVIEW. It takes about 48ms/image. You can specify a compression quality between 0
(highly compressed and looks very poor) and 100 (uncompressed and looks exactly the same as
the original).
The fourth example takes advantage of Datasocket and uses a customized ActiveX Control for
the web browser to receive and display images. The VideoServer continuously performs a grab
and sends each frame to the Datasocket server. The ActiveX Control, written in Visual Basic, will
connect to a Datasocket server on demand and continuously receive and display the images in an
IMAQ Viewer. This example allows you to stream video over the Internet to multiple clients.
If you copy the Package directory to another computer, you must change the URL so the
computer name matches the name of the computer where the Video Server is running. For
example, if ideoServer is running on a machine called "TestMachine", and you open the HTM
file on another machine , the URL should be "dstp://TestMachine/Vision" .
3.3 Interface description
We have the modules partition and extraction, encryption, decryption and channelization.
First we will begin with selecting a jpeg image then approaching the module partition in this we
use adobe Photoshop cs for dividing the selected image. Here we can divide the image into
required no of slices with selected horizontal and vertical pixels. These slices are stored in
particular folder. These slices will serve as input for encryption and module.

34
In encryption each slice is encrypted by using 128 bit key encryption. With this the image
is not visible i.e no preview available is displayed when you open the encrypted slice. These
encrypted slices will serve as input for the channelization module.
The channelization module will send the encrypted slice by taking the input the ip
address and the maximum number of clients to be connected .The operations like send and
receive will comes under this module.
In decryption we use the received encrypted modules from the intermediate hosts. These
slices are decrypted by using the 128 bit decryption key .These decrypted slices are then sent to
the partition and extraction module. The decrypted slices are combined by using the adobe
Photoshop cs application. Hence we can retrieve the original image without sacrificing the
quality.

35
CHAPTER-4
DETAILED DESIGN

36
37
Sequence Diagram:
The sequence diagram is an interaction diagram that emphasizes the time ordering of
messages. Graphically, a sequence diagram is a table that shows objects arranged along the X axis
and messages, ordered in increasing time, along the Y axis.
COMMON PROPERTIES:
The sequence diagram is just like as special kind of diagram and shares the same
properties as all other diagrams. But it differs from all other diagrams in its contents.
CONTENTS:
Sequence diagram commonly contains the following things
 Objects
 Links
 Messages
OBJECTS:
Objects are typically named or anonymous instances of class, but may also represent
instances of other things such as components, collaboration and nodes. Graphically, object is
rendered as a rectangle with underlining its name as shown in below.
c:company
Object
LINKS:
A link is a semantic connection among objects i.e., an object of an association is called as

a link. A link is rendered as a line as shown below.
Link

38
MESSAGES:

39
A message is a specification of a communication between objects that conveys the
information with the expectation that the activity will ensue.

40
Activity Diagram:
An activity diagram shows the flow from activity to activity. The activity diagram
emphasizes the dynamic view of a system.
Common Properties:

41
An activity diagram is just a special kind of diagram and shares the same common
properties as do all other diagrams but they differ in their content.
Contents: Activity diagram commonly contain:-
 Activity states and action states:
An activity states is a kind of states in activity diagram; it shows an ongoing non-

atomic execution within a state machine. An activity states can be further decomposed.
 Transition:
A transition specifies the path from one action or activity state to the next action or
activity state.
 Object:
An object is a concrete manifestation of an abstraction; an entity with a well

defined boundary and identity that encapsulates state and behavior;
Common Uses:
 To model a workflow and an operation

42
43
CHAPTER -5
Implementation
5.1 Classes
5.1.1 Vector

44
Vector implements a dynamic array. Its is similar to ArrayList, but with two
differences. Vector is synchronized and it contains many legacy methods that are not part of the
collections framework.
Vector defines three protected data members.
Int capacityIncrement;
int elementCount;
Object[] elementData;
Because vector implements list, you can use a vector just like you use an Arraylist
instance.
After instantiate a vector, you can add element to it by calling addElement(). To obtain the
element at a specific location, call elementAt(). Just like above method vector have many
methods some are
o int capacity()
o Object cline()
o boolean contains(Object element)
o void ensureCapacity(int size)
o int indexof(object elemtnt)
o int size()
o String tostring()
o void trimTosize().
5.1.2 Button listener
Button listener class provide the what action to be takes places when a particular
button pressed. That is when a particular button is pressed the action listener will throw the
object to the corresponding function.
5.1.3 Sender
Sender class will create the interface of the sender side window .that in sender
class by using the send() method displays the sender side user interface .

45
5.1.4 Client
Client class contains the method receive () .By using this receive method displays
the internal client or host side user interface.
5.1.5 Receiver
Receiver class contains the method receive(). This receive method creates the
receiver side interface.
5.2 Methods
5.2.1 Socket ()
Tcp/Ip style networking is appropriate for most networking needs. It provides a

serialized predictable, reliable stream of packet data.
Socket is bundles of information passed between machines. Java implements socket on

the top of tcp/ip protocol by using two classed: the Datagrampacket object is the data container,
while the Datagramsocket is the mechanism used to send or receive the Datagram packets.
Datagram socket defines four public constructors. They are
 DatagramSocket() throws socketException .

 DatagramSocket(int port) throws SocketException
 DatagramSocket(int port, InetAdderss ipAdderss) throws
SocketException
 DatagramSocket(SocketAddress address) throws
SocketException
Datagram socket defines many methods
 void send(DatagramPacket packet) throws IOException

 void receive(DatagramPacket packet) throws IOException
The send () method sends packet to the port specified by packet. The receive() method
waits for a packet to be receive from the port specified by packet and returns the result.
5.2.2 Server socket ()

46
The server socket class is user to create server that listen for either local or remote client
program to connect to them on published ports. Server sockets are quite different from the normal
Socket. The constructor for serversocket reflect the port number that you want to accept
connections on and ,optionally ,how long you want the queue for said port to be. The queue
length tells the system how many clients connections it can leave pending before it should simply
refuse connections.
The server socket has a method called accept (), which is a blocking call that will wait for
a client to initiate communications and then return with a normal socket that is then used for
communication with the client.
That is server socket creates the socket on the specified port with a queue length of 50.
5.2.3 Read object()
A fileinputstream is then created that refers to the name “serial” and an

ObjectInputStream is created for that file stream. The readObject () method of ObjectInputStream
is then used to deserialize our object. The object input stream is then closed.
5.2.4 Write Object ()
A fileOutputStream is created that refers to a file name “serial”, and an

ObjectOuputStream is created for that file stream. The writeObject () method of
ObjectOuputStream is then used to serialize out object. The object output stream is flushed and
closed.
5.2.5 Thread socket ()
Threadsocket () method is used to create the thread for a particular client

requites. That is when ever server socket is created with maximum clients it will creates the
threads according to the maximum client after then it will reject the further requests.
5.3 Interface
5.3.1 window Listener
Defines several methods to recognize when a window is activated, they are close,
deactivated, deiconified , iconified , opened, quit.

47
Window focus listener defines two methods to recognize when a window gains
or loses input focus.

48
CHAPTER -6
TESTING
6.1 Software Testing:

49
Software testing is a critical element of software quality assurance and represents the
ultimate reuse of specification. Design and code testing represents interesting anomaly for the
software during earlier definition and development phase, it was attempted to build software from
an abstract concept to tangible implementation.
The testing phase involves, testing of the development of the system using various
techniques such as White Box Testing, Control Structure Testing.
6.2 Testing Techniques:
6.2.1 White Box Testing:
White box testing is a test case design method that uses the control structure
of the procedural design to derive test cases. After performing white box testing it was identified
that
 The Leave Recording System (LRS) software guarantees that all independent paths with in
the modules have been exercised at least once.
 It has been exercised all logical decisions on their true and false sides.
 It was tested to execute all loops at their boundaries and within their operational bounds.
 It was tested for the internal data structures to ensure their validity.
6.2.2 Control Structure Testing:
The following tests were conducted and it was noted that the BCBS is performing
them well.
 Basic path Testing

 Condition Testing
 Data Flow Testing
 Loop Testing

50
Black box testing methods focuses on the functional requirements of the software by
conducting black box testing using the methods Equivalence partitioning Boundary Value
Analysis and Cause-Effect-Graphing techniques.
 Functional validity of LRS checked.

 Checked the isolation of the boundaries of a class.
 The tolerance of the system for the data rates and data volumes.
6.3 Testing Strategies:
A strategy for software testing must accommodate low-level tests that are necessary to
verify that a small source code segment has been correctly implemented as well as high-level
against customer requirements.
Verification and Validation:
Verification is a fundamental concept in the software design. Verification refers to the set
of activities that ensure that software correctly implements a specific function. Validation refers to
a different set of activities that ensures that software that has been build is a traceable to
customers. Validation is nothing but the process of using software in live environment in order to
find errors.
Verification is typically done in two steps:
 Verification of the requirements: Verify that the software requirement definition satisfies
the customer needs.
 Verification of the design: Verify that the design satisfies the requirements definition.—
Verification and Validation encompasses a wide array of software quality assurance

(SQA) activities that include formal technical reuse quality and configuration audits, performance
monitoring, simulation, feasibility study. Software reviews are one of the most important SQA
activities.
 Code Testing
 Specification Testing

51
 Unit Testing
 Integrating Testing
 Validation Testing
 System Testing
 Output Testing
 User Acceptance Testing
6.3.1 Code Testing:
Testing the logic of the program is called the code testing. Every path through the program is
tested and checked whether the logic is working properly or not. This project was logically
performing well.
6.3.2 Specification Testing
Specification testing means checking the software it is as per specification given, this
project has tested for its specification such as what the particular module or program should do
and how it should perform under various conditions.
6.3.3 Unit Testing
Unit testing focuses verification on the smallest unit of software design such as form. This
is known as form testing. The testing is done individually on each form. Using the unit test
plan, prepared in design phase of the system development as a guide, important control paths
are tested to uncover errors within the boundary of the module. In this step the module is
working satisfactorily as a regard to the expected output from the module.
6.3.4 Integration Testing
Data can be lost across an interface, one module can have an adverse effect on another sub
function, when combined, may not produce the desired major function. Integration testing is a
systematic technique for constructing the program structure while at the same time conducting

52
tests to uncover errors associated with the interface. All the modules are combined in the testing
test. Then the entire program is as a whole.
There are mainly two types of integration
 Top Down Integration

 Bottom Up Integration
Top down Integration is an incremental approach to construction of program structure.

Modules are integrated by moving downward through the control hierarchy, beginning with
the main control module.
Bottom up integration testing as its name implies, begins construction and testing with
automatic modules. Here we used black box testing for finding errors in the following categories:
 Incorrect or missing functions

 Interface errors
 Initialization and termination errors
 Desired output for given input
 I/O errors
6.4 Validation Testing
The following tests were conducted to test the validity of the software. The validation
succeeds when the software functions in a manner that can be reasonable expected by the
customer. The developed software undergoes the following types of validation testing and was
succeeded.
a) Alpha Testing
b) Beta Testing

53
6.5 System Testing:
It is mainly used if the software meets its requirements. The reference document
for this process is the requirement document.
6.5.1 Acceptance Testing:
It is performed with realistic data of the client to demonstrate that the software is
working satisfactorily. In this project testing is done to check whether the JPEG files selection
are done successfully or not.
6.5.2 Testing Methods:
Testing is a process of executing a program to find out errors. If testing is

conducted successfully, it will uncover all the errors in the software. Any testing can be done
basing on two ways:
There are two approaches to testing:
 Functional (Black box Testing)

 Structural (White box Testing)
6.5.3 Black Box Testing:
In functional testing the structure of the program is not considered. Test

cases are decided solely on the basis of the requirements or specifications of the program or
module and internals of the module or the program are not considered for selection of test
cases .due to its nature, functional testing is often called “Black-box testing”.

54
It is a test case design method used on the functional requirements of the
software. It will help a software engineer to derive sets of input conditions that will exercise
all the functional requirements of the program. Black Box testing attempts to find errors in the
following categories:
Incorrect or missing functions
Interface errors
Performance errors
Initialization and termination errors
By Black box testing we derive a set of test cases that satisfy the following criteria:
Test cases that reduce by a count that is greater than one, the number of
additional test cases that must be designed to achieve reasonable testing.
Test cases that tell us something about the presence or absence of classes of errors
rather than errors associated only with a specific test at hand
6.5.4 White Box Testing:
In the structural approach, test cases are generated based on the actual
code of the program or module to be tested. The structural approach is sometimes called
“Glass-box testing”.
In this, testing for each method in each class is done by using basis path
testing technique .for each method we have design flowchart and then we map this flowchart
into the flow graph in to the mapping sequence of procedural statements and decision
diamonds to a single node. It is a test case design method that uses the control structures of the
procedural design to derive test cases. Using this testing a software Engineer can derive the
following test cases:
Exercise all the logical decisions on either true or false sides.
Execute all loops at their boundaries and within their operational boundaries.

55
In the project we tested all procedurals with white box testing. Mainly we used
the graphical notation in basic path method, which is the method in white box testing. The
flow is a representation of control flow. In this we calculate cyclomatic complexity; the value
of complexity defines the number of independent paths in the basic set of program and
provides with an upper bound for the number of tests that must be conducted.
The complexity is computed in one of the three ways:
1)The number of regions of the flow graph corresponds to the cyclomatic complexity.
2) Cyclomatic complexity V (G) for the flow graph G is defined as
V (G) =E-N+2
3) V (G) is also defined as V (G) =P+1 Where P is the number of predicate nodes.
6.5.5 System Testing
Testing the entire system as a whole and checking for its correctness is system testing. The
system is listed for dispensaries between the system and its original objectives. This project was
effective and efficient.
6.5.6 Output Testing
After performing system testing, the next step is output testing of the proposed system, since
no system could be useful if it does not produce the desired output in the specified format. The
outputs generated are displayed by the system under consideration or testing by asking the users
about the format required by them, here the output format is considered in two ways, one is the
screen and other is the printed form.
6.5.7 User Acceptance testing:
User Acceptance of a system is the key factor for the success of any system. The system
under consideration was tested for user acceptance by constantly keeping in touch with the
perspective system users at the time of developing and making changes whenever required. The
following are the testing points.

56
 Input screen design
 Output screen design
 Menu-driven system
6.6 Example test cases:
The testing process done for proposed system is unit testing, module testing and the black
box testing. The unit testing is the testing done for the individual components that they operate
correctly or not. In this testing, the input given is number of slices and then check whether they
are grouped into particular format based on their frame sequence number. After unit testing we
have performed the module testing i.e., done to collection of depending components. The module
testing is done on Inter Class and Intra Class schedulers.
After these two tests we have performed the black box testing for the overall project.
Black box testing is performed when we know the specified function that a product has been
designed to perform. We have taken the required inputs(number of slices ) and tested whether the
required output is produced or not.

57
Chapter-7
RESULT ANALYSIS AND

CONCLUSION

58
7.1 Result analysis:
There are four modules in our project. They are
1. Partition & Extraction

2. Encryption
3. Decryption
4. Channelization
In the first module, the image to be sent to receiver from the sender is
selected. Then by using Adobe Image Ready Photoshop, the image is partitioned into required
number of slices by giving the number of pixels for both horizontal and vertical rows. The
output of this module is number of slices of the original image according to sender’s wish. In
extraction the slices are decrypted and they are to be combined in order to get the original
image. By using Adobe Image Ready Photoshop, we combine the slices and the result is that
we get the original image.
In the second module, the slices of the original image are encrypted by
using 128 Bit Encrypt/Decrypt. A key is given here to encrypt the slices. And then these
encrypted slices are sent to the internal nodes. The receiver receives the encrypted images. The
result of this module is that the slices are encrypted and the preview of the image is not
available unless the decryption is done.
In the third module, the encrypted slices sent by the internal node are
received and they are decrypted by using the 128 Bit Encrypt/Decrypt with the same key

59
given for encryption. The result of this module is that the encrypted slices are decrypted and
the preview of the slices is available.
In the last module, we transmit the encrypted slices from the sender to
receiver using ip address and number of clients an input. If both sender and receiver are in
active state then only transmission takes place.
7.2 Conclusion
In the first part of this paper, we presented a brief overview of information hiding, describing
its main disciplines (covert channels, steganography, anonymity, and digital watermarking)
and some areas in which this technology can be applied. In the rest of our work, we
concentrated our attention on digital watermarking in particular. We provided an overview of
the current status of and prospects for digital watermarking, emphasizing its basic principles.
In addition, we described a taxonomy based on domain of insertion, applications area, and
types of existing algorithms. We also oared an overview of the advances and limitations,
which led us to some interesting topics for future research. Our work showed that even though
a wide variety of watermarking techniques have been proposed in the last few years, it is quite
difficult to classify the approaches and assess their quality. This is due to the fact that there are
various watermarking methods which provide robustness, but different levels of required
robustness can be identified, depending on the application. As a result, there is no generic
watermarking method which it’s all kind of systems. Furthermore, none of the techniques
proposed so far seem to be robust to all possible attacks and image operations.
This study also revealed that current watermarking technologies face three important
drawbacks that prevent them from becoming the best solutions for protecting multimedia data.
The first drawback was discussed previously. It is clear that watermarking techniques are still
vulnerable to attacks. The second problem is that there are no watermarking technology
standards in place so the community has not accepted this technology as a legitimate form of
multimedia data protection. The third draw-back concerns legal problems for managing
content distribution through the Internet. On the other hand, there have been many efforts to

60
create applications in which watermarking can provide successful solutions, such as copy
protection for Internet audio distribution, broadcast monitoring and others. This fact may
assure that watermarking technology will become widely deployed in the near future. In terms
of technical progress, we can see some great advances. The recent explosion in research in
watermarking to protect intellectual property is evident. As a consequence, a large amount of
money has been spent on copyright protection systems, so there is a continuous increase in
watermarking research. This implies that one can expect that sooner or later, digital
watermarking will provide efficient solutions to the difficult problem of providing security to
creators and consumers of digital content regarding their legal rights. Given all these facts it
seems that digital watermarking will play an increasing role in the future for security in the
digital world. The progress in watermarking may suggest that this technology will achieve the
goals that have been set for it.
7.3 Future enhancements
1. We are now working within the LAN then we extend it to entire network.
2. Greater compression can be achieved using advanced compression techniques.
3. First we are implementing on jpeg images then we can implement on all image formats.
4. As our project provides only one-to-one communication, some provision can be made in such
a way that it can be one-to-many communication.
5. We come provide some enhancements in such a way that at time we can send more than one
image as for now in our project, we can send only one image at a time.

61
Appendix-A
UML
Diagrams
62
63
64
65
66
Appendix-B
Interfaces

67
JPEG IMAGE
PARTITION
.
i
:
.
DECRYPTION .
CHANNELIZATION
UNSECURED PATH
1 2 3 4 - - - - - - - - N PARTITIONS - - - - - - - - - - N-1 N
DECRYPTION
.
EXTRACTION i
:
.
.
JPEG IMAGE

68
Interfaces
Appendix-C
Input-Output
Windows

69
Input:

70
Output:
Retrieved Image

71
Appendix-D
Snapshots
72
Sender Interface:

73
Partition & Encryption:

74
Image Transmission:

75
Intermediate Host:

76
Sender Information:

77
Receiver Conformation:

78
79
Receiver Interface:

80
Combining the Slices:

81
Bibliography

82
Websites
 http://www.askstudent.com/security/a-step-by-step-guide-on-encrypting-files-
using-truecrypt/
 http://www.truecrypt.org/docs/encryption-algorithms.php
 http://pagead2.googlesyndication.com/pagead/iclk?
ww.gmsinc.com/product_details.
 www.google.com/codesearch
 www.scribd.com
 http://wareseeker.com/Graphic-Apps/jpeg-japery-1.00.zip/10205
 http://www.sciencedirect.com/science?_ob=ArticleURL&_udi=B6V0F-
3VV6MND-
7&_user=10&_rdoc=1&_fmt=&_orig=search&_sort=d&view=c&_acct=C0000
50221&_version=1&_urlVersion=0&_userid=10&md5=b992f6bb97ec440a2673
72f016613fde
 http://en.pudn.com/search_db.asp?keyword=encryption%20decryption20image
Books

83
 S. Katzenbeisser and F. Petitcolas, Information hiding techniques for steganography
and digital watermarking, Artech House, 2000.
 LithMaster on June 6th, 2008 5:12 pm This isn’t TRUE steganography, steganography
is encoding a file directly into an image by slightly changing pixel values (other methods
available), what you are doing is sort of hiding the file on the disk with that name, but this
is still pretty cool.
 Image and Video Encryption Advances in Information Security Volume 15
 Image Quality and System Performance III Author Luke C.Cui, Yoichi Mihake
 Data Transmission Systems – Image Transmission By Mauro Barni
 Image portioning by level set multiregion competition, ICIP04 (IV: 2721-2724). IEEE
DOI Link 0505 BibRef
 Document and Image Compression BY MISHWAK
 Lossless image compression and encryption using SCAN

S. S. Maniccama and N. G. Bourbakisa, b,
Articles

84
 New Image Encryption and Compression Method Based on Independent Component
Analysis
Ito, M.; Ohnishi, N.; Alfalou, A.; Mansour, A.
 Integrated Confusion-Diffusion Mechanisms for Chaos Based Image Encryption

Koduru, S.C.; Chandrasekaran, V. Computer and Information Technology Workshops, 2008. CIT
Workshops 2008. IEEE 8th International Conference
Paper References
1 [1] P. P. Dang and P. M. Chau, "Image encryption for secure internet multimedia applications,"
IEEE Trans. Consumer Electron., vol. 46, no. 3, pp. 395-403, 2000.
2 Kuo-Liang Chung , Lung-Chun Chang, Large encrypting binary images with higher security,
Pattern Recognition Letters, v.19 n.5-6, p.461-468, April 1, 1998 [doi>10.1016/S0167-
8655(98)00017-8 ]
3 [3] H. Cheng and X. Li, "Partial encryption of compressed images and videos," IEEE Trans.
Signal Processing, vol. 48, no. 8, pp. 2439-2451, 2000.
4 Chin-Chen Chang , Min-Shian Hwang , Tung-Shou Chen, A new encryption algorithm for
image cryptosystems, Journal of Systems and Software, v.58 n.2, p.83-91, September 1,
2001 [doi>10.1016/S0164-1212(01)00029-2 ]
5 Jinn-Ke Jan , Yuh-Min Tseng, On the security of image encryption method, Information
Processing Letters, v.60 n.5, p.261-265, Dec. 9, 1996 [doi>10.1016/S0020-0190(96)00168-8 ]
6 Chin-Chen Chang , Tai-Xing Yu, Cryptanalysis of an encryption scheme for binary images,
Pattern Recognition Letters, v.23 n.14, p.1847-1852, December 2002 [doi>10.1016/S0167-
8655(02)00157-5 ]
7 [7] S. Li and X. Zheng, "On the security of an image encryption method," Proc. IEEE Int.
Conference on Image Processing (ICIP'2002), vol. 2, pp. 925-928, 2002.

85
8 Object Extraction Combining Image Partition with Motion Detection Wenming Yang Wang Lu
Naitong Zhang Harbin Inst. of Technol., Harbin;This paper appears in: Image Processing, 2007.
ICIP 2007. IEEE International Conference on Publication Date: Sept. 16 2007-Oct. 19 2007.
9 Digital image synthesis and multiple-image encryption based on the introduction of
parameter multiplexing and phase-shifting interferometry X.F. Menga, b, L.Z. Caia.

86

3 Phase Systems

Transféré par

Informations du document

Copyright

Formats disponibles

Partager ce document

Partager ou intégrer le document

Options de partage

Avez-vous trouvé ce document utile ?

Ce contenu est-il inapproprié ?

Droits d'auteur :

Formats disponibles

3 Phase Systems

Transféré par

Droits d'auteur :

Formats disponibles

1.

2. Feasibility analysis and srs

2.1 Feasibility analysis ……………………………………….. 10

3.1 Introduction ………………………………………………. 15

5.1 Class ………………………………………………...………42

 Anti-spy Image Transmission

6.1 What is testing? …………………………… ………………47

7. Result analysis and conclusion

7.1 Result analysis ………………………………………..…….56

8.1 UML diagrams ……………………………………..….…...59

9.1 Interfaces ………………………………………………

10.1 Input/output windows …………………………….………64

11.1 Snapshots ……………………………………………..…...67

12.1 Websites ……………………………………………...……77

12.2 Textbooks ………………………………………………….78

12.3 Generals …………………………………………...………79

 Anti-spy Image Transmission

 Anti-spy Image Transmission

 Anti-spy Image Transmission

 Anti-spy Image Transmission

Motivation for JPEG

 Anti-spy Image Transmission

Image Transmission Techniques (Advances in Electronics and Electron Physics Supplement

Introduction to Data Compression

 Anti-spy Image Transmission

 Anti-spy Image Transmission

In the Chapter 2 feasibility analysis and Software Requirements Specification document

In the Chapter 5 the implementation containing class description. (Method, cardinality

 Anti-spy Image Transmission

 Anti-spy Image Transmission

As per the technology is considered it is advanced in terms of manpower, intelligence,

2.1.2 Economical Feasibility

2.1.3 Operational Feasibility

 Anti-spy Image Transmission

2.2.1 Problem definition

2.2 .2 Project scope

2.2.3 Problem description

This Software Requirements Specification provides a complete description of all the

 Anti-spy Image Transmission

2.3.1 Product Perspective

2.3.2 Product Features

This product on following

 Retrieved Image doesn’t sacrifice the quality of the transmitted image.

2.4 External Interface Requirements

2.4.1 Hardware Requirements

 Anti-spy Image Transmission

2.4.2 Software Requirements

 Operating System - Windows 2000 or later

2.4.3 Functional requirements

 Anti-spy Image Transmission

2.6 Safety Requirements

not, we have to use the any ARQ technique.

 Anti-spy Image Transmission

 Anti-spy Image Transmission

This System contains the following modules:

 1.Partition & Extraction

3.2 Module Description

3.2.1 Partition & Extraction

3.2.1.1 Slicing and Linking with ImageReady

 Anti-spy Image Transmission

3.2.1.4 Configuring Slice Links

 Anti-spy Image Transmission

up our smaller main.

3.2.2.1 Digital Watermarking