Automatic measurement of traditional Chinese costume from its silhouette through Fuzzy c -means clustering method

Abstract

As the precious cultural heritage of the Chinese nation, traditional costumes are in urgent need of scientific research and protection. In particular, there are scanty studies on costume silhouettes, due to the reasons of the need for cultural relic protection, and the strong subjectivity of manual measurement, which limit the accuracy of quantitative research. This paper presents an automatic measurement method for traditional Chinese costume dimensions based on fuzzy C-means clustering and silhouette feature point location. The method is consisted of six steps: (1) costume image acquisition; (2) costume image preprocessing; (3) color space transformation; (4) object clustering segmentation; (5) costume silhouette feature point location; and (6) costume measurement. First, the relative total variation model was used to obtain the environmental robustness and costume color adaptability. Second, the FCM clustering algorithm was used to implement image segmentation to extract the outer silhouette of the costume. Finally, automatic measurement of costume silhouette was achieved by locating its feature points. The experimental results demonstrated that the proposed method could effectively segment the outer silhouette of a costume image and locate the feature points of the silhouette. The measurement accuracy could meet the requirements of industrial application, thus providing the dual value of costume culture research and industrial application.

Keywords

Traditional Chinese costume costume dimension measurement relative total variation model FCM clustering algorithm silhouette feature point localization

Introduction

In recent years, with the continuous awareness in preserving intangible cultural heritage, the protection and inheritance of traditional costumes have gradually become a research focus. Research on traditional costumes has mainly focused on the analysis of artistic characteristics and historical and cultural discussion, thus there are still deficiencies and gaps in the quantitative research.¹

The quantitative research of traditional Chinese costumes has mostly focused on color research,^2,3 but there are few related researches on silhouette. The silhouette is the external clothing shape and the basis of its shape, which determines the overall clothing impression.⁴ Traditional Chinese costumes have a variety of silhouette structures, which can be classified by their letter image. Common silhouettes are the A-line, X-line, and H-line. Among them, A-line costumes can best represent traditional Chinese costume due to their wide robes and large-sleeves. At the beginning of the 20th century, western-style fitted clothing was introduced, and under its influence, traditional costumes have gradually incorporated an X-line, which emphasizes the waist, and an H-shape, which is the same width from top to bottom. These three silhouette costumes are shown in Figure 1. And these costume image samples were all collected from the Folk Costume Museum of Jiangnan University.

Figure 1.

Common silhouettes of traditional Chinese costumes: (a) A-line, (b) X-line, and (c) H-line.

Quantitative research on the silhouettes of traditional costumes is urgently needed, especially dimension measurement, which is the basis of silhouette research. However, most of the traditional costume samples are cultural relics that cannot be touched frequently due to the need for protection. In addition, because they belong to different museums or collectors, it is difficult to obtain samples. Therefore, data collection has failed to form a complete system, which has affected the scientific process of traditional costume research. Moreover, the process of traditional manual measurement is time-consuming, inaccurate, and has a high cost. Traditional Chinese costumes have a planar symmetrical structure that is suitable for two-dimensional image processing technology based on computer vision. Thus, this paper introduced it into costume dimension measurement to meet the scientific automation needs of traditional costume research. There are many A-line samples in traditional Chinese costumes, which are also the most representative silhouettes. The overall shape of an A-line costume is a triangle or trapezoid with a narrow upper and lower width, and the hem is unfolded.⁵ As shown in Figure 2, the main measurement parts include the costume length, sleeve length, sleeve width, bust width, and hem width. Therefore, this paper first took an A-line costume as an example to carry out the automatic dimension measurement experiment.

Figure 2.

Main measurement parts of an A-line costume.

In recent years, machine vision has become widely used in the field of textiles and costumes, and there have been many successful applications in in pattern, color, and fabric structure extraction. Hu et al.⁶ proposed an algorithm to improve the robustness and accuracy of clothing image segmentation. The algorithm does not need any predefined clothing model, but uses the Delaunay Constraint Triangle (CDT) to evaluate the foreground (clothing) and background (non-clothing) of clothing image. In order to obtain more accurate results, Yang et al.⁷ used a data-driven framework with two reasoning stages to divide the segmentation process into two processes: image co-segmentation and image model building, and finally achieved good results. In view of the problem of low segmentation accuracy caused by multiple objects and occlusion in clothing image, Zhao et al.⁸ utilized a cooperative segmentation method for clothing image with multiple objects. However, the data of multiple objects is often difficult to collect, so the method of single image is very important, and the clustering algorithm is one of the classic solutions. In order to determine the main body of the yarn accurately, Li et al.⁹ used threshold segmentation and morphological opening operation to process the yarn image in sequence, which has better performance. Kuo et al.¹⁰ used genetic algorithm to distinguish the images of repetitive pattern embroidery and non-repetitive pattern embroidery, which greatly reduced the calculation of the entire image. K-means clustering method is one of the most classic clustering algorithms. Some studies adopted and improved algorithms to achieve color pattern segmentation and color extraction, and achieved good results.^11,12 Li et al.¹³ used x-means clustering algorithm, which can accurately identify the color and texture of dyed fabrics, and had good robustness. Zhang et al.^14–16 used FCM algorithm to recognize the color pattern and color yarn layout for yarn-dyed fabrics. Pan et al.¹⁷ realized the automatic recognition of fabric texture structure by inputting BP neural network into the cluster segmentation results.

In the field of automatic costume dimension measurement, Dong and Hu¹⁸ used SUSAN corner detection algorithm to achieve costume feature point extraction and obtain costume dimension information. Li et al.¹⁹ used median filtering and histogram equalization to preprocess the image, and then combines the Forstner algorithm and SIFT technology to extract feature corners and achieve costume dimension measurement. However, the effects of these two methods of extracting costume feature points through corner detection were poor when applied to costumes with relatively smooth silhouette curves and complex internal structure and texture.

Traditional costumes are highly decorative, with diverse colors and complex textures. In this paper, relative total variation image texture processing and the FCM clustering algorithm were used to intelligently extract costume silhouettes with complex textures. At the same time, by using costume structure-based positioning of costume feature points, the automatic collection of traditional A-line costume dimensions was achieved. It was hoped that the results could provide more accurate and comprehensive data support for traditional costume research and costume design, as well as facilitate the digital inheritance and preservation of traditional costumes.

Research framework

The research framework of this study is shown in Figure 3. Step 1 was costume image acquisition, in which a costume image acquisition platform was set up and calibrated, and then traditional costume image sample s were collected with a digital camera. Step 2 was image preprocessing, in which the internal texture and other noises in the image were filtered out through the relative total variation algorithm. In Step 3 the preprocessed image was converted from the RGB color space to the CIE Lab color space. Step 4 was image clustering and segmentation, in which image clustering was completed through the FCM algorithm and then collected to complete costume silhouette segmentation. Step 5 was to collect the feature points according to the characteristics of the costume silhouette. Finally, according to the definition of the main costume dimension, the number of pixels between feature points was collected and the actual dimension was obtained according to the measurement ratio.

Figure 3.

Research framework of the proposed method.

Costume silhouette extraction

Image acquisition

To ensure measurement accuracy, a stable image acquisition platform was built first. In this study, a FUJIFILM X-Pro2 digital camera and an XF35 mm F1.4R lens were used in combination with an overhead bracket, and the Fujifilm Camera Remote app was used to collect pictures with an iPad as a remote control. At the same time, in order to reduce the impact of shadows on the accuracy of the silhouette recognition, a ring-shaped LED light source was used above the platform with a color temperature of 5600 K. The camera lens was placed 2 m away from the acquisition platform. The shooting parameters were as follows: an f/4 aperture, 1/60s exposure time, ISO-250 ISO speed, and a focal length of 23 mm. In order to ensure the segmentation effect, it should be noted that the sample costumes cannot be located at the edge of the picture. And these samples were all collected from the Folk Costume Museum of Jiangnan University.

Image preprocessing

Costume images have an extremely complex color composition. Besides the use of fabrics of different colors in a large area, local color distribution differences may cause image segmentation errors. Such local color differences may include local color areas produced by embroidery, printing, and jacquard and sewing processes, as well as local brightness noise caused by lighting effects. Such local color differences may cause errors in image segmentation, thus, specific techniques must be used to preprocess the images. In general, techniques such as Gaussian filtering²⁰ and median filtering¹⁹ can be applied to costume images for local noise removal. However, the above-mentioned technical methods may cause blurring of costume edge contours, introduce errors in subsequent costume edge contour recognition, and cause errors in the final costume dimension collection. In order to retain relatively good costume silhouette characteristics and remove local color difference distributions, this study used an image denoising algorithm based on the relative total variation model.²¹ The algorithm could be effectively applied to “structure + texture” images to remove local color difference areas and retain costume edge information.²² In this algorithm, the model objective function is expressed as follows:

a r g \underset{S}{m i n} \sum_{p} {(S_{P} - I_{p})}^{2} + λ \cdot (\frac{D_{x} (p)}{ℒ_{x} (p) + ε} + \frac{D_{y} (p)}{ℒ_{y} (p) + ε})

(1)

where: $I$ is the input image; $S$ is the output structure image; $p$ is the index of the 2D image pixels; $D (p)$ is the total window variation; $ℒ (p)$ is the inherent window variation; $ε$ is the small component to prevent the divisor from being zero; and $λ > 0$ is the proportion of the weight item and control fidelity item to total variation. $D_{x} (p)$ and $D_{y} (p)$ are defined as:

D_{x} (p) = \sum_{q \in R (p)} g_{p, q} \cdot | {(\partial_{x} S)}_{q} |

(2)

D_{y} (p) = \sum_{q \in R (p)} g_{p, q} \cdot | {(\partial_{y} S)}_{q} |

(3)

$ℒ_{x} (p)$ and $ℒ_{y} (p)$ are defined as:

ℒ_{x} (p) = | \sum_{q \in R (p)} g_{p, q} \cdot {(\partial_{x} S)}_{q} |

(4)

ℒ_{y} (p) = | \sum_{q \in R (p)} g_{p, q} \cdot {(\partial_{y} S)}_{q} |

(5)

where, $q$ is the index of all pixels in a square area centered on point $p$ ; $\partial_{x}, \partial_{y}$ denote the partial deviation in two directions; and $g_{p, q}$ is a weighting function defined according to spatial affinity, expressed as:

g_{p, q} \propto \exp (- \frac{{(x_{p} - x_{q})}^{2} + {(y_{p} - y_{q})}^{2}}{2 σ^{2}})

(6)

in which the role of $σ$ is to control the space dimension of the window.

In equation (1), the first item ${(S_{P} - I_{p})}^{2}$ restricts the change between the source image and the output image to be as small as possible. The second item is relative to the total variation; in a small window area of the image, only the relative total variation value significantly smaller than the relative total variation value corresponding to the main structure window is included in the image. With this difference, it was possible to remove textures from the image while preserving the main structure of the image. The pre-processed image is shown in Figure 4(b).

Figure 4.

Implementation process of the costume image silhouette segmentation algorithm: (a) original costume image, (b) pre-processed image, (c) clustering result, and (d) segmentation result.

Color space conversion

The original image collected by a digital camera was an RGB color space; however, the device-oriented RGB color space was not suitable for directly segmenting color images due to the highly linear correlation between its components.² In order to solve this problem, CIE feature model was proposed in 1976, which makes up for the shortage of RGB color space model depending on device color. It is composed of three basic colors x, y, and Z, and any color can be represented by the combination of these three basic colors. The values of the three basic colors x, y, and Z can be obtained by linear conversion of RGB.

Let r, g, and b be the three-channel components of a pixel in the RGB color space. The value ranges are (0, 255). The conversion formula is as follows:

{\begin{matrix} R = g a m m a (\frac{r}{255.0}) \\ G = g a m m a (\frac{g}{255.0}) \\ B = g a m m a (\frac{b}{255.0}) \end{matrix}

(7)

gamma (x) = {\begin{matrix} {(\frac{x + 0.055}{1.055})}^{2.4}, x > 0.04045 \\ \frac{x}{12.92}, o t h e r w i s e \end{matrix}

(8)

[\begin{matrix} X \\ Y \\ Z \end{matrix}] = M \cdot [\begin{matrix} R \\ G \\ B \end{matrix}]

(9)

Where, $M = (\begin{matrix} 0.4124 & 0.3576 & 0.1805 \\ 0.2126 & 0.7152 & 0.0722 \\ 0.0193 & 0.1192 & 0.9505 \end{matrix})$

However, there are two defects in this color space. One is that brightness information and chroma information are difficult to explain the relationship between color perception and physical stimulation. And the other is perception uniformity, which means that the digital difference between colors is not consistent with visual perception. In order to solve these two problems, experts have stipulated a kind of color space, namely CIELAB (hereinafter referred to as lab),²³ but the conversion formula is quite complex. Based on it, Connolly and Fleiss²⁴ studied the improvement scheme of non-linear function and improved the efficiency.

{\begin{matrix} L^{*} = 116 f (Y / Y_{n}) - 16 \\ a^{*} = 500 [f (X / X_{n}) - f (Y / Y_{n})] \\ b^{*} = 200 [f (Y / Y_{n}) - f (Z / Z_{n})] \end{matrix}

(10)

f (t) = {\begin{matrix} t^{1 / 3}, i f t > {(\frac{6}{29})}^{3} \\ \frac{1}{3} {(\frac{29}{6})}^{2} t + \frac{4}{29}, o t h e r w i s e \end{matrix}

(11)

where, L*, a*, and b* are the values of the three channels of the final LAB color space, and X, Y, and Z are the calculated values after RGB is converted to XYZ. X_n, Y_n, and Z_n are generally defaulted to 95.047, 100.0, and 108.883.

Lab is a kind of uniform color space, which can classify the color according to the shortest distance, achieve more independent and simple control of color and brightness information, and accurately express the color characteristics of the image. It is more suitable for color image segmentation than RGB color space.

FCM clustering segmentation

Clustering algorithm is one of the classical algorithms in the field of image segmentation, among which K-means, mean shift and FCM are the representative methods. K-means²⁵ is a simple clustering method with fast calculation speed, but the segmentation effect depends on the initial clustering center. If the initialization selection is poor, the segmentation effect cannot be guaranteed, and it is easy to fall into the local optimal value. Mean shift²⁶ is an iterative algorithm based on the core density theory, which finds the target position through iterative calculation, and has many application scenarios.²⁷ However, due to its unsupervised nature, it is very difficult for mean shift to segment an image into meaningful pictures. In addition, with the development of neural network technology, it is very popular to use neural network for image segmentation.²⁸ But it needs a lot of data for training, which is difficult to meet the requirements in our data set.

Based on the advantages and disadvantages of the above methods, these methods are not suitable for this research. In order to extract the costume silhouette and retain more reliable information, this paper used FCM clustering and clustering result segmentation algorithm to implement the external costume main structure extraction. The segmentation algorithm segmented the foreground and background of the image through image edge detection to achieve the extraction of the main structure of the costume in the image.

The FCM clustering algorithm is one of the most widely-used clustering algorithms. The algorithm divides pixels by iterative optimization of the cost function and divides pixels into a certain area according to the degree to which each pixel belongs to a different area. Due to the degradation of the image and the influence of external noise and other uncertain factors, it is difficult to assign pixels to a certain classifier during segmentation; however, the FCM clustering algorithm uses a fuzzy concept for the independence between classifiers. This overcomes the shortcomings of the hard classification method for assigning pixels and can reduce the impact of uncertain factors on pixel classification to some extent.²⁹

Suppose X = {x1, x2,. . ., xn}is the gray value or feature value of an image pixel. The image consists of c regions. The clustering center of the region is expressed as v = {v1, v2, . . ., vc}, u = {uik}cn is the membership matrix, and uik is the membership degree of xi belonging to the k-th region. The core idea of FCM is to find a suitable membership degree and cluster center, so that the variance and iteration error of the cost function within the cluster are minimized. The value of the cost function is the weighted cumulative sum of the two norm measures from the pixel to the cluster center, expressed as:

J (U, V) = \sum_{i = 1}^{c} \sum_{j = 1}^{n} u_{i j}^{m} {‖ x_{j} - v_{i} ‖}^{2}

(12)

where, $J (U, V)$ is the sum of the squared weighted distances of the pixel in the region to the cluster center and the value of $J (U, V)$ reflects the compactness of the image region. The lower the value, the more likely the pixel is in a region and the better the clustering effect. Parameter $m$ is a weighted index of the membership degree, which is used to enhance the contrast of the gray value of the pixels belonging to different regions. It determines the degree of blur of the classification result, $m \in (1, \infty)$ $m \in (1, \infty)$ $m \in (1, \infty)$ . An m of 2 is usually taken as the typical value, and the higher the value, the fuzzier the classification. Parameter $c$ is the number of clusters. $u_{i j}$ is the degree of membership of the j-th data $(x_{j})$ to the i-type cluster center ( $v_{i}$ ) and satisfies $u_{i j} \in (0, 1)$ and $\sum_{i = 1}^{c} u_{i j} = 1$ . The above weight coefficients, except for the number of clusters c need to be obtained based on sample characteristics experiments, and the others are inspired by Ahmed et al.³⁰ proposed method. The image processing research experience in the field of medical imaging has also achieved good results in this paper.

The traditional FCM algorithm starts with the initialization of the clustering center, however the selection of clustering centers often depends on an individual’s experience. In order to solve this problem, this study chose to initialize the membership degree matrix as the beginning of the algorithm.³¹ The FCM algorithm proceeded as follows:

(1) Set the number of clusters as c = 6, weight coefficient m = 2, and iteration stop threshold ε=10^-3.

(2) Initialize the membership degree matrix U⁰ and set the iteration pointer t = 1.

(3) Update the clustering center matrix according to equation (13).

v_{i} = \sum_{j = 1}^{n} {(u_{i j})}^{m} x_{j} / \sum_{j = 1}^{n} {(u_{i j})}^{m} 1 \leq i \leq c

(13)

(4) Update the membership degree matrix according to equation (14), where the iteration pointer $t = t + 1$ , and if $‖ x_{j} - v_{j} ‖ \neq 0$ , u_ij will be as shown in equation (14):

u_{i j} = {[\sum_{k = 1}^{c} {(\frac{‖ x_{j} - v_{i} ‖}{‖ x_{j} - v_{k} ‖})}^{2 / (m - 1)}]}^{- 1}

(14)

If $‖ x_{j} - v_{j} ‖ = 0$ , then $u_{k i} = 1, u_{i j} = 0 (i \neq k)$ .

(5) If $| U^{t + 1} - U^{t} | \leq ε$ , then the FCM algorithm is completed; otherwise, return to Step (3).

After the FCM clustering of the costume image was completed, the costume silhouette needed to be segmented from the image background. Since the contours to be collected were not distributed around the edges of the image, all the existing edges of the clustering result graph were set as the background $(I_{s}$ ), and the remaining categories were set as the foreground to obtain the image segmentation results. The clusters contained in the edges around the image constituted set $C_{e}$ , and the rest of the clusters constituted its complementary, set $C_{i}$ . The calculation method is shown in equation (15):

I_{s} (p) = {\begin{matrix} 1 I_{c} (p) \in C_{e} \\ 0 I_{c} (p) \in C_{i} \end{matrix}

(15)

where p is the index of the 2D image pixels. The example costume image clustering and segmentation results are shown in Figure 4(c) and 4(d).

Costume dimension measurement

This study took an A-line traditional costume as an example and proposed a key point positioning algorithm based on the geometric characteristics of the costume silhouette design according to the costume image edge contours obtained in the previous section. The costume silhouette dimension was automatically measured based on the positioned key points. The costume dimension measurement algorithm could be extended to other categories of costumes with the same silhouette structure.

Feature point extraction

Costumes with different silhouettes have different dimensions for measurement, and the measurement of each dimension depends on specific location points on the surface of the costume. These points were called silhouette feature points in this paper. Regardless of the making of the costume, all silhouette feature points have specific geometric characteristics depending on the shapes of the costume and the design. Taking an A-line costume as an example, its main dimension indicators include: costume length, sleeve length, sleeve hem width, bust width, and hem width. Their respective geometric characteristics are defined below:

Costume length: The distance from the intersection of the end point line on the left and right cuffs of the costume and the center line of the costume to the lower end point of the costume.

Sleeve length: The distance between the end points of the left and right cuffs of the costume.

Sleeve hem width: The distance between the upper and lower end points of the cuff of the costume.

Bust width: The distance between the most concave positions on the left and right of the costume.

Hem width: The distance between the left and right endpoints of the costume’s hem.

To sum up, the dimension measurement of the A-line silhouette costume required locating the following key points: the top vertex of the costume (A), the bottom vertex of the costume (F), the upper end points of the left and right cuffs of the costume (B1, B2), the upper end point along the length of the costume (G), the lower end points of the left and right cuffs of the costume (C1, C2), the most concave positions of the left and right sides of the costume (D1, D2), and the left and right end points of the costume’s hem (E1, E2). The above positions are shown in Figure 5(a).

Figure 5.

A-line costume feature point location: (a) A-line costume feature point example and (b) A-line costume feature point location result.

Based on the geometric relationship, it was assumed that the costume sample was placed vertically in the image, and there was a set (P) of costume edge contour points. The positions of all feature points were thus modeled.

(1) Points A and F were located at the top and bottom of the center of gravity line of the costume, respectively. Therefore, when the costume was placed vertically, its abscissa had the same value as the center of gravity of the costume graphic, as shown in equation (16).

{A, F} = {(x, y) | (x, y) \in P \land x = G_{x}}

(16)

(2) B1 and B2 were respectively located at the far left and upper right of the costume silhouette and represented the points on the left and right edges of the costume that were furthest from point F.

\begin{array}{l} B_{1} = \underset{p \in P_{l}}{\arg \max} ‖ p - F ‖ \\ B_{2} = \underset{p \in P_{r}}{\arg \max} ‖ p - F ‖ \end{array}

(17)

(3) D1 and D2 were the most concave positions on the left and right sides of the costume silhouette, respectively, and could be described as the points closest to A and G on edge contours B1F and B2F.

\begin{array}{l} D_{1} = \underset{p \in P_{B_{1} F}}{\arg \min} ‖ p - m e a n {A, G} ‖ \\ D_{2} = \underset{p \in P_{B_{2} F}}{\arg \min} ‖ p - m e a n {A, G} ‖ \end{array}

(18)

(4) C1 and C2 were the lower end points of the left and right cuffs and were the farthest from the diagonal of the sleeve; that is, the points on edge contours B1D1 and B2D2, and were the farthest points from straight lines B1D1 and B2D2.

\begin{array}{l} C_{1} = \underset{p \in P_{B_{1} D_{1}}}{\arg \max} d i s (p, l i n e (B_{1}, D_{1})) \\ C_{2} = \underset{p \in P_{B_{2} D_{2}}}{\arg \max} d i s (p, l i n e (B_{2}, D_{2})) \end{array}

(19)

(5) Same as above, E1 and E2 were the left and right lower end positions of the costume hem, respectively, and were the farthest from the diagonal of the unilateral hem; that is, they were on the points for edge contours D1F and D2F and were the furthest from straight lines D1F and D2F.

\begin{array}{l} E_{1} = \underset{p \in P_{D_{1} F}}{\arg \max} d i s (p, l i n e (D_{1}, F)) \\ E_{2} = \underset{p \in P_{D_{2} F}}{\arg \max} d i s (p, l i n e (D_{2}, F)) \end{array}

(20)

In the above order, the traversal method was used to traverse all the costume contour edge points to solve the model, and then the coordinates of each feature point could be obtained. The actual running results are shown in Figure 5(b), which proved that the algorithm could effectively locate the A-line costume feature points.

Dimension measurement on feature points

In order to obtain the actual dimensions of the costume, the measurement ratio k needed to first be determined. The method consisted of measuring a rectangular black cloth, in which the actual length of the cloth was $l_{e}$ , the automatic measured value of the cloth was $l_{m}$ , and $k = l_{e} / l_{m}$ .

Taking the A-line silhouette costume as an example, when the image resolution dpi was known, the main costume dimension indicators, such as costume length $l_{1}$ , sleeve length $l_{2}$ , sleeve hem width $l_{3}$ , bust width $l_{4}$ , and hem width $l_{5}$ could be obtained through the distance of the feature points extracted in Section 3.1 and the measurement ratio k via calculation. The calculation process is shown in Eq. (21):

\begin{array}{l} l_{1} = k \cdot 254 \cdot ‖ (B_{1} + B_{2}) / 2 - F ‖ / d p i \\ l_{2} = k \cdot 254 \cdot ‖ B_{1} - B_{2} ‖ / d p i \\ l_{3} = k \cdot 254 \cdot (‖ B_{1} - C_{1} ‖ / 2 + ‖ B_{2} - C_{2} ‖ / 2) / d p i \\ l_{4} = k \cdot 254 \cdot ‖ D_{1} - D_{2} ‖ / d p i \\ l_{5} = k \cdot 254 \cdot ‖ E_{1} - E_{2} ‖ / d p i \end{array}

(21)

Results and discussion

Discussion on image segmentation effect

This study used a relative total variation preprocessing algorithm to process costume images and retain the silhouette edges while smoothing the local texture. On this basis, the Lab color space combined with the FCM clustering algorithm was used to obtain the costume silhouette segmentation results. Table 1 shows the original images of several representative A-line example costumes, the relative total variation preprocessing results, the image segmentation results, and the image segmentation results without preprocessing. On the whole, the costume image segmentation results obtained from the images not preprocessed by the relative total variation model were poor, and the disadvantages were mainly due to: (1) texture changes near the edges of the costume silhouettes, which lead to the segmentation result without preprocessing being fuzzier; (2) the local texture of the costume without smoothing was recognized as the background; and (3) when the main color of the costume was close to the background, the costume target without smoothing of the local texture was less distinguishable from the background and was more difficult to segment. From this comparative experiment, it was known that the relative total variation preprocessing algorithm proposed in this paper could effectively improve the segmentation effect of costume silhouettes, which was of great significance.

Table 1.

Comparison of costume segmentation effect.

Sample no.	Original image	Total variation preprocessed image	Segmentation result	Segmentation result without preprocessing
1
2
3
4
5
6

Optimization of FCM clustering number C

In the FCM algorithm, parameter c refers to the number of categories of the sample to be clustered. The main drawback of using clustering to segment images is that regardless of the structure of the given image, as long as the number of clustering categories c is given, it can always segment the image. Therefore, if parameter c is not selected properly, the segmentation result may not be consistent with the real structure of the image. In this study, clustering-based image segmentation was used to extract the costume silhouette, and the dimensions of the costume were measured by the edge feature points of the silhouette. In order to ensure the accuracy of the measurement results, higher requirements were imposed on the accuracy of the silhouette extraction.

In the 50 traditional costume samples selected for this study, after the images were preprocessed with relative total variation, it was found that there were fewer than eight types of foreground and background colors. Therefore, by using two to ten categories of clustering for the sample costume, the accuracy of the nine groups of collected costume data could be compared to determine the number of optimal clustering categories (c). It was found in the experiment that when c = 2, the silhouette could not be completely extracted for most costume samples, therefore there was no value for c = 2 in further accuracy analysis. Figure 6 shows the relative error distribution of 250 parts of 50 costume samples when c ranged from 3 to 10. The costume images collected under the experimental conditions of this study had a high contrast with the background. In the case of c> 2, all costumes could be segmented to obtain a continuous silhouette edge set, as well as provide effective dimension data. The average and minimum relative error differences were small for different values of c. Due to the influence of costume color, edge shadow, and other factors, the maximum error and error distribution varied significantly under different values of c. From Figure 6, it could be seen that when c = 6, the average relative error and maximum relative error of the 250 parts in the 50 samples were the lowest and the overall error distribution was optimal; that is, when c = 6, the system’s accuracy, versatility, and robustness were highest.

Figure 6.

Clustering number c and measurement relative error.

Accuracy of costume dimension measurement results

The image segmentation and dimension acquisition algorithm proposed in this study were implemented on the collected image set to obtain the dimensions of each part based on the costume image acquisition for all samples. No cases of positioning errors were found during the subjective observation and after observing the location of the labeled feature points in all samples. To allow objective data analysis, the 50 costume samples were measured; the costume length, sleeve length, bust width, hem width, and sleeve width dimensions were obtained, and the distribution of absolute and relative errors in the measurement results was analyzed. Using the average value of three manual measurements as the true value of dimension $l_{a}$ , and the automatic measurement result l, the absolute error $Δ = | l_{a} - l |$ and relative error $δ = \frac{Δ}{l_{a}} \times 100 %$ are shown in Figure 7. According to China’s GB/T 2662-2008 clothing standards, the absolute error of various clothing dimensions should be controlled within 1.5 cm. According to the following results, out of the 250 dimension results collected from the 50 experimental samples, 248 results were within the range specified by the standard, indicating a compliance rate of 99.21%. However, we found that the hem of some of the images was not clear enough, which made the key points inaccurate and caused errors beyond the limits. At the same time, the average absolute error of the five main dimensions was less than 1 cm, thus proving the effectiveness of the proposed method in this paper.

Figure 7.

Costume dimension measurement accuracy.

Conclusion

This paper proposed a method of costume silhouette extraction and dimension acquisition based on machine vision technology. The costume image segmentation algorithm used for silhouette extraction included technical methods based on relative total variation image preprocessing, the Lab color space, and FCM clustering. Comparative experiments proved that using the image segmentation algorithm after preprocessing of the relative total variation image could result in more accurate costume silhouette edges with higher environmental robustness and wider costume color adaptability. In addition, the proposed dimension acquisition method had accurate feature point positioning performance, was not sensitive to the outer contour curvature of the costume, could effectively locate the feature points of different styles of A-line costumes, and had high versatility. The analysis of the subjective evaluation and objective statistics found that the measurement accuracy of the proposed method could meet the requirements of industrial production standards, thus proving that the algorithm not only could be applied to the collection of traditional costume dimension data but also had application value in the costume industry.

There were a number of shortcomings in the method proposed in this paper. First, although the proposed method could also be applied to the measurement of articles in museums, personal collections, and pictures for which real samples cannot be obtained, the accuracy of the measurement will be limited by the arrangements of the collected costumes and the photo shooting effects. Second, the feature point positioning algorithm used in this study only proposed a specific technical route based on an A-line costume. Although its core ideas were consistent with those of X-line, H-line and other costume silhouettes, the model should be adjusted for specific silhouettes. Future research could discuss how to unify key point positioning algorithms for different costume categories.

Supplemental Material

sj-pdf-1-jef-10.1177_1558925020978323 – Supplemental material for Automatic measurement of traditional Chinese costume from its silhouette through Fuzzy c-means clustering method

Supplemental material, sj-pdf-1-jef-10.1177_1558925020978323 for Automatic measurement of traditional Chinese costume from its silhouette through Fuzzy c-means clustering method by Jiaqin Zhang, Jingan Wang, Le Xing and Hui’e Liang in Journal of Engineered Fibers and Fabrics

Footnotes

Declaration of conflicting interests

The author(s) declared no potential conflicts of interest with respect to the research, authorship, and/or publication of this article.

Funding

The author(s) disclosed receipt of the following financial support for the research, authorship, and/or publication of this article: This work was supported by the Major Projects of Philosophy and Social Sciences Research in Jiangsu Colleges and Universities “Research on the Contemporary Value and World Influence of Jiangsu Costume Culture Heritage” [grant no 2019SJZSA021].

ORCID iD

Jiaqin Zhang

Supplemental material

Supplemental material for this article is available online.

References

Bian

70 years of Chinese fashion design. Design 2019; 318: 29–35.

Xing

Zhang

Liang

, et al. Intelligent recognition of dominant colors for Chinese traditional costumes based on a mean shift clustering method. J Text Inst 2018; 109: 1–11.

Liu

Lin

Liang

, et al. Material identification of the late Qing Dynasty textile and microanalysis of dye used in textile. Spectrosc Spectr Anal 2019; 39: 286–291.

Liu

XG.

Basic apparel design. Shanghai: Donghua University Press, 2010, pp.133.

BL.

An intelligent analysis and prediction framwork for womenswear silhouette based on data mining technology. PhD Thesis, Donghua University, China, 2018.

Yan

Lin

XG.

Clothing segmentation using foreground and background estimation based on the constrained Delaunay triangulation. Pattern Recognit 2008; 41(5): 1581–1592.

Yang

Luo

Lin

Clothing co-parsing by joint image segmentation and labeling. In: Computer vision and pattern recognition (CVPR), Columbus, OH, 24–27 June 2014, pp.3182–3189. New York: IEEE.

Zhao

Peng

, et al. Clothing cosegmentation for shopping images with cluttered background. IEEE Trans Multimedia 2016; 18: 1111–1123.

Zuo

Wang

, et al. A direct measurement method of yarn evenness based on machine vision. J Eng Fibers Fabr 2015; 10: 95–102.

10.

Kuo

CFJ

Hsu

CTM

Shih

CY.

Automatic pattern recognition and color separation of embroidery fabrics. Text Res J 2011; 81: 1145–1157.

11.

Ding

Zou

Chen

, et al. Extraction and classification of She nationality clothing via visual features. Text Res J 2016; 86: 1259–1269.

12.

Xiong

Liu

, et al. Determining the colorimetric attributes of multicolored materials based on a global correction and unsupervised image segmentation method. Appl Opt 2018; 57(26): 7482–7491.

13.

Meng

Wang

, et al. Intelligent recognition of the patterns of yarn-dyed fabric based on LSRT images. J Eng Fibers Fabr 2019; 14: 1–13.

14.

Zhang

Pan

Gao

, et al. Automatic detection of layout of color yarns of yarn-dyed fabric. Part 1: single-system-mélange color fabrics. Color Res Appl 2015; 40: 626–636.

15.

Zhang

Pan

Gao

, et al. Automatic detection of layout of color yarns of yarn-dyed fabric. Part 3: double-system-mélange color fabrics. Color Res Appl 2017; 42: 250–260.

16.

Zhang

Pan

Gao

, et al. Automatic recognition of the color effect of yarn-dyed fabric by the smallest repeat unit recognition algorithm. Text R J 2015; 85: 432–446.

17.

Pan

Gao

Liu

, et al. Automatic recognition of woven fabric pattern based on image processing and BP neural network. J Text Inst 2011; 102: 19–30.

18.

Dong

JL.

An efficient method for automatic measurement of garment dimensions. Journal of Textile Research 2008; 29: 98–101.

19.

Zheng

Jin

JF.

Application of image processing in on-line clothes size measurement. J Electron Meas Instrum 2016; 30: 1214–1219.

20.

Wang

Zhang

KJ.

Online measurement technology for garment size based on image processing. Information Technology and Informatization 2018; 225: 78–80.

21.

Yan

Xia

, et al. Structure extraction from texture via relative total variation. ACM Trans Graph 2012; 31: 139.

22.

Zhang

Tang

CM.

Fabric defect detection based on relative total variation model and adaptive mathematical morphology. J Text Res 2017; 38: 145–149.

23.

Tominaga

Color classification of natural color images. Color Res Appl 1992; 17: 230–239.

24.

Connolly

Fleiss

A study of efficiency and accuracy in the transformation from RGB to CIELAB color space. IEEE Trans Image Process 1997; 6: 1046–1048.

25.

MacQueen

. Some methods for classification and analysis of multivariate observations. In: Proceedings of the fifth Berkeley symposium on mathematical statistics and probability (eds Lecam

Neyman

), University of California, CA, 1967, pp.281–297. Berkeley and Los Angeles: University of California Press.

26.

Comaniciu

Meer

Mean shift: a robot approach toward feature space analysis. IEEE Trans Pattern Anal Mach Intell 2002; 24: 603–619.

27.

Yang

Zhou

XB.

Nucleus segmentation using market-controlled watched, tracking using mean shift, and Kalman filter in time lapse microcopy. IEEE Trans Circuits Syst I Regul Pap 2006; 53: 2405–2414.

28.

Livne

Rieger

Aydin

, et al. A U-Net deep learning framework for high performance vessel segmentation in patients with cerebrovascular disease. Front Neurosci 2019; 13: 97.

29.

Liu

Wang

, et al. The survey of fuzzy clustering method for image segmentation. J Image Graph 2012; 17: 447–458.

30.

Ahmed

Yamany

Mohamed

, et al. A modified fuzzy c-means algorithm for bias field estimation and segmentation of MRI data. IEEE Trans Med Imaging 2002; 21: 193–199.

31.

Kuo

CFJ

Jian

, et al. Automatic machine embroidery image color analysis system. Part I: using Gustafson-Kessel clustering algorithm in embroidery fabric color separation. Text Res J 2012; 82: 571–583.

Supplementary Material

Please find the following supplemental material available below.

For Open Access articles published under a Creative Commons License, all supplemental material carries the same license as the article it is associated with.

For non-Open Access articles published, all supplemental material carries a non-exclusive license, and permission requests for re-use of supplemental material or any part of supplemental material shall be sent directly to the copyright owner as specified in the copyright notice associated with the article.

0.00 MB

0.19 MB