# Lower Order Krawtchouk Moment-Based Feature-Set for Hand Gesture Recognition

Authors: Bineet Kaur; Garima Joshi
Journal: Advances in Human-Computer Interaction
 (2016)

---

## Abstract

The capability of lower order Krawtchouk moment-based shape features has been analyzed. The behaviour of 1D and 2D Krawtchouk polynomials at lower orders is observed by varying Region of Interest (ROI). The paper measures the effectiveness of shape recognition capability of 2D Krawtchouk features at lower orders on the basis of Jochen-Triesch’s database and hand gesture database of 10 Indian Sign Language (ISL) alphabets. Comparison of original and reduced feature-set is also done. Experimental results demonstrate that the reduced feature dimensionality gives competent accuracy as compared to the original feature-set for all the proposed classifiers. Thus, the Krawtchouk moment-based features prove to be effective in terms of shape recognition capability at lower orders.


---

## Body

## 1. Introduction

Gesture recognition system identifies gestures using shape features. These systems are applied in video-surveillance, 3D animation, sign language interpretation, and Human Computer Interaction (HCI) systems. Sign language is a nonverbal way of communication among the deaf through hand gestures. In sign language, different signs are created by the combination of hand movements and facial expressions. Sign language has its own grammar and syntax which is different than the grammar used in spoken or written language. Every country has its own sign language with its own phonetics. Some of the sign languages are American Sign Language (ASL), British Sign Language (BSL), Japanese Sign Language (JSL), Korean Sign Language (KSL), and so on. Indian Sign Language (ISL) has a well-structured phonology, morphology, syntax, and grammar. ISL provides information through movements of hands, arms, face, and head. It can produce an isolated sign (single hand gesture) and continuous sign (movement of hands in series). The aim is to create an application which understands ISL alphabets by interpreting gestures of hands which can then be produced in the textual form on the computer screen. This will make interaction with the deaf people easy without the need for an interpreter, thereby developing Human Computer Interaction (HCI) system in terms of ISL. The block diagram of ISL recognition system is illustrated in Figure1.Figure 1
Block diagram of ISL recognition system.For a gesture recognition system to be effective, features play an important role in extracting information about the image. Therefore, moments are widely used shape descriptors because they are capable of extracting local as well as global information. These have been used in various applications like pattern recognition [1], face recognition [2, 3], image watermarking [4], medical image analysis [5], and gesture recognition [6, 7]. Hu proposed moments for the first time [8]. These were seven moments, which were invariant to scale, rotation, and translation. Since then, a lot of research has been done on its applicability in various domains. After this, Teague introduced continuous orthogonal moments, Zernike and Legendre [9]. Being orthogonal in nature, they had minimum information redundancy. So, image reconstruction was easier as compared to Hu moments which were nonorthogonal in nature. However, these moments require image coordinate space transformation. Moreover, the numerical approximation of continuous moment integrals results in discretization error, thus reducing the recognition accuracy. However, Khotanzad and Hong used Zernike moments for pattern recognition because of its rotational invariance property [10]. To rectify the problems encountered in continuous orthogonal moments, discrete orthogonal moments like Tchebichef and Krawtchouk were proposed.Yap et al. analyzed Krawtchouk moments for the first time on 2D images [11]. One benefit of Krawtchouk moments is that they are defined in image coordinate space and hence do not have a discretization error. Another benefit is that they not only extract global information like Zernike moments but also have the ability to represent local information from any Region of Interest (ROI) in an image. Wang et al. compared Krawtchouk (till 4th order, with ROI at centre), Legendre, and Zernike moments for handwritten Chinese character recognition [12]. It was concluded that Krawtchouk moments outperformed other moments in terms of recognition accuracy. Moreover, Krawtchouk moments proved to be best feature descriptors in face recognition systems also. Noraini analyzed the performance of Krawtchouk and Tchebichef moments on a database of facial expressions [2]. It was studied that Krawtchouk moments gave better accuracy. In the context of hand gestures, Priyal and Bora evaluated the performance of Krawtchouk moments (till 80th order, with ROI at centre) on single handed 10 gesture signs of digits “0” to “9,” taken from 23 users, with 423 samples for each gesture [7]. The gestures were taken at different angles, scales, and orientations. It was concluded that Krawtchouk moments were user-invariant as compared to Geometric and Zernike moments. The paper focuses on following objectives:(1)
A Krawtchouk moment-based feature-set till 3rd order is extracted. To include local shape characteristics, the feature vector is increased by varying the ROI.
(2)
The performance of proposed features is analysed for different classifiers.
(3)
The recognition accuracy of original feature-set is compared with the reduced feature-set. An optimal feature-set and classifier combination that gives good recognition accuracy is proposed.
(4)
For comparative analysis the performance of proposed feature vector is also analysed on standard Jochen-Triesch’s database.The paper is organized as follows: Section2 gives the introduction of classical Krawtchouk polynomials, Krawtchouk invariant moments for feature extraction, and spatial behaviour of 1D and 2D Krawtchouk polynomials. Section 3 presents the detail of proposed methodology. The details about the database, feature extraction technique, feature selection algorithm, and classifiers used in this work are detailed in this section. Section 4 discusses the results and comparison of results for original as well as reduced feature-set. Section 5 gives conclusion and scope of future work.


## 2. Krawtchouk Moment-Based Features

Krawtchouk moments are derived from Krawtchouk polynomials. These are discrete in nature and are associated with binomial functions [13]. This section gives an introduction to the classical Krawtchouk polynomials and weighted Krawtchouk polynomials. The spatial behaviour of 1D and 2D Krawtchouk polynomials with varying ROI is also presented.


### 2.1. Krawtchouk Polynomials

The 1D weighted Krawtchouk polynomials ofrth order are defined as [11](1)
K
-
r
i
;
p
,
X
=
K
r
i
;
p
,
X
w
i
;
p
,
X
ρ
r
;
p
,
X
.The parameter “p” can be used to vary the position of peak. In 1D it can be varied from 0 to 1. In the classical Krawtchouk polynomials increasing the order results in numerical fluctuations. So, weighted Krawtchouk polynomials are used to achieve numerical stability. The Krawtchouk polynomials are defined as (2)
K
r
i
;
p
,
X
=
∑
k
=
0
∞
-
r
k
-
i
k
1
/
p
k
-
X
k
k
!
,where m
k is the pochhammer symbol which is given by(3)
m
k
=
m
m
+
1
⋯
m
+
k
-
1
=
Г
m
+
k
Г
m
.The weight functions used in (1) are given by(4)
w
i
;
p
,
X
=
X
i
p
i
1
-
p
X
-
i
,
ρ
r
;
p
,
X
=
-
1
r
1
-
p
p
r
r
!
-
X
r
.In weighted Krawtchouk polynomials, as the order increases, the numbers of zero crossings also increase. Figure 2 shows the 1D weighted Krawtchouk polynomials plot at 0th, 1st, 2nd, and 3rd order. In these plots, ROI is varied by varying parameter p
=
0.3, 0.5, and 0.7, respectively. The parameter p deviates from 0.5 by Δ
p. For example, if p
=
0.5, the ROI lies at the centre of the image. For p
>
0.5, the ROI is shifted towards the positive x-direction and, with p
<
0.5, it is shifted to the negative x-direction. It can be observed that the value of weighted Krawtchouk polynomials lies within the range of (
-
1,1
).Figure 2
1D plot of weighted Krawtchouk polynomials, with varying ROI.


### 2.2. Krawtchouk Moment Invariants

For an image intensity functionf
(
i
,
j
), the 2D Krawtchouk moments of order (
r
+
q
) is(5)
Q
r
q
=
∑
i
=
0
X
-
1
∑
j
=
0
Y
-
1
K
-
r
i
;
p
1
,
X
-
1
K
-
q
j
;
p
2
,
Y
-
1
f
i
,
j
,where the size of f
(
i
,
j
) is (
X
,
Y
). In case of 2D Krawtchouk polynomial plots, parameters p
1 and p
2 shift the ROI horizontally and vertically, respectively. p
1
>
0.5 shifts ROI horizontally to the positive x-direction while p
1
<
0.5 shifts the ROI horizontally to the negative x-axis. Similarly, for p
2
>
0.5, shifting of ROI takes place vertically to the negative y-direction and, for p
2
<
0.5, the ROI shifts to the positive y-direction. Figure 3 shows the top view of 2D Krawtchouk moment plots at lower orders. Here, ROI is focused to the centre with p
1
=
p
2
=
0.5. The ROIs with different values of p
1 and p
2 are shown in Figure 4, covering different ROIs in an image which are used as features in this paper. The white colour shows positive peaks whereas black colour shows negative peaks. It shows that the Krawtchouk moments are very good local descriptors.Figure 3
2D Krawtchouk plots forX
=
Y
=
30, p
1
=
p
2
=
0.5.Figure 4
Different ROIs used for feature extraction.For an image, various lower orders of Krawtchouk moments can be calculated as shown in Figure3. Further, the ROIs are defined at different positions of the image, thus covering the entire image. The ROI is shifted horizontally and vertically by taking values of (p
1, p
2) as (0.5, 0.5), (0.3, 0.3), (0.4, 0.7), (0.6, 0.3), and (0.6, 0.7) as shown in Figure 4. At each ROI, till 3rd order 9 features are calculated. Thus, a total of 45 Krawtchouk moment-based local features are extracted to study the recognition accuracy of ISL alphabets.The shape-based local features invariant to rotation, scale, and translation are calculated from Krawtchouk moments. These invariant Krawtchouk moments are listed in the following:(6)
Q
~
00
=
Ω
00
v
~
00
,
Q
~
10
=
Ω
10
v
~
00
-
1
X
-
1
p
1
v
~
10
,
Q
~
01
=
Ω
01
v
~
00
-
1
Y
-
1
p
2
v
~
01
,
Q
~
11
=
Ω
11
v
~
00
-
1
X
-
1
p
1
v
~
10
-
1
Y
-
1
p
2
v
~
01
+
1
X
-
1
Y
-
1
p
1
p
2
v
~
11
,where (7)
Ω
r
q
=
ρ
r
;
p
1
,
X
-
1
ρ
q
;
p
2
,
Y
-
1
-
1
/
2
.The Krawtchouk moments can also be written in terms of geometric moments as follows:(8)
v
~
r
q
=
∑
i
=
0
X
-
1
∑
j
=
0
Y
-
1
X
×
Y
/
2
M
00
f
i
,
j
i
-
i
-
cos
⁡
θ
+
j
-
j
-
sin
⁡
θ
X
2
/
2
M
00
+
X
2
r
j
-
j
-
cos
⁡
θ
-
i
-
i
-
sin
⁡
θ
Y
2
/
2
M
00
+
Y
2
q
,where geometric moments of order (
r
+
q
) are given by(9)
M
r
q
=
∑
i
=
0
X
-
1
∑
j
=
0
Y
-
1
i
r
j
q
f
i
,
j
,
γ
=
r
+
q
2
+
1
,
i
-
=
M
10
M
00
,
j
-
=
M
01
M
00
,
θ
=
0.5
tan
-
1
⁡
2
µ
11
µ
20
-
µ
02
,where θ is in the range of -
45
°
≤
θ
≤
45
°. To define it in the range of 0° to 360°, make modifications as done by Teague [9]. µ
r
q is central moment. The Krawtchouk moments thus obtained in (8) are invariant to rotation, scale, and translation:(10)
Q
~
r
q
=
ρ
r
ρ
q
-
0.5
∑
R
=
0
r
∑
Q
=
0
q
a
R
,
r
,
p
1
a
Q
,
q
,
p
2
v
~
R
Q
.


## 2.1. Krawtchouk Polynomials

The 1D weighted Krawtchouk polynomials ofrth order are defined as [11](1)
K
-
r
i
;
p
,
X
=
K
r
i
;
p
,
X
w
i
;
p
,
X
ρ
r
;
p
,
X
.The parameter “p” can be used to vary the position of peak. In 1D it can be varied from 0 to 1. In the classical Krawtchouk polynomials increasing the order results in numerical fluctuations. So, weighted Krawtchouk polynomials are used to achieve numerical stability. The Krawtchouk polynomials are defined as (2)
K
r
i
;
p
,
X
=
∑
k
=
0
∞
-
r
k
-
i
k
1
/
p
k
-
X
k
k
!
,where m
k is the pochhammer symbol which is given by(3)
m
k
=
m
m
+
1
⋯
m
+
k
-
1
=
Г
m
+
k
Г
m
.The weight functions used in (1) are given by(4)
w
i
;
p
,
X
=
X
i
p
i
1
-
p
X
-
i
,
ρ
r
;
p
,
X
=
-
1
r
1
-
p
p
r
r
!
-
X
r
.In weighted Krawtchouk polynomials, as the order increases, the numbers of zero crossings also increase. Figure 2 shows the 1D weighted Krawtchouk polynomials plot at 0th, 1st, 2nd, and 3rd order. In these plots, ROI is varied by varying parameter p
=
0.3, 0.5, and 0.7, respectively. The parameter p deviates from 0.5 by Δ
p. For example, if p
=
0.5, the ROI lies at the centre of the image. For p
>
0.5, the ROI is shifted towards the positive x-direction and, with p
<
0.5, it is shifted to the negative x-direction. It can be observed that the value of weighted Krawtchouk polynomials lies within the range of (
-
1,1
).Figure 2
1D plot of weighted Krawtchouk polynomials, with varying ROI.


## 2.2. Krawtchouk Moment Invariants

For an image intensity functionf
(
i
,
j
), the 2D Krawtchouk moments of order (
r
+
q
) is(5)
Q
r
q
=
∑
i
=
0
X
-
1
∑
j
=
0
Y
-
1
K
-
r
i
;
p
1
,
X
-
1
K
-
q
j
;
p
2
,
Y
-
1
f
i
,
j
,where the size of f
(
i
,
j
) is (
X
,
Y
). In case of 2D Krawtchouk polynomial plots, parameters p
1 and p
2 shift the ROI horizontally and vertically, respectively. p
1
>
0.5 shifts ROI horizontally to the positive x-direction while p
1
<
0.5 shifts the ROI horizontally to the negative x-axis. Similarly, for p
2
>
0.5, shifting of ROI takes place vertically to the negative y-direction and, for p
2
<
0.5, the ROI shifts to the positive y-direction. Figure 3 shows the top view of 2D Krawtchouk moment plots at lower orders. Here, ROI is focused to the centre with p
1
=
p
2
=
0.5. The ROIs with different values of p
1 and p
2 are shown in Figure 4, covering different ROIs in an image which are used as features in this paper. The white colour shows positive peaks whereas black colour shows negative peaks. It shows that the Krawtchouk moments are very good local descriptors.Figure 3
2D Krawtchouk plots forX
=
Y
=
30, p
1
=
p
2
=
0.5.Figure 4
Different ROIs used for feature extraction.For an image, various lower orders of Krawtchouk moments can be calculated as shown in Figure3. Further, the ROIs are defined at different positions of the image, thus covering the entire image. The ROI is shifted horizontally and vertically by taking values of (p
1, p
2) as (0.5, 0.5), (0.3, 0.3), (0.4, 0.7), (0.6, 0.3), and (0.6, 0.7) as shown in Figure 4. At each ROI, till 3rd order 9 features are calculated. Thus, a total of 45 Krawtchouk moment-based local features are extracted to study the recognition accuracy of ISL alphabets.The shape-based local features invariant to rotation, scale, and translation are calculated from Krawtchouk moments. These invariant Krawtchouk moments are listed in the following:(6)
Q
~
00
=
Ω
00
v
~
00
,
Q
~
10
=
Ω
10
v
~
00
-
1
X
-
1
p
1
v
~
10
,
Q
~
01
=
Ω
01
v
~
00
-
1
Y
-
1
p
2
v
~
01
,
Q
~
11
=
Ω
11
v
~
00
-
1
X
-
1
p
1
v
~
10
-
1
Y
-
1
p
2
v
~
01
+
1
X
-
1
Y
-
1
p
1
p
2
v
~
11
,where (7)
Ω
r
q
=
ρ
r
;
p
1
,
X
-
1
ρ
q
;
p
2
,
Y
-
1
-
1
/
2
.The Krawtchouk moments can also be written in terms of geometric moments as follows:(8)
v
~
r
q
=
∑
i
=
0
X
-
1
∑
j
=
0
Y
-
1
X
×
Y
/
2
M
00
f
i
,
j
i
-
i
-
cos
⁡
θ
+
j
-
j
-
sin
⁡
θ
X
2
/
2
M
00
+
X
2
r
j
-
j
-
cos
⁡
θ
-
i
-
i
-
sin
⁡
θ
Y
2
/
2
M
00
+
Y
2
q
,where geometric moments of order (
r
+
q
) are given by(9)
M
r
q
=
∑
i
=
0
X
-
1
∑
j
=
0
Y
-
1
i
r
j
q
f
i
,
j
,
γ
=
r
+
q
2
+
1
,
i
-
=
M
10
M
00
,
j
-
=
M
01
M
00
,
θ
=
0.5
tan
-
1
⁡
2
µ
11
µ
20
-
µ
02
,where θ is in the range of -
45
°
≤
θ
≤
45
°. To define it in the range of 0° to 360°, make modifications as done by Teague [9]. µ
r
q is central moment. The Krawtchouk moments thus obtained in (8) are invariant to rotation, scale, and translation:(10)
Q
~
r
q
=
ρ
r
ρ
q
-
0.5
∑
R
=
0
r
∑
Q
=
0
q
a
R
,
r
,
p
1
a
Q
,
q
,
p
2
v
~
R
Q
.


## 3. Proposed Methodology

### 3.1. ISL Database

The database consists of 10 hand gestures of ISL alphabets “A,” “B,” “F,” “I,” “K,” “M,” “P,” “Q,” “U,” and “W.” Each gesture is collected from 72 subjects. A total of 720 gesture images are constructed from different signers as shown in Figure5. A total of 720 gesture images are constructed from different signers. The signs are selected such that they have identical shapes like, “A,” “B,” “P,” “Q,” “U,” and “W,” high occlusion as in “M” and “W,” and one gesture being subgesture of the other as in “I” and “K.” In most of signs both hands are used, which leads to complexity. The images have a resolution of 640 × 480 pixels, taken on a uniform (black) background, with varying illumination, at a fixed distance from the camera. These go through preprocessing stage, where each image is converted from RGB to binary form. Edge detectors are used and each image is resized to form 30 × 30 binary images, while preserving their edges and shape.Figure 5
Database of 10 ISL alphabets.


### 3.2. Jochen-Triesch’s Database

The database consists of 10 static hand postures collected from 24 subjects in uniform dark, uniform light, and complex background [14].


### 3.3. Feature Extraction

In this work, the moments till 3rd order are selected. This can be viewed in Figure6, where the reconstruction results show that they cover the entire image giving local shape features. Thus, the lower order Krawtchouk moments of 3rd order are more suitable for classification [15]. On the other hand, the higher order moments result in more computational complexity with the increase in the number of Krawtchouk coefficients.Figure 6
Reconstruction of original image using Krawtchouk moments with ROI at centre.The Krawtchouk features up to 3rd order are extracted by varying values ofp
1 and p
2. Lower orders have the ability to characterize shape details, thus providing local information from a specific ROI. The features calculated for various ROIs are shown in Figure 7. The 9-dimensional feature-set extracted for each ROI includes(11)
Q
~
r
q
=
Q
~
01
,
Q
~
10
,
Q
~
11
,
Q
~
02
,
Q
~
20
,
Q
~
12
,
Q
~
21
,
Q
~
03
,
Q
~
30
.As shown in Figure 7, for 5 values of (p
1, p
2), a total of 45 Krawtchouk moment-based local features are calculated for image.Figure 7
Reconstruction of original image using Krawtchouk moments with varying ROIs.


### 3.4. Feature Selection

Feature selection is useful in removing irrelevant and redundant features. In this paper, correlation-based feature selection (CFS) algorithm is used. CFS is considered as the most stable feature selection algorithm which selects feature subsets that are highly correlated with the class, but uncorrelated with each other [16, 17]. CFS uses Pearson correlation coefficient which is calculated as follows [18]:(12)
M
s
=
k
r
-
c
f
k
+
k
k
-
1
r
-
f
f
,where M
s is the merit of the current subset of features, k is the number of features, r
-
c
f is the mean of the correlations between each feature and the class, and r
-
f
f is the mean of the pairwise correlations between every two features. The numerator increases when the features can classify the data accurately and the denominator increases when there exists redundancy between the features. Larger M
s gives the best feature subset. The feature subset is chosen on the basis of highest M
s value. For this, greedy stepwise algorithm is used, where one feature is added at a time into an empty matrix at each stage. Each feature subset is ranked on the basis of M
s until a subset is selected on the basis of the best correlation coefficient value (M
s) [19].CFS has been used for large databases to reduce the problems of class imbalance, high dimensionality, and information redundancy [17, 20, 21]. For the proposed database in this paper, it reduces the feature-set from 45 to 22. A comparison of original and reduced feature-set is done in terms of recognition accuracy at various classifiers.


### 3.5. Classifiers

The performance ofk-Nearest Neighbour (k-NN) using Manhattan (MD), k-NN using Euclidean distance (ED) (with value of k
=
1, in both cases), Multilayer Perceptron (MLP), Support Vector Machine (SVM), and Extreme Learning Machines (ELM) is analyzed [22, 23]. A comparison of performance of these classifiers in terms of recognition accuracy with variation of feature-set dimensionality is studied. For SVM, the performance of PUK, RBF, and Poly kernel is deliberated. For ELM, linear, Poly, and RBF kernels are taken into consideration. SVM with PUK has the strongest mapping power and better generalization as compared to other kernel functions like polynomial, linear, and RBF [24]. They outperformed in terms of recognition accuracy as compared to other kernels and classifiers like k-NN, MLP, and SVM with polynomial and RBF kernels [17, 25]. ELM is used in various multiclass classification applications and gives similar or better generalizations at faster learning speed as compared to SVM which has high computational complexity [23]. In each case, the results for raw feature vector and feature vector after normalization are also compared.


## 3.1. ISL Database

The database consists of 10 hand gestures of ISL alphabets “A,” “B,” “F,” “I,” “K,” “M,” “P,” “Q,” “U,” and “W.” Each gesture is collected from 72 subjects. A total of 720 gesture images are constructed from different signers as shown in Figure5. A total of 720 gesture images are constructed from different signers. The signs are selected such that they have identical shapes like, “A,” “B,” “P,” “Q,” “U,” and “W,” high occlusion as in “M” and “W,” and one gesture being subgesture of the other as in “I” and “K.” In most of signs both hands are used, which leads to complexity. The images have a resolution of 640 × 480 pixels, taken on a uniform (black) background, with varying illumination, at a fixed distance from the camera. These go through preprocessing stage, where each image is converted from RGB to binary form. Edge detectors are used and each image is resized to form 30 × 30 binary images, while preserving their edges and shape.Figure 5
Database of 10 ISL alphabets.


## 3.2. Jochen-Triesch’s Database

The database consists of 10 static hand postures collected from 24 subjects in uniform dark, uniform light, and complex background [14].


## 3.3. Feature Extraction

In this work, the moments till 3rd order are selected. This can be viewed in Figure6, where the reconstruction results show that they cover the entire image giving local shape features. Thus, the lower order Krawtchouk moments of 3rd order are more suitable for classification [15]. On the other hand, the higher order moments result in more computational complexity with the increase in the number of Krawtchouk coefficients.Figure 6
Reconstruction of original image using Krawtchouk moments with ROI at centre.The Krawtchouk features up to 3rd order are extracted by varying values ofp
1 and p
2. Lower orders have the ability to characterize shape details, thus providing local information from a specific ROI. The features calculated for various ROIs are shown in Figure 7. The 9-dimensional feature-set extracted for each ROI includes(11)
Q
~
r
q
=
Q
~
01
,
Q
~
10
,
Q
~
11
,
Q
~
02
,
Q
~
20
,
Q
~
12
,
Q
~
21
,
Q
~
03
,
Q
~
30
.As shown in Figure 7, for 5 values of (p
1, p
2), a total of 45 Krawtchouk moment-based local features are calculated for image.Figure 7
Reconstruction of original image using Krawtchouk moments with varying ROIs.


## 3.4. Feature Selection

Feature selection is useful in removing irrelevant and redundant features. In this paper, correlation-based feature selection (CFS) algorithm is used. CFS is considered as the most stable feature selection algorithm which selects feature subsets that are highly correlated with the class, but uncorrelated with each other [16, 17]. CFS uses Pearson correlation coefficient which is calculated as follows [18]:(12)
M
s
=
k
r
-
c
f
k
+
k
k
-
1
r
-
f
f
,where M
s is the merit of the current subset of features, k is the number of features, r
-
c
f is the mean of the correlations between each feature and the class, and r
-
f
f is the mean of the pairwise correlations between every two features. The numerator increases when the features can classify the data accurately and the denominator increases when there exists redundancy between the features. Larger M
s gives the best feature subset. The feature subset is chosen on the basis of highest M
s value. For this, greedy stepwise algorithm is used, where one feature is added at a time into an empty matrix at each stage. Each feature subset is ranked on the basis of M
s until a subset is selected on the basis of the best correlation coefficient value (M
s) [19].CFS has been used for large databases to reduce the problems of class imbalance, high dimensionality, and information redundancy [17, 20, 21]. For the proposed database in this paper, it reduces the feature-set from 45 to 22. A comparison of original and reduced feature-set is done in terms of recognition accuracy at various classifiers.


## 3.5. Classifiers

The performance ofk-Nearest Neighbour (k-NN) using Manhattan (MD), k-NN using Euclidean distance (ED) (with value of k
=
1, in both cases), Multilayer Perceptron (MLP), Support Vector Machine (SVM), and Extreme Learning Machines (ELM) is analyzed [22, 23]. A comparison of performance of these classifiers in terms of recognition accuracy with variation of feature-set dimensionality is studied. For SVM, the performance of PUK, RBF, and Poly kernel is deliberated. For ELM, linear, Poly, and RBF kernels are taken into consideration. SVM with PUK has the strongest mapping power and better generalization as compared to other kernel functions like polynomial, linear, and RBF [24]. They outperformed in terms of recognition accuracy as compared to other kernels and classifiers like k-NN, MLP, and SVM with polynomial and RBF kernels [17, 25]. ELM is used in various multiclass classification applications and gives similar or better generalizations at faster learning speed as compared to SVM which has high computational complexity [23]. In each case, the results for raw feature vector and feature vector after normalization are also compared.


## 4. Results and Discussions

The accuracy is defined as total number of correctly recognized images to total number of test images:(13)
Accuracy
=
Total  number  of  correctly  recognized  images
Total  number  of  test  images
×
100
%
.To ensure the recognition ability of Krawtchouk moments, the comparison with Hu moments and Zernike moments is done. Table 1 shows the recognition accuracy for ISL alphabets for these three moments. For a small feature vector up to 3rd order, Krawtchouk moments show the best results for all the classifiers except for ELM. On normalization, the best accuracy of 85.9% is observed with Krawtchouk moments by SVM PUK, SVM polynomial, and k-NN using Manhattan distance. In case of Hu and Zernike moments, the best recognition accuracies are observed in SVM PUK and ELM polynomial kernel.Table 1
Comparison of recognition accuracies of Hu moments, Zernike moments, and Krawtchouk moment.
Feature set (up to 3rd order)
k-NN using ED  (k
=
1)
k-NN using MD (k
=
1)
SVM
MLP
ELM
Poly
RBF
PUK
Poly
RBF
Linear
Raw feature-set for ISL database
Hu moments (7 features)
66.9%
67.8%
67.9%
70%
71.1%
70.2%
70.2%
69.2%
70%
Zernike moments (6 features)
77.6%
74.3%
73.5%
76%
78%
75.1%
76.2%
76%
75.4%
Krawtchouk moments (9 features)
84.9%
85.3%
82.9%
83.5%
84.9%
84.5%
66.2%
65.4%
66.1%
Normalized feature-set for ISL database
Hu moments (7 features)
68%
68.3%
70.2%
70.4%
71.9%
70.1%
70.8%
70.2%
70.2%
Zernike moments (6 features)
78.2%
75.7%
79%
79.4%
79.6%
78%
79.7%
79%
78.4%
Krawtchouk moments (9 features)
85.5%
85.9%
85.9%
84.8%
85.9%
85.2%
70.7%
70.2%
70.1%In Tables2 and 3, a comparison of accuracies is carried out for increased feature vector of Krawtchouk moments for ISL database and the standard Jochen-Triesch’s dataset. With an increase in the feature-set at different ROIs, recognition accuracy improves gradually for different classifiers. A total of five ROIs are taken, from center, top-left, top-right, bottom-left, and bottom-right of an image. The aim is to find a combination of feature-set and a classifier that gives the best recognition accuracy.Table 2
Recognition accuracies at Jochen-Triesch images taken at different values ofp
1 and p
2.
Values ofp
1 and p
2
Total FV
k-NN using ED
k-NN using MD
SVM
ELM
MLP
Poly
RBF
PUK
Poly
RBF
Linear
Raw feature-set for Jochen-Triesch
p
1
=
0.5
p
2
=
0.5
9
60%
61.1%
58.4%
59.2%
62.2%
65.2%
62.3%
66.1%
63.3%
p
1
=
0.4
p
2
=
0.7
18
65.6%
66.6%
67%
69.3%
70.7%
73.3%
72.1%
79.6%
68.3%
p
1
=
0.3
p
2
=
0.3
27
67.9%
67.2%
76%
77.1%
79.1%
80.2%
79.9%
80.4%
78.4%
p
1
=
0.6
p
2
=
0.3
36
75.7%
78.9%
78.4%
79%
80.9%
82.7%
81.7%
82.4%
81.1%
p
1
=
0.6
p
2
=
0.7
45
80%
81.1%
82.2%
82.7%
82.9%
83.5%
82.9%
83%
82.5%
Normalized feature-set for Jochen-Triesch
p
1
=
0.5
p
2
=
0.5
9
60%
61.5%
58.5%
61.4%
63.7%
69.2%
66.6%
69.2%
65%
p
1
=
0.4
p
2
=
0.7
18
65.8%
66.9%
67.2%
72%
72%
75%
74%
74.2%
69%
p
1
=
0.3
p
2
=
0.3
27
67.9%
67.9%
76.7%
79.1%
80.6%
82.6%
81.2%
82.1%
79.6%
p
1
=
0.6
p
2
=
0.3
36
75.9%
78.9%
79%
80.3%
83.2%
83.9%
82.8%
83.3%
82.5%
p
1
=
0.6
p
2
=
0.7
45
80.1%
81.8%
83.9%
83.9%
84.5%
84.9%
84%
84.5%
83.5%Table 3
Recognition accuracies at different classifiers for ISL images taken at different values ofp
1 and p
2 with raw feature-set.
Values ofp
1 and p
2
Total F.V.
k-NN using ED
k-NN using MD
SVM
ELM
MLP
Poly
RBF
PUK
Poly
RBF
Linear
Raw feature-set for ISL database
p
1
=
0.5
p
2
=
0.5
9
84.9%
85.3%
82.9%
83.5%
84.9%
66.2%
65.4%
66.1%
84.5%
p
1
=
0.4
p
2
=
0.7
18
85%
86.1%
83%
84.3%
85.4%
76%
75.8%
76.4%
85.3%
p
1
=
0.3
p
2
=
0.3
27
86.1%
86.1%
84.1%
84.7%
86.4%
84.5%
82.7%
84.2%
86.9%
p
1
=
0.6
p
2
=
0.3
36
86.9%
86.3%
84.1%
86.6%
86.8%
85.3%
84.47%
84.9%
86.9%
p
1
=
0.6
p
2
=
0.7
45
86.9%
86.9%
86.1%
87.4%
87.9%
88.1%
87.7%
87.9%
87.3%
Normalized feature-set for ISL database
p
1
=
0.5
p
2
=
0.5
9
85.5%
85.9%
85.9%
84.8%
85.9%
70.7%
70.2%
70.1%
85.2%
p
1
=
0.4
p
2
=
0.7
18
86%
86.5%
87.4%
87.4%
87.5%
80%
79.2%
80.4%
85.8%
p
1
=
0.3
p
2
=
0.3
27
87.6%
88.1%
88.5%
87.3%
87.7%
86.2%
87.8%
85.9%
86%
p
1
=
0.6
p
2
=
0.3
36
88.2%
88.1%
88.6%
88.2%
88.9%
87.5%
87.9%
86.8%
86.3%
p
1
=
0.6
p
2
=
0.7
45
88.2%
88.2%
88.9%
89.2%
90%
89.3%
89.2%
88.9%
87.6%For the maximum feature vector size of 45, ELM with polynomial kernel gives the best recognition of 88.1% followed by SVM with PUK and ELM with linear kernel both giving 87.9%. ELM with RBF gives 87.7% accuracy. Some classifiers likek-NN using Euclidean and Manhattan distance show good recognition accuracy even with a smaller feature vector size. For other classifiers like SVM and MLP, a larger feature-set results in better accuracy.However, after normalizing the feature-set, improvement in accuracy is observed. Normalization maps the feature values into a specific range. In this paper, the normalized feature values lie within[
-
1,1
]. It helps in improving the recognition accuracy as it accelerates the training step [29, 30]. For normalized feature vector, SVM with PUK shows best recognition accuracy of 90%. It is followed by ELM with polynomial kernel giving 89.3%. SVM with RBF and ELM with RBF kernel both show 89.2%.On applying CFS technique, the feature-set reduces to 22 features. Table4 shows the recognition accuracies at different classifiers for selected feature-set. For some classifiers the performance of accuracy reduces slightly but for others the recognition accuracy improves. The best performance is shown by ELM with polynomial kernel giving 89.6%. Also, SVM with RBF, ELM with RBF, and MLP show the comparable results. On normalization of reduced feature vector, SVM PUK and ELM polynomial both show the best accuracy at 90% at 22 features. This is equivalent to maximum accuracy achieved by normalized 45 features. ELM linear kernel gives 89.9%, followed by 89.8% shown by both SVM RBF and ELM RBF. Overall, the feature-reduction algorithm proves to be effective, as accuracies obtained at smaller feature-sets are either better or comparable.Table 4
Recognition accuracies for original and reduced feature-sets for ISL database.
CFS (22 features)
k-NN using ED
k-NN using MD
SVM
ELM
MLP
Poly
RBF
PUK
Poly
RBF
Linear
Raw features
84.5%
86.5%
84.8%
89.5%
89.2%
89.6%
89.4%
85.6%
89.3%
Normalized features
87.9%
87.9%
87.4%
89.8%
90%
90%
89.8%
89.9%
89.3%


## 5. Conclusion

In this paper, the spatial behavior of 1D and 2D Krawtchouk polynomials at lower orders has been studied. Reconstruction results ensure that the lower order moments give local characteristics of an image. Krawtchouk-based moment invariants are extracted till 3rd order to represent their shape details. The ROI is varied by changing parametersp
1 and p
2, and features are calculated from different regions in an image. It is concluded that lower order Krawtchouk moment proves to be effective shape descriptors. The performance of these in terms of recognition accuracy is analyzed for different classifiers. It is observed that ELM polynomial kernel gives the best recognition accuracy of 88.1% at 45 features followed by SVM PUK and ELM linear kernel with 87.9%.However, on normalizing features, 90% accuracy is observed in SVM PUK followed by 89.3% in ELM polynomial kernel.Other classifiers also show encouraging results. However, the feature-set is reduced from 45 to 22 by CFS algorithm. The best performance is shown by ELM with polynomial kernel giving 89.6% from 88.1% at 45 features. With normalization of features, the accuracy improves further on feature selection. SVM PUK and ELM polynomial kernel both show the best accuracy at 90% at 22 features. ELM and SVM both perform best when the feature-set is increased and normalized.k-NN shows best performance with a lower feature vector size.Overall, it can be concluded that the normalized feature-set of 22 features is capable of classifying the images with maximum accuracy of 90% in case of SVM PUK and ELM-Poly classifiers for ISL dataset. For Jochen-Triesch dataset, it is 84.9% for ELM with Poly kernel.Table5 shows the comparison of results of proposed feature-set for Jochen-Triesch’s dataset. It is concluded that Krawtchouk moment-based features prove to be effective in shape recognition capability even with a smaller feature vector size as compared to other methods used which involve a large feature vector size. The feature-set for this database can be increased by extracting Krawtchouk moment features at higher orders. The technique employed for feature extraction can be based on image partitioning, with Krawtchouk moment features calculated at different subimages.Table 5
Comparison of results for Jochen-Triesch’s dataset.
Reference
Feature extraction method
Recognition accuracy
[14]
Elastic graph matching
92.9%
[26]
Modified census transform
89.9%
[27]
Weighted Eigen-space size functions
85.1%
[28]
Tchebichef (till 9th order), Hu, and Geometric features
84.63% (dark background)95.55% (light background)
Proposed method
Krawtchouk features till 3rd order (45 features)
84.9%



---

*Source: 6727806-2016-03-13.xml*