Project report on
HEALTH MONITORING OF A MISSILEIn partial fulfillment of the requirements for the award of the degree o f
BACHELOR OF TECHNOLOGYin
ELECTRONICS & COMMUNICATION ENGINEERING
Submitted By
1.B.SUNNY PRAVEEN(11P61A04A3)
2.M.VIJAY (11P61A04B7)3.R.YASHWANTH (11P61A04C0
Under the Guidance of
CH.RAJENDRA PRASAD
(ASST PROFESSOR)
(Affiliated to Jawaharlal Nehru Technological University Hyderabad)Aushapur (V), Ghatkesar (M), R.R.Dist-501301
2011-2015
Department of Electronics & Communication Engineering
CERTIFICATE
This is to certify that the project report entitled “HEALTH MONITORING OF
A MISSILE” being submitted by b.sunny praveen (Roll. No11P61A04A3.) in partial
fulfillment of the requirements for the award of the Bachelor Degree in Electronics and
Communication Engineering to the JNTU College of Engineering, Hyderabad is a
bonafide work carried out by him under my guidance and supervision.
The result embodied in this report has not been submitted to any other University
or Institution for the award of any degree or diploma.
Head of the Department: Project Guide: Prof. B.Brahma Reddy Name of the Guide Department of ECE. Designation Of Guide
CANDIDATE’S DECLARATION
We, Name of the students students of Vignana Bharathi Institute of Technology,
Ghatkesar in Bachelor of Technology, with specialization in Electronics &
Communication Engineering, an original work carried out by us, availing the guidance
of the project guide Guide Name, Designation, department of ECE, VBIT, Ghatkesar. To
the best of our knowledge and belief, this project bears no resemblance with any report
submitted to J.N.T.U.H. or any other University for the award of any degree or diploma.
ByName of the Students(Roll. No.)
ACKNOWLEDGEMENT
Team spirit and comradeship are the basic ingredients for the success of any task.
Be it in education, sports arena, battlefield or even in our lives, similarly this project is
the result of contribution from the students and staff. While doing this project many
difficulties came in between but finally completed it with the guidance and suggestions
from the following intelligentsia who gave their time and expertise generously.
We wish to express our deep sense of gratitude to my guide Guide Name,
Designation, ECE Department, for her invaluable guidance and perspicacious
analytical suggestions throughout this project.
We are grateful to Prof. B. Brahma Reddy, Head of the Department of
Electronics and Communication Engineering, for his thought provoking suggestions
and constant encouragement that led us to a roaring success.
We are highly indebted to our Principal Dr. J.S.N.Murthy, who is indefatigable,
magnanimous, who constantly encouraged and nurtured me.
We are eternally grateful to my Parents for their affectionate cooperation and
blessings for this great achievement.
Finally, we pray the Almighty, for our college to grow from strength to strength
and let the students, staff and whoever helped us be exemplary with magnificent health,
happiness and long life.
By
Name Of The Students
ABSTRACT
TABLE OF CONTENTS
List of Figures i
List of Tables ii
Chapter: 1 Introduction 01 1.1) Brief Introduction about the project 01
1.2) Back Ground 01
1.3) Motivation 03
1.4) Objective of the project 04
1.5) Organization of Thesis 05
Chapter: 2 Visual Cryptography 06 2.1) Introduction to Cryptography 06
2.2) Encryption and Decryption 07
2.3) How does cryptography work? 08
2.4) Types of cryptography algorithms 08
2.5) Why three Encryption Techniques 17
2.6) Introduction to Visual cryptography 19
2.7) How visual cryptography works 22
2.8) The Basic model 24
2.9) Basic visual cryptography schemes 29
Chapter: 3 Improved Visual Cryptography Schemes 36 3.1) Chang, T Sai and Chen’s Scheme 36
3.2) Hiding Algorithm 36
3.3) Recovering Algorithm 39
3.4) Chang et al. algorithm 42
3.5) A uniform 2 out of 2 construction 43
3.6) Hiding Algorithm 44
3.7) Recovering Algorithm 46
3.8) A uniform n out of n construction 48
3.9) Security analysis of the uniform construction 51
3.10) Advantages 51
3.11) Applications of visual cryptography 52
Chapter: 4 Results 55 4.1) Introduction 55
4.2) Chang, T Sai & Chen’s algorithm results 56
4.3) Chang et al. algorithm results 57
4.4) Comparisons 59
Chapter: 5 Conclusions and Future work 60
5.1) Conclusions 60
5.2) Future work
60
Chapter: 6 References 61
LIST OF FIGURES
PAGE NO.
Figure1: Block Diagram 05
Figure 2: (a) 10-sparse Fourier spectrum 08
Figure 2: (b) time domain signal of length 300 with 30 samples 08
Figure 2: (c) reconstruction via ℓ2-minimization 08
Figure 2: d) exact reconstruction via ℓ1-minimization 08
Figure 3: (a) Sampling data of the NMR image in the Fourier domain which
corresponds to only 0.11% of all samples 09
Figure 3: (b) Reconstruction by back projection 09
Figure 3: (c) Intermediate iteration of an efficient algorithm for large
scale total variationminimization 09
Figure 3: (d) The final reconstruction is exact 09
Figure4: Graphical representation of compressing a high-dimensional
vectorx to a low dimensional vector v 26
Figure 5:Probability distributions 28
Figure 6: Finding the sum of the rectangle area 30
Figure 7: texture example 29
Figure 8: integral image 30Figure 9:(a) Integral image 30
PAGE NO.
Figure 9: (b)Image 30
Figure 10: An example 31Figure 11: a,b,c,d points 31Figure 12: Value of d 32Figure13 :a+b 32Figure 15: d-(b+c) 33Figure 16: Value of a 33Figure 17: Integral table 33Figure 18: Illustration of robustness of our algorithm to ambiguity in detection 45
Figure19: Screenshots of some sampled tracking results 54
LIST OF TABLES
PAGE NO.
Table 1:Success Rate 48
Table2: Center Location Error 50
CHAPTER 1
INTRODUCTION
1.1 Introduction:
In this project we discussed two secret sharing schemes based on cryptography. Those are
Chang, T sai and Chen’s algorithm and Chang’s et al. algorithm.
Visual cryptography [Naor95] is a kind of cryptography that can be decoded
directly by the human visual system without any special calculations for decryption.
The former scheme Chang, Tsai and Chen’s scheme [3] is a colored secret sharing and
hiding scheme based on Visual Cryptography schemes (VCS) where the traditional
stacking operation of subpixels and rows interrelations is modified [5]. This technique
does not require transparencies stacking and hence, it is more convenient to use in real
applications. To hide a secret color image, a dealer chooses arbitrarily two significant
color images as cover images at first, which share the same size as the secret color image.
Then according to these cover images and a predefined Color Index Table (CIT), the
secret color image will be hidden into two shares called camouflage images. As for
recovering, stack the two camouflage images, and through inverted look-up of CIT, the
secret image will return ease.
The next scheme Chang et al. algorithm is a new secret color image sharing
scheme [1] based on modified visual cryptography. The proposed approach uses
meaningful shares (cover images) to hide the colored secret image and the recovery
process is lossless. The scheme defines a new stacking operation (XOR) and requires a
sequence of random bits to be generated for each pixel. Chang’s scheme can be
generalized to an n out of n approach as opposed to Chang Tsai’s scheme.
1.2 Back Ground:
Visual cryptography, introduced by Naor and Shamir in 1995 [2], is a new
cryptographic scheme where the ciphertext is decoded by the human visual system.
Hence, there is no need to any complex cryptographic computation for decryption. The
idea is to hide a secret message (text, handwriting, picture, etc…) in different images
called shares or cover images. When the shares (transparencies) are stacked together in
order to align the subpixels, the secret message can be recovered. The simplest case is the
2 out of 2 scheme where the secret message is hidden in 2 shares, both needed for a
successful decryption [2]. This can be further extended to the k out of n scheme where a
secret message is encrypted into n shares but only k shares are needed for decryption
where k≤ n. If k-1 shares are presented, this will give no information about the secret
message. Naor and Shamir applied this idea on black and white images only.
Until the year 1997, although the transparencies could be stacked to recover the secret
image without any computation, the revealed secret images ( as in [1, 2,
4, 6]) were all black and white. In [7], Verheul and Van Tilborg used the concept of arcs
to construct a colored visual cryptography scheme, where users could share colored
secret images. The key concept for a c-colorful visual cryptography scheme is to
transform one pixel to b subpixels, and each subpixel is divided into c color regions. In
each subpixel, there is exactly one color region colored, and all the other color regions
are black. The color of one pixel depends on the interrelations between the stacked
subpixels. For example, if we want to encrypt a pixel of color ci, we color region i with
color ci on all subpixels. If all subpixels are colored in the same way, one sees color ci
when looking at this pixel; otherwise one sees black.
A major disadvantage of this scheme is that the number of colors and the number
of subpixels determine the resolution of the revealed secret image. If the number of
colors is large, coloring the subpixels will become a very difficult task, even though we
can use a special image editing package to color these subpixels. How to stack these
transparencies correctly and precisely by human beings is also a difficult problem.
Another problem is that when the number of subpixels is b, the loss in resolution from the
original secret image to the revealed image becomes b. Recently, Yang and Laih
proposed a new colored visual secret sharing scheme [8] by using a different structure of
colored subpixels. They get better resolution than Verheul and Van Tilborg’s scheme
while the number of subpixels is the same. However, their scheme still has the same
disadvantages as Verheul and Van Tilborg’s scheme when the secret image contains a
great deal of different colors.
In [5], Hwang proposed a new visual cryptography scheme which improved the
visual effect of the shares (the shares in their scheme were significant images while those
in the previous schemes were meaningless images). Hwang’s scheme is very useful when
we need to manage a lot of transparencies; nevertheless, it can only be used in black and
white images. For this reason, Chang, Tsai and Chen recently proposed a new secret
color image sharing scheme [3] based on the modified visual cryptography. In that
scheme, through a predefined Color Index Table (CIT) and a few computations they can
decode the secret image precisely. Using the concept of modified visual cryptography,
the recovered secret image has the same resolution as the original secret image in their
scheme. However, the number of subpixels in their scheme is also in proportion to the
number of colors appearing in the secret image; i.e., the more colors the secret image has,
the larger the shares will become. Another disadvantage is that additional space is needed
to store the Color Index Table (CIT).
In 2002 chang et al. proposed a new secret color image sharing scheme based on
modified visual cryptography. By means of defining a modified stacking operation, our
scheme can hide a gray image (256-colors) among n shares easily and has the ability to
recover the hidden image clearly. Our new scheme does not need any predefined Color
Index Table (CIT), and the sizes of shares are the same and fixed. Furthermore, the share
size is independent of the number of colors appearing in the secret image. Moreover, the
pixel expansion in our scheme is only 9, which is the least among those in the previously
proposed methods.
1.3 Motivation:
Since that general data hiding technology comes short of quantity and security, in
visual cryptography fails to detect color contrast and to stack images with precision, and
thereby a new technique is proposed to share a secret color image improves data hiding
and visual cryptography to transmit secret color images. Basically, our scheme is at first
to convert confidential information into a color image. Next, two significant color images
are selected at random as cover images which share the same size as the image with
confidential information. Finally, the secret image with all the pixels will be hidden into
two cover images, called camouflage images. An established CIT will help to hide the
secret image in the two camouflage images. As for recovering, stack the two camouflage
images, and through inverted look-up of CIT, the secret image will returns with ease.
However, this scheme has to spend some additional space to store the CIT and spare
some additional time to look-up the CIT. Besides, this scheme is only a 2 out of 2
scheme.
To overcome these disadvantages Chang et al. proposed in 2002 a new color
image sharing scheme [1] based on modified visual cryptography. The proposed
approach uses meaningful shares (cover images) to hide the colored secret image and
recovery process is lossless. The scheme defines a new stacking operation (XOR) and
requires a sequence of random bits to be generated for each pixel. Chang’s scheme can be
generalized to n out of n approach as opposed to Chang T sai’s scheme.
1.4 Objective of the project:
Security is the major problem to send the data, images or financial documents
through the internet or e-mail. The object of the project is discussing the two improved
visual cryptography schemes for secret hiding. Those are Chang, T Sai and Chen’s
algorithm and Chang’s et al. algorithm.
In Chang, T Sai and Chen’s scheme, a secret color image can be hidden in two
significant color images by using a predefined Color Index Table (CIT). As recovering,
by means of stacking two camouflage images and look up the CIT, we can recover the
original image with ease.
In Chang et al. algorithm, a secret image can be hidden into two colored cover
images without Color Index Table. This scheme defines a new stacking operation (XOR)
and requires a sequence of random bits to be generated for each pixel.
1.5 Organization of the Thesis:
Chapter 1: In this chapter we discuss about brief introduction of the project,
background, motivation and object of the project.
Chapter 2: In this chapter we discuss introduction of cryptography, various
cryptography techniques, Introduction to visual cryptography, working of
visual cryptography and basic models of visual cryptography schemes.
Chapter 3: In this we discuss the improved visual cryptography schemes
( Chang, T Sai and Chen’s algorithm and Chang’s et al. algorithm).
Advantages and applications of visual cryptography are also discussed.
Chapter 4: In this we discuss the results of two algorithms and comparisons between
the two algorithms.
Chapter 5: In this chapter we discuss the conclusion and future work.