International Journal of Engineering Research and Development ISSN: 2278-067X, Volume 1, Issue 9 (June 2012), PP.30-33 www.ijerd.

com

Wavelet Based Comparison of Edge Detection Technique for Iris Recognition

Electronics Engg.Dept, P.I.E.T., Nagpur, Maharashtra, India

AbstractEdges characterize boundaries and therefore a problem of fundamental importance in image processing. Edge detection significantly reduces the amount of data and filters out useless information, while preserving the important structural properties in an image. In this paper, we present wavelet based comparison of edge detection technique. Fourier Transform in edge detection applications has its own disadvantages. Wavelet transform plays a very important role in the image processing analysis, for its fine results when it is used in multi-resolution, multi-scale modelling. Unlike Discrete Cosine transforms or Fourier transforms, wavelet transform offers a natural decomposition of images at multiple resolutions. Wavelet analysis is a local analysis; it is especially suitable for time frequency analysis, which is essential for singulari ty detection, the fact motivated us to develop a technique using Haar wavelet to find an edge from an image. The proposed technique has been demonstrated for iris imagery. Keywords Daubechies D4 wavelet, Daubechies D2 wavelet, Edge detection, Fourier Transform, Haar wavelet, Iris imagery, MMSE, PSNR.

I.

INTRODUCTION

The concept of wavelet analysis has been developed since the late 1980's. However, its idea can be traced back to the Littlewood-Paley technique and Calder'on-Zygmund theory [7] in harmonic analysis. Fourier analysis is also a good tool for frequency analysis, but it can only provide global frequency information, which is independent of time. Hence, with Fourier analysis, it is impossible to describe the local properties of functions in terms of their spectral properties, which can be viewed as an expression of the Heisenberg uncertainty principle [6]. In many applied areas like digital signal processing, time-frequency analysis is critical. That is, we want to know the frequency properties of a function in a local time interval. Engineers and mathematicians developed analytic methods that were adapted to these problems, therefore avoiding the inherent difficulties in classical Fourier analysis. For this purpose, Dennis Gabor [9] introduced a sliding-window technique. He used a Gaussian function g as a window function, and then calculated the Fourier transform of a function in the sliding window. The Gabor transform is useful for time-frequency analysis. The Gabor transform was later generalized to the windowed Fourier transform in which g is replaced by a time local function called the window function. However, this analyzing function has the disadvantage that the spatial resolution is limited by the fixed size of the Gaussian envelope [4].The most preeminent books on wavelets are those of Meyer [10], [8] and Daubechies [13]. Meyer focuses on mathematical applications of wavelet theory in harmonic analysis. Daubechies gives a thorough presentation of techniques for constructing wavelet bases with desired properties; along with particular example of an orthonormal wavelet system was introduced by Alfred Haar [14]. However, the Haar wavelets are discontinuous and therefore poorly localized in frequency. St'ephane Mallat [12], [15] made a decisive step in the theory of wavelets in 1987 when he proposed a fast algorithm for the computation of wavelet coefficients. He proposed the pyramidal schemes that decompose signals into sub bands. These techniques can be traced back to the 1970s when they were developed to reduce quantization noise [3].The framework that unifies these algorithms and the theory of wavelets is the concept of a multi-resolution analysis (MRA). In 1997, Chui and Wang [5] further discussed the asymptotically optimal time frequency localization by scaling functions and wavelets. In their paper they proved the convergence of the time-frequency window sizes of cardinal polynomial B-wavelets, which are used in Mallat's algorithm and are important in many other wavelet applications. An edge in an image is a contour across which the brightness of the image changes abruptly. In image processing, an edge is often interpreted as one class of singularities. In a function, singularities can be characterized easily as discontinuities where the gradient approaches infinity. However, image data is discrete, so edges in an image often are defined as the local maxima of the gradient. Edge is a main tool in pattern recognition, image segmentation, and scene analysis. An edge detector is basically a high pass filter that can be applied to extract the edge points in an image. This topic has attracted many researchers and many achievements have been made [11], [4], [19], [18], [20], [16], [17]. In this paper, we will explain the mechanism of edge detectors from the point of view of wavelets and develop a way to construct edge detector using wavelet transforms. The rest of the article is organized as follows: Section II and III briefly describe popular edge detector as well as some wavelet functions. In section IV describes the propose technique. Section V presents the experimental results conducted on several iris imagery. Finally, Section VI concludes the article.

II.

POPULAR EDGE DETECTOR

Many classical edge detectors have been developed over time. They are based on the principle of matching local image segments with specific edge patterns. The edge detection is realized by the convolution with a set of directional derivative masks [2]. The popular edge detection operators are Roberts, Sobel, Prewitt, Frei-Chen, and Laplacian operators [18], [20], [2], [10]. They are all defined on a 3 by 3 pattern grid, so they are efficient and easy to apply. In certain situations where the edges are highly directional, some edge detector works especially well because their patterns fit the edges better.

30

Wavelet Based Comparison of Edge Detection Technique for Iris Recognition III. WAVELET TRANSFORM

Wavelets are composed of two bases, a scaling and a wavelet basis. The scaling basis deals with how the wavelet represents a signal over a given frequency band. The wavelet basis shows how the wavelet sees the transients in a signal on a given frequency band.

A.

The Haar Wavelet Transform The Haar wavelet has the advantage of being simple to compute and easy to understand [14]. Each step in the Haar wavelet transform calculates a set of scaling coefficients and a set of wavelet coefficients. If data sets do, dl, dn-1contains n elements; there will be n/2 scaling coefficients and n/2 wavelet coefficient values. The scaling coefficients are stored in the lower half of the n element array and the wavelet coefficients are stored in the upper half. For two dimensional matri xes the wavelet transform has performed both horizontally and vertically. It creates four different sub bands named as LL, HL, LH and HH as shown in fig.1.the Harr wavelet to calculate scaling coefficients (S n) and a wavelet coefficient (wn) from an odd and even element in the data set are shown below (1) (2)

Figure 1. Wavelet multiresolution property of an image: (a) represents original image, (b) a one-level decomposition produces 4 sub-bands, namely LL, LH, HL and HH.

IV.

PROPOSED WAVELET BASED EDGE DETECTION TECHNIQUE

The proposed technique has composed with four different blocks as shown in Fig. 2. Each of these blocks is described in detail in next.

Figure 2. Block Diagram of Propose Technique.

A.

Input Image The images are used in this paper in the form of grey color model'. The size of the images is considered here are 512 x 512 pixels where each pixel contains different intensity values of grey from 0 to 255. The input image is processed and set to forward for the next block.

B.

Wavelet Transform The image which is come from the previous block is used here for the wavelet transform. The Haar wavelets are described in section III are applied on the processed image which creates different sub-bands like LL, LH, HH and HL.

C.

Edge Detector This is the main block where the detection of the edge from the image has to be performed. From a signal processing point of view, the wavelet transform is basically a convolution operation, which is equivalent to passing an image through low-pass and high-pass filters. Let the original image be I(w, h), then the LH sub-band represents the vertical edges, HL subband represents the horizontal edges and HH sub-band represents the diagonal edges of I(w, h). Using these properties of the LH, HH and HL sub-bands, we construct an edge image. If an element in the LH sub-band is Vm, n, an element in the HH sub-band is dm, n and an element in the HL sub-band is hm, n, then the corresponding element em, n in the edge image is given by Eqn. (3)

31

Wavelet Based Comparison of Edge Detection Technique for Iris Recognition

V.

EXPERIMENTAL RESULT USING MAT LAB

The result is reported by Fig. 3. (a), (b), (c), and (d). The proposed technique has found the edges from the images which are very evident and clear by the visualization. Also on the basis of parameter like MMSE and PSNR, we can show that the Haar wavelet transform produces better result as shown in Fig.3

Fig. 3 (a) with Haar wavelet (MMSE: 27.44 dB, PSNR: 31.39 dB)

Fig. 3 (b) with Db2 wavelet (MMSE: 25.81 dB, PSNR: 31.16 dB)

Fig .3 (c) with Haar wavelet (MMSE: 19.33 dB, PSNR: 31.70 dB)

32

Wavelet Based Comparison of Edge Detection Technique for Iris Recognition

Fig.3 (d) with Db4 wavelet (MMSE: 18.00 dB, PSNR: 31.64 dB)

VI.

CONCLUSION

In this article edge detection technique using Haar wavelet has been developed. The developed technique has performed over iris imagery and produces very promising result. Haar wavelet transform analysis is essential for singularity detection which results as an edge of the original image. Good performance of this technique for such imagery shows that it may be motivating to use this algorithm in other Imagery applications also. As a scope of further research this technique can also be extended for clustering, indexing and retrieval of image.

VII.

ACKNOWLEDGMENTS

The authors would like to thank firstly, our GOD, and all friends who gave us any help related to this work. Finally, the most thank is to our families and to our country INDIA which born us.

REFERENCES
[1]. [2]. [3]. [4]. [5]. [6]. [7]. [8]. [9]. [10]. [11]. [12]. [13]. [14]. [15]. [16]. [17]. [18]. [19]. [20]. Avijit Sur, Nilanjan Patra, Santanu Cfakraborthy, Indrajit SahaA new Wavelet based edge detection Technique for Iris Imagery978-1-4222-1888-6/08/$25.00 Q 2008 IEEE. K. R. Castleman, Digital Image Processing, Englewood Cliffs, NJ: Prentice-Hall, 1996. D. Esteban and C. Galand, "Applications of quadrature mirror filters tosplit-band voice coding schemes," Int. Conf. Acoust. Speech SignalProcess. Hartford, CT, pp. 191-195, 1977. R. J. Beattie, Edge detection for semantically based early visualprocessing, dissertation, Univ. Edinburgh, Edinburgh, U.K., 1984. C. K. Chui and J. Z. Wang, "A study of asymptotically optimal time frequency localization by scaling functions and wavelets," Annals of Numerical Mathematics, vol. 4, pp. 193-216, 1997 A. Cohen and R. D. Ryan, Wavelets and Multiscale Signal Processing, Chapman & Hall, 1995. A. Zygmund, Trigonometric Series, 2nd ed., Cambridge: Cambridge University Press, 1968. Y. Meyer, Ondelettes, fonctions splines ET analyses gradu'ees, RapportCeremade, 1987. D. Gabor, "Theory of communication," JIEE (London), vol. 93, pp. 429-457, 1946. J. J. Benedetto and M.W. Frazier, Wavelets-Mathematics and Applications, CRC Press, 1994. M. Hueckel, "An operator which locates edges in digital pictures,"JACM, vol. 18, no. 1, pp. 113-125, 1971. S. Mallat, "Multiresolution approximations and wavelet orthonormalbases of L2(R)," Trans. Amer. Math. Soc., vol. 315, pp. 69-87, 1989. I. Daubechies, Ten lectures on Wavelets, CBMS-NSF Series in Appl.Math., SIAM, Philadelphia. A. Haar, "Zur theorie der orthogonalen funktionen systems," Math. Ann., vol. 69, pp. 331-371, 1910. S. Mallat, A Wavelet Tour of Signal Processing, New York: Academic,1998 Y. Y. Tang, L.H. Yang, and L. Feng, "Characterization and detection ofedges by lipschitz exponent and MASW wavelet transform," Proc. 14th Int. Conf. Pattern Recognit.,Brisbane, Australia, pp. 1572-1574, 1998. K. A. Stevens, "Surface perception from local analysis of texture andcontour," Artificial Intell. Lab., Mass. Instr. Technol., Cambridge, Tech. Rep. AI-TR-512, pp. 1572-1574, 1980. L. Mero, "A simplified and fast version of the hueckel operator forinding optimal edges in pictures," Pric. IJCAI, pp. 650-655, 1975. B. K. P. Horn, The Binford-Horn line-finder, Artificial Intell. Lab., Mass. Inst. Technol., Cambridge, Al Memo 285, 1971. R. Nevatia, "Evaluation of simplified hueckel edge-line detector," Comput., Graph., Image Process., vol. 6, no. 6, pp. 582-588, 1977.

33