CN106340060B - The production method of digitized template before a kind of nose reconstruction - Google Patents
The production method of digitized template before a kind of nose reconstruction Download PDFInfo
- Publication number
- CN106340060B CN106340060B CN201610780918.1A CN201610780918A CN106340060B CN 106340060 B CN106340060 B CN 106340060B CN 201610780918 A CN201610780918 A CN 201610780918A CN 106340060 B CN106340060 B CN 106340060B
- Authority
- CN
- China
- Prior art keywords
- vertex
- nose
- face
- data
- production method
- 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.)
- Active
Links
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06T—IMAGE DATA PROCESSING OR GENERATION, IN GENERAL
- G06T17/00—Three dimensional [3D] modelling, e.g. data description of 3D objects
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06T—IMAGE DATA PROCESSING OR GENERATION, IN GENERAL
- G06T15/00—3D [Three Dimensional] image rendering
- G06T15/04—Texture mapping
Landscapes
- Engineering & Computer Science (AREA)
- Physics & Mathematics (AREA)
- Computer Graphics (AREA)
- General Physics & Mathematics (AREA)
- Theoretical Computer Science (AREA)
- Geometry (AREA)
- Software Systems (AREA)
- Length Measuring Devices By Optical Means (AREA)
- Image Analysis (AREA)
Abstract
The present invention relates to medical equipment preparation technical field, a kind of production method of digitized template before nose reconstruction is disclosed.It can be handled by Data Dimensionality Reduction three-dimensional nasal surfaces expanding into two-dimensional surface, collaborative work without multiple professionals, can it is convenient and be quickly obtained can be used as cut out skin template digitized template, the application of material and facility has been greatly reduced simultaneously, cost of manufacture can be reduced, practical promotion and application are convenient for.
Description
Technical field
The present invention relates to medical equipment preparation technical fields, and in particular, to digitized template before a kind of nose reconstruction
Production method.
Background technique
When preparing the operation of full Nasal repair, and is cutting out epidermis (the volume valve for being normally taken from patient), then " rebuilding " nose
Before, doctor needs to estimate the size and shape for repairing required skin.After taking skin scheme to determine, it will usually make one first
A sanction skin template cuts out skin for assisting during surgery, and whether size and shape that skin is cut out etc. is suitable, accurate, can be straight
Connecing influences the final effect that nose is rebuild.
The production method that skin template is cut out in existing preoperative production is: doctor is usually first according to the shape information (example of patient nose
Such as the planar picture before patient and its kith and kin's oral account and/or patient) and the experience of oneself determine shape (the i.e. institute of template
Call " clover " shape), size, 3D nose mold is then made using paraffin, or optical imaging apparatus is further used and obtains
Three-dimensional nose information is taken, subsequently makes plastic mould using 3D paraffin mold or corresponding three-dimensional nose information, it finally will modeling
Sealing rubber die is cut off, is flattened, and compares shape, cuts out masking foil, obtains cutting out skin template.This traditional preparation methods exist asks as follows
Topic: (1) the Collaboration work of multiple professions is needed, such as waxen imagen teacher；(2) process is complicated, time-consuming；(3) material, equipment also by
Limitation.
Summary of the invention
For aforementioned problem of the prior art, the present invention provides a kind of production sides of digitized template before nose reconstruction
Method can be handled by Data Dimensionality Reduction three-dimensional nasal surfaces expanding into two-dimensional surface, without multiple professionals'
It cooperates, can be convenient and be quickly obtained and can be used as the digitized template for cutting out skin template, while material has been greatly reduced
The application of material and equipment, can reduce cost of manufacture, be convenient for practical promotion and application.
The technical solution adopted by the present invention provides a kind of production method of digitized template before nose reconstruction, including
Following steps: S101. determines target nose, obtains the 3D characterize data on the full nose surface of target nose, the 3D characterize data packet
Distance between the apex coordinate and vertex of the grid of triangle surface containing 3D；S102. Data Dimensionality Reduction is carried out to the 3D characterize data
Processing, obtains the 2D characterize data on the full nose surface of the target nose, and the 2D characterize data includes 2D triangle surface grid
Apex coordinate and vertex between distance, wherein the vertex of the 2D triangle surface grid and the 3D triangle surface net
The vertex of lattice corresponds；S103. using the two-dimentional boundary of the 2D triangle surface grid as the boundary of digitized template, system
Make digitized template.
Optimization, in the step S102, include the following steps: S201. for the 3D triangle surface grid
Vertex set X={ x1,x2,…,xNAnd the 2D triangle surface grid vertex set Y={ y1,y2,…,yN, wherein vertex
xkWith vertex ykCorresponding, k ∈ { 1,2 ..., N }, N are the vertex sum in the vertex set X, establish following optimization problem:
In formula, | | ym-yn| | it is vertex to (ym,yn) between Euclidean distance, | | xm-xn| | it is vertex to (xm,xn)
Between Euclidean distance, m, n ∈ { 1,2 ..., N },It is all vertex to (ym,yn)
The quadratic sum formula of distance between maximization point,For all vertex ykThe sum of translation freedoms, on vertex to (ym,yn)
Between need to keep corresponding vertex to (xm,xn) between Euclidean distance when, e(m,n)=1, otherwise e(m,n)=0；S202. will
The optimization problem is converted into semi definite programming problem, then acquires positive semidefinite symmetrical matrix using the tool box of semi definite programming
G*；S203. by the positive semidefinite symmetrical matrix G*It is unfolded as follows:
G*=P Λ PT(Λ=diag { λ1,λ2,…,λN, P=[v1,v2,…,vN])
In formula, { λ1,λ2,…,λNIn element be arranged successively from big to small, then obtain the positive semidefinite symmetrical matrix G*
In each elementS204. each vertex y is obtained according to following formulakCoordinate optimizing solution
It advanced optimizes, in the step S201, judges on vertex to (ym,yn) between whether need to keep corresponding
Vertex is to (xm,xn) between Euclidean distance method include the following steps: when vertex to (xm,xn) be adjacent vertex and
Vertex xmWhen the triangle area mean value of surrounding is less than first threshold, then determine on vertex to (ym,yn) between need to keep corresponding
Vertex is to (xm,xn) between Euclidean distance, otherwise determine on vertex to (ym,yn) between do not need keep corresponding vertex
To (xm,xn) between Euclidean distance.Optimize in detail, the first threshold can be, but not limited to as in the 3D triangle
In shape patch grids, the mean value and sum of variance of all triangle areas.
Optimization, further include following steps in the step S101: S301. acquires patient using optical scanning equipment
The first 3D face representation data；S302. by the 2nd 3D face characterization in the first 3D face representation data and database
Data carry out shape of face matching and then mention using the nose in the most matched 2nd 3D face representation data of shape of face as target nose
Take out the 3D characterize data on the full nose surface of target nose.
It advanced optimizes, in the step S302, by the in the first 3D face representation data and database
Two 3D face representation datas carry out the matched method of shape of face and include the following steps: to use registration Algorithm by the first 3D face number
Shape of face matching is carried out according to the 2nd 3D face data all in database, calculates separately out corresponding shape of face matching similarity,
Then will the 2nd 3D face representation data corresponding with highest shape of face matching similarity as most matched 2nd face 3D of shape of face
Portion's characterize data.Optimize in detail, the registration Algorithm uses closest approach iteration registration Algorithm.
Optimization, in the step S103, include the following steps: the two-dimentional boundary of the 2D triangle surface grid
It is printed upon on paper, then paper is attached to and is cut out on skin raw sheet, finally the sanction skin raw sheet is carried out according to the graphic limit on paper
It cuts out, obtains digitized template.
Optimization, further include following steps after the step S101: being characterized according to the 3D on the full nose surface of target nose
Data print nose model using 3D printer；It further include following steps after the step S103: the institute that will be obtained
It states digitized template to be bonded with the nose model, whether size matches for verification, if size mismatches, according to size
With as a result, zoom in and out to the two-dimentional boundary of the 2D triangle surface grid, it then re-execute the steps S103.
Optimization, the digitized template is aluminium-foil paper template or masking foil template.
To sum up, using the production method of digitized template before a kind of nose reconstruction provided by the present invention, have as follows
The utility model has the advantages that (1) can be handled by Data Dimensionality Reduction expands into two-dimensional surface for three-dimensional nasal surfaces, without multiple special
The collaborative work of industry personnel, can it is convenient and be quickly obtained can be used as cut out skin template digitized template；(2) significantly subtract
Lack the application of material and facility, cost of manufacture can be reduced, is convenient for practical promotion and application.
Detailed description of the invention
In order to more clearly explain the embodiment of the invention or the technical proposal in the existing technology, to embodiment or will show below
There is attached drawing needed in technical description to be briefly described, it should be apparent that, the accompanying drawings in the following description is only this
Some embodiments of invention for those of ordinary skill in the art without creative efforts, can be with
It obtains other drawings based on these drawings.
Fig. 1 is the flow diagram of the production method of digitized template before nose reconstruction provided by the invention.
Fig. 2 is the schematic diagram provided by the invention for showing target nose 3D characterize data.
Fig. 3 is the schematic diagram provided by the invention for showing target nose 2D characterize data.
Fig. 4 is the schematic diagram provided by the invention for showing 3D face representation data.
Specific embodiment
Hereinafter reference will be made to the drawings, digitizes before describing nose reconstruction provided by the invention in detail by way of example
The production method of template.It should be noted that the descriptions of the manners of these embodiments are used to facilitate the understanding of the present invention, but
And it does not constitute a limitation of the invention.
The terms "and/or", only a kind of incidence relation for describing affiliated partner, indicates that there may be three kinds of passes
System, for example, A and/or B, can indicate: individualism A, individualism B exist simultaneously tri- kinds of situations of A and B, the terms
"/and " it is to describe another affiliated partner relationship, indicate may exist two kinds of relationships, for example, A/ and B, can indicate: individually depositing
In A, two kinds of situations of individualism A and B, in addition, character "/" herein, typicallying represent forward-backward correlation object is a kind of "or" pass
System.
Embodiment one
Fig. 1 shows the flow diagram of the production method of digitized template before nose reconstruction provided by the invention, Fig. 2
The schematic diagram provided by the invention for showing target nose 3D characterize data is shown, Fig. 3 shows displaying mesh provided by the invention
The schematic diagram of nose 2D characterize data is marked, Fig. 4 shows the schematic diagram provided by the invention for showing 3D face representation data.This reality
The production method for applying digitized template before the nose reconstruction of example offer, including steps are as follows.
S101. it determines target nose, obtains the 3D characterize data on the full nose surface of target nose, the 3D characterize data includes
Distance between the apex coordinate and vertex of 3D triangle surface grid.
The displaying schematic diagram of target nose 3D characterize data as shown in Figure 2.In the step S101, optimization, also
Include the following steps: that S301. uses the first 3D face representation data of optical scanning equipment acquisition patient；S302. by described
The 2nd 3D face representation data in one 3D face representation data and database carries out shape of face matching, by shape of face most matched second
Then nose in 3D face representation data extracts the 3D characterize data on the full nose surface of target nose as target nose.
In step S301, the 3D characterize data one of the form of the first 3D face representation data and the full nose surface
It causes, includes the distance between the apex coordinate and vertex for the 3D triangle surface grid of face face, bandwagon effect such as Fig. 4
It is shown, it can be directly acquired by the optical scanning equipment.The optical scanning equipment can be, but not limited to as 3-D scanning
The equipment such as instrument.In the step S302, by the 2nd 3D face characterization in the first 3D face representation data and database
Data carry out that the matched method of shape of face includes the following steps: will be in the first 3D face data and database using registration Algorithm
The 2nd all 3D face datas carries out shape of face matching, calculates separately out corresponding shape of face matching similarity, then will be with highest
The corresponding 2nd 3D face representation data of shape of face matching similarity is as the most matched 2nd 3D face representation data of shape of face.Institute
Form and the first 3D face representation data for stating the 2nd 3D face representation data are same consistent, comprising for face face
Distance between the apex coordinate and vertex of 3D triangle surface grid, bandwagon effect are also as shown in Figure 4.Optimize in detail, institute
Stating registration Algorithm can be, but not limited to use closest approach iteration (Iterative Closest Point, ICP) registration Algorithm.
In addition, further including following steps after the step S101: characterizing number according to the 3D on the full nose surface of target nose
According to printing nose model using 3D printer.Obtained digitized template is carried out using the nose model so as to subsequent
Size matching verification.
S102. Data Dimensionality Reduction processing is carried out to the 3D characterize data, obtains the 2D table on the full nose surface of the target nose
Data are levied, the 2D characterize data includes the distance between the apex coordinate and vertex of 2D triangle surface grid, wherein the 2D
The vertex of triangle surface grid and the vertex of the 3D triangle surface grid correspond.
In step s 102, Data Dimensionality Reduction is that a kind of express data by higher-dimension switchs to the expression of " certain is significant " low-dimensional
Transform method (" meaning " is determined by specific data and its application background), starting point is, in most cases, data
" Main change " (or being intrinsic attribute) usually only determines that (it is far smaller than the original expression of data by limited several parameters
Dimension).As an example, in the embodiment of the present invention step S102, data are carried out using the method based on semi definite programming
Dimension-reduction treatment comprising following steps: S201. is directed to the vertex set X={ x of the 3D triangle surface grid1,x2,…,xN}
With the vertex set Y={ y of the 2D triangle surface grid1,y2,…,yN, wherein vertex xkWith vertex ykIt is corresponding, k ∈ 1,
2 ..., N }, N is the vertex sum in the vertex set X, establish following optimization problem:
In formula, | | ym-yn| | it is vertex to (ym,yn) between Euclidean distance, | | xm-xn| | it is vertex to (xm,xn)
Between Euclidean distance, m, n ∈ { 1,2 ..., N },It is all vertex to (ym,yn)
The quadratic sum formula of distance between maximization point,For all vertex ykThe sum of translation freedoms, on vertex to (ym,yn)
Between need to keep corresponding vertex to (xm,xn) between Euclidean distance when, e(m,n)=1, otherwise e(m,n)=0；S202. will
The optimization problem is converted into semi definite programming problem, then acquires positive semidefinite symmetrical matrix using the tool box of semi definite programming
G*；S203. by the positive semidefinite symmetrical matrix G*It is unfolded as follows:
G*=P Λ PT(Λ=diag { λ1,λ2,…,λN, P=[v1,v2,…,vN])
In formula, { λ1,λ2,…,λNIn element be arranged successively from big to small, then obtain the positive semidefinite symmetrical matrix G*
In each elementS204. each vertex y is obtained according to following formulakCoordinate optimizing solution
The thinking of establishing of optimization problem described in the step S201 to S204 is: under local constraint, carrying out most
The triangle surface grid overall situation expansion changed greatly, whereinFor the first constraint condition, optimize the flat of solution for removing
Freedom degree is moved, single optimal solution is obtained；e(m,n)·||xm-xn| |=e(m,n)·||ym-yn| | it is the second constraint condition, is used for
After the expansion of the triangle surface grid overall situation, the topological structure (i.e. connection relationship) in holding triangle surface grid between each vertex is no
Become, obtains expected 2D characterize data, as shown in Figure 3.In addition, the derivation calculating process that the step S202 to S204 is recorded is
The prior art is no longer described in detail in this.
It advanced optimizes, in the step S201, judges on vertex to (ym,yn) between whether need to keep corresponding
Vertex is to (xm,xn) between Euclidean distance method include the following steps: when vertex to (xm,xn) be adjacent vertex and
Vertex xmWhen the triangle area mean value of surrounding is less than first threshold, then determine on vertex to (ym,yn) between need to keep corresponding
Vertex is to (xm,xn) between Euclidean distance, otherwise determine on vertex to (ym,yn) between do not need keep corresponding vertex
To (xm,xn) between Euclidean distance.Optimize in detail, the first threshold can be, but not limited to as in the 3D triangle
In shape patch grids, the mean value and sum of variance of all triangle areas.
S103. using the two-dimentional boundary of the 2D triangle surface grid as the boundary of digitized template, production digitlization
Template
In step s 103, optimization includes the following steps: to print on the two-dimentional boundary of the 2D triangle surface grid
On paper, then paper is attached to and is cut out on skin raw sheet, finally the sanction skin raw sheet is cut out according to the graphic limit on paper,
Obtain digitized template.The digitized template can be, but not limited to as aluminium-foil paper template or masking foil template.
It further include following steps after the step S105: by the obtained digitized template and the nose mould
Type is bonded, and whether size matches for verification, if size mismatches, according to size matching result, to the 2D gore
The two-dimentional boundary of piece grid zooms in and out, and then re-execute the steps S103.
To sum up, before nose reconstruction provided by the present embodiment digitized template production method, have following technology effect
Fruit: (1) it by Data Dimensionality Reduction can be handled and three-dimensional nasal surfaces are expanded into two-dimensional surface, without multiple professionals
Collaborative work, can it is convenient and be quickly obtained can be used as cut out skin template digitized template；(2) material has been greatly reduced
The application of material and equipment, can reduce cost of manufacture, be convenient for practical promotion and application.
As described above, the present invention can be realized preferably.For a person skilled in the art, religion according to the present invention
It leads, the production method for designing digitized template before various forms of nose reconstructions does not need creative labor.Not
These embodiments are changed in the case where being detached from the principle and spirit of the invention, modifies, replace, integrating and modification is still fallen within
In protection scope of the present invention.
Claims (10)
1. the production method of digitized template before a kind of nose reconstruction, which comprises the steps of:
S101. it determines target nose, obtains the 3D characterize data on the full nose surface of target nose, the 3D characterize data includes 3D tri-
Distance between the apex coordinate and vertex of angular patch grids；
S102. Data Dimensionality Reduction processing is carried out to the 3D characterize data, obtains the 2D characterization number on the full nose surface of the target nose
According to the 2D characterize data includes the distance between the apex coordinate and vertex of 2D triangle surface grid, wherein the 2D triangle
The vertex of shape patch grids and the vertex of the 3D triangle surface grid correspond；
S103. using the two-dimentional boundary of the 2D triangle surface grid as the boundary of digitized template, digitized template is made.
2. the production method of digitized template before a kind of nose reconstruction as described in claim 1, which is characterized in that described
In step S102, include the following steps:
S201. it is directed to the vertex set X={ x of the 3D triangle surface grid1,x2,…,xNAnd the 2D triangle surface net
Vertex set Y={ the y of lattice1,y2,…,yN, wherein vertex xnWith vertex ynCorresponding, n ∈ { 1,2 ..., N }, N are the vertex set X
In vertex sum, establish following optimization problem:
In formula, | | ym-yn| | it is vertex to (ym,yn) between Euclidean distance, | | xm-xn| | it is vertex to (xm,xn) between
Euclidean distance, m, n ∈ { 1,2 ..., N },It is all vertex to (ym,yn) maximum
The quadratic sum formula of distance between change point,For all vertex ynThe sum of translation freedoms, on vertex to (ym,yn) between
It needs to keep corresponding vertex to (xm,xn) between Euclidean distance when, e(m,n)=1, otherwise e(m,n)=0；
S202. semi definite programming problem is converted by the optimization problem, then acquires half using the tool box of semi definite programming
Positive definite symmetric matrices G*；
S203. by the positive semidefinite symmetrical matrix G*It is unfolded as follows:
G*=P Λ PT
In formula, P=[v1,v2,…,vN], Λ=diag { λ1,λ2,…,λN, { λ1,λ2,…,λNIn element from big to small according to
Secondary arrangement then obtains the positive semidefinite symmetrical matrix G*In each element
S204. each vertex y is obtained according to following formulanCoordinate optimizing solution
3. the production method of digitized template before a kind of nose reconstruction as claimed in claim 2, which is characterized in that described
In step S201, judge on vertex to (ym,yn) between whether need to keep corresponding vertex to (xm,xn) between Euclid
The method of distance includes the following steps:
When vertex is to (xm,xn) it is adjacent vertex and vertex xmWhen the triangle area mean value of surrounding is less than first threshold, then determine
On vertex to (ym,yn) between need to keep corresponding vertex to (xm,xn) between Euclidean distance, otherwise determine on vertex
To (ym,yn) between do not need keep corresponding vertex to (xm,xn) between Euclidean distance.
4. the production method of digitized template before a kind of nose reconstruction as claimed in claim 3, which is characterized in that described the
One threshold value is the mean value and sum of variance of all triangle areas in the 3D triangle surface grid.
5. the production method of digitized template before a kind of nose reconstruction as described in claim 1, which is characterized in that described
Further include following steps in step S101:
S301. using the first 3D face representation data of optical scanning equipment acquisition patient；
S302. the 2nd 3D face representation data in the first 3D face representation data and database is subjected to shape of face matching,
Using the nose in the most matched 2nd 3D face representation data of shape of face as target nose, the full nose table of target nose is then extracted
The 3D characterize data in face.
6. the production method of digitized template before a kind of nose reconstruction as claimed in claim 5, which is characterized in that described
In step S302, the 2nd 3D face representation data in the first 3D face representation data and database is subjected to shape of face matching
Method include the following steps:
The 2nd 3D face data all in the first 3D face data and database is carried out by shape of face using registration Algorithm
Match, calculates separately out corresponding shape of face matching similarity, it then will the 2nd face 3D corresponding with highest shape of face matching similarity
Portion's characterize data is as the most matched 2nd 3D face representation data of shape of face.
7. the production method of digitized template before a kind of nose reconstruction as claimed in claim 6, which is characterized in that described to match
Quasi- algorithm uses closest approach iteration registration Algorithm.
8. the production method of digitized template before a kind of nose reconstruction as described in claim 1, which is characterized in that described
In step S103, include the following steps: that the two-dimentional boundary by the 2D triangle surface grid is printed upon on paper, it is then that paper is attached
Cut out skin raw sheet on, finally the sanction skin raw sheet is cut out according to the graphic limit on paper, obtains digitized template.
9. the production method of digitized template before a kind of nose reconstruction as described in claim 1, which is characterized in that described
Further include following steps after step S101: according to the 3D characterize data on the full nose surface of target nose, being printed using 3D printer
Nose model out；
Further include following steps after the step S103: by the obtained digitized template and the nose model into
Row fitting, whether size matches for verification, if size mismatches, according to size matching result, to the 2D triangle surface net
The two-dimentional boundary of lattice zooms in and out, and then re-execute the steps S103.
10. the production method of digitized template before a kind of nose reconstruction as described in claim 1, which is characterized in that described
Digitized template is aluminium-foil paper template or masking foil template.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201610780918.1A CN106340060B (en) | 2016-08-30 | 2016-08-30 | The production method of digitized template before a kind of nose reconstruction |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201610780918.1A CN106340060B (en) | 2016-08-30 | 2016-08-30 | The production method of digitized template before a kind of nose reconstruction |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN106340060A CN106340060A (en) | 2017-01-18 |
| CN106340060B true CN106340060B (en) | 2019-03-05 |
Family
ID=57822892
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201610780918.1A Active CN106340060B (en) | 2016-08-30 | 2016-08-30 | The production method of digitized template before a kind of nose reconstruction |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN106340060B (en) |
Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101777093A (en) * | 2009-12-25 | 2010-07-14 | 电子科技大学 | Large-scale virtual crowd routing method |
| CN102332180A (en) * | 2011-10-15 | 2012-01-25 | 杭州力孚信息科技有限公司 | Three-dimensional garment modeling and pattern designing method based on draping |
| CN104890237A (en) * | 2015-04-30 | 2015-09-09 | 北京敏速自动控制设备有限公司 | 3D printing method and system thereof |
| CN105184868A (en) * | 2015-09-01 | 2015-12-23 | 广东顺德中山大学卡内基梅隆大学国际联合研究院 | Triangular surface grid generation method based on three-dimensional entity model |
| CN105243381A (en) * | 2015-11-25 | 2016-01-13 | 朱金良 | Automatic fault recognition and detection system and method based on 3D information |
Family Cites Families (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US8494237B2 (en) * | 2010-11-08 | 2013-07-23 | Cranial Technologies, Inc | Method and apparatus for processing digital image representations of a head shape |
| US9113130B2 (en) * | 2012-02-06 | 2015-08-18 | Legend3D, Inc. | Multi-stage production pipeline system |
-
2016
- 2016-08-30 CN CN201610780918.1A patent/CN106340060B/en active Active
Patent Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101777093A (en) * | 2009-12-25 | 2010-07-14 | 电子科技大学 | Large-scale virtual crowd routing method |
| CN102332180A (en) * | 2011-10-15 | 2012-01-25 | 杭州力孚信息科技有限公司 | Three-dimensional garment modeling and pattern designing method based on draping |
| CN104890237A (en) * | 2015-04-30 | 2015-09-09 | 北京敏速自动控制设备有限公司 | 3D printing method and system thereof |
| CN105184868A (en) * | 2015-09-01 | 2015-12-23 | 广东顺德中山大学卡内基梅隆大学国际联合研究院 | Triangular surface grid generation method based on three-dimensional entity model |
| CN105243381A (en) * | 2015-11-25 | 2016-01-13 | 朱金良 | Automatic fault recognition and detection system and method based on 3D information |
Non-Patent Citations (6)
| Title |
|---|
| Method of 3D Body Surface Segmentation and 2D Pattern Development Using Triangle Simplification and Triangle Patch Arrangement;YH Jeong et al.;《Journal of the Korean Society of Cothing and Textiles》;20051231;第29卷(第9/10期);第1359-1368页 |
| Polycube splines;Hongyu Wang et al.;《ELSEVIER》;20081231;第721-733页 |
| 基于3D打印的个性化外科手术模板设计软件关键算法研究与系统实现;杨悦;《万方数据知识服务平台》;20160603;第3-6章 |
| 数字建模联合3D打印在耳郭再造整形中的应用;梁久龙 等;《解放军医药杂志》;20151130;第27卷(第11期);第24-25页，第29页 |
| 盒状件分布动载荷频域识别方法;姜金辉 等;《力学季刊》;20080630;第272-277页 |
| 非完备几何特征测量数据建模及其在颜面缺损修复中的应用研究;孙进;《万方数据知识服务平台》;20150817;第3.1节 |
Also Published As
| Publication number | Publication date |
|---|---|
| CN106340060A (en) | 2017-01-18 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| WO2019174376A1 (en) | Lung texture recognition method for extracting appearance and geometrical feature based on deep neural network | |
| CN101739719B (en) | Three-dimensional gridding method of two-dimensional front view human face image | |
| CN106022228B (en) | A kind of three-dimensional face identification method based on grid local binary patterns in length and breadth | |
| CN101882326A (en) | Three-dimensional craniofacial reconstruction method based on overall facial structure shape data of Chinese people | |
| CN104008564A (en) | Human face expression cloning method | |
| Deng et al. | A regional method for craniofacial reconstruction based on coordinate adjustments and a new fusion strategy | |
| CN105147341B (en) | Three-dimensional model reconstructing method for keeping fracture line of jaw bone | |
| CN107521090A (en) | It is a kind of that the incomplete method of remains face is precisely repaired based on 3D printing technique | |
| CN103258343A (en) | Eye image processing method based on image editing | |
| CN103337085A (en) | Efficient portrait face distortion method | |
| CN108422670A (en) | A kind of paths planning method in discontinuous grid division three-dimensional point cloud face | |
| CN105469064B (en) | A kind of acquisition methods and device of skin aging trend | |
| CN107895364A (en) | A kind of three-dimensional reconstruction system for the preoperative planning of virtual operation | |
| CN104077781A (en) | Medical image registration algorithm evaluation method based on deformation field | |
| CN111739000A (en) | System and device for improving left ventricle segmentation accuracy of multiple cardiac views | |
| CN110321946A (en) | A kind of Multimodal medical image recognition methods and device based on deep learning | |
| CN103034844B (en) | Image-recognizing method and device | |
| CN102034272B (en) | Generating method of individualized maxillofacial soft tissue hexahedral mesh | |
| CN106340060B (en) | The production method of digitized template before a kind of nose reconstruction | |
| CN107993277B (en) | priori knowledge-based reconstruction method of artificial bone repair model of damaged part | |
| CN107330948B (en) | fMRI data two-dimensional visualization method based on popular learning algorithm | |
| CN108846342A (en) | A kind of harelip operation mark point recognition system | |
| CN116763295A (en) | Livestock scale measuring method, electronic equipment and storage medium | |
| JP2003141567A (en) | Three-dimensional city model generating device and method of generating three-dimensional city model | |
| CN113435273B (en) | Data augmentation method, data augmentation device, electronic device, and storage medium |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |