1848

IEEE TRANSACTIONS ON IMAGE PROCESSING, VOL. 22, NO. 5, MAY 2013

Design of Low-Complexity High-Performance Wavelet Filters for Image Analysis

Ameya K. Naik and Raghunath S. Holambe

Abstract This paper addresses the construction of a family of wavelets based on halfband polynomials. An algorithm is proposed that ensures maximum zeros at = for a desired length of analysis and synthesis lters. We start with the coefcients of the polynomial ( x + 1)n and then use a generalized matrix formulation method to construct the lter halfband polynomial. The designed wavelets are efcient and give acceptable levels of peak signal-to-noise ratio when used for image compression. Furthermore, these wavelets give satisfactory recognition rates when used for feature extraction. Simulation results show that the designed wavelets are effective and more efcient than the existing standard wavelets. Index Terms Biometrics, computational complexity, lters, wavelet coefcients.

I. I NTRODUCTION VER THE last few decades wavelets have gained signicant importance and become a standard tool for applications such as image coding [1], [2]. Wavelet based image coders are adopted in compression standards [3][6] (JPEG 2000) and are found to outperform traditional coders based on discrete cosine transform [7]. Recently wavelets have also been accepted as a standardized tool for image analysis and feature extraction [8][10]. It is well known that the performance of wavelet based systems is highly dependent on the choice of wavelet. Consequently wavelet design becomes highly critical for such systems. Typically for best performance the correlation between properties of the image, characteristics of lters and the nature of the application needs to be examined. One of the vital lter characteristics is the lter length which has direct impact on the complexity and the system performance. Optimal lter designs have been proposed for image compression [11] and feature extraction [8][10] independently. Existing literature also focuses on design of signal dependent wavelets [12] for certain applications. However the computational complexity of such wavelets is usually high. Hence many issues are still open in the eld of designing low-complexity lters for diverse applications relating to different image sets.
Manuscript received January 24, 2012; revised May 27, 2012, August 31, 2012, and December 20, 2012; accepted December 21, 2012. Date of publication January 9, 2013; date of current version March 14, 2013. The associate editor coordinating the review of this manuscript and approving it for publication was Dr. Joan Serra-Sagrista. The authors are with the S. G. G. S. Institute of Engineering and Technology, Nanded 431606, India (e-mail: ameyaknaik@ yahoo.com; rsholambe@sggs.ac.in). Color versions of one or more of the gures in this paper are available online at http://ieeexplore.ieee.org. Digital Object Identier 10.1109/TIP.2013.2237917

This paper proposes a design algorithm for a class of wavelets that can be used for image compression as well as feature extraction. Our approach is to start with the design of a halfband polynomial of the desired length. A method has been suggested to design the halfband polynomial with maximum vanishing moments [1]. Low pass and high pass decomposition lters of variable lengths can be obtained by factoring the halfband polynomial and distribution of its factors. As a result different wavelets can be obtained with different lengths and properties. The performance of the designed wavelets is tested for applications such as image compression and feature extraction. It is observed that in addition to the existing standard wavelets, other wavelets do exist that perform well for compression and feature extraction. The organization of the paper is as follows. Section II gives a brief description about the existing wavelets and their characteristics. Section III gives the general conditions for construction of any wavelet. The construction of wavelets using halfband polynomial (WCHP) is presented in Section IV. The relation of WCHP with the standard wavelets and their lter coefcients are given in Sections V and VI respectively. Section VII deals with the energy distributions of the designed wavelets in the various subbands. The performance of WCHP for image compression and feature extraction is discussed in Section VIII. Section IX gives the comparison of WCHP with state of art coders and standards followed by conclusions. II. R ELATED W ORK Although various wavelets exist, the most commonly used belong to the category of orthogonal and bi-orthogonal transforms. Daubechies [13] presented a method for constructing orthogonal wavelets with compact support. Orthogonal wavelets [14] ensure that the noise and error in subbands are not amplied making the coding design comparatively simple. However such wavelets are not symmetric and do not provide linear phase. Phase linearity [15] is necessary for handling boundary distortions of nite length signals such as images. Orthogonality and linear phase exists only in case of Haar lters which are not continuous. Hence a new class of near symmetric wavelets [16] (symmlets) was designed. In order to make the lter symmetric the phase is manipulated so that it is almost linear. Symmlets nd application in many signal processing areas such as feature extraction. Linear phase symmetric lters can also be obtained by relaxing the orthogonality constraint and using bi-orthogonal wavelets. Bi-orthogonal [17] wavelets are found to have

1057-7149/$31.00 2013 IEEE

NAIK AND HOLAMBE: DESIGN OF LOW-COMPLEXITY HIGH-PERFORMANCE WAVELET FILTERS

1849

good compression potential and low computational complexity. Various bi-orthogonal wavelets have been designed and proposed for different image processing standards such as JPEG 2000. The most popular construction is the CDF 9/7 [18] (CohenDaubechiesFeauveau) which have linear phase and give excellent compression ratios. However these lters are designed with coefcients that are irrational numbers and thus require oating point implementation. Subsequently the computational complexity increases making the hardware implementation difcult. Hence recently there has been much emphasis on design of lters which yield hardware friendly dyadic coefcients. Furthermore additional lter properties such as large vanishing moments, high frequency selectivity, atness, etc. are also desired in certain applications. A class of wavelets which give maximum vanishing moments and dyadic coefcients are the bi-orthogonal splines. Godavarthy [19] showed how to algorithmically construct wavelets in this family. However such wavelets give good performance only for smaller lengths of reconstruction low pass lters. Cheng et al. [11] used lifting scheme [20], [21] to design wavelets with binary coefcients. However this construction was achieved at the cost of reduced vanishing moments. Similar constructions were proposed by Guangjun et al. [22] and Quan [23] in order to provide optimum lter banks. Patil et al. [24] used general halfband polynomial to design two channel bi-orthogonal wavelet lters. By imposing lesser number of zeros at z = 1 some independent parameters were obtained. These parameters were then manipulated to obtain desired frequency response. Though it is explicit it is worth mentioning that for same degree of atness a higher order polynomial is required than the standard ones. This increases the computational complexity making hardware implementation difcult. Furthermore the performance of aforementioned wavelets was tested for standard photographic images [25]. However many common class of images such as ngerprints, satellite images, etc. do not have the same statistical properties as photographic images. Hence it becomes necessary to design wavelets that match the characteristics of images of our interest. In addition even for the same class of images wavelets may perform differently for distinct applications. In order to address this problem recently a new class of wavelets based on THFB (Triplet Half-band Filter Bank) [26] were proposed. These wavelets give superior performances in applications such as compression and feature extraction. However these wavelets require a combined (analysis and synthesis) lter length of 32. The higher lter lengths are generally not suitable for hardware implementation. In order to overcome these existing limitations the design of a new class of wavelets is presented. The wavelets are optimal in terms of hardware complexity, reconstruction quality, recognition accuracy and lter length. Moreover these wavelets can prove useful in designing a low-complexity framework [27] for diverse image processing applications. III. G ENERAL BACKGROUND In this article we consider only FIR lters for implementation of a two channel lter bank (Fig. 1).

Fig. 1.

Two channel lter bank with perfect reconstruction.

Let h and g denote low pass and high pass analysis lters respectively. The corresponding synthesis lters are given as and g h . The perfect reconstruction (PR) conditions [1], [2] are given as (z ) + g (z ) g (1) h (z ) h (z ) = 2z l where l is the amount of delay ( z ) + g ( z ) g h (z ) h ( z ) = 0 . (2) (z ) and g If g (z ) = h (z ) = h (z ) then (2) is automatically satised and (1) reduces to an equation for the product (z ) lter P (z ) = h (z ) h P (z ) P (z ) = 2z l where l is odd. (3)

The design of a PR lter bank can be given as below. 1) Choose a polynomial P (z ) that satises (3). ( z ). 2) Factor P (z ) = h (z ) h 3) Choose g (z ) = h (z ) and g ( z ) = h ( z ). However in general for an orthogonal lter set the relation between the lters can be given as ( z ) h (z ) = h and g (z ) = g ( z ) (4)

(z ) and g h (z ) form a quadrature mirror lter set. IV. WAVELETS C ONSTRUCTED U SING H ALFBAND P OLYNOMIAL (WCHP) In this section we present a method for designing wavelets using halfband polynomials. The design starts with choosing the best possible halfband polynomial P (z ) of the desired length. The polynomial is selected so as to have maximum factors of z = 1 for the chosen length. A. Formation of Halfband Polynomial Step 1: Let h be the length of the decomposition low pass be the length of the reconstruction low pass lter. h lter and should satisfy the condition r em {(h 4} = 0, where and + ), rem{.} is remainder after division. Step 2: Calculate the length of the halfband polynomial (z ) as = h 1. P (z ) = h (z ) h + Step 3: Calculate the number of unknowns = {( 1)/2} 1. Step 4: The maximum number of vanishing moments for the product lter P (z ) can be given as = 1. This implies r em ( P (z ), (z + 1) ) = 0. Step 5: Find the polynomial (z ) = (z + 1) and the corresponding vector 1x containing rst coefcients of . That is = [1, 2 , 3 , . . . , ].

1850

IEEE TRANSACTIONS ON IMAGE PROCESSING, VOL. 22, NO. 5, MAY 2013

TABLE I FACTORS OF THE H ALFBAND P OLYNOMIAL FOR D IFFERENT L ENGTHS

Algorithm 1 Algorithm for Constructing Combinations for WCHP. (a) Biorthogonal Wavelets. (b) Orthogonal Wavelets

Step 6: Find the solution to the equation A B 1 , where 1 0 0 0 0 0 0 0 0 3 1 0 0 0 0 0 0 2 5 4 3 2 1 0 0 0 0 1 2 4 3 2 1 A= 1 2 3 4 1 0 0 1 2 3 4 0 0 0 0 1 2 3 0 0 0 0 0 0 0 0 1 1 2 2 4 3 6 X = B = 0 . 0 0 1 0 0 Step 7: Construct the polynomial

X 1 = 0 0 0 0 2 4 2

(a)

(b)

B. Algorithm for Construction of WCHP We present the construction of wavelets for two halfband polynomial lengths namely = 15 and 19. While designing the wavelets we choose to have at least two zeros at z = 1 for both decomposition and reconstruction low pass lters. Moreover the lters are constructed with real coefcients. This implies for every complex root at z H B of the halfband polynomial there exists a root at z H B . The construction algorithm is presented in Algorithm 1. In the algorithm (Algorithm 1): n = Number of real roots (other than z = 1) having magnitude less than unity. I m = Number of complex roots having magnitude less than unity. start = Minimum number of zeros at z = 1 for synthesis low pass lters. last = Maximum number of zeros at z = 1 for synthesis low pass lters. combi = Various combinations of I , I, , and Z possible. The degree of the synthesis lowpass lter is given by (z )} = 2 I + 2 I + + + 1 and the length is given Deg {h (z )} + 1. The synthesis low pass lter is constructed by Deg {h by combining I complex roots (with conjugates), I complex inverses (with conjugates), real roots, real inverses and Z roots at z = 1. The remaining roots of halfband polynomial can be used to construct analysis low pass lter. The procedure is repeated for all possible combinations available (combi).

Q (z ) = 1 + 1 z + 2 z 2 + 3 z 3 + + 1 z 1 + z . Step 8: Find the roots of Q (z ) which lie within the unity circle and have phase between 0 to /2. Tabulate the real roots as Q and complex roots as Q I for different combinations of . h and Q = Q and Q I = Q I 1, Q I 2, Q I 3, . . . , Q I m where 2 m + n = /2. Table I gives the factors of halfband polynomial other than z = 1. The maximum vanishing moments possible for different lengths of halfband polynomial are also given. = 12 and 20 real roots do not It can be noted that for h + = 8 complex exist other than at z = 1 whereas for h + roots are absent.
1,

2, . . . ,

NAIK AND HOLAMBE: DESIGN OF LOW-COMPLEXITY HIGH-PERFORMANCE WAVELET FILTERS

1851

TABLE II VARIOUS C OMBINATIONS FOR WCHP 16/i AND WCHP 20/i

TABLE III L OW PASS F ILTER C OEFFICIENTS FOR WCHP 16/i AND WCHP 20/i

C. CohenDaubechiesFeauveau Bi-Orthogonal Wavelets

Db: Daubechies Wavelets Rev. Db: Reverse Daubechies Wavelets Symm: Symmetric Wavelets Asymm: Asymmetric wavelets Type A: Symmetric Biorthogonal Wavelets of even length Type B: Symmetric Biorthogonal Wavelets of odd length Type C: Asymmetric Biorthogonal Wavelets of even length Type D: Asymmetric Biorthogonal Wavelets of odd length

CDF 9/7 low pass reconstruction lters are constructed by using half the maximum zeros at z = 1 (4 zeros) and all the real roots of Q (z ) along with its reciprocals. RCDF (z ) = { R1 R2 } R1 = ( z Q R 1 ) ( z Q R 2 ) ( z Q R R ) 1 1 1 R2 = ( z Q R1 ) 1( z Q R2 ) 1( z Q R R ) ( z + 1) z . (6)

The wavelets constructed by this method will be referred to as i where i is the index number of the combination. WCHP h +/ It is found that 47 different combinations are possible for = 15 and 35 for = 19. Few of the combinations are shown in Table II. It can be seen that many of the well known standard wavelets such as Daubechies, Symmlets, CDF and splines can be constructed using this method. In addition some other useful wavelets can also be constructed for use in different applications. V. R ELATION OF WCHP W ITH S TANDARD WAVELETS A. Daubechies Wavelets Daubechies low pass reconstruction lters are minimum phase with all the roots within the unit circle. Hence the factors of the reconstruction low pass polynomial can be given as
n m

= 0) Hence the combination combi(i ) = {( I = 0) ( I ( = n ) ( = n ) ( Z = /2)} represents CDF 9/7 wavelets. D. Bi-Orthogonal Spline Wavelets In case of splines the reconstruction low pass lter poly nomial is of the form (z + 1) 1 . Hence combi(i ) = {( I = 0) ( I = 0) ( = 0) ( = 0) ( Z = h 1)} represents . the combination for a spline wavelet of length VI. C HARACTERISTICS OF THE P ROPOSED WAVELETS The performance of DWT (Discrete Wavelet Transform) based CODEC depends on the accuracy of the wavelet coefcients. A high precision representation ensures good performance, but at the cost of computational complexity [28][30]. Table III gives the quantized low pass lter coefcients for a few WCHP types. It can be seen that the coefcients have dyadic values. Hence these lters can be easily implemented in hardware with only add and shift operations. Fig. 2 shows the scaling and wavelet functions for a couple of WCHP types (WCHP 16/22 and WCHP 16/47). The corresponding impulse responses and frequency responses are depicted in Figs. 3 and 4 respectively. For the sake of comparisons, similar plots are also provided for binary 9/7 lters [11]. The responses of WCHP 16/22 and binary 9/7 [11] lters indicate good resemblance with each other and hence are expected to give similar performances when used for compression and feature extraction applications.

R Db (z ) =

(z Q
t 1=1 m

t 1)

(z Q I t 2 )
t 2=1

z (z Q I t 3 ) ( z + 1) .

(5)

t 3=1

Hence for combi(i ) = {( I = I m ) ( I = 0) ( = n ) ( = 0) ( Z = /2)} the combination represents Daubechies wavelets. B. Near Symmetrical Orthogonal Wavelets (Symmlets) Symmlets are near symmetric wavelets constructed by taking roots having magnitude less than unity and reciprocal of the remaining roots. A lter with coefcients an is called linear phase if the phase of the function a ( ) = n an e2n is a linear function of . Symmlets are constructed by maintaining the phase deviation from linear function as minimum as possible. WCHP 16/7 and WCHP 20/4 belong to this category.

1852

IEEE TRANSACTIONS ON IMAGE PROCESSING, VOL. 22, NO. 5, MAY 2013

(a)

(a)

(b) (b)
Fig. 2. Scaling and wavelet functions of WCHP and binary wavelets. (a) Decomposition. (b) Reconstruction. Fig. 3. Impulse responses of low pass wavelet lters. (a) Decomposition. (b) Reconstruction.

VII. E NERGY D ISTRIBUTION OF THE D ESIGNED WAVELETS The suitability of a wavelet for any application depends on the energy distribution in the subbands (LL, HL, LH, and HH) obtained after wavelet decomposition. Table IV gives the percentage energy distribution for a few wavelets in the WCHP family. The values depicted are obtained after rst level wavelet decomposition of an image. The test image considered is a general ngerprint image. It can be seen that all the orthogonal wavelets retain nearly the same percentage of energy in the average subbands. However for the bi-orthogonal case the same depends on the length of the decomposition and reconstruction lters. In general the spline wavelets are found to retain maximum energy in the average subband. As a result such wavelets can give satisfactory performance for threshold based compression applications. The threshold is selected such that only the coefcients in the desired subbands (usually LL) are retained. In the transformed image only the coefcients with magnitude above the threshold are retained and the rest are replaced with zeroes. The image can then be reconstructed from the modied transform coefcients. Since maximum energy is retained in the LL subband, the retention of coefcients in this subband leads to good quality reconstruction. Subsequently the Mean Square Error decreases leading to a higher PSNR. However in case of feature extraction applications, vital information present in detail subbands (HL, LH, and HH) is required.

Fig. 4.

Frequency responses of WCHP and binary wavelets.

Hence it is desired to have at least some minimum energy in these regions. VIII. E XPERIMENTAL R ESULTS The designed wavelets are tested for their possible application in image compression and feature extraction. For this purpose we have chosen a few wavelets from the WCHP family that are found to retain sufcient energy in the average and detail subbands. We have tested the performance of these wavelets over seven standard images and well known nger-

NAIK AND HOLAMBE: DESIGN OF LOW-COMPLEXITY HIGH-PERFORMANCE WAVELET FILTERS

1853

TABLE IV P ERCENTAGE E NERGY D ISTRIBUTION FOR WCHP 16/i AND WCHP 20/i

Fig. 5. Ea : Eh : Ev : Ed : Percentage Percentage Percentage Percentage of of of of Energy Energy Energy Energy retained retained retained retained in in in in LL subband HL subband LH subband HH subband

PSNR versus bit rate for WCHP and binary wavelets.

print databases. For the purpose of fair comparisons we have considered a few standard wavelet based image coders viz. Set Partitioning In Hierarchical tree (SPIHT) [31], Embedded Zerotree Wavelet coder (EZW) [32] and Adaptive Scanning Methods for Wavelet Difference Reduction (ASWDR) [33]. In order to obtain an insightful analysis the objective measure of peak signal to noise ratio [34], [35] (PSNR) for various bits per pixel (0.1, 0.25, 0.5, 1, and 2 bpp) are measured. Comparisons are also made by tabulating the number of additions and shift operations required to implement the encoder in Canonical Signed Digit (CSD) form. Table V(a) depicts the PSNR values obtained for seven common testing images [36], [37]: Lena (512 512), Barbara (512 512), Woman (2048 2560, Caf (2560 2048), Bike (2560 2048), Tableware (600 spi, SCID N4A) and Three musicians (600 spi, SCID N7A). The rst two images (Lena and Barbara) are the standard images used for testing classic JPEG encoders. The next three images (Woman, Caf and Bike) are ISO/IEC high resolution images whereas the last two (Tableware and Three musicians) are the test images commonly used in JPEG 2000 literature. It can be seen that WCHP 16/22 gives the best performance as compared to other wavelets. The performance is comparable with the 9/7 wavelets proposed in [11], [34]. Although WCHP 16/i wavelets perform better than WCHP 20/i , there exist a few wavelets such as WCHP 20/34 and 20/35 that give acceptable PSNR values. PSNR values are known to be mathematically convenient and hence generally used for judging image quality. However they are not well matched to perceived visual quality. Hence, an index known as mean structural similarity (MSSIM) [38][40] is used for comparing the original image with the reconstructed image. The similarity measure is given by S (x , y ) = f (l (x , y ), c(x , y ), s (x , y )) where l (x , y ) = luminance comparison function c(x , y ) = contrast comparison function s (x , y ) = structure comparison function.

It can be noted that the MSSIM values (Table V(b)) are in accordance with the respective PSNR values. However a few exceptions do exist such as SI6 and SI7 for bpp = 0.25 where higher MSSIM value is obtained for the former but a higher PSNR value is obtained for the later. Fig. 5 shows the performance comparison of WCHP for different compression methods (SPIHT, EZW, and ASWDR). It can be seen that the performance of WCHP 16/22 is the best when SPIHT encoding scheme is used. Although comparable performances are obtained using binary wavelets [11] a marginal gain is still provided by WCHP. Additionally it may be noted that SPIHT encoding gives better results as compared to EZW and ASWDR. The designed wavelets are also tested over a ngerprint dataset. For ngerprint feature extraction two wavelet based algorithms are considered. A. Fingerprint Feature Extraction Algorithm I [41] The algorithm is based on the 2-D wavelet decomposition of J levels on a ngerprint image. The transformation results 2 3 in 3 J + 1 subbands viz. {a J , [d 1 j , d j , d j ] j =1,..., J } where a J is a low resolution approximation of the original image and dk j are the wavelet subands at different scales and orientations. A feature vector of length 3 J is formed by ordered normalized L 2-norms of the wavelet subbands d k j given by k 2 , e3 ] t h subband {[e1 , e } where e is the L 2-norn of k j = 1 ,..., J j j j j t h at the j level. The similarity between two feature vectors is measured based on the intersection operator proposed by Swain and Ballard [42]. For our simulations we have taken J = 3 resulting in a feature vector of length nine for each of the ngerprint image. B. Fingerprint Feature Extraction Algorithm II [43] The ngerprint image undergoes single level wavelet decomposition. Each of the four sub-bands (LL, LH, HL, and HH) undergoes further decomposition. The original image is then represented by 64 sub-images (features) [a , d1, d2 , . . . , d63 ] where a is the zero-th sub-image of the 64 sub-images, which is a low resolution approximation of

1854

IEEE TRANSACTIONS ON IMAGE PROCESSING, VOL. 22, NO. 5, MAY 2013

TABLE V ( A ) PSNR VALUES FOR WCHP AND B INARY WAVELETS ( B ) MSSIM VALUES FOR WCHP AND B INARY WAVELETS

SI1: Lena SI2: Woman (Barbara) SI3: Woman (Portrait) SI4: Caf SI5: Bike SI6: Tableware SI7: Three musicians WCHP1 : Filter considering 2 factor during quantization WCHP2 : Filter without considering 2 factor during quantization

the original image and d j , j = 1, 2, . . . , 63 are the wavelet sub-images, containing the image details at different scales and orientations. The performance evaluation of WCHP is done on standard databases (National Institute of Standards and Technology NIST [44] and Biometric Systems Lab, University of Bologna [45]) of the ngerprint research community. All the images in the databases are gray scale using 8 bits per pixel. The NIST database includes 2000 ngerprint images from 1000 different persons

whereas the Bologna dataset contains 168 images from 21 individuals. Each image is applied with some preprocessing technique for noise removal and quality enhancement. For comparison [9] a False Acceptance Rate (FAR) and a False Rejection Rate (FRR) test is performed. The FAR and FRR are dened as follows: FAR = Number of accepted imposter claims 100% Total number of imposter accesses (7)

NAIK AND HOLAMBE: DESIGN OF LOW-COMPLEXITY HIGH-PERFORMANCE WAVELET FILTERS

1855

TABLE VI EER P ERFORMANCE FOR WCHP AND B INARY WAVELETS

Fig. 6. ROC for comparison between WCHP and binary wavelets using Algorithm II.

FRR =

Number of rejected genuine claims 100%. Total number of genuine accesses

(8)

Finally the Equal Error Rate (EER) can be calculated as E E R = ( F A R + F R R )/2. For the FAR test the rst impression of each nger is matched against the rst impression of all other ngers whereas for FRR test, each impression of each nger is matched against all other impressions of the same nger. Table VI gives the EER values for the designed wavelets. It can be seen that the performance of orthogonal wavelets is usually better as compared to the bi-orthogonal construction. However it can be noted that the best performance can be obtained for the WCHP 16/i category for i = 22 (WCHP 16/22). In general the WCHP 16/i wavelets perform better than WCHP 20/i . However, few exceptions do exist for the orthogonal case (WCHP 20/4). The spline wavelets (WCHP 16/47 and 20/35) perform well only when the length of the reconstruction low pass lter is smaller. For feature extraction applications it can be seen that there do exist certain wavelets (WCHP 16/22 and 20/32) that give excellent EER performances for both the wavelet based feature extraction algorithms. Moreover it can be noted that certain bi-orthogonal wavelets (WCHP 16/22, 16/32, and 20/35) perform satisfactorily for compression as well as feature extraction. The performance of the designed wavelets is also compared with the existing binary [11], [21], [34] wavelets. Fig. 6 gives the region operating characteristics (ROC) of WCHP and binary wavelets as proposed by Cheng [11] and Arias [34]. ROC is usually plotted as False Positive Rate (FPR) versus True Positive Rate (TPR). FPR and TPR values are calculated based on FAR and FRR values obtained from (7) and (8) respectively. It can be observed that WCHP 16/22 outperforms binary 9/7 wavelets [34] when feature extraction Algorithm II is used. Also the performance of WCHP 16/22 is comparable with that of binary wavelets proposed in [11]. In order to validate the results obtained using a dataset of 2000 ngerprint images, similar plots are also shown for varying database sizes (1800 and 2200). It can be observed (Fig. 7) that there is negligible deviation in the ROC curves.

EER 1: Equal Error Rate obtained using ngerprint feature algorithm I EER 2: Equal Error Rate obtained using ngerprint feature algorithm II

Fig. 7.

ROC obtained for WCHP 16/22 and binary wavelets for different.

We also compare the performance of DWT based feature extraction methods with other methods based on Fourier transform [46] and Gabor lters [47]. It can be observed (Fig. 8) that the DWT based methods give superior performances as compared to non DWT based methods. We also investigate the performance (Fig. 9) of WCHP at different decomposition levels. The MSSIM values represent the quality of reconstructed ngerprint images when SPIHT algorithm is used. It is worth noting that at higher decomposition levels the performance of the wavelets is somewhat similar. However at lower decomposition levels the performance of wavelets with total length (length of decomposition and reconstruction lowpass lters) equal to 20 is better as compared to other wavelets.

1856

IEEE TRANSACTIONS ON IMAGE PROCESSING, VOL. 22, NO. 5, MAY 2013

Fig. 8. ROC for performance comparison between wavelet based methods and other methods. The important region is indicated by the dotted ellipse, and its corresponding magnied version is shown in the dotted rectangle.

Fig. 10. PSNR versus bit rate for JPEG 2000, WCHP, and adaptive wavelets for standard Lena image.

Fig. 11. MSSIM versus bit rate for JPEG 2000, WCHP, and adaptive wavelets for standard Lena image. Fig. 9. MSSIM versus decomposition levels for WCHP and binary wavelets. The important region is indicated by the dotted ellipse, and its corresponding magnied version is shown in the dotted rectangle. TABLE VII P ERCENTAGE R EDUCTION IN C OMPUTATIONAL C OMPLEXITY FOR WCHP 16/i , WCHP 20/ i AND A DAPTIVE WAVELETS AS C OMPARED TO CDF 9/7

Finally it can be concluded that certain wavelets such as WCHP 16/22 and 20/35 give satisfactory performances for both image compression and feature extraction. Consequently they can be used for diverse image processing applications. IX. C OMPARISON W ITH E XISTING S TANDARDS AND S TATE - OF - THE -A RT R ESULTS The performance of the designed wavelets is compared with state of art encoder viz. JPEG 2000 and adaptive wavelet transforms [4][6]. For comparisons the most commonly employed measure viz. PSNR is used (Fig. 10). Also MSSIM values (Fig. 11) are also considered since they are more suitable for judging perceived visual quality. For objective performance evaluation, we replace the wavelet transform module of JPEG 2000 [48] by the other transforms and use the same bit-plane coding (quantization module) and EBCOT technique (entropy coding module) as in JPEG 2000. The same post compression rate distortion (PCRD) strategy of EBCOT (optimal rate control strategy) as recommended in JPEG2000 is used. This ensures a best code stream for a given target bit-rate. It can be seen that the designed wavelets give nearly same performance as that

One of the vital parameters for practical application of any lters is the hardware complexity. Existing literature focuses on multiplierless design for lter implementation. As seen from Table VII, for a particular length of analysis and synthesis = 7) implementation of lowpass lters (e.g. h = 9 and WCHP requires much lesser hardware as compared to the existing binary wavelets.

NAIK AND HOLAMBE: DESIGN OF LOW-COMPLEXITY HIGH-PERFORMANCE WAVELET FILTERS

1857

of JPEG 2000. However, it may be noted that in WCHP computational complexity (Table VII) is reduced signicantly. In general for standard test images, the increase in coding gain offered by adaptive wavelets lies between 1% and 4% (0.71 dB for Lena, 1.03 dB for Bike and 0.49 dB for Caf using Weighted Adaptive Lifting scheme [4]). Although the performance of adaptive wavelets [4][6] (ADL, WAL, and DA-DWT) is better as compared to proposed wavelets it may be argued that the implementation of these adaptive schemes involve much higher computational costs. For DADWT with N direction candidates, the prediction step, along with the computation of the sum of absolute values, needs to be performed N times. Hence in general the DA (Directional Adaptive)-DWT requires about 5 to 6 times more computation than the conventional 2-D DWT. Similarly ADL (Adaptive Directional Lifting) based image encoder has considerably higher complexity since it has to compute the image dependent segmentation tree, and then search for the optimal prediction direction in each terminal node. The complexity of WAL (Weighted Adaptive Lifting) based transform is comparable with that of ADL-based image encoder since both ADL and WAL go through the direction estimation process to obtain the direction information. In addition, the sub-pixel interpolation process is required in both ADL and WAL, which further increases the computational complexity. The Sinc 8-tap interpolation lter adopted by ADL scheme is slightly more complex as compared to 6-tap directional interpolation lter used in WAL. Hence the xed computations involved in WAL are less as compared to the ADL scheme. A brief comparison of computational costs involved in the aforementioned schemes is presented in Table VII. For comparisons the CDF 9/7 wavelet is taken as a reference and the percentage of reduction in add and shift operations are presented for different (WCHP, binary and adaptive) wavelets. It can be seen that the adaptive wavelets require much higher computations (negative percentage of reduction) as compared to standard CDF 9/7 wavelets. In contrast to this, WCHP offers a signicant computational advantage over other the other wavelet types (binary and adaptive wavelets). Thus it can be inferred that WCHP gives acceptable visual quality at much reduced computational costs. Subsequently they can be used in applications that require lower computations and lesser hardware. X. C ONCLUSION In this paper design of wavelets based on halfband polynomial is discussed. These wavelets give acceptable PSNR values and are signicantly less complex as compared to the existing wavelets. Furthermore simulation results depict that the designed wavelets can be used for ngerprint feature extraction. Thus using WCHP it is possible to design lowcomplexity systems for image analysis. ACKNOWLEDGMENT The authors would like to thank the associate editor and anonymous reviewers for valuable comments and helpful suggestions.

R EFERENCES
[1] G. Strang and T. Nguyen, Wavelets and Filter Banks. Cambridge, MA: Wellesley-Cambridge, 1996. [2] P. P. Vaidyanathan, Multirate Systems and Filter Banks. Englewood Cliffs, NJ: Prentice-Hall, 1993. [3] A. Skodras, C. Christopoulos, and T. Ebrahimi, The JPEG 2000 still image compression standard, IEEE Signal Process. Mag., vol. 18, no. 5, pp. 3658, Sep. 2001. [4] Y. Liu and K. N. Ngan, Weighted adaptive lifting-based wavelet transform for image coding, IEEE Trans. Image Process., vol. 17, no. 4, pp. 500511, Apr. 2008. [5] W. Ding, F. Wu, X. Wu, S. Li, and H. Li, Adaptive directional liftingbased wavelet transform for image coding, IEEE Trans. Image Process., vol. 16, no. 2, pp. 416427, Feb. 2007. [6] C. L. Chang and B. Girod, Direction-adaptive discrete wavelet transform for image compression, IEEE Trans. Image Process., vol. 16, no. 5, pp. 12891302, May 2007. [7] N. Ahmed, T. Natarajan, and K. R. Rao, Discrete cosine transform, IEEE Trans. Comput., vol. 23, no. 1, pp. 9093, Jan. 1974. [8] Z. Weina, H. Jun, Z. Xiaoyang, and Y. Weiwei, Fingerprint verication based on wavelet and edge detection, in Proc. 9th Int. Conf. Electron. Meas. Instrum., Aug. 2009, pp. 10011004. [9] A. T. B. Jin, D. N. C. Ling, and T. S. Ong, An efcient ngerprint verication system using integrated wavelet and Fourier-Mellin invariant transform, J. Image Vis. Comput., vol. 22, no. 6, pp. 503513, 2004. [10] D. Maltoni, D. Maio, A. K. Jain, and S. Prabhakar, Handbook of Fingerprint Recognition, 2nd ed. New York: Springer-Verlag, 2009. [11] L. Cheng, D. L. Liang, and Z. H. Zhang, Popular biorthogonal wavelet lters via a lifting scheme and its application in image compression, IEE Proc.-Visual Image Signal Process., vol. 150, no. 4, pp. 227232, Aug. 2003. [12] H. Yoo and J. Jeong, Signal-dependent wavelet transform and application to lossless image compression, Electron. Lett., vol. 38, no. 4, pp. 170172, Feb. 2002. [13] I. Daubechies, The wavelet transform, time-frequency localization and signal analysis, IEEE Trans. Inf. Theory, vol. 36, no. 5, pp. 9611005, Sep. 1990. [14] J. D. Villasenor, B. Belzer, and J. Liao, Wavelet lter evaluation for image compression, IEEE Trans. Image Processing, vol. 4, no. 8, pp. 10531060, Aug. 1995. [15] O. Ekiz and A. G. Constantinides, Phase linearity in polyphase lters, in Proc. Int. Conf. Acoust., Speech Signal Process., vol. 1. Istanbul, Turkey, Jun. 2000, pp. 321323. [16] I. Daubechies, Orthonormal bases of compactly supported wavelets, Commun. Pure Appl. Math. vol. 41, no. 7, pp. 909996, 1988. [17] I. Daubechies, Ten Lectures on Wavelets. Philadelphia, PA: SIAM, 1992. [18] C. I. Daubechies and J. C. Feauveau, Biorthogonal bases of compactly supported wavelets, Commun. Pure Appl. Math., vol. 45, no. 5, pp. 485-560, 1992. [19] S. Godavarthy, Generating spline wavelets, in Proc. 36th Annu. Southeast Regional Conf., Apr. 1998, pp. 814. [20] W. Sweldens, The lifting scheme: A custom-design construction of biorthogonal wavelets, Dept. Math., Univ. South Carolina, Columbia, Tech. Rep. 7, 1994. [21] G. Yang and S. Guo, A new wavelet lifting scheme for image compression applications, in Proc. Int. Workshop Intell. Comput. Pattern Anal./Synth., Aug. 2006, pp. 465474. [22] Z. Guangjun, C. Lizhi, and C. Huowang, A simple 9/7-tap wavelet lter based on lifting scheme, in Proc. Int. Conf. Image Process. vol. 2. Thessaloniki, Greece, Oct. 2001, pp. 249252. [23] D. Quan and Y. S. Ho, Image quality optimization based on wavelet lter design and wavelet decomposition in JPEG 2000, in Proc. Int. Workshop Adv. Image Technol., Jan. 2009, pp. 16. [24] B. D. Patil, P. G. Patwardhan, and V. M. Gadre, On the design of FIR wavelet lter banks using factorization of a halfband polynomial, IEEE Signal Process. Lett., vol. 15, pp. 485488, May 2008, DOI:10.1109/LSP.2008.922295 [25] Image Databases. (2008) [Online]. Available: http://www.imageprocessingplace.com/ [26] A. D. Rahulkar and R. S. Holambe, Half-iris feature extraction and recognition using a new class of biorthogonal triplet half-band lter bank and exible k-out-of-n: A postclassier, IEEE Trans. Inf. Forensics Security, vol. 7, no. 1, pp. 230240, Feb. 2012 [27] O. Rioul and M. Vetterli, Wavelets and Signal Processing, IEEE Signal Process. Mag., vol. 8, no. 4, pp. 1438, Oct. 1991.

1858

IEEE TRANSACTIONS ON IMAGE PROCESSING, VOL. 22, NO. 5, MAY 2013

[28] Y. A. Reznik, A. T. Hinds, C. Zhang, L. Yu, and Z. Ni, Efcient xed-point approximations of 88 inverse discrete cosine transform, in Proc. SPIE Appl. Dig. Image Process. XXX. vol. 6696, Aug. 2007, DOI: 10.1117/12.740228. [29] H. Kiya, M. Yae, and M. Iwahashi, A linear phase two channel lter bank allowing perfect reconstruction, in Proc. IEEE Int. Symp. Circuits Syst., San Diego, CA, May 1992, pp 951954. [30] M. Martina and G. Masera, Low-complexity efcient 9/7 wavelet lters VLSI implementation, IEEE Trans. Circuits Syst., vol. 53, no. 11, pp. 12891293, Nov. 2006. [31] A. Said and W. A. Pearlman, A new, fast, and efcient image codec based on set partitioning in hierarchical trees, IEEE Trans. Circuits Syst. Video Tech., vol. 6, no. 3, pp. 243250, Jun. 1996. [32] J. M. Shapiro, Embedded image coding using zerotrees of wavelet coefcients, IEEE Trans. Signal Process., vol. 41, no. 12, pp. 34453462. Dec. 1993. [33] J. S. Walker and T. Q. Nguyen, Adaptive scanning methods for wavelet difference reduction in lossy image compression, in Proc. IEEE Int. Conf. Image Process., Sep. 2000, pp. 182185. [34] G. Strang, Lecture Notes in Control and Information Sciences, New York: Springer-Verlag, pp. 143153, 1996. [35] D. Salomon, Data Compression: The Complete Reference, 4th ed. New York: Springer-Verlag, 2007. [36] Standard Images. (2010) [Online]. Available: http://www.hlevkin.com/ [37] Graphic TechnologyPrepress Digital Data ExchangePart 1: CMYK Standard Colour Image Data (CMYK/SCID), ISO 12640-1, 2005. [38] Z. Wang, A. C. Borik, H. R. Sheikh, and E. P. Simoncelli, Image quality assessment: From error visibility to structural similarity, IEEE Trans. Image Process., vol. 13, no. 4, pp. 600612, Apr. 2004. [39] A. M. Eskicioglu and P. S. Fisher, Image quality measures and their performance, IEEE Trans. Commun., vol. 43, no. 12, pp. 29592965, Dec. 1995. [40] A. Hor and Z. Ziou, Image quality metrics: PSNR vs. SSIM, in Proc. 20th Int. Conf. Pattern Recognit., Aug. 2010, pp. 23662369. [41] M. Tico, E. Immonen, P. Ramo, P. Kuosmanen, and J. Saarinen, Fingerprint recognition using wavelet features, in Proc. IEEE Int. Symp.Circuits Syst., May 2001, pp. 2124. [42] M. J. Swain and D. H. Ballard, Color indexing, Int. J. Comput. Vis., vol. 7, no. 1, pp. 1132, 1991. [43] L. Shen and A. Kot, A new wavelet domain feature for ngerprint recognition, Biomed. Soft Comput. Human Sci., vol. 14, no. 1, pp. 5559, 2009. [44] National Institute of Standards and Technology, Gaithersburg, MD [Online]. Available: http://www.nist.gov/srd/nistsd4.cfm

[45] Fingerprint Database. (2000). Biometric Systems Lab, Univ. Bologna, Cesena, Italy [Online]. Available: http:// biolab.csr.unibo.it/ databasesoftware.asp [46] R. Zewail, A. Seif, M. Saeb, and N. Hamdy, Fingerprint recognition based on spectral feature extraction, in Proc. IEEE 46th Midwest Symp. Circuits. Syst., vol. 1. Dec. 2003, pp. 328332. [47] C. J. Lee and S. D. Wang, Fingerprint feature extraction using gabor lters, IEE Electron. Lett., vol. 35, no. 4, pp. 288290, Feb. 1999. [48] JPEG 2000 Image Coding System: Reference Software. (2009) [Online]. Available: http://www.jpeg.org

Ameya K. Naik received the B.E. degree in electronics from Shah and Anchor Kutchhi Engineering College, University of Mumbai, Mumbai, India, and the M.E. degree from the Vivekanand Education Societys Institute of Technology, University of Mumbai, in 2002 and 2004, respectively. He is currently a Research Scholar with the Shri Guru Gobind Singhji Institute Institute of Engineering and Technology, Swami Ramanand Teerth Marathwada University, Nanded, India, and an Assistant Professor with the K. J. Somaiya College of Engineering, Mumbai. His current research interests include image processing, biometrics, and applications of wavelet transform.

Raghunath S. Holambe received the B.E. and M.E. degrees in instrumentation from the Shri Guru Gobind Singhji (SGGS) Institute of Engineering and Technology, Vishnupuri, Nanded, India, in 1985 and 1990, respectively, and the Ph.D. degree from the Indian Institute of Engineering and Technology, Kharagpur, India, in 1997. He was a Consultant with Siemens Information Systems Ltd., Bangalore, India, for two years. He is currently a Professor with the Department of Instrumentation Engineering, the SGGS Institute of Engineering and Technology. His current research interests include digital signal processing, image processing, lter banks, applications of wavelet transform, biometrics, and real-time processing of signals using digital signal processors.