Chinese Sign Language Recognition Based on DTW-Distance-Mapping Features

Sign language is an important communication tool between the deaf and the external world. As the number of the Chinese deaf accounts for 15% of the world, it is highly urgent to develop aChinese sign language recognition (CSLR) system. Recently, a novel phonologyand radical-coded CSL, taking advantages of a limited and constant number of coded gestures, has been preliminarily verified to be feasible for practical CSLR systems. )e keynote of this version of CSL is that the same coded gesture performed in different orientations has different meanings. In this paper, wemainly propose a novel two-stage feature representationmethod to effectively characterize the CSL gestures. First, an orientation-sensitive feature is extracted regarding the distances between the palm center and the key points of the hand contour. Second, the extracted features are transformed by a dynamic time warping(DTW-) based featuremapping approach for better representation. Experimental results demonstrate the effectiveness of the proposed feature extraction and mapping approaches. )e averaged classification accuracy of all the 39 types of CSL gestures acquired from 11 subjects exceeds 93% for all the adopted classifiers, achieving significant improvement compared to the scheme without DTW-distance-mapping.


Introduction
Sign language (SL), a structured form of hand gestures, is the combination of various signs, hand movements, or body and facial expressions to deliver information. e motivation of SL recognition (SLR) is to provide a translation system to bridge the communication between the deaf and the healthy hearing society. From the literatures, cameras, data gloves, accelerometers (ACCs), and surface electromyography (sEMG) sensors are some common acquisition devices to capture gesture signals [1][2][3]. Currently, many SLs have been studied worldwide for the purpose of recognition, typically as American SLs, Australian SLs, Arabic SLs, Greek SLs, Korean SLs, and Chinese SLs (CSLs) [4][5][6][7]. According to the global estimates on prevalence of hearing loss provided by WHO, about 360 million people of such kind are in the world, among whom approximately one-fifth are Chinese [8]. ereby, it is urgent to develop a practical and effective CSL recognition (CSLR) framework.
In the past decades, researchers have proposed various solutions to improve the performance of CSLR [9,10]. For instance, Fang et al. employed data-gloves as input devices and designed a CSLR system based on a hierarchical decision tree, which could recognize 5113-isolated-sign vocabulary with accuracy rates of 91.6% and 83.7% for the registered and unregistered sets, respectively [2]. Li et al. [3] proposed an automatic component-level CSLR framework using the combined information from both ACC and sEMG signals. e overall classification results were 96.5% and 86.7% for a vocabulary of 12 0 signs and for 200 sentences, respectively. Later, Ma et al. employed a probabilistic model, hidden conditional random field (HCRF), to recognize CSLs based on sEMG and ACC signals. e average recognition rate was 91.51% for 120 high-frequency CSL words [11]. In 2015, Zhang et al. proposed a new system for both isolated and continuous CSLR based on video data. For isolated CSLR, the histogram of oriented displacement (HOD) was used to describe the trajectories, while the multi-SVM was adopted for classification. As for continuous CSLR, a dynamic programming method with warping templates obtained by DTW was adopted. e averaged accuracies of 450 phrases and 180 sentences were 88.0% and 85.2%, better than those obtained by HMMs, as well as CRF and its advanced techniques [12]. By considering the typical posture and motion simultaneously, Wang et al. proposed a sparse observation representation approach for CSLR, yielding better performance than traditional DTW and HMMs [13]. Besides the CSLR systems with traditional machine learning frameworks, there are a lot of studies employing advanced deep learning techniques [9,[14][15][16]. For instance, Yang and Zhu proposed a CSLR system based on convolutional neural networks using video data [15]. In [9], Huang et al. delivered a novel sequence-to-sequence learning method based on keyframe centered clips (KCCs) for isolated CSLR. e CSL sequence learning was realized by establishing an encoderdecoder using a long short-term memory (LSTM) network, achieving an average accuracy of 91.18% for 310 CSL words. Xiao et al. adopted a dual LSTM combined with a couple conditional HMM to fuse hand and skeleton sequence information to recognize continuous CSLs using RGB-D data [16].
Currently, the sign gestures employed by CSLR systems generally refer to the handbook edited by China Association of the Deaf [17], which has about 5000 normalized sign gestures. However, since the number of frequently used Chinese characters is about 3500, the number of frequently used words is far more than tens of thousands. It is obvious that these gestures are not enough for practical applications. Besides, most of these sign gestures are symbolic and consist of complex components, which are sometimes hard to be standardized due to regional differences and personal habits. To overcome these limitations, a completely new version of phonology-and radical-coded CSL execution has been introduced by the same association. In this version, each Chinese character can be expressed by executing the coded gestures twice using both hands. e first execution of phonology-coded gesture is near the mouth or the chest, representing Mandarin Pinyin. e second execution of radical-coded gesture is near the waist, representing the fore and the end radicals. In this way, almost every Chinese character can be composed of the only 13 basic gesture shapes [17,18], with each having 3 orientations (totally 39 gestures), shown in Figure 1. e defined 13 gesture shapes are shown in Figure 1(a) and named after four capital letters. e 3 orientations are shown in Figure 1(b) and abbreviated as U, H, and D, corresponding to vertical upwards, horizontal, and vertical downwards, respectively. e coded rules to express a Chinese character can be seen from Table 1 in [18]. Taking the Chinese character "huang" (yellow) for instance, the pronunciation is formed by the fast sounding of basic initial consonant code "h" (right hand, "ASLB" with a horizontal orientation) and the basic final consonant code "uang" (left hand, "ASLW" with a horizontal orientation). It is expressed by the first execution of phonology-coded gestures using both hands. However, common characters "huang" (empire), "huang" (yellow), and "huang" (lie) share the same pronunciation "huang" but can be distinguished from the fore and the end radicals, as seen in [18]. ese radicals are expressed by the second execution of radical-coded gestures using both hands. ereby, two executions of coded gestures can determine one Chinese character. By representing Chinese characters one-by-one based on the defined coded gestures, a word or a complete sentence can be formed to express a specific meaning. It can be seen from Figure 1 that all the coded gestures are somewhat static and will not be influenced when the same character is expressed in different words or different sentences. Meanwhile, the number of the coded gestures is limited and constant, which are relatively simply designed so that the standardization of them becomes much easier. Consequently, the most important thing is to recognize the 13 hand shapes with 3 different orientations for this version of CSL including relatively static gestures without the careful consideration of movement epenthesis (ME) problem.
is paper aims to develop an orientation-sensitive and robust feature to represent the above CSL gestures that are executed with different number of stretching-out fingers and different orientations. e main contributions of this paper can be summarized into the following two aspects: (1) We propose an orientation-sensitive feature extraction approach based on the distances between the palm center and the key points of the hand contour for CSLR. e key points are extracted by considering the information of stretching-out fingers. e proposed features are capable of representing different orientations of the same gesture shape, as well as characterizing the spatial distribution of stretching-out fingers with the same number but different hand shapes.
(2) We introduce a DTW-based feature mapping method to further improve the recognition accuracy. e feature mapping method calculates the DTW distances between the current sample and a set of reference samples covering all categories of gestures, aiming to improve the effectiveness of feature representation. To the best of our knowledge, it is the first time that the DTW algorithm is employed for feature mapping in visual recognition problems. e rest of this paper is structured as follows. Section 2 introduces some related works. In Section 3, we present the proposed CSLR framework, mainly including the extraction of orientation-sensitive features and the feature mapping based on DTW distances. e detailed experimental results and discussions are provided in Section 4. Finally, Section 5 concludes the paper.

Related Work
2.1. Orientation-Sensitive Feature Extraction. Since cameras are simple, noncontact, convenient, and natural devices to capture gesture videos, vision-based approaches have drawn much attention in the field of CSLR [4,6,9]. In order to well recognize gestures, feature extraction is an important procedure, which sometimes should consider the rotation or orientation information of gestures. To address this problem, researchers have put forward some solutions. e first type is to develop orientation-sensitive descriptors. For instance, the histogram of gradient (HOG) is a typical rotation-dependent indicator to describe the appearance and the shape of a local object within an image using the distribution of intensity gradients [19]. Wang et al. proposed a novel sparse observation representation approach to convert the high-dimensional HOG features into low-dimensional sparse vectors while obtaining better classification performance [13]. e other type is to evaluate the angles between the actual orientation and the designated orientation of the gesture. For instance, Huang et al. used Gabor-filter-based method to estimate the angles between the gesture orientations and the designated orientation, which later helped to correct the hand pose into the upright orientation [20]. Priyal and Bora utilized the geometry information of gestures to correct gesture orientation by calculating the histogram of palm length to palm width ratios [21].

Dynamic Time
Warping. DTW, proposed by Itakura, is an algorithm to measure the similarity of two distorted trajectories, which overcomes the scale invariance of two models by aligning them in the similarity matrix [22]. If the lengths of two time series that need to compare similarities are not equal, the time axis length of one sequence or both sequences needs to be "warped" for obtaining a better alignment result [23]. e goal of DTW is to find an optimal match path between these two unequal sequences by using a dynamic programming approach, allowing shifting of the time axis. is matching process requires compensation for length differences and the nonlinear properties of length differences in two sequences should be taken into account [24]. anks to its small training data requirement and high accuracy, DTW has been widely used in both sequential and nonsequential models. Readers can refer to the survey on DTW for detailed information [25]. Currently, more and more advanced DTW techniques, such as VQ-DTW [26], weighted-DTW [27], and Soft-DTW [28], have been developed. ey have been widely used in biometric identification [29], static and dynamic gesture recognition [30,31], medical examination [32], etc. Most of the DTW-based studies calculated the similarity of two sequences for classification directly according to the minimum cost or using cluster algorithms. In this paper, the DTW-based distance is employed for feature mapping to improve the effectiveness of feature representation.

The Proposed CSLR Method
e flow chart of our Chinese sign language recognition framework based on DTW-distance-mapping features is illustrated in Figure 2. First, gesture videos are acquired and framed to images. Second, each frame of image is transformed to hue, saturation, and value (HSV) color space for hand segmentation [33] and the segmented image is resized. ird, a palm center is localized based on hand boundary contour points and a constant number of key points are determined. e orientation-sensitive features are then extracted based on the distances between the palm center and all the key points. Afterwards, the orientation-sensitive feature is mapped into DTW distances via DTW algorithm between a certain sample and reference samples. Finally, the DTW-distance-mapping features are sent to classifiers for training and testing.

Hand Segmentation.
Different hand segmentation approaches have been available in literature to separate the hand region from the background [33,34]. Among them, the color-based method is common, which is a distinctive cue of hands and is invariant to scale and rotation [35]. Before performing this method, the framed images from acquired gesture videos in RGB color space are first converted to the HSV color space. Both thresholds (H Th and S Th ) of hue and  saturation are defined to segment the hand region. In this paper, if the hue pixels from a region are smaller than H Th and the saturation pixels from the same region are larger than S Th , these pixels will be determined within the hand region. H Th and S Th are experimentally set to 0.1 and 0.2. en, Otsu's method is utilized to better separate the skin hand region from the nonskin background region, with the criterion that the intraclass variance between the two regions is minimal [36]. Morphological dilate-erode operations are then adopted to eliminate the noise interference. Subsequently, a guided filter, namely, edge-aware image filtering, is performed to get a smooth hand edge [37]. Scale normalization is utilized to resize the cropped hand regions to a constant size of 256 × 256. e results of hand segmentation are shown in Figure 3.

Palm Center Localization.
After the hand segmentation, the hand boundary contour is tracked by the 8-neighborhood contour tracing algorithm, resulting in a sequence of hand contour points for each image [38]. For the purpose of determining the number of stretching-out fingers, the palm circle with a proper radius value is adopted to eliminate the palm region. To achieve this goal, the palm center is first localized according to the hand boundary contour points. e detailed procedures are as follows: (1) First, the centroid coordinate of the segmented hand region in the resized image is calculated. e contour point at the bottom of the centroid is assigned as the initial point. en, the adjacent point in the clockwise direction will be assigned as the second point. In this way, the sequences of the hand contour points are generated.
(2) Second, the Euclidean distance between each contour point in the sequence and the centroid is calculated, and its minimums, representing the finger roots, are detected using peak detection algorithm [39].
(3) ird, by applying the least-square method to the detected finger roots, a fitting circle is obtained. e palm center is defined as the center of the fitting circle. Let R min denote the radius of the circle. In order to cover all the stretching-out fingers without submerging them, an enlarged circle with the radius R � 1.1R min is adopted. After eliminating the palm by the enlarged circle (setting all the pixels within the circle to zeros), the number of the connected regions corresponding to stretching-out fingers is calculated. Figure 4 shows the detected finger roots and the corresponding fitting circle. It can be seen from Figures 4(a) and 4(b) that the distance minimums indicate the locations of finger roots, marked as blue stars. e center of the fitting circle (denoted as the red rectangle) and the isolated fingers after the palm elimination are shown in Figure 4(c).

Key Point Determination.
After palm elimination, the hand boundary contour points are redetected to form a new sequence and the distance between each new contour point and the palm center is recalculated. e fingertips are determined as the locations corresponding to distance maximums, while finger roots are determined by the threshold (R). Figure 5 shows the detected fingertips and finger roots of gesture "EXPM," where Figure 5(a) is in the form of distance sequence, while Figure 5(b) is in the form of hand. It can be clearly seen that the maximums (red stars) indicate the fingertips, while the minimums (blue stars) can represent the finger roots. Compared to the minimums in Figure 4(a) where there exist inaccurate or missing finger roots, the detection of finger roots based on our proposed palm elimination technique is more accurate, shown in Figure 4(b) accordingly. Similar conclusions can be found in [30,40].
In this paper, five key points are selected to represent each stretching-out finger. One point is the fingertip, two other points are the finger roots, and the remaining two points are the midpoints that relate to knuckles. e midpoints are determined as the middle of the horizontal distances between the fingertip and ambilateral adjacent finger roots. e detected midpoints can be seen as the pink stars in Figure 5(b).
Since at most five fingers can stretch out simultaneously, the maximum number of the key points is 25. With the aim of making all the gestures be classified at once while reducing the computation complexity, the number of all the key points is set to be a constant M, where M is not smaller than 25. Suppose that there are N i , 1 ≤ N i ≤ 5, N i ∈ N stretchingout fingers detected from the resized hand-segmented binary image I i ; a total of 5N i points can be formed orderly to represent all the stretching-out fingers. e M key points consist of two parts: one part includes the 5N i points representing the stretching-out fingers and the other part includes all the hand boundary contour points inside the interval from the location of the last finger root clockwise to that of the first finger root, which is equally normalized to M − 5N i boundary contour points. Figure 5 gives an example of 40 key points of gesture "EXPM" with 5 stretching-out fingers. So far, 25 key points have been determined. In order to form the total 40 hand boundary contour points, the remaining 15 points are uniformly sampled from the interval clockwise from the rightmost finger root to the leftmost finger root, shown as the green stars in Figure 5 ere is a particular gesture "HDGP" where none of the finger are stretching out. In this case, Harris corner detection algorithm [41] is adopted to derive the corresponding hand boundary contour points, and all the points are normalized to M points.

Distance Calculation.
All the Euclidean distances between the M key points and the palm center are calculated as the orientation-sensitive features. Specifically, the Euclidean distance Dist(k) between the k-th key point (x k , y k ) and the palm center (x 0 , y 0 ) is calculated as

DTW-
where 1 ≤ i ≤ N Train . N Train is the total number of training gesture samples. Similarly, the original testing feature F Test,j can be mapped to the new feature F Test,j ′ according to Equation (2), too. e number of the new feature dimensions only depends on the total number of reference samples. Due to the inherent property of DTW, the original orientation-sensitive features are transformed to the new feature space with higher similarity [42]. Besides, since the new features consist of the DTW distances between the sample and all types of gestures, the relationship between each two types of gestures is considered to strengthen the separability of features.
After feature mapping, the new training and testing features will be sent to the classifiers. e effective classifiers can be linear discriminant analysis (LDA) [18], K-Nearest Neighbors (KNN) [43], support vector machine (SVM) [44], and hidden Markov models [10]. Before sending the features into classifiers, a feature dimension reduction technique, uncorrelated linear discriminant analysis (ULDA), is performed to reduce the feature dimension into C − 1, where C is the number of gesture types [45]. On the one hand, Fukunaga proposed the optimal dimension of feature space as C − 1 for C-class problem [46]. On the other hand, the optimizing criterion in LDA is the ratio of between-class scatter to the within-class scatter, and, for any C-class problem, C − 1 nonzero eigenvalues will be obtained [45]. As Mathematical Problems in Engineering it is known that ULDA is an extension of LDA by adding some constraints into the optimization objective of LDA, the feature vectors extracted by ULDA will contain minimum redundancy [47]. ereby, the dimension of the reduced features after ULDA is C − 1 for C-class problem.

Data Acquisition.
A built-in camera from Vivo X7 (Vivo Inc., Guangzhou, China) was employed to collect gesture videos. It was attached on a laptop, with a distance of 0.2 m away from the subject. All the videos were recorded with a frame rate of 30 frames per second (fps) and a resolution of 1280 × 720. With the approval of the Ethics Review Committee of Hefei University of Technology, 11 informed subjects (3 females and 8 males, with the average age of 23.64 ± 1.03 years) were recruited in the experiment. Every subject performed all the 39 types of gestures sequentially with each lasting for about 5 seconds, resulting in a total number of 39 videos (all the videos are publicly available and can be obtained from Baidu Cloud Engine 1). Since this paper aims to propose a robust and orientation-dependent feature to classify CSL gestures, the environmental settings of data acquisition were relatively simple, regardless of complex background, intensive illumination variations, different colors of skin, and so forth. Some effective solutions addressing these problems can be found in [21,44]. Each acquired video was framed to images on MATLAB platform and downsampled to 10 fps. Finally, for each gesture, 50 images were obtained in order to meet the sample requirement of classifiers and provide samples with different illumination variations and tilted angles, resulting in 21450 samples in total (50 frames/gesture × 39 gestures/subject × 11 subjects � 21450 frames).

With DTW-Distance-Mapping versus without DTW-
Distance-Mapping. Two classification schemes were designed to demonstrate the feasibility of our proposed mapping features. ey were classifying all 39 types of gestures with and without DTW-distance-mapping, termed as Scheme I and Scheme II, respectively. For Scheme I, once the reference samples were determined, the samples from the remaining 10 subjects were further divided into training samples and testing samples by applying the leave-one-subject-out strategy again; namely, each one of the 10 subjects took turns  to be the testing subject, while the samples of the other 9 subjects were used for training. As for Scheme II, the above two-level leave-one-subject-out strategy for training and testing was exactly the same as Scheme I for fair comparison. at is to say, a reference subject was also selected in each round (at the first level) but was just removed from the experiment instead of being used for DTW feature mapping. e averaged classification rates of our proposed CSLR framework among all the 11 subjects are illustrated in Figure 6. It can be seen clearly from Figure 6 that the results of DTW-mapping-distance features are all higher than 93%. Specifically, the results are 93.20 ± 0.80%, 99.03 ± 0.19%, and 94.92 ± 0.87% for LDA, SVM, and KNN, respectively, while those of without DTW scheme are 84.33 ± 0.97%, 97.16 ± 0.19%, and 87.78 ± 0.44%, respectively (in the form of Mean ± Std). e averaged classification rates of Scheme I are improved by 8.87%, 1.87%, and 7.14% compared to Scheme II, respectively.
A one-way ANOVA test was conducted on the results in Figure 6 to explain the difference between the two schemes from the statistical view [48,49]. e p values derived from the ANOVA analysis are listed in Table 1. e maximum p value among all the classifiers is 2.48e-13 (p ≪ 0.05), indicating that there is a significant difference between these two schemes.
Furthermore, we take the results based on LDA as an example to show the specific classification results of each subject in Figure 7. e blue ones represent the results of Scheme I, while the yellow ones represent those of Scheme II. It can be seen that DTW-distance-mapping features can almost improve corresponding classification accuracy for each subject, with the improvement of at least 6.68%. e best classification accuracy improvement can reach 10.35%, achieved from subject S10.
Taking the results of subject S6 as an example, a specific classification confusion matrix of 39 types of gestures is illustrated in Figure 8. Figure 8(a) represents the results of Scheme I with KNN, and the corresponding results of Scheme II are shown in Figure 8(b). e horizontal and vertical coordinates represent predicted class and actual class, and the values of the axes represent the gesture types. e first 13 values represent all types of the downward gestures and then the horizontal and upward ones. It can be seen from Figure 8(b) that most types of gestures are well classified, and some of them can be 100% classified, such as "DASLW" and "UPINT." It can be clearly seen that the misclassified gesture in Scheme I is significantly reduced, especially for line 6 (gesture "DEXIF"), line 23 (gesture "HEXTF"), and line 33 (gesture "UEXTF"). ese results verify that the separability ability can be improved by DTWdistance-mapping features compared to the original features.

DTW Matching versus DTW-Distance-Mapping.
In order to show the better performance of DTW-distancemapping compared to that of DTW matching, where the latter one means adopting DTW as a template matching for classification, we first give the overall classification accuracy of 11 subjects using DTW matching and DTW mapping followed by classifiers, listed in Table 2.
e accuracy of using DTW matching for all 39 types of gestures is only 29.30%, while that of using DTW mapping followed by classifier is at least 93.20%, with an improvement of at least of 63.90%. Meanwhile, all 39 types of gestures can be divided into subsets according to the number of stretching-out fingers. e numbers of gesture types of each subset are 3, 9, 12, 9, 3, and 3. e overall classification accuracy of each subset is also shown in Table 2, with * − F corresponding to * stretching-out fingers. All the results demonstrate that the strategy of DTW mapping followed by classifiers is superior to that of traditional DTW matching alone. It can be seen that the number of gesture types of 1 − F subset is 9, 3 fewer than that of 2 − F subset. However, the overall classification accuracy of 1 − F subset is lower than that of 2 − F subset during every case. It can be indicated that when the number of the stretching-out finger is fewer, the DTW distance between each two feature sequences will be much similar. By means of DTW mapping, all the features are transformed into minimum cumulative distance of warp path while considering the differences between each two samples [30]. ereby, the DTW mapping can enhance the separation ability of features to improve the classification accuracy. However, as for 4 − F and 5 − F subsets, although there are only 3 types of gestures in each subset, the traditional DTW matching method is unable to recognize them well, with the classification accuracy of about 74%. It indicates that the traditional DTW matching method cannot well distinguish the same gesture but with different orientations.
To further demonstrate the feasibility of DTW mapping strategy, the classification confusion matrices for all the 9 types of 1 − F gestures (subject 1 was designated as the reference subject) derived from DTW mapping followed by KNN and DTW matching are shown in Figure 9, with Figure 9(a) representing the confusion matrix using DTW matching and Figure 9(b) representing results using the Mathematical Problems in Engineering 7 DTW mapping. e parameters of the KNN were set to 100 neighbors, Euclidean distance, and equal distance weight, respectively. According to Figure 9(a), except for the accuracies of 66% for gesture "DEXIF" and 59% for gesture "HEXIF," the recognition rates of the other 7 gestures are all less than 50% when using DTW as template matching. However, when adopting the strategy of DTW mapping, the average recognition accuracy is significantly improved, with the lowest recognition rate of 81% for the gesture "DEXTF." e overall recognition accuracy is 89.50%, with an improvement rate of 62.06% compared to that using DTW matching. e reasons why the performance of DTW mapping followed by classifiers is superior to that of DTW matching can also be revealed from the feature representation perspective. Taking the 9 types of 1 − F gestures for instance, Figure 10 shows the original orientation-sensitive features, Table 2: e overall classification accuracy of 11 subjects using DTW matching and DTW mapping followed by classifiers.  while Figure 11 shows the corresponding DTW-distancemapping features. It can be seen from Figure 10 that, even with the same number of stretching-out fingers, the corresponding features are different with the same orientation (comparison of each 3 horizontal subfigures). For the same gesture with different orientations, the corresponding features are also different (comparison of each 3 vertical subfigures). However, when only one finger is stretching out, the original feature waveforms are similar but with a shifting of the time axis, which cannot be well distinguished using the DTW matching. e reason is that the DTW distance between these two feature sequences with similar waveform but time shifting is small. It can be seen from Figure 11 that the DTW-distancemapping features of all types of gestures in 1 − F subset are separable. Specifically, the DTW-distance-mapping feature of "UEXLF" is quite different from that of "HEXIF," which indicates that, by considering the relationship between each two types of gesture via DTW distance, the DTW-distancemapping features are more separable.

Discussion.
e above results clearly demonstrate that (1) the proposed feature extraction approach based on DTW-distance-mapping is effective for CSLR and (2) the DTW-based feature mapping strategy can further improve the recognition accuracy. By using DTW mapping, the features are transformed into minimal cumulative distance of warp path to enhance the feature representation ability, which can overcome the differences between subjects, such as gesture execution habits or different sizes of the palm. To further analyze the results, we compared them with other related studies. In [50], Liu et al. designed a hierarchical strategy based on the number of fingers to solve the "large-category" problem of SLs, and HOG features were used. e results of 25 popular static gestures were 78.9% for training gestures in a fixed orientation and 99.9% for training gestures in multiple orientations. Nevertheless, the results of 39 types of gestures in our study can also reach 99.03% using DTW-distance-mapping combined with SVM. Besides, the maximum dimension of the orientation-sensitive features is only 40, which is far smaller than that of the HOG features. Subsequently, in 2016, Chen et al. proposed locating palm center, fingertips, and finger roots, as well as root-center-angle features using finger length weighted Mahalanobis distance. e average accuracy of the 15 self-collected gestures with 9 rotations was 94.67%, which benefitted from the usage of the supernumerary depth data from Kinect sensor and the robustness to illumination variations [51]. Ren et al. proposed a novel Finger-Earth Mover's Distance (FEMD) method to measure the dissimilarity between hand shapes, which helped to achieve an average accuracy of 93.2% for 10 gestures.
e FEMD was robust to hand articulations, distortions, and orientation or scale changes and could even handle challenging situations including cluttered backgrounds and lighting conditions [40,52]. However, in our study, the same gesture executed with different orientations is treated as a different gesture, where the FEMD method is suboptimal. Meanwhile, the classification performance of using DTW-distance-mapping features has been proved to be better than that using DTW as template matching. In addition, the time-consumption complexity of our proposed DTW is O(N 2 ), while that of EMD algorithm is cubic, specifically O(N 3 log n) [53]. e mean running times of a hand recognition procedure were reported as 4.0012 seconds and 0.0750 seconds for near-convex decomposition followed by FEMD and the thresholding decomposition followed by FEMD, respectively [40]. As for our DTWdistance-mapping method, the mean running time of a hand recognition procedure was 0.07188 seconds (MATLAB 2015b, i5-7500 CPU, 8G RAM).
It is noted that a drawback of our proposed CSLR system is the skin-color-based hand segmentation approach, which has restrictions such as illumination invariance and relative simple background, although this step is not the focus of this work. In the future, we will develop a more robust hand segmentation method to improve the practicability of the proposed CSLR system. e other drawback of our proposed CSLR framework lies in determining the radius of the palm fitting circle, which is important to determine the number of stretching-out fingers. Due to physiological anatomy and gesture execution habit differences between subjects, the radius of the palm fitting circle currently cannot be constant among all the subjects. In the future, we will adopt some adaptive methods to solve this problem. e other problem is that there is a restriction of finger occlusion. If the stretchingout fingers are occluded but the maximum distance between the distance contour point and the palm center is larger than the radius R, the corresponding fingertips can still be detected. However, if the maximum distance is not larger than the radius R due to severe occlusion, the corresponding fingertips cannot be detected by our proposed method. In this case, gestures based on RGB-D data and FEMD method might provide valuable information that can handle severe occlusion problem [40]. Besides, with the development of deep learning technique, deeplearning-based CSLR system will also be further explored.

Conclusions
In this paper, we have proposed a novel two-stage feature representation method for Chinese sign language recognition (CSLR). e target is to classify 39 types of static CSL gestures, consisting of 13 types of basic hand shapes with each having 3 orientations. An orientation-sensitive feature extraction approach is presented based on distances between the palm center and the key points of the hand contour. Besides, a dynamic time warping-(DTW-) based feature mapping approach is proposed to further improve the recognition accuracy. Experimental results demonstrate the effectiveness of the proposed feature representation approach. is study will facilitate the practical progress of CSLR systems.

Data Availability
e data used to support the findings of this study are available from the corresponding author upon request.

Conflicts of Interest
e authors declare that they have no conflicts of interest.