CN109859322B - Spectral attitude migration method based on deformation graph - Google Patents

Spectral attitude migration method based on deformation graph Download PDF

Info

Publication number
CN109859322B
CN109859322B CN201910056771.5A CN201910056771A CN109859322B CN 109859322 B CN109859322 B CN 109859322B CN 201910056771 A CN201910056771 A CN 201910056771A CN 109859322 B CN109859322 B CN 109859322B
Authority
CN
China
Prior art keywords
grid
migration
deformation
vertex
attitude
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
Application number
CN201910056771.5A
Other languages
Chinese (zh)
Other versions
CN109859322A (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.)
Guangxi University
Original Assignee
Guangxi 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 Guangxi University filed Critical Guangxi University
Priority to CN201910056771.5A priority Critical patent/CN109859322B/en
Publication of CN109859322A publication Critical patent/CN109859322A/en
Application granted granted Critical
Publication of CN109859322B publication Critical patent/CN109859322B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Landscapes

  • Processing Or Creating Images (AREA)
  • Prostheses (AREA)

Abstract

The invention discloses a spectral attitude migration method based on a deformation map, which comprises the following steps: 1) Simplifying a source grid by utilizing a grid simplification algorithm to generate a source grid deformation graph; 2) Performing coupling-alignment-and-basis-based spectral pose migration on a source grid by using a reference grid; 3) Generating a deformation graph after the attitude migration by using an optimized energy function according to the attitude migration result and the source grid deformation graph; 4) Deforming the source grid to generate a target grid by using an embedded deformation graph editing method according to the deformation graph generated after the posture migration; 5) And segmenting all regions with insufficient grid posture migration, and carrying out layered posture migration until the posture migration is sufficient. The method has better locality when the source grid is represented by using the embedded deformation graph editing method, and reduces the influence of the quality of the geometric proxy on the result to a certain extent; the sub grids are spliced by simple offset, orientation adjustment is not needed, and the quality of the target grid generated by posture migration is effectively improved.

Description

Spectral attitude migration method based on deformation graph
Technical Field
The invention relates to the technical field of 3D model spectral attitude migration, in particular to a spectral attitude migration method based on a deformation map.
Background
The three-dimensional grid model has wide application in the aspects of 3D printing, virtual reality, entertainment games and the like. It is difficult to model complex geometries quickly and accurately using conventional manual modeling, scanning equipment, or modeling software. And the existing grid model is edited and reused, so that the re-modeling can be avoided. The method is used for obtaining the target grid with similar postures by using the existing postures of the reference grid as the example-based grid modeling technology deformation migration and posture migration, but how to accurately describe the posture of the source grid model and automatically guide the deformation of the target grid model is also a challenging subject.
Levy performs trivial pose migration between grids with the same connectivity by exchanging coefficients corresponding to low-frequency eigenfunctions (i.e., eigenfunctions corresponding to smaller eigenvalues) of the Laplacian matrix of the grids. But the expression result of the source grid and the reference grid is obviously different due to the difference of the Laplacian characteristic bases. The target grid model obtained after the posture migration has serious distortion and deformation phenomena, and the posture learning is insufficient. Kovnatsky and the like optimize Laplace matrix characteristic bases of two grid models with different connection relations to obtain coupling reference harmonics and bases with compatibility based on functional mapping, and then exchange low-frequency coefficients of the coupling reference harmonics and bases of the two grids to perform attitude migration between the grid models with different connection relations and different attitudes. Although this method solves the shape distortion phenomenon due to the feature basis difference, the posture learning is still insufficient. Yin et al propose a detail preserving spectral pose migration algorithm and a multi-layer migration framework. According to the method, on the basis of coupling calibration and base attitude migration, a subspace technology based on a generalized central coordinate is combined, the Cage is used as a geometric proxy to reduce the solving scale, the deformation freedom is reduced, and the solving stability is guaranteed. In order to solve the problem of insufficient posture learning, yin and the like propose a layered posture migration strategy, a region with insufficient migration posture is divided, the original posture which is not large-scale is converted into the large-scale posture of a local region, and then spectrum posture migration is carried out. Thereby obtaining better attitude migration effect. However, since the method uses the Cage and the mean coordinates to represent the source grid, and the mean coordinates do not satisfy the internal locality, the pose migration result is greatly influenced by the Cage.
The invention provides a spectral attitude migration method based on a deformation diagram, which utilizes an embedded deformation diagram editing method to replace a subspace technology of a generalized central coordinate, takes the deformation diagram as a geometric proxy and takes geodesic distance as weight to represent a source grid. The embedding deformation can better maintain the geometric details of the grid, and the influence of the geometric proxy on the migration result is reduced to a certain extent, so that the quality of the migration result is improved.
Disclosure of Invention
The invention aims to overcome the defects and shortcomings of the prior art, and provides a spectral attitude migration method based on a deformation map. The embedding deformation can better maintain the geometric details of the grid, and the influence of the geometric proxy on the migration result is reduced to a certain extent, so that the quality of the migration result is improved.
In order to realize the purpose, the technical scheme provided by the invention is as follows: a spectral attitude migration method based on a deformation map comprises the following steps:
1) Simplifying the source grid by utilizing a grid simplification algorithm to generate a source grid deformation graph;
2) Performing coupling-alignment-and-basis-based spectral pose migration on a source grid by using a reference grid;
3) Generating a deformation graph after the attitude migration by using an optimized energy function according to the attitude migration result and the source grid deformation graph;
4) Deforming the source grid to generate a target grid by using an embedded deformation graph editing method according to the deformation graph generated after the posture migration;
5) And (5) segmenting all regions with insufficient grid posture migration, and carrying out layered posture migration according to the steps from 2) to 4) until the posture migration is sufficient.
In step 1), simplifying a source grid by using an optimized quadratic error metric algorithm, namely a QEM (quantitative error metric) algorithm to generate a deformation graph, wherein the total folding cost of each edge of the grid in the optimized quadratic error metric algorithm is defined as:
cost(a,b)=αQ QEM (a,b)+βQ F (a,b)+γQ Reg (a,b)+μQ Are (a,b)
in which a and b are the edges to be foldedTwo end points, alpha, beta, gamma, mu are scalar weights, Q QEM For QEM edge fold cost, Q F Is the offset, Q, of the adjacent minimum offset edge after the folded edge is folded Reg For the cost of regularity when folding edges (a, b) → v, Q Reg =|Reg(N F (v))-max{Reg(N F (a)),Reg(N F (b))}|,N F (a)、N F (b)、N F (v) Is an adjacent triangle set with vertexes a, b and v, reg (tri) =3-2R (tri), R (tri) = cos ([ alpha ]) + cos ([ beta ]) + cos ([ gamma ]), is the regularity of delta tri,
Figure GDA0003831548120000031
where S (tri) is the area of triangle tri.
In step 2), performing coupling alignment and basis-based spectral pose migration on the source grid by using the reference grid, comprising the following steps:
2.1 Calculating laplacian matrixes of the input reference grid M and the input source grid M' and corresponding spectrums and characteristic functions thereof, and calculating a laplacian matrix of the deformation graph G;
2.2 Selecting direct feature corresponding points of the reference grid and the source grid, and calculating an indication function of s neighborhood points of the corresponding points based on area approximation between the reference grid and the source grid as a corresponding function between grids;
2.3 ) optimizing the Laplace eigenbase of the reference grid M and the source grid M' to obtain a coupled reference tone and a coupled basis { phi i M }、{φ i M' Is calculated using a formula
Figure GDA0003831548120000032
Determining attitude transition results based on coupling criteria and bases
Figure GDA0003831548120000033
In the formula, alpha i M And alpha i M' Spectral coefficients of M and M', respectively, k being exchange alpha i M' And | V '| is the number of vertexes of M'.
In the step 3), after the attitude migration is carried out by utilizing the coupling alignment and the base,utilizing an optimized energy function to the attitude migration results
Figure GDA0003831548120000034
Solving the deformation graph after the attitude transition, wherein the peak constraint term
Figure GDA0003831548120000041
Terms of pailaplace coordinates
Figure GDA0003831548120000042
Scaling constraint items
Figure GDA0003831548120000043
Q is a geodesic distance weight matrix,
Figure GDA0003831548120000044
for the purpose of the solved deformation map or maps,
Figure GDA0003831548120000045
for the set of deformation map vertices to be solved,
Figure GDA0003831548120000046
is composed of
Figure GDA0003831548120000047
The number of the vertexes of (a),
Figure GDA0003831548120000048
as a result of the pose migration based on the coupling alignment and the basis,
Figure GDA0003831548120000049
for rotating the transformation matrix, delta i G To morph the laplace coordinates of the graph G,
Figure GDA00038315481200000410
for the laplace coordinates of the solved deformation map,
Figure GDA00038315481200000411
is composed of
Figure GDA00038315481200000412
Of a scaling matrix, λ 1 、λ 2 Is a scalar weight.
In step 4), the solved deformation map is deformed by using an embedded deformation map editing method to generate a target grid, and the method comprises the following steps:
4.1 Utilizing a minimum energy function
Figure GDA00038315481200000413
Optimizing the attitude transition result to obtain a rotation and translation matrix of the source grid deformation, wherein
Figure GDA00038315481200000414
Is composed of
Figure GDA00038315481200000415
Number of vertices, rotation term
Figure GDA00038315481200000416
Single vertex rotation term Rot (R) j )=(c 1 ·c 2 ) 2 +(c 1 ·c 3 ) 2 +(c 2 ·c 3 ) 2 +(c 1 ·c 2 ) 2 +(c 1 ·c 1 -1) 2 +(c 2 ·c 2 -1) 2 +(c 3 ·c 3 -1) 2 ,c 1 、c 2 And c 3 Is a rotation matrix R at the vertex of the deformation graph j Column vector of (2), regularization term
Figure GDA00038315481200000417
N (j) is a vertex v j T is the translation transformation, α jn =1.0, vertex constraint term
Figure GDA00038315481200000418
Figure GDA00038315481200000419
For the generated target netGrid (C)
Figure GDA00038315481200000420
The top of the upper vertex is a vertex of the lower vertex,
Figure GDA00038315481200000421
is a deformation diagram
Figure GDA00038315481200000422
Vertex of (a), w rot 、w reg 、w con Is scalar weight;
4.2 Using a formula after obtaining a rotational-translation matrix
Figure GDA00038315481200000423
Computing a target grid
Figure GDA00038315481200000424
Set of vertices of
Figure GDA00038315481200000425
Wherein w j (v l ') is a geodesic distance weight,
Figure GDA00038315481200000426
in order to be a matrix of rotations,
Figure GDA00038315481200000427
to translate the matrix, v l ' being the vertices of the source mesh, g j (v i ') is associated with the source mesh vertex v i ' geodetically nearest m vertex sets on the deformation map G,
Figure GDA00038315481200000428
are the vertices on the final target mesh sought.
In step 5), dividing the reference grid, the generated target grid and the deformation map thereof into regions with insufficient posture migration, and carrying out layered posture migration according to the steps 2) to 4) until the posture migration is sufficient, wherein the method comprises the following steps:
5.1 Select the local grid with insufficient gesture learning to correspond toReference grid M, generated target grid M' and deformation graph
Figure GDA0003831548120000051
Dividing to obtain corresponding partial sub-grids S, S' and G s
5.2 Using steps 2) to 3) to obtain a local deformation map G s Deformation map after attitude migration
Figure GDA0003831548120000052
5.3 Calculate G) s Dividing the average offset of the boundary vertex position before and after the attitude transition, and adding it to the average offset
Figure GDA0003831548120000053
The respective vertex of (a);
5.4 Utilize
Figure GDA0003831548120000054
Updating the deformation map of the vertex information
Figure GDA0003831548120000055
5.5 Utilizing step 4) to obtain a final attitude migration result.
Compared with the prior art, the invention has the following advantages and beneficial effects:
1. the method simplifies the source grid by using an optimized Quadratic Error Metric (QEM) algorithm to generate a vertex distribution uniform deformation graph, and can generate a better effect when the grid of the driving source deforms.
2. The invention utilizes an embedded deformation editing method to replace the subspace technology of the generalized central coordinate, takes the deformation diagram as a geometric proxy, and expresses the source grid by the geodesic distance weight, thereby effectively improving the quality of the target grid generated by the attitude migration.
3. When the layered attitude migration is performed, the local area grid (sub-grid) is directly translated to be spliced with the whole grid, and orientation adjustment is not needed.
Drawings
FIG. 1 is a flow chart of the gesture migration of the present invention.
FIG. 2 is a schematic diagram of a gesture migration process according to the present invention.
FIG. 3 is a diagram illustrating the results of performing a gesture migration based on coupling and basis according to the present invention.
FIG. 4 is a diagram illustrating the result of pose migration transformation according to the present invention.
Detailed Description
The present invention will be further described with reference to the following specific examples.
As shown in fig. 1 and fig. 2, the deformation map-based spectral pose migration method provided by this embodiment inputs a grid and a source grid, and includes the following steps:
1) Simplifying a source grid by utilizing a Quadratic Error Metric (QEM) algorithm to generate a deformation graph with uniformly distributed vertexes, wherein the total folding cost of each edge of the grid in the QEM algorithm is defined as:
cost(a,b)=αQ QEM (a,b)+βQ F (a,b)+γQ Reg (a,b)+μQ Are (a,b)
in the formula, a and b are two end points of the edge to be folded respectively, alpha, beta, gamma and mu are scalar weight values respectively, and Q is QEM For QEM edge folding cost, Q F Is the offset, Q, of the adjacent minimum offset edge after the folded edge is folded Reg For the cost of regularity when folding edges (a, b) → v, Q Reg =|Reg(N F (v))-max{Reg(N F (a)),Reg(N F (b))}|, N F (a)、N F (b)、N F (v) Is an adjacent triangle set with vertexes a, b and v, reg (tri) =3-2R (tri), R (tri) = cos ([ alpha ]) + cos ([ beta ]) + cos ([ gamma ]), is the regularity of delta tri,
Figure GDA0003831548120000061
wherein S (tri) is the area of triangle tri.
2) Performing coupling-and-basis-based spectral pose migration on a source grid using a reference grid, comprising the steps of:
2.1 Calculating laplacian matrices of the input reference grid M and the source grid M' and corresponding spectra and characteristic functions thereof, and calculating the laplacian matrix of the deformation graph G;
2.2 Selecting direct characteristic corresponding points of the reference grid and the source grid, and calculating an indication function of s neighborhood points of the corresponding points between the reference grid and the source grid based on area approximation as a corresponding function between grids;
2.3 ) the Laplace eigen bases of the reference grid M and the source grid M' are optimized to obtain a coupling reference and a basis { φ i M }、{φ i M' Is calculated using a formula
Figure GDA0003831548120000062
Determining attitude transition results based on coupling criteria and bases
Figure GDA0003831548120000063
In the formula, alpha i M And alpha i M' Spectral coefficients of M and M', respectively, k being exchange alpha i M' And | V '| is the number of vertexes of M'. The resulting coupled-bin and base-based spectral pose migration results are shown in FIG. 3.
3) After the attitude migration is carried out by utilizing the coupling alignment and the base, the attitude migration result is utilized an optimized energy function
Figure GDA0003831548120000071
The deformation graph after the posture transition is obtained, and the peak constraint term in the formula is shown in FIG. 4
Figure GDA0003831548120000072
Terms of pailaplace coordinates
Figure GDA0003831548120000073
Scaling constraint terms
Figure GDA0003831548120000074
Q is a geodesic distance weight matrix,
Figure GDA0003831548120000075
for the purpose of the solved deformation map,
Figure GDA0003831548120000076
for the set of deformation map vertices to be solved,
Figure GDA0003831548120000077
is composed of
Figure GDA0003831548120000078
The number of the vertexes of (a),
Figure GDA0003831548120000079
as a result of the pose migration based on the coupling alignment and the basis,
Figure GDA00038315481200000710
for rotating the transformation matrix, delta i G To morph the laplace coordinates of the graph G,
Figure GDA00038315481200000711
for the laplace coordinates of the solved deformation map,
Figure GDA00038315481200000712
is composed of
Figure GDA00038315481200000713
A scaling matrix of 1 、λ 2 Is a scalar weight.
4) The method for generating the target grid by deforming the source grid by using the method for editing the embedded deformation diagram comprises the following steps:
4.1 Utilizing a minimum energy function
Figure GDA00038315481200000714
Optimizing the attitude transition result to obtain a rotation and translation matrix of the source grid deformation, wherein
Figure GDA00038315481200000715
Is composed of
Figure GDA00038315481200000716
Top ofNumber, rotation term
Figure GDA00038315481200000717
Single vertex rotation term Rot (R) j )=(c 1 ·c 2 ) 2 +(c 1 ·c 3 ) 2 +(c 2 ·c 3 ) 2 +(c 1 ·c 2 ) 2 +(c 1 ·c 1 -1) 2 +(c 2 ·c 2 -1) 2 +(c 3 ·c 3 -1) 2 ,c 1 、c 2 And c 3 Is a rotation matrix R at the vertex of the deformation graph j Column vector of (2), regularization term
Figure GDA00038315481200000718
N (j) is a vertex v j T is the translation transformation, α jn =1.0, vertex constraint term
Figure GDA00038315481200000719
Figure GDA00038315481200000720
For the generated target mesh
Figure GDA00038315481200000721
The top of the upper vertex is a vertex of the lower vertex,
Figure GDA00038315481200000722
is a deformation diagram
Figure GDA00038315481200000723
Vertex of, w rot 、w reg 、w con Is scalar weight;
4.2 Using a formula after obtaining a rotational-translation matrix
Figure GDA00038315481200000724
Computing a target grid
Figure GDA00038315481200000725
Set of vertices of
Figure GDA00038315481200000726
Wherein w j (v l ') is a geodesic distance weight,
Figure GDA00038315481200000727
in order to be a matrix of rotations,
Figure GDA00038315481200000728
to translate the matrix, v l ' being the vertices of the source mesh, g j (v i ') is associated with the source mesh vertex v i ' geodetically nearest m vertex sets on the deformation map G,
Figure GDA00038315481200000729
are the vertices on the final target mesh sought.
The generated morphogram-based spectral pose migration low frequency pose migration results are shown in step 2-4 of FIG. 2.
5) Dividing the reference grid, the generated target grid and the deformation graph thereof in the insufficient posture migration area, and carrying out layered posture migration according to the steps 2) to 4) until the posture migration is sufficient, wherein the method comprises the following steps:
5.1 Selecting partial grids with insufficient posture learning, and generating a corresponding reference grid M, a generated target grid M' and a deformation map
Figure GDA0003831548120000081
Dividing to obtain corresponding partial sub-grids S, S' and G s
5.2 Using steps 2) to 3) to obtain a local deformation map G s Deformation map after posture migration
Figure GDA0003831548120000082
5.3 Calculate G) s The average offset of the division boundary vertex position before and after the attitude transition is added to
Figure GDA0003831548120000083
In a corresponding roofPoint;
5.4 Utilize
Figure GDA0003831548120000084
Updating the deformation map of the vertex information
Figure GDA0003831548120000085
5.5 Utilizing step 4) to obtain a final attitude migration result.
The layered pose migration process and the final result are shown as step 5 in fig. 2.
In conclusion, after the scheme is adopted, the invention provides a new method for three-dimensional model posture migration, and the embedded deformation graph editing method has better locality when representing the source grid, thereby reducing the influence of the quality of the geometric proxy on the result to a certain extent; the sub-meshes are spliced using simple offsets without having to make orientation adjustments. The quality of the target grid generated by the attitude migration is effectively improved, and the method has practical popularization value and is worth popularizing.
The above-mentioned embodiments are merely preferred embodiments of the present invention, and the scope of the present invention is not limited thereto, so that the changes in the shape and principle of the present invention should be covered within the protection scope of the present invention.

Claims (2)

1. A spectral attitude migration method based on a deformation map is characterized by comprising the following steps:
1) Simplifying a source grid by utilizing a grid simplification algorithm to generate a source grid deformation graph;
simplifying a source grid by using an optimized secondary error metric algorithm, namely a QEM algorithm to generate a deformation graph, wherein the total folding cost of each edge of the grid in the optimized secondary error metric algorithm is defined as:
cost(a,b)=αQ QEM (a,b)+βQ F (a,b)+γQ Reg (a,b)+μQ Are (a,b)
in the formula, a and b are two end points of the edge to be folded respectively, alpha, beta, gamma and mu are scalar weight values respectively, and Q is QEM For QEM edge folding cost, Q F Is to be foldedOffset, Q, adjacent to the minimum offset edge Reg For the cost of regularity when folding edges (a, b) → v, Q Reg =|Reg(N F (v))-max{Reg(N F (a)),Reg(N F (b))}|,N F (a)、N F (b)、N F (v) Is an adjacent triangle set with vertexes a, b and v, reg (tri) =3-2R (tri), R (tri) = cos (& lt alpha) + cos (& lt beta) + cos (& lt gamma), which is the regularity of the triangle tri,
Figure FDA0003875400400000011
wherein S (tri) is the area of triangle tri;
2) Performing coupling-alignment-and-basis-based spectral pose migration on a source grid using a reference grid, comprising the steps of:
2.1 Calculating laplacian matrixes of the input reference grid M and the input source grid M' and corresponding spectrums and characteristic functions thereof, and calculating a laplacian matrix of the deformation graph G;
2.2 Selecting direct characteristic corresponding points of the reference grid and the source grid, and calculating an indication function of s neighborhood points of the corresponding points between the reference grid and the source grid based on area approximation as a corresponding function between grids;
2.3 ) optimizing the Laplace eigenbase of the reference grid M and the source grid M' to obtain a coupled reference tone and a coupled basis { phi i M }、{φ i M′ Is calculated using a formula
Figure FDA0003875400400000012
Determining attitude transition results based on coupling criteria and bases
Figure FDA0003875400400000013
In the formula, alpha i M And alpha i M′ Spectral coefficients of M and M', respectively, k being exchange alpha i M′ The number of the vertexes, | V '| is the number of the vertexes of M';
3) Generating a post-attitude-migration deformation map by using an optimized energy function according to the attitude migration result and the source grid deformation map;
performing attitude using coupling alignment and basisAfter the state migration, utilizing an optimized energy function for the attitude migration result
Figure FDA0003875400400000021
Solving the deformation graph after the attitude transition, wherein the peak constraint term
Figure FDA0003875400400000022
Laplace coordinate item
Figure FDA0003875400400000023
Scaling constraint terms
Figure FDA0003875400400000024
Q is a geodesic distance weight matrix,
Figure FDA0003875400400000025
for the purpose of the solved deformation map,
Figure FDA0003875400400000026
for the set of deformation map vertices to be solved,
Figure FDA0003875400400000027
is composed of
Figure FDA0003875400400000028
The number of the vertexes of (a),
Figure FDA0003875400400000029
as a result of the pose migration based on the coupling alignment and the basis,
Figure FDA00038754004000000210
for rotating the transformation matrix, delta i G To morph the laplace coordinates of the graph G,
Figure FDA00038754004000000211
laplace sitting for the solved deformation mapThe mark is that,
Figure FDA00038754004000000212
is composed of
Figure FDA00038754004000000213
A scaling matrix of 1 、λ 2 Is a scalar weight;
4) Deforming the source grid to generate a target grid by using an embedded deformation graph editing method according to the deformation graph generated after the posture migration;
the method for generating the target grid by deforming the source grid by using the method for editing the embedded deformation diagram comprises the following steps:
4.1 Using a minimized energy function
Figure FDA00038754004000000214
Optimizing the attitude transition result to obtain a rotation and translation matrix of the source grid deformation, wherein
Figure FDA00038754004000000215
Is a deformation diagram
Figure FDA00038754004000000216
Number of vertices, rotation term
Figure FDA00038754004000000217
Single vertex rotation term Rot (R) j )=(c 1 ·c 2 ) 2 +(c 1 ·c 3 ) 2 +(c 2 ·c 3 ) 2 +(c 1 ·c 2 ) 2 +(c 1 ·c 1 -1) 2 +(c 2 ·c 2 -1) 2 +(c 3 ·c 3 -1) 2 ,c 1 、c 2 And c 3 Is a rotation matrix R at the vertex of the deformation graph j Column vector of (2), regularization term
Figure FDA00038754004000000218
N (j) isVertex v j T is the translation transformation, α jn =1.0, vertex constraint term
Figure FDA00038754004000000219
Figure FDA00038754004000000220
For the generated target mesh
Figure FDA00038754004000000221
The top of the upper vertex is a vertex of the lower vertex,
Figure FDA00038754004000000222
is a deformation diagram
Figure FDA00038754004000000223
Vertex of, w rot 、w reg 、w con Is scalar weight;
4.2 Using a formula after obtaining a rotational-translation matrix
Figure FDA0003875400400000031
Computing a target grid
Figure FDA0003875400400000032
Set of vertices of
Figure FDA0003875400400000033
Wherein w j (v j ') is the geodesic distance weight,
Figure FDA0003875400400000034
in order to rotate the matrix of the matrix,
Figure FDA0003875400400000035
to translate the matrix, v l ' is the vertex of the source mesh, g j (v i ') is associated with the source mesh vertex v i ' geodetically nearest m vertex sets on the deformation map G,
Figure FDA0003875400400000036
the vertex on the final target mesh is calculated;
5) And (5) segmenting all regions with insufficient grid posture migration, and carrying out layered posture migration according to the steps from 2) to 4) until the posture migration is sufficient.
2. The method for migrating spectral poses based on deformation maps according to claim 1, characterized in that: in step 5), dividing the reference grid, the generated target grid and the deformation map thereof into regions with insufficient posture migration, and carrying out layered posture migration according to the steps 2) to 4) until the posture migration is sufficient, wherein the method comprises the following steps:
5.1 Selecting partial grids with insufficient posture learning, and generating a corresponding reference grid M, a generated target grid M' and a deformation map
Figure FDA0003875400400000037
Dividing to obtain corresponding local sub-grids S, S' and G s
5.2 Using steps 2) to 3) to obtain a local deformation map G s Deformation map after attitude migration
Figure FDA0003875400400000038
5.3 Calculate G) s The average offset of the division boundary vertex position before and after the attitude transition is added to
Figure FDA0003875400400000039
The respective vertex of (a);
5.4 Utilize
Figure FDA00038754004000000310
Updating the deformation map of the vertex information
Figure FDA00038754004000000311
5.5 Utilizing the step 4) to obtain a final posture migration result.
CN201910056771.5A 2019-01-22 2019-01-22 Spectral attitude migration method based on deformation graph Active CN109859322B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201910056771.5A CN109859322B (en) 2019-01-22 2019-01-22 Spectral attitude migration method based on deformation graph

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201910056771.5A CN109859322B (en) 2019-01-22 2019-01-22 Spectral attitude migration method based on deformation graph

Publications (2)

Publication Number Publication Date
CN109859322A CN109859322A (en) 2019-06-07
CN109859322B true CN109859322B (en) 2022-12-06

Family

ID=66895490

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201910056771.5A Active CN109859322B (en) 2019-01-22 2019-01-22 Spectral attitude migration method based on deformation graph

Country Status (1)

Country Link
CN (1) CN109859322B (en)

Families Citing this family (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN111027438B (en) * 2019-12-03 2023-06-02 Oppo广东移动通信有限公司 Human body posture migration method, mobile terminal and computer storage medium
CN112530016B (en) * 2020-10-30 2022-11-11 北京字跳网络技术有限公司 Method, device, equipment and storage medium for adsorbing road fittings
CN112819961B (en) * 2021-02-18 2023-08-22 桂林电子科技大学 Simplified grid deformation method and device based on micro-computing

Citations (10)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US6362820B1 (en) * 1999-06-24 2002-03-26 Microsoft Corporation Quadric metric for simplifying meshes with appearance attributes
CN1842824A (en) * 2004-08-03 2006-10-04 松下电器产业株式会社 Human identification apparatus and human searching/tracking apparatus
CN101071514A (en) * 2006-05-12 2007-11-14 中国科学院自动化研究所 Method for directly transferring three-dimensional model attitude
CN102402691A (en) * 2010-09-08 2012-04-04 中国科学院自动化研究所 Method for tracking gestures and actions of human face
CN102855666A (en) * 2012-08-21 2013-01-02 北京师范大学 Craniofacial reconstructing method based on hierarchical regression model
CN103996221A (en) * 2014-04-21 2014-08-20 北京农业信息技术研究中心 Plant organ mesh simplification method targeted for visualization calculation
CN106484511A (en) * 2016-09-30 2017-03-08 华南理工大学 A kind of spectrum attitude moving method
CN107256557A (en) * 2017-05-03 2017-10-17 华南理工大学 A kind of controllable subdivision curved surface image vector method of error
CN107527384A (en) * 2017-07-14 2017-12-29 中山大学 A kind of lattice simplified method of Three-Dimensional Dynamic based on motion feature and its system
CN108961411A (en) * 2018-07-02 2018-12-07 南京大学 A kind of simplified method of the complex three-dimensional building model keeping external appearance characteristic

Family Cites Families (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2013123636A1 (en) * 2012-02-20 2013-08-29 Thomson Licensing Method and apparatus for mesh simplification

Patent Citations (11)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US6362820B1 (en) * 1999-06-24 2002-03-26 Microsoft Corporation Quadric metric for simplifying meshes with appearance attributes
CN1842824A (en) * 2004-08-03 2006-10-04 松下电器产业株式会社 Human identification apparatus and human searching/tracking apparatus
CN101344923A (en) * 2004-08-03 2009-01-14 松下电器产业株式会社 Human identification apparatus and human searching/tracking apparatus
CN101071514A (en) * 2006-05-12 2007-11-14 中国科学院自动化研究所 Method for directly transferring three-dimensional model attitude
CN102402691A (en) * 2010-09-08 2012-04-04 中国科学院自动化研究所 Method for tracking gestures and actions of human face
CN102855666A (en) * 2012-08-21 2013-01-02 北京师范大学 Craniofacial reconstructing method based on hierarchical regression model
CN103996221A (en) * 2014-04-21 2014-08-20 北京农业信息技术研究中心 Plant organ mesh simplification method targeted for visualization calculation
CN106484511A (en) * 2016-09-30 2017-03-08 华南理工大学 A kind of spectrum attitude moving method
CN107256557A (en) * 2017-05-03 2017-10-17 华南理工大学 A kind of controllable subdivision curved surface image vector method of error
CN107527384A (en) * 2017-07-14 2017-12-29 中山大学 A kind of lattice simplified method of Three-Dimensional Dynamic based on motion feature and its system
CN108961411A (en) * 2018-07-02 2018-12-07 南京大学 A kind of simplified method of the complex three-dimensional building model keeping external appearance characteristic

Non-Patent Citations (2)

* Cited by examiner, † Cited by third party
Title
Spectral pose transfer;MengxiaoYin et al;《Computer Aided Geometric Design》;20150325;第35-36卷;82-94 *
三维运动目标的多尺度智能递推识别新方法;张天序等;《自动化学报》;20060930;第32卷(第5期);641-657 *

Also Published As

Publication number Publication date
CN109859322A (en) 2019-06-07

Similar Documents

Publication Publication Date Title
CN109859322B (en) Spectral attitude migration method based on deformation graph
CN105957151B (en) It is a kind of based on the hexahedral mesh generation method for closing form Polycube
CN110619681B (en) Human body geometric reconstruction method based on Euler field deformation constraint
WO2011111680A1 (en) Method and apparatus for creating surface processing data
CN113077553B (en) Three-dimensional model segmentation method based on surface attribute
CN110689620B (en) Multi-level optimized grid surface discrete spline curve design method
CN113506333A (en) Medical image registration network training data set expansion method based on deformable atlas
CN109118589A (en) Geometrical model full range details restorative procedure
CN102509356A (en) Detail-kept geometrical model deformation method using grid subdivision
CN107730587A (en) One kind is based on picture quick three-dimensional Interactive Modeling method
Xi et al. Analysis of segmented human body scans
CN105427252A (en) Mesh model multi-scale geometric detail repair method based on empirical mode decomposition
CN105761314B (en) A kind of Model Simplification Method kept based on notable color attribute feature
CN116401904A (en) CAD digital-analog optimization method and visualization method
CN106484511A (en) A kind of spectrum attitude moving method
CN111274732B (en) Grid repairing method based on 'connection relation-position' iterative optimization
CN112330798A (en) Three-dimensional tiny object reconstruction method based on parameterized model
Xiao et al. A unified method for appearance and geometry completion of point set surfaces
CN108876922B (en) Grid repairing method based on internal dihedral angle compensation regularization
Shang et al. Effective re-parameterization and GA based knot structure optimization for high quality T-spline surface fitting
Salval et al. Multiresolution surface blending for detail reconstruction
CN114119928A (en) Grid operation-based lung organ three-dimensional model optimization method and system
CN114219921A (en) Suspension surface modeling method based on visual point and RBF interpolation
Chen et al. Constructing triangular meshes of minimal area
CN114820917A (en) Automatic facial skeleton binding migration method and system based on fbx file

Legal Events

Date Code Title Description
PB01 Publication
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