CN106971199A - A kind of automatic classification method of fabric three-dimensional draping shape - Google Patents

A kind of automatic classification method of fabric three-dimensional draping shape Download PDF

Info

Publication number
CN106971199A
CN106971199A CN201710141486.4A CN201710141486A CN106971199A CN 106971199 A CN106971199 A CN 106971199A CN 201710141486 A CN201710141486 A CN 201710141486A CN 106971199 A CN106971199 A CN 106971199A
Authority
CN
China
Prior art keywords
dimensional
fabric
point
pendency
feature outlines
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Granted
Application number
CN201710141486.4A
Other languages
Chinese (zh)
Other versions
CN106971199B (en
Inventor
毋戈
钟跃崎
李端
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Donghua University
Original Assignee
Donghua University
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Donghua University filed Critical Donghua University
Priority to CN201710141486.4A priority Critical patent/CN106971199B/en
Publication of CN106971199A publication Critical patent/CN106971199A/en
Application granted granted Critical
Publication of CN106971199B publication Critical patent/CN106971199B/en
Expired - Fee Related legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Classifications

    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F18/00Pattern recognition
    • G06F18/20Analysing
    • G06F18/24Classification techniques

Landscapes

  • Engineering & Computer Science (AREA)
  • Data Mining & Analysis (AREA)
  • Theoretical Computer Science (AREA)
  • Computer Vision & Pattern Recognition (AREA)
  • Bioinformatics & Cheminformatics (AREA)
  • Bioinformatics & Computational Biology (AREA)
  • Artificial Intelligence (AREA)
  • Evolutionary Biology (AREA)
  • Evolutionary Computation (AREA)
  • Physics & Mathematics (AREA)
  • General Engineering & Computer Science (AREA)
  • General Physics & Mathematics (AREA)
  • Life Sciences & Earth Sciences (AREA)
  • Image Processing (AREA)
  • Image Analysis (AREA)

Abstract

The invention provides a kind of automatic classification method of fabric three-dimensional draping shape, it is characterised in that comprises the following steps:The pendency feature outlines of fabric three-dimensional draping shape are extracted, oval Fourier's description is carried out to the pendency feature outlines of three-dimensional drape form;Oval Fourier's description is carried out to the pendency feature outlines of the three-dimensional drape form of M sample in scanning fabric draping database, use is classified automatically without the hierarchy clustering method of given cluster number to three dimensional fabric overhang profiles line.The invention provides a kind of parametrization of general three dimensional fabric draping shape and automatic classification method, effectively clustering information can be extracted from three dimensional fabric draping shape, automatic classification is completed, so as to more comprehensive and accurate the relation analyzed between fabric draping form and physical property.

Description

A kind of automatic classification method of fabric three-dimensional draping shape
Technical field
The present invention relates to a kind of automatic classification method of fabric three-dimensional draping shape, for obtaining big by spatial digitizer After the threedimensional model for measuring true fabric draping, parameter processing is carried out to it and classified automatically, so as to serve fabric property Analysis, the reconstruction of virtual fabric and dress designing etc..
Background technology
The current test analysis to fabric static drape performance, which is concentrated mainly on, utilizes its plane projection to carry out image procossing. Because this method can not reflect the three-dimensional configuration feature of fabric completely, therefore with larger limitation.More for example have The fabric of similar suspended coefficient and node number but has entirely different physical property.
With the popularization of spatial digitizer so that the scanning to a large amount of true fabric drapings is possibly realized.At present, obtaining And establish three dimensional fabric pendency database after, have no idea realize classification.
The content of the invention
The purpose of the present invention is:Three-dimensional drape form to fabric carries out automatic Classification and Identification.
In order to achieve the above object, the technical scheme is that there is provided automatic point of a kind of fabric three-dimensional draping shape Class method, it is characterised in that comprise the following steps:
Step 1, the pendency feature outlines for extracting fabric three-dimensional draping shape, comprise the following steps:
Step 1.1, calculating fabric three-dimensional draping shape PdIn XDOoYDTwo-dimensional projection P in plane1=f1(Pd, Zmax), ZmaxIt is fabric three-dimensional draping shape PdMaximum coordinate value among on Z axis, f1(Pd, Zmax) it is by z < ZmaxFabric three-dimensional pendency Form PdThree dimensional point cloud project to XDOoYDTo obtain two-dimensional projection P in plane1Two-dimentional cloud data function;
Step 1.2, calculating two-dimensional projection P12-d contour C0=f2(P1), f2(P1) it is to calculate two-dimensional projection P1Two Tie up the function of contour line;
Calculate two-dimensional projection P1Summit V0=f3(C0), f3(C0) it is to calculate 2-d contour C0Summit function;
Step 1.3, pass through summit V0Coordinated indexing go out it in fabric three-dimensional draping shape PdIn corresponding summit V1, and Calculate V1In min coordinates value Z on Z axismin
Step 1.4, the horizontal two-dimension contour line C for calculating three dimensional fabric pendencyi=f2(f1(Pd, Zi)), i=1 ..., 9,Z0For parameter set in advance;
Step 1.5, make 2-d contour C0The Z coordinate of upper point is 200, horizontal two-dimension contour line CiThe Z coordinate of upper point is Zi, then 2-d contour C0With horizontal two-dimension contour line CiAs fabric three-dimensional draping shape PdFeature outlines;
Step 2, the pendency feature outlines to three-dimensional drape form carry out oval Fourier and described, in the form of row vector (A0, B0, C0, D0, A1, B1, C1, D1... ..., An, Bn, Cn, Dn... ..., AN, BN, CN, DN) describe in contour curve, formula, n tables Show overtone order, N represents maximum overtone order, An、BnRespectively pendency feature outlines are in projection plane XDOoYDX-direction N-th harmonic oval coefficient, Cn、DnRespectively pendency feature outlines are in projection plane XDOoYDY direction n-th The oval coefficient of harmonic wave;
Step 3, the pendency feature outlines to the three-dimensional drape form of M sample in scanning fabric draping database are carried out Oval Fourier's description, obtains matrix EFDs:
In formula, AMN, BMN, CMN, DMNRepresent m-th sample The oval coefficient of the n-th harmonic wave of the pendency feature outlines of this three-dimensional drape form, calculates EEFDsCovariance matrix Characteristic value is adjacent with feature, EEFDsFor oval Fourier descriptor, preceding k eigenvalue of maximum is constituted into projection matrix T4N×k, then Obtain matrix EFDs k principal component PCs=EEFDs×T4N×k, k≤4N;
Step 4, the principal component obtained according to step 3, use is without the given hierarchy clustering method for clustering number to three-dimensional Fabric draping contour line is classified automatically.
Preferably, the An, Bn, Cn, DnCalculation procedure be:
For pendency feature outlines, with it in XDOoYDThe X of planeDMinimum coordinate points on axle are starting point, using ellipse Circle Fourier methods are described as:
In formula, A0、C0Respectively in pendency feature outlines X, the y-coordinate of heart point, t are the arc length risen between point-to-point P of pendency feature outlines, and T is contour curve girth, and x (t) is t Functional relation between x coordinate, y (t) is the functional relation between t and y-coordinate;
An、BnIt is to dangle feature outlines in projection plane XDOoYDX-direction n-th harmonic oval coefficient, meter Calculation method is:
Cn、DnRespectively pendency feature outlines are in projection plane XDOoYDY direction n-th harmonic oval system Count, computational methods are:
In formula, K is total for pendency feature outlines sampled point Number, Δ xPFor pendency feature outlines on point P to point P+1 distance in XDThe displacement of direction of principal axis, Δ yPFor pendency feature contour The distance of point P to point P+1 on line is in YDThe displacement of direction of principal axis, Δ tPFor pendency feature outlines on point P to point P+1 away from From that is,
A0、C0Respectively dangle x, the y-coordinate of feature outlines central point, and computational methods are:
In formula:
And ε11=0.
Preferably, the step 4 comprises the following steps:
Step 4.1, each sample is classified as a class, calculates the distance between each two class, that is, sample and sample it Between similarity, wherein the distance between r classes and s classes are d (r, s), then have:
In formula, TrsIt is the Euclidean distance sum of all samples between any two in r classes and s classes, NrAnd NsNumber of samples in r classes and s classes respectively;
Step 4.2, nearest two classes between each class are found, they are classified as a class;
Step 4.3, recalculate similarity between this newly-generated class and each old class;
Step 4.4, repeat step 4.2 and step 4.3 are all classified as a class until all sample points, terminate.
, can be effective the invention provides a kind of parametrization of general three dimensional fabric draping shape and automatic classification method Ground extracts clustering information from three dimensional fabric draping shape, completes automatic classification, is knitted so as to more comprehensive and accurate analyze Relation between thing draping shape and physical property.
Brief description of the drawings
Fig. 1 (a) to Fig. 1 (c) is three dimensional fabric pendency indicatrix schematic diagram;
Fig. 2 is the cluster result that three dimensional fabric dangles;
Fig. 3 is the overhang profiles in class 1 near classification center;
Fig. 4 is the overhang profiles in class 2 near classification center;
Fig. 5 is the overhang profiles in class 3 near classification center;
Fig. 6 is the overhang profiles in class 4 near classification center;
Fig. 7 is the overhang profiles in class 5 near classification center.
Embodiment
With reference to specific embodiment, the present invention is expanded on further.It should be understood that these embodiments are merely to illustrate the present invention Rather than limitation the scope of the present invention.In addition, it is to be understood that after the content of the invention lectured has been read, people in the art Member can make various changes or modifications to the present invention, and these equivalent form of values equally fall within the application appended claims and limited Scope.
A kind of automatic classification method for fabric three-dimensional draping shape that the present invention is provided, comprises the following steps:
Step 1, the pendency feature outlines for extracting fabric three-dimensional draping shape, comprise the following steps:
Step 1.1, calculating fabric three-dimensional draping shape PdIn XDOoYDTwo-dimensional projection P in plane1=f1(Pd, Zmax), ZmaxIt is fabric three-dimensional draping shape PdMaximum coordinate value among on Z axis, f1(Pd, Zmax) it is by z < ZmaxFabric three-dimensional pendency Form PdThree dimensional point cloud project to XDOoYDTo obtain two-dimensional projection P in plane1Two-dimentional cloud data function, such as scheme Shown in 1 (a);
Step 1.2, calculating two-dimensional projection P12-d contour C0=f2(P1), f2(P1) it is to calculate two-dimensional projection P1Two Tie up the function of contour line;
Calculate two-dimensional projection P1Summit V0=f3(C0), f3(C0) it is to calculate 2-d contour C0Summit function;
Step 1.3, pass through summit V0Coordinated indexing go out it in fabric three-dimensional draping shape PdIn corresponding summit V1, and Calculate V1In min coordinates value Z on Z axismin, such as shown in Fig. 1 (a);
Step 1.4, the horizontal two-dimension contour line C for calculating three dimensional fabric pendencyi=f2(f1(Pd, Zi)), i=1 ..., 9,Z0For parameter set in advance;
Step 1.5, make 2-d contour C0The Z coordinate of upper point is 200, horizontal two-dimension contour line CiThe Z coordinate of upper point is Zi, then 2-d contour C0With horizontal two-dimension contour line CiAs fabric three-dimensional draping shape PdFeature outlines, such as Fig. 1 (b) And shown in Fig. 1 (c);
Step 2, the pendency feature outlines to three-dimensional drape form carry out oval Fourier and described, in the form of row vector (A0, B0, C0, D0, A1, B1, C1, D1... ..., An, Bn, Cn, Dn... ..., AN, BN, CN, DN) describe in contour curve, formula, n tables Show overtone order, N represents maximum overtone order, An、BnRespectively pendency feature outlines are in projection plane XDOoYDX-direction N-th harmonic oval coefficient, Cn、DnRespectively pendency feature outlines are in projection plane XDOoYDY direction n-th The oval coefficient of harmonic wave;
An, Bn, Cn, DnCalculation procedure be:
For pendency feature outlines, with it in XDOoXDThe X of planeDMinimum coordinate points on axle are starting point, using ellipse Circle Fourier methods are described as:
In formula, A0、C0Respectively in pendency feature outlines X, the y-coordinate of heart point, t are the arc length risen between point-to-point P of pendency feature outlines, and T is contour curve girth, and x (t) is t Functional relation between x coordinate, y (t) is the functional relation between t and y-coordinate;
An、BnIt is to dangle feature outlines in projection plane YDOoYDX-direction n-th harmonic oval coefficient, meter Calculation method is:
Cn、DnRespectively pendency feature outlines are in projection plane XDOoYDY direction n-th harmonic oval system Count, computational methods are:
In formula, K is total for pendency feature outlines sampled point Number, Δ xPFor pendency feature outlines on point P to point P+1 distance in XDThe displacement of direction of principal axis, Δ yPFor pendency feature contour The distance of point P to point P+1 on line is in YDThe displacement of direction of principal axis, Δ tPFor pendency feature outlines on point P to point P+1 away from From that is,
A0、C0Respectively dangle x, the y-coordinate of feature outlines central point, and computational methods are:
In formula:
And ε11=0.
Step 3, the pendency feature outlines to the three-dimensional drape form of M sample in scanning fabric draping database are carried out Oval Fourier's description, obtains matrix EFDs:
In formula, AMN, BMN, CMN, DMNRepresent m-th sample The oval coefficient of the n-th harmonic wave of the pendency feature outlines of this three-dimensional drape form, calculates EEFDsCovariance matrix Characteristic value is adjacent with feature, EEFDsOval Fourier descriptor, projection matrix T is constituted by preceding k eigenvalue of maximum4N×k, then To matrix EFDs k principal component PCs=EEFDs×T4N×k, k≤4N;
Step 4, the principal component obtained according to step 3, use is without the given hierarchy clustering method for clustering number to three-dimensional Fabric draping contour line is classified automatically.Step 4 comprises the following steps:
Step 4.1, each sample is classified as a class, calculates the distance between each two class, that is, sample and sample it Between similarity, wherein the distance between r classes and s classes are d (r, s), then have:
In formula, TrsIt is the Euclidean distance sum of all samples between any two in r classes and s classes, NrAnd NsNumber of samples in r classes and s classes respectively;
Step 4.2, nearest two classes between each class are found, they are classified as a class;
Step 4.3, recalculate similarity between this newly-generated class and each old class;
Step 4.4, repeat step 4.2 and step 4.3 are all classified as a class until all sample points, terminate.
The present invention is illustrated with the sample of four kinds of unlike materials, and the basic performance of fabric sample is as shown in table 1.Survey Before examination, all static flattening of all samples is placed on 24 hours in the environment of relative humidity 65 ± 2%, 20 ± 2 DEG C of temperature.
The basic performance of the fabric sample of table 1
The woolen automatic classification results of draping shape of cotton, flax, silk, sample are as shown in Fig. 2 and table 2.
The class statistic result of the three dimensional fabric of table 2 pendency
Cluster result can be divided into obvious 5 major class as seen in Figure 2, all kinds of to account for sample total respectively 25.0%th, 31.8%, 11.4%, 27.3% and 4.5%.It can be seen from Table 2 that class 1 is main by low suspended coefficient and low node The pendency composition of number;Class 2 is mainly made up of the pendency of low suspended coefficient and high node number;Class 3 is main by high suspended coefficient Constituted with the pendency of high node number;Class 4 is mainly made up of the pendency of high suspended coefficient and low node number;Class 5 only has two Sample, for other samples, they have maximum suspended coefficient and minimum node number.In addition, we can also see Go out silk and principally fall into the 2nd class, and flax principally falls into the 4th class.Fig. 3 to 7 provide respectively it is all kinds of near classification center Overhang profiles.

Claims (3)

1. a kind of automatic classification method of fabric three-dimensional draping shape, it is characterised in that comprise the following steps:
Step 1, the pendency feature outlines for extracting fabric three-dimensional draping shape, comprise the following steps:
Step 1.1, calculating fabric three-dimensional draping shape PdIn XDOoYDTwo-dimensional projection P in plane1=f1(Pd, Zmax), ZmaxIt is to knit Thing three-dimensional drape form PdMaximum coordinate value among on Z axis, f1(Pd, Zmax) it is by z < ZmaxFabric three-dimensional draping shape Pd's Three dimensional point cloud projects to XDOoYDTo obtain two-dimensional projection P in plane1Two-dimentional cloud data function;
Step 1.2, calculating two-dimensional projection P12-d contour C0=f2(P1), f2(P1) it is to calculate two-dimensional projection P1Two dimension wheel The function of profile;
Calculate two-dimensional projection P1Summit V0=f3(C0), f3(C0) it is to calculate 2-d contour C0Summit function;
Step 1.3, pass through summit V0Coordinated indexing go out it in fabric three-dimensional draping shape PdIn corresponding summit V1, and calculate Go out V1In min coordinates value Z on Z axismin
Step 1.4, the horizontal two-dimension contour line C for calculating three dimensional fabric pendencyi=f2(f1(Pd, Zi)), i=1 ..., 9,Z0For parameter set in advance;
Step 1.5, make 2-d contour C0The Z coordinate of upper point is 200, horizontal two-dimension contour line CiThe Z coordinate of upper point is Zi, then 2-d contour C0With horizontal two-dimension contour line CiAs fabric three-dimensional draping shape PdFeature outlines;
Step 2, the pendency feature outlines to three-dimensional drape form carry out oval Fourier and described, (the A in the form of row vector0, B0, C0, D0, A1, B1, C1, D1... ..., An, Bn, Cn, Dn... ..., AN, BN, CN, DN) describe in contour curve, formula, n represents humorous Ripple number of times, N represents maximum overtone order, An、BnRespectively pendency feature outlines are in projection plane XDOoYDX-direction The oval coefficient of nth harmonic, Cn、DnRespectively pendency feature outlines are in projection plane XDOoYDY direction n-th harmonic Oval coefficient;
Step 3, the pendency feature outlines to the three-dimensional drape form of M sample in scanning fabric draping database carry out oval Fourier describes, and obtains matrix EFDs:
In formula, AMN, BMN, CMN, DMNRepresent m-th sample The oval coefficient of the n-th harmonic wave of the pendency feature outlines of three-dimensional drape form, calculates EEFDsCovariance matrix feature It is worth, E adjacent with featureEFDsFor oval Fourier descriptor, preceding k eigenvalue of maximum is constituted into projection matrix T4N×k, then obtain Matrix EFDs k principal component PCs=EEFDs×T4N×k, k≤4N;
Step 4, the principal component obtained according to step 3, use is without the given hierarchy clustering method for clustering number to three dimensional fabric Overhang profiles line is classified automatically.
2. a kind of automatic classification method of fabric three-dimensional draping shape as claimed in claim 1, it is characterised in that the An, Bn, Cn, DnCalculation procedure be:
For pendency feature outlines, with it in XDOoYDThe X of planeDMinimum coordinate points on axle are starting point, using oval Fu In leaf method be described as:
x ( t ) = A 0 + Σ n = 1 N [ A n c o s ( 2 π n t T ) + B n s i n ( 2 π n t T ) ] ;
In formula, A0、C0Respectively dangle feature outlines central point X, y-coordinate, t is the arc length risen between point-to-point P of pendency feature outlines, and T is contour curve girth, and x (t) is that t and x are sat Functional relation between mark, y (t) is the functional relation between t and y-coordinate;
An、BnIt is to dangle feature outlines in projection plane XDOoYDX-direction n-th harmonic oval coefficient, calculating side Method is:
A n = T 2 π 2 n 2 Σ P = 1 K Δx P Δt P ( c o s 2 πnt P T - c o s 2 πnt P - 1 T ) ;
B n = T 2 π 2 n 2 Σ P = 1 K Δx P Δt P ( sin 2 πnt P T - sin 2 πnt P - 1 T ) ;
Cn、DnRespectively pendency feature outlines are in projection plane XDOoYDY direction n-th harmonic oval coefficient, meter Calculation method is:
C n = T 2 π 2 n 2 Σ P = 1 K Δy P Δt P ( c o s 2 πnt P T - c o s 2 πnt P - 1 T ) ;
In formula, K is the sum of pendency feature outlines sampled point, ΔxPFor pendency feature outlines on point P to point P+1 distance in XDThe displacement of direction of principal axis, Δ yPFor pendency feature outlines On point P to point P+1 distance in YDThe displacement of direction of principal axis, Δ tPFor pendency feature outlines on point P to point P+1 distance, I.e.
A0、C0Respectively dangle x, the y-coordinate of feature outlines central point, and computational methods are:
A 0 = 1 T Σ P = 1 K [ Δx P 2 Δt P ( t P 2 - t P - 1 2 ) + ϵ ( t P - t P - 1 ) ] ;
In formula:
ϵ P = Σ j = 1 P - 1 Δx j - Δx P Δt P Σ j = 1 P - 1 Δt j ;
And ε11=0.
3. a kind of automatic classification method of fabric three-dimensional draping shape as claimed in claim 1, it is characterised in that the step 4 comprise the following steps:
Step 4.1, each sample is classified as a class, calculates the distance between each two class, that is, between sample and sample Similarity, wherein the distance between r classes and s classes are d (r, s), then has:
In formula, TrsIt is r classes and the Euclidean distance sum of all samples between any two, N in s classesrWith NsNumber of samples in r classes and s classes respectively;
Step 4.2, nearest two classes between each class are found, they are classified as a class;
Step 4.3, recalculate similarity between this newly-generated class and each old class;
Step 4.4, repeat step 4.2 and step 4.3 are all classified as a class until all sample points, terminate.
CN201710141486.4A 2017-03-10 2017-03-10 A kind of automatic classification method of fabric three-dimensional draping shape Expired - Fee Related CN106971199B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201710141486.4A CN106971199B (en) 2017-03-10 2017-03-10 A kind of automatic classification method of fabric three-dimensional draping shape

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201710141486.4A CN106971199B (en) 2017-03-10 2017-03-10 A kind of automatic classification method of fabric three-dimensional draping shape

Publications (2)

Publication Number Publication Date
CN106971199A true CN106971199A (en) 2017-07-21
CN106971199B CN106971199B (en) 2019-11-08

Family

ID=59330187

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201710141486.4A Expired - Fee Related CN106971199B (en) 2017-03-10 2017-03-10 A kind of automatic classification method of fabric three-dimensional draping shape

Country Status (1)

Country Link
CN (1) CN106971199B (en)

Cited By (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN108256529A (en) * 2017-11-29 2018-07-06 深圳慎始科技有限公司 Global point cloud based on Dian Yun projected outlines signature and distribution matrix describes method
CN108765547A (en) * 2018-04-23 2018-11-06 北京林业大学 A kind of method and its application of leaf morphology free-air correction
CN113470034A (en) * 2021-06-10 2021-10-01 六盘水市农业科学研究院 Device for automatically measuring area of soft rot disease spots of in-vitro plants
CN114241473A (en) * 2020-09-07 2022-03-25 柯镂虚拟时尚股份有限公司 Method and device for estimating physical property parameters of fabric

Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN2634477Y (en) * 2003-07-08 2004-08-18 浙江工程学院 Three dimension detector for fabric pendulous state
CN1566949A (en) * 2003-07-08 2005-01-19 浙江工程学院 Fabric suspension three-dimensional tester based on grating stripe method
CN103325146A (en) * 2013-06-28 2013-09-25 北京航空航天大学 Clothes surface piece three-dimensional mapping method based on human body section ring data

Patent Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN2634477Y (en) * 2003-07-08 2004-08-18 浙江工程学院 Three dimension detector for fabric pendulous state
CN1566949A (en) * 2003-07-08 2005-01-19 浙江工程学院 Fabric suspension three-dimensional tester based on grating stripe method
CN103325146A (en) * 2013-06-28 2013-09-25 北京航空航天大学 Clothes surface piece three-dimensional mapping method based on human body section ring data

Non-Patent Citations (5)

* Cited by examiner, † Cited by third party
Title
YASSINE BEN SALEM等: "《Texture classification of woven fabric based on a GLCM method and using multiclass support vector machine》", 《2009 6TH INTERNATIONAL MULTI-CONFERENCE ON SYSTEMS, SIGNALS AND DEVICES》 *
ZHAOLI WANG等: "《Automatic profiled fiber identification based on a sequential clustering algorithm》", 《2011 INTERNATIONAL CONFERENCE ON ELECTRIC INFORMATION AND CONTROL ENGINEERING》 *
沈毅等: "《织物悬垂形态的模拟仿真》", 《纺织学报》 *
胡堃等: "《基于照片序列的织物悬垂形态重建及测量》", 《东华大学学报(自然科学版)》 *
钟跃崎等: "《一种三维织物建模与仿真算法》", 《系统仿真学报》 *

Cited By (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN108256529A (en) * 2017-11-29 2018-07-06 深圳慎始科技有限公司 Global point cloud based on Dian Yun projected outlines signature and distribution matrix describes method
CN108765547A (en) * 2018-04-23 2018-11-06 北京林业大学 A kind of method and its application of leaf morphology free-air correction
CN114241473A (en) * 2020-09-07 2022-03-25 柯镂虚拟时尚股份有限公司 Method and device for estimating physical property parameters of fabric
CN113470034A (en) * 2021-06-10 2021-10-01 六盘水市农业科学研究院 Device for automatically measuring area of soft rot disease spots of in-vitro plants

Also Published As

Publication number Publication date
CN106971199B (en) 2019-11-08

Similar Documents

Publication Publication Date Title
CN106971199A (en) A kind of automatic classification method of fabric three-dimensional draping shape
CN107918780B (en) Garment type and attribute classification method based on key point detection
CN109993748B (en) Three-dimensional grid object segmentation method based on point cloud processing network
CN105389569B (en) A kind of estimation method of human posture
CN106023156B (en) The method for registering of point cloud model and CAD model based on detection feature
CN104200463B (en) Based on the method for registering images that Fourier-mellin transform and maximum mutual information are theoretical
CN108319957A (en) A kind of large-scale point cloud semantic segmentation method based on overtrick figure
CN104408463B (en) High-resolution construction land pattern spot identification method
CN105787488B (en) From the overall situation to the image characteristic extracting method of localized delivery and device
CN109241901A (en) A kind of detection and recognition methods to the three-dimensional point cloud with hole
CN110458174A (en) A kind of unordered accurate extracting method of cloud key feature points
CN108009557A (en) A kind of threedimensional model method for describing local characteristic based on shared weight convolutional network
CN105930859B (en) Radar Signal Sorting Method based on linear manifold cluster
CN105574265B (en) Entire assembly model quantitative description towards model index
CN103839074B (en) Image classification method based on matching of sketch line segment information and space pyramid
CN106096612A (en) Trypetid image identification system and method
Liu et al. Research on digital restoration of plain unlined silk gauze gown of Mawangdui Han Dynasty Tomb based on AHP and human–computer interaction technology
Zhai et al. Multi-fitting detection on transmission line based on cascade reasoning graph network
CN103810287B (en) Based on the image classification method having the shared assembly topic model of supervision
CN109711330A (en) A kind of active MMW human body imaging threat object detecting method
Ma et al. A method for calculating and simulating phenotype of soybean based on 3D reconstruction
CN106022267B (en) A kind of automatic positioning method of the weak characteristic point of three-dimensional face model
CN103390150B (en) human body part detection method and device
CN116186580A (en) Millimeter wave radar point cloud signal gesture recognition method based on manual characteristics
CN108256569B (en) Object identification method under complex background and used computer technology

Legal Events

Date Code Title Description
PB01 Publication
SE01 Entry into force of request for substantive examination
SE01 Entry into force of request for substantive examination
GR01 Patent grant
GR01 Patent grant
CF01 Termination of patent right due to non-payment of annual fee

Granted publication date: 20191108

CF01 Termination of patent right due to non-payment of annual fee