# Fuzzy Applications in Custom Clothing Design Technology Based on Intelligent 3D Simulation Technology

Authors: Xiaolu Ye; Ibrahim Mishaal
Journal: Mathematical Problems in Engineering
 (2022)

---

## Abstract

This article integrates intelligent 3D simulation technology with an online customized clothing system to increase the impact of customized clothing design. The user uses a 3D scanner to scan his own body and acquire 3D body data, which include information of the head, chest, upper limbs, lower limbs, hands, and feet. Furthermore, this work enhances intelligent tracking and recognition technology, enhances the impact of human body parameter collection, and combines the enhanced algorithm to create a personalised clothing design system based on intelligent 3D simulation technology. Through experimental research, it can be seen that the customized clothing design system based on intelligent 3D simulation technology proposed in this paper has good effects and can effectively improve the service quality of online customized clothing.


---

## Body

## 1. Introduction

With the continuous development of society and economy, people’s living standards are improving day by day and consumption concepts are also changing. The purchase of ready-made clothes in shopping malls can no longer satisfy consumers’ increasingly demanding dress needs and tastes. Moreover, the competition among clothing manufacturers is becoming more and more fierce, and there are serious plagiarisms in product styles among various manufacturers, which makes the fashion trend suddenly become a rotten street product [1]. This is the component of the dressing that customers are most concerned with. However, the garment sector suffers from a severe lack of innovation, which drives up customer demand for personalised apparel. “Personalised customization system” is a new manufacturing and sales model that employs information technology and network technology to create items [2], and it is recognised as one of the most promising company development models in the future. The goal of building and developing a jeans customization app is to suit as many demands of the customers as possible, to link consumers with manufacturers and to let consumers to contact directly with manufacturers. At the same time, consumers directly participate in the product design process, enjoy more user experience and interactivity, independently design, carry out more innovations in clothing, and design products with personal characteristics [3].This article combines intelligent 3D simulation technology to study the custom clothing design system and builds an intelligent clothing design system to help customize clothing online and improve the effect of remote clothing customization.


## 2. Related Work

With the continuous development of digital technology, virtual reality technology, and Internet technology, people began to use virtual fitting technology to solve the contradiction of fitting. Virtual fitting technology requires the establishment and rendering of 3D models of clothing and human bodies. At present, many scholars have proposed a series of human body modeling methods [4], but the establishment of models still takes a lot of time, requires high cost, and has a long cycle. Due to the diversity, complexity, and irregularity of the cloth, it is very difficult to model and simulate the cloth. The current 3D clothing modeling, physical simulation, and rendering technology are limited, and it is difficult to realistically display the texture and wearing effect of the clothing cloth. At present, some virtual fitting products have been produced, but there are still some gaps between the simulation and fitting effects of fabrics and real fabrics. These unreal effects cannot be trusted by consumers, and many consumers cannot accept their own body’s benefits. A concrete form is presented on the screen [5]. Due to the above various reasons, although the 3D virtual fitting technology has made great progress, it has not yet been widely used. The current application forms of virtual fitting technology mainly include virtual fitting systems, virtual fitting mirrors, and virtual fitting systems based on mobile terminals [6]. The technical composition of the virtual fitting system generally includes three-dimensional human body measurement technology, digital fitting human body model, interactive stitching method of garment pieces, and virtual three-dimensional fitting simulation technology [7]. The measurement technology of three-dimensional human body uses more methods such as laser measurement method, moiré fringe measurement method, digital imaging fitting measurement method, and stereo camera measurement method [8]. There are many modeling methods for digital human body models, including the method of using B-spline surface modeling, the modeling method of constructing solid geometry, and the modeling method of polyhedron.The three-dimensional form of the garment is achieved by adding sewing force to the two-dimensional garment pattern’s stitching edge. The stitching edge between each design is set after importing the two-dimensional CAD garment pattern file. The stitching edge adds stitching force, after which the two-dimensional paper design is warped by the stitching force and the internal human body model to generate a three-dimensional garment shape, resulting in virtual fitting [9]. Virtual 3D fitting simulation technology is the current research hotspot and research difficulty in the field of graphics. It includes fabric simulation technology and 3D fitting effect simulation technology [10]. The application of cloth simulation technology will make the simulation effect of clothing cloth more realistic, but the diversity of textile materials, the complexity of material structure, and the irregularity of shapes, etc., all bring difficulties to the three-dimensional modeling and dynamic simulation of fabrics. There are many ways to model cloth, mainly including geometry-based modeling methods, physics-based modeling methods, and hybrid modeling methods, that use pure geometric transformation methods to simulate the deformation of some special cloths [11, 12] The combination of geometric modeling method and texture modeling method is used to realize the simulation of cloth wrinkle shape. Literature [13] proposes an implicit integral modeling method, which improves the speed of cloth physical simulation. Literature [14] combines the understanding of fabric yield state in textile materials science and establishes the corresponding model. Literature [15] proposes an effective simulation of nonstretchable cloth. Literature [16] proposes a fast and stable cloth animation algorithm. With the efforts of many experts and scholars, the current research on 3D clothing simulation technology has reached a high level. The simulation of some fabrics can achieve more realistic visual effects, but the simulation fidelity of daily clothing still has some gaps with the real objects. The dynamic simulation effect of clothing is an important link that affects the real degree of virtual fitting. The 3D dynamic simulation of flexible fabrics is still being studied. In addition, the establishment of 3D human models in the virtual fitting system began to focus on the fusion of real facial features [17] to enhance consumers’ sense of reality in virtual fitting.


## 3. 3D Simulation Technology

Tracking feature points of sequence images is an important application in the field of image processing. Through the understanding of the above optical flow method, the specific tracking description is as follows: we first determine the key points of the current frame image and predict the approximate location of the key points by comparing the gray images of adjacent frames. Then, the gray points whose positions remain unchanged are excluded, and the positions of the key points of the human body are obtained.The light intensity of a pixel in the image at timet is represented by I(x, y, t). After dt time to reach the next frame, the moving distance is (dx, dy). According to the principle of constant brightness assumed by the basic optical flow method, the light intensity of the pixel remains unchanged during the movement and the expression is as shown in formula (1). By Taylor expansion of this formula, the optical flow formula is obtained, as shown in formula (2).(1)Ix,y,t=Ix+dx,y+dy,t+dt,(2)∂I∂xdxdt+∂I∂ydydt+∂I∂tdtdt=0.We assume thatu=dx/dt and v=dy/dt, respectively, represent the optical flow vector of the image along the X axis and Y axis at the pixel. We assume that Iy=∂I/∂y,It=∂I/∂t, and Ix=∂I/∂x represent the partial derivatives along the X, Y, and Z directions, respectively. Then, the constraint formula of the optical flow method is expressed as follows [18]:(3)Ixu+Iyv+It=0.Here, the partial derivative can be obtained from the image data, but theu,v optical flow vector is not known. Therefore, it is necessary to add constraints again, and different constraints will lead to different optical flow field calculation methods.Kroeger et al. presented the Dense Inverse Search (DIS)-based technique, a dense optical flow calculation method with exceptionally low time complexity and competitive calculation accuracy. This kind of calculating technique offers a high rate of computation and a high level of resilience. At the same time, it tackles the optical flow algorithm’s frequent drawbacks of huge amounts of calculations, intricate calculations, and lengthy operating time. Thus, a balance between the accuracy of the algorithm operation and the time complexity is achieved.The additional constraint condition of the DIS algorithm is that the subregion blocks of the image maintain the spatial consistency of the block correspondence after instantaneous motion. Based on the corresponding relationship of the motion state of the pixels in the block, the corresponding component of the block is searched inversely. The original imageIt is θps×θps pixel size, the center position of a given image block T is x=x,yT, and the best matching subwindow of the next frame of the same size image It+1 is queried by the gradient descent method. By calculating the distortion vector u=u,v, the minimum error sum of squares of the image block T and the matching subwindow can be obtained and the calculation is shown in the following formula:(4)u=argminuT∑xIt+1x+uT−Tx2.Due to the nonlinearity of the minimization result of the previous formula, the inverse Lukas–Kanade local differential algorithm is used to optimize and update the distortion vectoru, u←u+Δu. This paper calculates formulas (4) and (5) alternately and iterates many times until the minimum value is closed.(5)Δu=argminΔuT∑xIt+1x+u+ΔuT−Tx2.The scale pyramid is used to aggregate image blocks, and the dense optical flow field is searched inversely. The expression is shown in the following formula:(6)Usx=1Z∑iNsλi,xmax1,dix2⋅ui.Here,Us is the dense optical flow field of each pixel x, dix is the grayscale difference between the image block T and the distorted image at pixel xdix=It+1x+ui−Tx, and ui represents the estimated distance of the search target image block i. The expression for standardized Z is as follows [19]:(7)Z=∑iλi,xmax1,dix2.The pixel energy of the image is refined, so that the optical flow can be searched quickly and the accuracy of the optical flowUs can be improved. The technique simplifies the refining procedure by following three rules: it does not use feature matching items, it uses pixel grayscale pictures, and it thins on the present scale. Formula (8) is the pixel energy calculation formula.(8)EU=∫ΩσψEI+ΓψEG+αψESdx.Here,Ω is the image domain, EIandEG are the weighted sum of pixel gray energy and gradient energy, respectively, ES is the standard displacement gradient. ES=∇u2+∇v2 is the smoothing term representing the penalty, and Ψa2=a2+ε2 represents the penalty function. The optical flow energy EU is a nonconvex function. It uses the super-relaxation iterative algorithm to quickly iterate to calculate its minimum point.The main principle of the Farneback optical flow method is to approximate the neighborhood value of the pixel to be detected by using an extended polynomial. Since the gray value of an image pixel can be represented by a two-dimensional variable $f(x, y)$, the approximate expression of the local coordinate system established with this point as the center is as follows:(9)fx,y=r1+r2x+r3y+r4x2+r5y2+r6xy=xyTr4r62r62r5xy+r2r3Txy+r1=xTAx+bTx+c.Here,A is a symmetric matrix, b is a vector, and c is a scalar. The rectangular area of the pixel point 2n+1 pixel side length is taken as the neighborhood. In order to ensure that the pixels closer to the center occupy more weight, the Farneback optical flow method approximates the pixel value of the area around the pixel through the weighted minimum mean square value, thereby determining the coefficient of the previous formula. The center pixel f1x is moved by d to obtain a new polynomial f2x.(10)f2x=f2x−d=x−dTA1x−d+b1Tx−d+c1=xTA2x−x2T+c2.Here, the coefficients of the same variable are equal, that is,A2=A1,b2=b1−2A1d,andc2=dTA1x−2b1Td+c1. Since A1 is not singular, the image global displacement d is calculated as follows [20]:(11)2A1d=b2−b1⇒d=−12A1−1b2−b1.The Farneback algorithm has accurate calculation results, has low error, and does not require the detection of scene space to be static, which is suitable for the needs of this paper to detect daily human motion videos.Affine transformation is the geometric mapping of a two-dimensional image in two different vector spaces, as shown by the formula∂I/∂xdx/dt+∂I/∂ydy/dt+∂I/∂tdt/dt=0, consisting of a nonsingular linear transformation and a translation.(12)y=fx=Ax+b.Here,A represents the linear transformation of the affine matrix, b represents the displacement, and f (x) represents the affine transformation function. Affine transformation is a kind of “rigid body transformation,” which is often used in image processing fields such as face alignment.The forward mapping warping algorithm is a direct mapping application from the source imagefu,v to the warped transformed image gx,y. Knowing the conversion relationship between the coordinate positions of the two images xu,v and yu,v, this paper directly maps the coordinates of the original image to the converted image in a point-to-point manner. The coordinates of the twisted point are usually irregular, and the new coordinate position is calculated by rounding approximately, as shown in Figure 1.Figure 1
Forward mapping distortion.The reverse mapping distortion algorithm is a reverse mapping method; that is, the conversion relationship between the coordinate positions of the two images is known, and the inverse mapping function is calculated. For each new coordinate point (x, y) of the distorted transformed image, this paper uses the inverse mapping functions u(x, y) and vx,y to find its corresponding position u,v on the original image one by one. According to the pixel mapping principle gx,y=fu,v, the new image pixel value is captured, as shown in Figure 2. If the coordinate point u,v calculated by the inverse mapping function is not on the grid, this paper uses the interpolation method to calculate the pixel value of the position.Figure 2
Inverse mapping distortion.We assume that we know the pixel values of four pointsQ11=x1,y1, Q12=x1,y2, Q21=x2,y1, and Q22=x2,y2 and find the pixel value of the last known function f at point P=x,y. This paper first performs linear calculation in the x direction, and the expression is shown in the following formulas:(13)fR1≈x2−xx2−x1fQ11+x−x1x2−x1fQ21,fR2≈x2−xx2−x1fQ12+x−x1x2−x1fQ22.Here,R1=x,y1andR2=x,y2. Calculating the linear value in the y direction, the expression is as follows:(14)fP≈y2−yy2−y1fR1+y−y1y2−y1fR2.The pixel valuefx,y of the required P point is obtained as follows:(15)fx,y≈fQ11x2−x1y2−y1x2−xy2−y+fQ21x2−x1y2−y1x−x1y2−y,+fQ12x2−x1y2−y1x2−xy−y1+fQ22x2−x1y2−y1x−x1y−y1.The mean shift algorithm (mean shift) is a clustering approach based on density. Using the gradient ascent approach, the programme repeatedly finds the local extreme points of the probability density function in the collected data using a sliding window. To determine the sample’s center point, the sliding window moves the mean centroid according to the probability density of its internal data. Unlike the K-means clustering approach, the mean shift algorithm may detect the number of classification clusters without knowing the number of classes in advance.For the sample setXx1,x2,…,xn, the algorithm randomly selects a point that has not been classified as the center point of Z and its basic formula is shown in the following formula:(16)mx=1K∑xi∈Shx−xi.Here,Sh is a high-dimensional spherical sliding window with X as the center point and h as the radius, k represents the number of sample points in the range of Sh, and xi represents all sample points in the Sh window. The obtained mx is the gradient of the probability density function, expressed as the mean drift vector, that is, the direction and size of the current center point X movement, as shown in the following formula:(17)xt+1=mt+xt.Here,Sh is the mean drift vector obtained in state t, xt is the center of Sh in state t, and xt+1 is the center of ShC in state t.The algorithm iteratively calculates formulas (12) and (13) until the value of m⟶t converges, at which time the center of a cluster C is obtained. The algorithm judges whether the distance between the current cluster C and other existing cluster centers is less than the threshold. If it is less, the clusters are merged. The algorithm repeats the above calculation steps until all points in the sample set are marked [21].Since the low-dimensional sample features are inseparable, the low-dimensional inseparable data are mapped to the high-dimensional space for segmentation. Here, the concept of kernel function is introduced in the mean shift, and the calculation of the inner product in the high-dimensional space is directly completed in the low-dimensional space, so that the point closer to the center of the high-dimensional sphere has a greater weight. The kernel density estimation method approximates the gradient of the probability density function of all samples in the bandwidth, as shown in the following formulas:(18)fx=1Nhd∑i=1NKx−xih,s.t.Kx≥0,∫RdKxdx=1.Here,h is the bandwidth and Kx is the kernel function. Generally, the kernel function satisfies the radial symmetry (Radially Symmetric), as shown in the following formula:(19)Kx=c⋅kx2.Here,Kx is the distribution function, and c is the normalization parameter. We bring the kernel function into the probability density function and then derivate it to get the following formula:(20)∇fx=2cNhd+2∑i=1Ngx−xih2mx.Here,gx=−k′x,mx is the mean shift vector as shown in the following formula:(21)mx=∑i=1Nxigx−xi/h2∑i=1Ngx−xi/h2−x.The overall frame diagram is shown in Figure3.Figure 3
Frame diagram of fast attitude based on optical flow.For the two-frame image difference processing, the average pixel intensity obtained can measure the degree of change of the two-frame image. These continuous video framesIt and It+1 calculate the interframe difference in turn, and the expression is shown in the following formula:(22)diffx,y=1,ifIt−It+1>0,0,else.Here, diff is the property that distinguishes consecutive frames. To get the average interframe difference intensity of the current frame, the algorithm divides the total of all components of diff by the number of image pixels, resulting in the video average interframe difference intensity sequence. As shown in Figure4, the algorithm performs downsampling of 0.75, 1.00, and 1.25 times on the input image and simulates the objects of different scales obtained by the retina mapping when the image gradually enters the human body, that is, the different degrees of image clarity. The algorithm applies three images to the PoseNet, PoseRefine, and ParsingRefine subnetworks, and it can obtain output feature heat maps of different scales [22].Figure 4
Multiscale JPPNet network structure diagram.The human mask image is input into the pose estimation network, and 16 channel feature maps are obtained. For each channel feature, there are several candidate points of human skeleton key points as shown in Figure5. The original JPPNet network uses the method of returning the maximum index to extract the key points of the channel characteristics. This paper sets up the key point correction module based on the temporal and spatial relationship characteristics of key frames. According to the trajectory of key points of the human body, the range of motion is divided and the candidate points with violent motion are further screened.Figure 5
Example diagram of channel feature candidate points.


### 3.1. Extraction of Candidate Points

The algorithm uses the mean shift algorithm to cluster the features of each channel and extracts several candidate feature points of the channel. After a lot of experimental verification, when all the elements of the feature map are less than the threshold 0.04, the network cannot accurately detect the key point. The calculation method of candidate points is as follows.First, the algorithm binarizes the channel feature mapF(x, y) as follows:(23)Fx,y=1,fx,y>0.04,0,else.After that, the algorithm builds a sample setX=x1,y1,x2,y2,…, where xi,yi represents all the coordinates where the value of Fxi,yi is 1. The algorithm randomly selects a point x1,y1 that is not classified as the center point of the first cluster of the sample set X. The algorithm uses the mean shift vector to iteratively calculate the sample set X until the value of mx,y is collected. At this time, the clustering center point C1 of the first cluster is obtained as x′,y′, as shown in the following formulas:(24)mx,y=∑i=1Nxi,yigxi,yi−x,y/h2∑i=1Ngxi,yi−x,y/h2−x,y,(25)x′,y′=mx,y+x,y.The algorithm repeats the above steps until the sample setX is completely classified, and the cluster center C=C1,C2,…T and cluster label Label=0,1,…T are obtained. Then, the algorithm maps the label of the sample set X to the feature map fx,y. In the same cluster of fx,y, the index of the maximum value of the feature map is found. The algorithm sorts the corresponding feature values of each cluster from large to small and then calculates the maximum point of each cluster of the feature map as the center point, and the new cluster center Center=Center1,Center2,… is obtained, that is, the set of all candidate points of the feature map.


### 3.2. Screening of Candidate Points

The identical key point of neighbouring key frames is generally maintained within a tolerable range of motion based on the timing relationship of adjacent key frames. If the distance range is exceeded, the algorithm analyses the intensity of the point’s motion using the frame difference approach to evaluate if the point’s motion condition is acceptable [23]. When the point’s motion state becomes inappropriate, the algorithm moves on to the next potential point and screens them in order. The specific screening process is as follows.The candidate point set isCenter=Center1,Center2,…, and the corresponding key points of two adjacent key frames are PointK−1 and PointK+1, respectively. The algorithm calculates the Euclidean distances dis1,dis2 between the key point and the first candidate point Center1. The Euclidean distance between the two key points of the pelvis PointK7, and the chest cavity PointK8 in the current frame is len=PointK7,PointK82÷2. Because the characters in adjacent key frames have similar actions, the candidate points will not deviate too far from the corresponding key points, that is, dis1 and dis2 will not be too large. Experiments verify that the posture estimation network can easily confuse the key points of the naked body of the human body (such as hands and feet) and there is a certain distance between the easy-to-confuse points. Comparing dis1,dis2, and len, the algorithm judges whether the movement of the point is abnormal. If both are greater than len, it is considered that the candidate point has a large motion range and an abnormal state, and further testing and judgment are required. Otherwise, the first candidate point Center is the key point, and the inspection is completed.For the abovementioned large-scale motion points that need to be further detected, there may be a situation where the character’s arm is suddenly waving in the dance video and the abovementioned candidate points for detection are reasonable at this time. In order to continue to detect the center, the algorithm uses the three-frame difference method to calculate the motion area of the current key frame character.(26)D1=1,IK−IK−1>0,0,else.D2=1,IK−IK+1>0,0,else.D=D1∩D2.Here,IK−1,IK,andIK+1 are three consecutive key frames, T is the set frame difference threshold, D1 is the binary difference image of IK−1 and IK, D2 is the binary difference image of IK and IK+1, and D is the binary description of the motion state of the current frame. A number of minimum rectangles are obtained by fitting the range of movement of the person through the binary difference graph D, which represents the rectangle area Contours=Cont1,Cont2,… of the person’s movement in the current frame. The algorithm checks whether the abnormal candidate point Center1 belongs to the rectangular contour Contours. If it belongs, the candidate point Center1 is the key point and the test ends. If it does not belong, the key point is wrong and the next candidate point Center2 is selected to perform the above comparison again.We assume that the target key point to be detected of the target key frameIK is Pointki, and IK, IK−1, and IK+1 are three consecutive key frames. Then, Flow1x,y=flowIK−1,IK and Flow2x,y=flowIK+1,IK, respectively, represent the forward and backward optical flow information of IK. Among them, flow is the optical flow function. The algorithm takes the rectangular area of the key point with a side length of 5 pixels as the neighborhood. This area block can maintain the consistency of the spatial relationship of the corresponding area block after instantaneous movement. Therefore, in this paper, the optical flow information of the 5 × 5 neighborhood is used to represent the movement information of the point. The expression is shown in the following formulas:(27)Flow1i¯x,y=125∑m=−22∑n=−22Flow1x+m,y+n,Flow2i¯x,y=125∑m=−22∑n=−22Flow2x+m,y+n.Here,Flow1i¯x,y and Flow2i¯x,y represent the average value of the forward and backward optical flow information of the key points PointK−1i and PointK+1i, respectively, in the 5 × 5 neighborhood.In the fusion of optical flow information and key point position information, the key point coordinates arePointK1i=PointK−1i+Flow1i¯x,yand PointK2i=PointK+1i+Flow1i¯x,y. In reference, the method of combining forward optical flow and backward optical flow can improve the accuracy of calculation. Therefore, in this paper, the two sets of key point coordinates are averaged and recorded as the detection point PointKi=PointK1i+PointK2i of the target key frame.Continuous video frames have strong spatiotemporal correlation, and adjacent frames express similar content and have a lot of redundant information.Figure6 shows an example of the spatiotemporal characteristics of a video sequence. Figure 6(a) is a group of adjacent video frames, Figure 6(b) shows all the key points of the human body posture, and Figure 6(c) shows the displacement vector of the key points corresponding to the two adjacent frames. If a key point is not represented, it signifies there is no movement at that location. The displacement distance between the key points of subsequent frames is extremely short, or there is no translation movement. As a result, it is assumed that consecutive frames include a lot of duplicate data. If each frame of an image is processed using the depth technique, a considerable quantity of duplicated information will be identified, resulting in inefficient use of computer resources. This study employs the Farneback optical flow technique to transport key frame information to surrounding nonkey frames in order to intelligently allocate system computing resources. The optical flow calculation time must be less than the calculation time of the deep convolutional network. Therefore, the application of Farneback optical flow method can greatly improve the calculation efficiency of the attitude estimation system.Figure 6
An example diagram of the spatiotemporal characteristics of a video sequence. (a) Input video frame sequence. (b) Human posture. (c) Key point displacement vector.
(a)(b)(c)In order to reduce the resource consumption of the algorithm in this paper, the algorithm needs to reduce the frequency of key frame detection and increase the segmentation step length of two adjacent key frames. In order to maintain the calculation accuracy, the algorithm sets the key frame as the intermediate frame and uses the optical flow method to track the key points of the nonkey frames before and after.We assume that the adjacent nonkey frame of the key frameIt is It+1, and the optical flow information is expressed as Flow1x,y=flowIt+1,It. The motion information of the key point Pointti,i=1,2,…,16 is replaced with the optical flow information in its 5 × 5 neighborhood.Then, the optical flow information at this point can be expressed by the mean value of the optical flow information in the 5 × 5 neighborhood at the key pointPointti as(28)Flow¯1ix,y=125∑m=−22∑n=−22Flow2x+m,y+n.The algorithm fuses the optical flow information and position information of the key point to predict the position of the key point in the adjacent nonkey frame:(29)Pointt+1i=Pointti+Flow¯2jx,y.By analogy, a complete human body posture sequence is obtained.


## 3.1. Extraction of Candidate Points

The algorithm uses the mean shift algorithm to cluster the features of each channel and extracts several candidate feature points of the channel. After a lot of experimental verification, when all the elements of the feature map are less than the threshold 0.04, the network cannot accurately detect the key point. The calculation method of candidate points is as follows.First, the algorithm binarizes the channel feature mapF(x, y) as follows:(23)Fx,y=1,fx,y>0.04,0,else.After that, the algorithm builds a sample setX=x1,y1,x2,y2,…, where xi,yi represents all the coordinates where the value of Fxi,yi is 1. The algorithm randomly selects a point x1,y1 that is not classified as the center point of the first cluster of the sample set X. The algorithm uses the mean shift vector to iteratively calculate the sample set X until the value of mx,y is collected. At this time, the clustering center point C1 of the first cluster is obtained as x′,y′, as shown in the following formulas:(24)mx,y=∑i=1Nxi,yigxi,yi−x,y/h2∑i=1Ngxi,yi−x,y/h2−x,y,(25)x′,y′=mx,y+x,y.The algorithm repeats the above steps until the sample setX is completely classified, and the cluster center C=C1,C2,…T and cluster label Label=0,1,…T are obtained. Then, the algorithm maps the label of the sample set X to the feature map fx,y. In the same cluster of fx,y, the index of the maximum value of the feature map is found. The algorithm sorts the corresponding feature values of each cluster from large to small and then calculates the maximum point of each cluster of the feature map as the center point, and the new cluster center Center=Center1,Center2,… is obtained, that is, the set of all candidate points of the feature map.


## 3.2. Screening of Candidate Points

The identical key point of neighbouring key frames is generally maintained within a tolerable range of motion based on the timing relationship of adjacent key frames. If the distance range is exceeded, the algorithm analyses the intensity of the point’s motion using the frame difference approach to evaluate if the point’s motion condition is acceptable [23]. When the point’s motion state becomes inappropriate, the algorithm moves on to the next potential point and screens them in order. The specific screening process is as follows.The candidate point set isCenter=Center1,Center2,…, and the corresponding key points of two adjacent key frames are PointK−1 and PointK+1, respectively. The algorithm calculates the Euclidean distances dis1,dis2 between the key point and the first candidate point Center1. The Euclidean distance between the two key points of the pelvis PointK7, and the chest cavity PointK8 in the current frame is len=PointK7,PointK82÷2. Because the characters in adjacent key frames have similar actions, the candidate points will not deviate too far from the corresponding key points, that is, dis1 and dis2 will not be too large. Experiments verify that the posture estimation network can easily confuse the key points of the naked body of the human body (such as hands and feet) and there is a certain distance between the easy-to-confuse points. Comparing dis1,dis2, and len, the algorithm judges whether the movement of the point is abnormal. If both are greater than len, it is considered that the candidate point has a large motion range and an abnormal state, and further testing and judgment are required. Otherwise, the first candidate point Center is the key point, and the inspection is completed.For the abovementioned large-scale motion points that need to be further detected, there may be a situation where the character’s arm is suddenly waving in the dance video and the abovementioned candidate points for detection are reasonable at this time. In order to continue to detect the center, the algorithm uses the three-frame difference method to calculate the motion area of the current key frame character.(26)D1=1,IK−IK−1>0,0,else.D2=1,IK−IK+1>0,0,else.D=D1∩D2.Here,IK−1,IK,andIK+1 are three consecutive key frames, T is the set frame difference threshold, D1 is the binary difference image of IK−1 and IK, D2 is the binary difference image of IK and IK+1, and D is the binary description of the motion state of the current frame. A number of minimum rectangles are obtained by fitting the range of movement of the person through the binary difference graph D, which represents the rectangle area Contours=Cont1,Cont2,… of the person’s movement in the current frame. The algorithm checks whether the abnormal candidate point Center1 belongs to the rectangular contour Contours. If it belongs, the candidate point Center1 is the key point and the test ends. If it does not belong, the key point is wrong and the next candidate point Center2 is selected to perform the above comparison again.We assume that the target key point to be detected of the target key frameIK is Pointki, and IK, IK−1, and IK+1 are three consecutive key frames. Then, Flow1x,y=flowIK−1,IK and Flow2x,y=flowIK+1,IK, respectively, represent the forward and backward optical flow information of IK. Among them, flow is the optical flow function. The algorithm takes the rectangular area of the key point with a side length of 5 pixels as the neighborhood. This area block can maintain the consistency of the spatial relationship of the corresponding area block after instantaneous movement. Therefore, in this paper, the optical flow information of the 5 × 5 neighborhood is used to represent the movement information of the point. The expression is shown in the following formulas:(27)Flow1i¯x,y=125∑m=−22∑n=−22Flow1x+m,y+n,Flow2i¯x,y=125∑m=−22∑n=−22Flow2x+m,y+n.Here,Flow1i¯x,y and Flow2i¯x,y represent the average value of the forward and backward optical flow information of the key points PointK−1i and PointK+1i, respectively, in the 5 × 5 neighborhood.In the fusion of optical flow information and key point position information, the key point coordinates arePointK1i=PointK−1i+Flow1i¯x,yand PointK2i=PointK+1i+Flow1i¯x,y. In reference, the method of combining forward optical flow and backward optical flow can improve the accuracy of calculation. Therefore, in this paper, the two sets of key point coordinates are averaged and recorded as the detection point PointKi=PointK1i+PointK2i of the target key frame.Continuous video frames have strong spatiotemporal correlation, and adjacent frames express similar content and have a lot of redundant information.Figure6 shows an example of the spatiotemporal characteristics of a video sequence. Figure 6(a) is a group of adjacent video frames, Figure 6(b) shows all the key points of the human body posture, and Figure 6(c) shows the displacement vector of the key points corresponding to the two adjacent frames. If a key point is not represented, it signifies there is no movement at that location. The displacement distance between the key points of subsequent frames is extremely short, or there is no translation movement. As a result, it is assumed that consecutive frames include a lot of duplicate data. If each frame of an image is processed using the depth technique, a considerable quantity of duplicated information will be identified, resulting in inefficient use of computer resources. This study employs the Farneback optical flow technique to transport key frame information to surrounding nonkey frames in order to intelligently allocate system computing resources. The optical flow calculation time must be less than the calculation time of the deep convolutional network. Therefore, the application of Farneback optical flow method can greatly improve the calculation efficiency of the attitude estimation system.Figure 6
An example diagram of the spatiotemporal characteristics of a video sequence. (a) Input video frame sequence. (b) Human posture. (c) Key point displacement vector.
(a)(b)(c)In order to reduce the resource consumption of the algorithm in this paper, the algorithm needs to reduce the frequency of key frame detection and increase the segmentation step length of two adjacent key frames. In order to maintain the calculation accuracy, the algorithm sets the key frame as the intermediate frame and uses the optical flow method to track the key points of the nonkey frames before and after.We assume that the adjacent nonkey frame of the key frameIt is It+1, and the optical flow information is expressed as Flow1x,y=flowIt+1,It. The motion information of the key point Pointti,i=1,2,…,16 is replaced with the optical flow information in its 5 × 5 neighborhood.Then, the optical flow information at this point can be expressed by the mean value of the optical flow information in the 5 × 5 neighborhood at the key pointPointti as(28)Flow¯1ix,y=125∑m=−22∑n=−22Flow2x+m,y+n.The algorithm fuses the optical flow information and position information of the key point to predict the position of the key point in the adjacent nonkey frame:(29)Pointt+1i=Pointti+Flow¯2jx,y.By analogy, a complete human body posture sequence is obtained.


## 4. Customized Clothing Design Based on Intelligent 3D Simulation Technology

The clothing customization system includes four levels: computer network and operating system, database management, clothing customization platform software, and user interface. The architecture of the system is shown in Figure7.Figure 7
System architecture.This paper links CRM, ASP, CAD, design knowledge base, and PDM through a networked integrated platform to realize the sharing of design resources. It includes four levels: module layer, system layer, application layer, and client layer. Enterprise customers can upload new designs developed by the company through the system to expand the resource library, as shown in Figure8.Figure 8
The overall frame structure of the integrated platform.Figure9 shows an example of customized clothing design based on intelligent 3D simulation technology. Among them, Figure 9(a) is the model selected by the user according to their own conditions, and Figure 9(b) shows the 3D simulation effect of the customized clothing.Figure 9
An example of customized clothing design based on intelligent 3D simulation technology. (a) Mannequin and (b) the model’s fitting effect.
(a)(b)The effect of the customized clothing design system based on intelligent 3D simulation technology is verified on the basis of the above research, and the clothing customization effect of the system in this paper is counted through multiple sets of clothing customization experiments, yielding the results shown in Table1 and Figure 10.Table 1
Verification data of customization effect of customized clothing design system based on intelligent 3D simulation technology.
NUMCustom effectNUMCustom effectNUMCustom effect189.501989.743692.48279.202079.193781.22382.432191.693881.33488.752293.523990.02580.042380.554084.26678.312485.384189.81793.882586.064289.82879.222684.844378.68993.832792.324492.231088.222879.504588.821179.692983.684684.731281.443086.614786.681389.743184.094890.911483.453286.584989.481590.093392.395087.211679.193486.585183.171791.213578.805288.471891.80Figure 10
Statistical diagram of clothing customization effect.Through the above experimental research, it can be seen that the customized clothing design system based on intelligent 3D simulation technology proposed in this paper has good effects and can effectively improve the service quality of online customized clothing.


## 5. Conclusion

The creation of unique clothing styles necessitates the use of a three-dimensional virtual clothing preprocessing technique to analyse three-dimensional human body data and create an initial clothing prototype. The point set on the first clothing prototype is the result of the 3D virtual clothing preprocessing module, and the point set is structured in a certain manner and saved in a file, which helps the 3D virtual clothing generating system’s future modules. Preprocessing 3D virtual clothing not only provides statistics to the clothing production process, but it also determines the expansion direction of the human body point to the point on the clothing, improving the efficiency of clothing development and presentation. This paper combines the intelligent 3D simulation technology to study the customized clothing design system and builds an intelligent clothing design system to help customers customize clothing online and improve the effect of remote clothing customization. Through experimental research, it can be seen that the customized clothing design system based on intelligent 3D simulation technology proposed in this paper has good effects and can effectively improve the service quality of online customized clothing.



---

*Source: 6140915-2022-06-24.xml*