You are on page 1of 4

IET-UK International Conference on Information and Communication Technology in Electrical Sciences (ICTES 2007),

Dr. M.G.R. University, Chennai, Tamil Nadu, India. Dec. 20-22, 2007. pp.638-641.

INFORMATION SECURE FINGER PRINT ANALYSIS


USING WAVELETS
S. Ramapriya*, S.K. Srivatsa†
* Department of Mathematics, Easwari Engineering College, Chennai, India,
Email: ramapriya99@gmail.com

Department of Instrumentation and Control, St.Joseph College of Engineering,
Chennai, India,Email: profsks@rediffmail.com

Keywords: Fingerprint Authentication, Wavelet Scalar up to 0.6 MB). The most commonly used algorithm used here
Quantization (WSQ), Lifting algorithms, Huffman Encoding, is Wavelet Scalar Quantization (WSQ) [2] technique
EZW (Embedded Zero Tree Wavelet) Coding. developed by FBI, standardized by NIST - which involves a
DWT step, scalar quantization and finally compression. The
Abstract Figure 1 schematically describes how WSQ uses wavelet
transforms for image compression.
A biometric is any measurable, distinct personal trait, which
can be used to verify the identities of different individuals.
This paper describes a reliable and widely used biometric
system-fingerprint authentication as an application of
Wavelet Transforms.

1 Introduction
Wavelets are mathematical functions that split data into
different frequency components, and then analyze each
component with a resolution matched to its scale. They have
advantages over traditional Fourier [1] methods in analyzing
physical situations wherein the signal contains Figure 1: WSQ for image compression
discontinuities. Discrete Wavelet Transforms (DWT) plays
After DWT, it is simply required to round the coefficients off
an important role in fingerprint analysis.
to zero, then the only information needed is the low-
resolution image plus a few detail coefficients that did not get
2 Discrete Wavelet Transforms rounded off to zero. The process of rounding high-precision
numbers into lower precision numbers with fewer digits is
Discrete Wavelet transforms are a result of dilations and
called quantization (the “Q” in “WSQ”). The process of
scaling of a ‘mother function’, giving rise to a family of
transforming and quantizing can be repeated as many times
wavelets. Scaling results in a series of wavelet coefficients,
as desired, each time decreasing the bits of information by a
satisfying certain constraints. Wavelet transforms have an
factor of almost 2 and slightly degrading the quality of the
infinite set of possible basis functions. Thus, wavelet analysis
image. Depending on the needs of the user, the process can
provides an immediate access to information that can be
be stopped before the lower resolution starts to become
obscured by other frequency domain methods such as Fourier
apparent.
analysis, which utilizes only sine and cosine functions.
Discrete Wavelet Transforms (DWT) plays an important role However, the DWT output is then truncated by the scalar
in fingerprint analysis and image storage. quantization step; this is the lossy part of the process.
Inadequate recovery of DWT coefficients will degrade image
3 Image Compression Algorithms resolution and detail.
The use of image compression methodologies can be The image on the left of Figure 2 is original; the one on the
extended to efficient, compact storage of fingerprints [1] in right is reconstructed from a 26:1 compression in WSQ [3].
large databases, as they occupy a lot of space (one print takes

638
Information Secure Finger Print Analysis using Wavelets

In the successive steps of the same direction, all DWT


coefficients will be generated so that DWT coefficients are
obtained via 2 output terminals. So there is no need of
cascaded DWT networks which increases chance of signal
loss after each stage. The recovery of each coefficient
becomes difficult as system complexity increases. The finger
print image is digitized, which is sampled at regular intervals
by discrete wavelet transforms.

B. Split
Figure 2: Finger Print image used in WSQ Technique
The samples of digital signal are broken into two sets of even
4 Modifications of Existing Scheme (a) and odd (b) samples

In this paper, a technique which eliminates the loss of C. Predictability (P)


information is implemented. This loss of information in
conventional schemes can be disastrous in comparison of Even and odd sets are highly correlated, allowing the use of
closely related images and minute variations in fingerprint one to predict the other. They can be correlated through their
contours can be overlooked or neglected by the system. The averages(s) and differences (d) as
several steps described here follow the encoding path alone,
wherein each block of the WSQ format will be substituted. d d
a = s− and b = s+
The inverse of each process will yield the original image. 2 2

A. DWT of a signal D. Update (U)

In the first step, Lifting scheme [4,8] or Lifting algorithms The process allows the DWT to output as smooth and coarse
are incorporated. This will execute a lossless DWT of the signals, forming consecutive DWT coefficients. It is a
signal. A sequence of lifting steps consists of alternating continuation of the former step, and checks the overall
‘lifts’, i.e. once the low pass and high pass is changed and in average of the signal.
the next step the high pass is fixed and the low pass is
changed. Figures 3 and 4 shows a schematic representation of Control system analysis at adder and subtractor give rise to
the lifting scheme, which yields all DWT outputs. following mathematical equations

b j −1 = b j −1 − P ( a j −1 ) (1)
a j −1 = a j −1 + U ( b j −1 ) (2)
An inverse lifting [5,10] step will allow perfect
reconstruction of signal (decoding). This is a relatively new
concept, and has not been used in image compression, but the
process prevents information loss.

The computations for coefficients are done in place,


Figure 3: Lifting scheme block diagram preventing memory allocation. It eliminates the need to
completely analyze signals in frequency domain. It allows
analysis of complex geometrical patterns, so that the
computer can easily interpret fingerprint contours. Also, the
computational time is greatly reduced, by simplifying the
DWT and inverse DWT.

5 Quantization
To reduce quantization errors of WSQ, Adaptive Step-size
Variation methods are used to automatically vary the step-
Figure 4: DWT Cascaded network size while truncating the different sub bands of the DWT
output (analogous to Adaptive Delta Modulation in

639
IET-UK International Conference on Information and Communication Technology in Electrical Sciences

communication systems, wherein step signal size of pulse


signals varied based on analog signal variations). This system
will require a modification in the uniform quantizer where
‘ xi ’ represents the series of DWT sub-band [6] entering the
adaptive quantizer. Filtering with an appropriate threshold of
coefficient value before the system will eliminate low value
coefficients (this is dead-zone of quantization as values tend
to zero). Figure 5 vividly describes a differential adaptive
encoder.

Figure 6: The relations between wavelet coefficients in


different sub bands as quad-trees

t0 = 2[log 2 ( MAX ( |γ ( x , y )|) ) ] (3)

Here MAX (.) means the maximum coefficient value in the


Figure 5: Adaptive and differential encoder image and γ ( x , y ) denotes the coefficients.

A comparator circuit can so be designed to allow the 2nd sub 7 Algorithm


band to be compared with the first, i.e. in first iteration; the
sub band comes out of comparator (shown by circle) and then Threshold=initial threshold//predefined value based upon
passed into an up-down counter (predictor), so that it can compression requirements
serve as the other input to the comparator. The step sizes will
increase/decrease depending on whether step size exceeds the do
{
sub-band / DWT [7] coefficient value. Also, closely spaced dominant pass ( );
coefficients will be neglected due to a differentiator in the subordinate pass ( );
feed back path. Threshold= (threshold)/2;
}
WHILE (threshold > stop threshold);
6 Image Compression
The algorithm [10] has three steps.
Image compression is performed by Huffman encoding to
reduce the number of variables (sub-bands) using a tree a. Dominant pass: Image is scanned and all coefficients
structure. This can be substituted with EZW [9] (Embedded pertaining to each bit is mapped to the tree. So all the
Zero Tree Wavelet) coding, which is based on progressive coefficients having values larger than the threshold are
encoding, improving accuracy, by focusing more on lower extracted and positions filled with zeroes. This ensures
sub bands (higher energy) to improve resolution and detail. A that they are never coded again. So execution time is
zero tree is a quad tree where the weights of all nodes of the reduced.
tree are equal to or lesser than that of the root node. As every b. Subordinate Pass: A refinement step to output the most
node gives rise to 4 children, a quad tree arises (due to significant bits of the tree. Refinement stops until we
progressive decomposition of DWT coefficients). The Figure reach a fixed ‘stop threshold’ value.
6 describes the relation between wavelet coefficients in c. Threshold value is reduced as we proceed down the tree
different sub bands as quad-trees. to ensure that insignificant bits are not coded in the future.
Pyramidal decomposition [9] breaks down the picture into EZW has better compression capabilities as compared to its
several sub images, forming a matrix structure. The high- counterpart in JPEG [11] 2000. It does not require prior
value coefficients are placed right and low value coefficients knowledge of the image’s bit pattern, as threshold depends on
to the left. Hence, the zero trees exploit the fact that DWT coefficients and compression ratio. Complicated tree
coefficients decrease down the tree and the nodes will fall
mapping / bit allocation is also avoided. This forms a simple
below the threshold for the compression limit for algorithm.
compression algorithm, which will also preserve image
So, the entire tree will be encoded into one zero tree symbol.
quality to a greater limit. Although a lossy process as
If the tree is encoded in a predefined order, then many bits
compared to Huffman coding, this results in effective image
can be coded, giving priority to different sub bands, forming
compressor wherein the compressed data stream can have
the several levels of the tree. Threshold is determined by the
practically any bit rate. Fingerprint analysis benefits, as
formula

640
Information Secure Finger Print Analysis using Wavelets

decompressed images will retain their standards despite Image Image Processing XIX, (1996).
storage in database. [2] J. N. Bradley, C. M. Brislawn, and Tom Hopper. “The FBI
Wavelet/Scalar Quantization Standard for greyscale fingerprint
image compression”, SPIE, Orlando,FL, Visual Info Processing 2,
8 Conclusion volume 1961, pp 293-304, (April 1993)
[3] J. N. Bradley and C. M. Brislawn. “Proposed First -Generation
Wavelets find application, which include human vision, WSQ Bit Allocation Procedure”. In anonymous internet ftp site,
seismic geology, (earthquake detection) and radar. As ftp.c3.1anl.gov in /pub/WSQ/documents/bit.alloc.ps file,(1993).
mentioned, wavelet transform based algorithms reduce [4] C. K. Chui. “An Introduction to Wavelets”, Academic Press
computation period, paving way for faster computer based Inc., (1992).
evaluation. Microprocessors that make use of the lifting [5] Federal Bureau of Investigation, “WSQ gray-scale fingerprint
algorithms will optimize the performance of database image compression specification”, document IAFIS-IC-0110v2,
management systems. Further research of Wavelet February (1993)
[6] R. C. Gonzalez and R. E. Woods. “Digital Image
Transforms is required to expand the range of its
Processing”.Addison Wesley, (1992).
applications, as the mathematical concepts are well known. [7] A. Jensen and A.La Cour-Harbo , “Ripples in Mathematics:
The Discrete Wavelet Transform”, Springer-Verlag, (2001).
Acknowledgements [8] W., Sweldens , “The Lifting Scheme:A Construction of
Second-generation wavelets”, SIAM Journal on Mathematical
The authors would like to thank S. Ravi and B. Rajan for Analysis, vol. 29(2), pp 511-546(1997)
numerous discussions and critical remarks on the manuscript. [9] J.M Shapiro., “Embedded image coding using zerotrees of
wavelet coefficients”, IEEE Transactions on Signal processing, Vol.
41, No. 12, pp. 3445-3462, (December 1993)
References [10] K.P.Soman and K.I.Ramachandran, “Insight into Wavelets –
From Theory to Practice”, Prentice-Hall Of India, (2004).
[1] C.M. Brislawn, J.N Bradley, R.J.Onyshzak, and T.Hopper.
[11] K..Sayood, “Introduction to Data compression, second
“The FBI compression standard for digitized fingerprint images”,
edition,Academic Press, (2000).
Proceedings of the SPIE conference 2847, applications of Digital

641

You might also like