CN107909099A - A kind of threedimensional model identification and search method based on thermonuclear - Google Patents
A kind of threedimensional model identification and search method based on thermonuclear Download PDFInfo
- Publication number
- CN107909099A CN107909099A CN201711103152.4A CN201711103152A CN107909099A CN 107909099 A CN107909099 A CN 107909099A CN 201711103152 A CN201711103152 A CN 201711103152A CN 107909099 A CN107909099 A CN 107909099A
- Authority
- CN
- China
- Prior art keywords
- mrow
- thermonuclear
- msup
- msub
- dimensional model
- 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.)
- Pending
Links
- 238000000034 method Methods 0.000 title claims abstract description 32
- 238000012545 processing Methods 0.000 claims abstract description 7
- 238000005070 sampling Methods 0.000 claims abstract description 5
- 238000003064 k means clustering Methods 0.000 claims description 11
- 230000008569 process Effects 0.000 claims description 8
- 239000011159 matrix material Substances 0.000 claims description 6
- 238000011524 similarity measure Methods 0.000 claims description 5
- 230000009466 transformation Effects 0.000 claims description 4
- 238000000354 decomposition reaction Methods 0.000 claims description 3
- 238000010606 normalization Methods 0.000 claims description 3
- 230000008859 change Effects 0.000 abstract description 3
- 230000009286 beneficial effect Effects 0.000 abstract description 2
- 230000006872 improvement Effects 0.000 abstract description 2
- 241000283690 Bos taurus Species 0.000 abstract 1
- 230000000052 comparative effect Effects 0.000 abstract 1
- 239000012530 fluid Substances 0.000 description 11
- 238000005537 brownian motion Methods 0.000 description 4
- 230000005653 Brownian motion process Effects 0.000 description 3
- 238000010586 diagram Methods 0.000 description 3
- 238000013461 design Methods 0.000 description 2
- 238000009792 diffusion process Methods 0.000 description 2
- 230000000694 effects Effects 0.000 description 2
- 238000000605 extraction Methods 0.000 description 2
- 238000012986 modification Methods 0.000 description 2
- 230000004048 modification Effects 0.000 description 2
- 230000007704 transition Effects 0.000 description 2
- 241000111040 Micrasema minimum Species 0.000 description 1
- 238000011161 development Methods 0.000 description 1
- 238000003745 diagnosis Methods 0.000 description 1
- 230000006911 nucleation Effects 0.000 description 1
- 238000010899 nucleation Methods 0.000 description 1
- 238000003672 processing method Methods 0.000 description 1
- 102000004169 proteins and genes Human genes 0.000 description 1
- 108090000623 proteins and genes Proteins 0.000 description 1
- 238000011160 research Methods 0.000 description 1
- 239000007787 solid Substances 0.000 description 1
- 238000012546 transfer Methods 0.000 description 1
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F18/00—Pattern recognition
- G06F18/20—Analysing
- G06F18/23—Clustering techniques
- G06F18/232—Non-hierarchical techniques
- G06F18/2321—Non-hierarchical techniques using statistics or function optimisation, e.g. modelling of probability density functions
- G06F18/23213—Non-hierarchical techniques using statistics or function optimisation, e.g. modelling of probability density functions with fixed number of clusters, e.g. K-means clustering
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/50—Information retrieval; Database structures therefor; File system structures therefor of still image data
- G06F16/58—Retrieval characterised by using metadata, e.g. metadata not derived from the content or metadata generated manually
- G06F16/583—Retrieval characterised by using metadata, e.g. metadata not derived from the content or metadata generated manually using metadata automatically derived from the content
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F18/00—Pattern recognition
- G06F18/20—Analysing
- G06F18/22—Matching criteria, e.g. proximity measures
Landscapes
- Engineering & Computer Science (AREA)
- Data Mining & Analysis (AREA)
- Theoretical Computer Science (AREA)
- Physics & Mathematics (AREA)
- General Physics & Mathematics (AREA)
- General Engineering & Computer Science (AREA)
- Bioinformatics & Cheminformatics (AREA)
- Evolutionary Biology (AREA)
- Evolutionary Computation (AREA)
- Computer Vision & Pattern Recognition (AREA)
- Bioinformatics & Computational Biology (AREA)
- Artificial Intelligence (AREA)
- Life Sciences & Earth Sciences (AREA)
- Library & Information Science (AREA)
- Probability & Statistics with Applications (AREA)
- Databases & Information Systems (AREA)
- Management, Administration, Business Operations System, And Electronic Commerce (AREA)
Abstract
The invention discloses a kind of threedimensional model identification based on thermonuclear and search method, including step, the thermonuclear feature unrelated with size of threedimensional model is extracted;Thermonuclear feature is improved, makes thermonuclear feature that there is change of scale consistency, obtains improved thermonuclear feature NSI HKS (x);The amplitude for choosing second to the 6th low frequency component of NSI HKS (x) is sampled as local feature;K mean cluster processing is carried out to the thermonuclear feature of sampling, obtains the cluster belonging to each data object;Threedimensional model similarity is measured, threedimensional model is identified and is retrieved.The beneficial effects of the invention are as follows:Utilize thermonuclear feature, carry out change of scale consistency improvement, then the selection to data sample is improved, then k average value processings are carried out, feature between different models is compared, finally use based on bright Cowes cardinal distance comparative approach with a distance from, improve identification and effectiveness of retrieval and accuracy rate.
Description
Technical Field
The invention relates to the technical field of computers, in particular to a three-dimensional model identification and retrieval method based on thermonuclear.
Background
With the development of computer technology and the improvement of computer hardware technology, the technology for acquiring three-dimensional models is rapidly developed. Three-dimensional models have not only grown dramatically in number, but they are also becoming more and more widely used. The main application fields include various aspects of industrial product design, virtual reality, three-dimensional games, building design, movie animation, medical diagnosis, molecular biological research and the like. Due to the rapid increase of the application demand of three-dimensional models, more and more three-dimensional model libraries, such as industrial solid model libraries, three-dimensional game model libraries, building model libraries, vehicle model libraries, protein molecule model libraries and the like, are generated. A large number of industries use three-dimensional models, and a large amount of time and energy are consumed for creating a high-fidelity three-dimensional model. Sometimes, the existing three-dimensional model can be used only by locally modifying, and statistics shows that more than 85% of new products are updated and modified on the basis of original products. It is very important to effectively manage these massive model information, so as to facilitate retrieval, query and reuse. Therefore, the rapid identification and retrieval of the three-dimensional model become an urgent problem to be solved.
Disclosure of Invention
In order to solve the above problems, the present invention provides a thermonuclear-based three-dimensional model identification and retrieval method, comprising the steps of:
s100) extracting the size-independent thermonuclear characteristics of the three-dimensional model, and expressing the thermonuclear characteristics of the three-dimensional model as a function HKS (x) in a time domain:
wherein λiAnd phii(x) The ith eigenvalue and the characteristic function of the Laplace-Beltrami operator of the shape;
s200) improving the thermonuclear characteristics to enable the thermonuclear characteristics to have scale transformation invariance, so as to obtain improved thermonuclear characteristics NSI-HKS (x);
s300) selecting amplitudes of second to sixth low-frequency components of NSI-HKS (x) as local features for sampling;
s400) carrying out K-means clustering processing on the sampled thermonuclear characteristics to obtain a cluster to which each data object belongs;
s500) measuring the similarity of the three-dimensional model, and identifying and retrieving the three-dimensional model.
Preferably, the step of extracting size-independent thermonuclear features of the three-dimensional model comprises:
s110) calculating Laplace-beltrami operator delta according to a formulaX=A-1W, wherein A and W are an area normalization matrix and a cosine weight matrix respectively;
s120) carrying out characteristic decomposition on the Laplace-beltrami operator to obtain lambdaiIs phiiRespectively, the ith eigenvalue and eigenvector.
Preferably, the step of improving the thermonuclear characteristics comprises:
s210) for each point x on the model, α with a time tτThe thermal characteristics are sampled, and the discrete function is shown as formula (1):
hτ=h(x,ατ) (1)
the scaling β of the S220 model is converted into a time shift S of 2logαβ and amplitude scaling β2As shown in formula (2):
h′τ=β2hτ+s(2);
s230) h takes a logarithmic form, and then takes a discrete derivative to eliminate the constant β2As shown in formula (3):
wherein,
namely, it is
S240) pairsPerforming discrete-time Fourier transform, as shown in equation (4):
H′(ω)=H(ω)e2πωs(4)
wherein H and H' are each independentlyAndis the Fourier transform of (a), omega ∈ [0,2 π ∈]
S250) then eliminate e by taking the modulus2πωsThat is, | H' (ω) | H (ω) |, and | H (ω) | is denoted as NSI-hks (x).
Preferably, τ is selected as τ e [ τ ] in the characteristic function NSI-HKS (x)min,τmax]The amplitudes of the second to sixth low frequency components of NSI-HKS (x) are sampled as local features.
Preferably, the K-means clustering process includes the steps of:
s410) randomly selecting K objects as initial clustering centers;
s420) calculating the distance between each object and each seed cluster center, and allocating each object to the cluster center closest to the object, wherein the cluster center and the objects allocated to the cluster center represent a cluster;
s430) after all the objects are distributed, the distribution center of each cluster is recalculated according to the existing objects in the cluster;
s440) continuously repeating the steps S420 and S430 until the data members of each cluster are not changed;
s450) obtaining the cluster to which each data object belongs.
Preferably, the value of K in the K-means clustering process is 60.
Preferably, the similarity measure method comprises a Minicosky distance comparison method.
Preferably, the formula of the Minkowski distance is as follows:
preferably, the step of measuring the similarity includes:
s510) comparing the distance between the first point of the model A and all the points of the model B, and selecting one group with the minimum distance for matching;
s520, comparing the Minicossian distances between the second point of the model A and all points of the model B (except matched points), and selecting one group with the minimum distance for matching until all 60 points are matched;
s530) calculating the average value of the distances among all matched points, wherein the smaller the average value is, the more similar the samples are, and the smaller the difference is; the larger the average, the more dissimilar the samples, and the greater the degree of difference.
The invention has the beneficial effects that: the invention provides a three-dimensional model identification and retrieval method based on thermonuclear, which is characterized in that the thermonuclear characteristics are utilized to improve the invariance of scale transformation, then the acquisition of data samples is improved, then k-means processing is carried out, so that the characteristics among different models can be compared, and finally, a distance comparison method based on the Minicos distance is adopted, so that the efficiency and the accuracy of identification and retrieval are improved.
Drawings
In order to more clearly illustrate the embodiments of the present invention or the technical solutions in the prior art, the drawings used in the description of the embodiments or the prior art will be briefly described below, and it is obvious that the drawings in the following description are only some embodiments of the present invention, and for those skilled in the art, other drawings can be obtained according to these drawings without inventive exercise.
FIG. 1 is a flow chart of a method for thermonuclear-based three-dimensional model identification and retrieval;
FIG. 2 is a flow chart illustrating the extraction of size-independent thermonuclear features of a three-dimensional model;
FIG. 3 is a flow diagram of an improved scale-independent method of processing thermonuclear features;
FIG. 4 is a flow chart of the K-means clustering process;
fig. 5 is a flowchart illustrating the steps of the similarity measure.
Detailed Description
The conception, the specific structure, and the technical effects produced by the present invention will be clearly and completely described below in conjunction with the embodiments and the accompanying drawings to fully understand the objects, the features, and the effects of the present invention. It is obvious that the described embodiments are only a part of the embodiments of the present invention, and not all embodiments, and those skilled in the art can obtain other embodiments without inventive effort based on the embodiments of the present invention, and all embodiments are within the protection scope of the present invention. All technical characteristics in the invention can be interactively combined on the premise of not conflicting with each other.
Fig. 1 is a flowchart illustrating a method for identifying and retrieving a three-dimensional model based on thermonuclear according to an embodiment of the present invention, where the method comprises the following steps:
s100) extracting the size-independent thermonuclear characteristics of the three-dimensional model, and expressing the thermonuclear characteristics of the three-dimensional model as a function HKS (x) in a time domain:
wherein λiAnd phii(x) The ith eigenvalue and the characteristic function of the Laplace-Beltrami operator of the shape;
s200) improving the thermonuclear characteristics to enable the thermonuclear characteristics to have scale transformation invariance, so as to obtain improved thermonuclear characteristics NSI-HKS (x);
s300) selecting amplitudes of second to sixth low-frequency components of NSI-HKS (x) as local features for sampling;
s400) carrying out K-means clustering processing on the sampled thermonuclear characteristics to obtain a cluster to which each data object belongs;
s500) measuring the similarity of the three-dimensional model, and identifying and retrieving the three-dimensional model.
FIG. 2 is a flow diagram illustrating the extraction of size-independent thermonuclear features of a three-dimensional model, according to one embodiment of the invention, comprising the steps of:
s110) calculating Laplace-beltrami operator delta according to a formulaX=A-1W, wherein A and W are an area normalization matrix and a cosine weight matrix respectively;
s120) carrying out characteristic decomposition on the Laplace-beltrami operator to obtain lambdaiIs phiiRespectively, the ith eigenvalue and eigenvector.
FIG. 3 is a flow diagram of an improved scale-independent thermonuclear feature processing method, according to a method embodiment of the invention, comprising the steps of:
s210) for each point x on the model, α with a time tτThe thermal characteristics are sampled, and the discrete function is shown as formula (1):
hτ=h(x,ατ) (1)
s220) the scaling β of the model is converted into a time shift S of 2logαβ and amplitude scaling β2As shown in formula (2):
hτ′=β2hτ+s(2);
s230) h takes a logarithmic form, and then takes a discrete derivative to eliminate the constant β2As shown in formula (3):
wherein,
namely, it is
S240) pairsPerforming discrete-time Fourier transform, as shown in equation (4):
H′(ω)=H(ω)e2πωs(4)
wherein H and H' are each independentlyAndis the Fourier transform of (a), omega ∈ [0,2 π ∈]
S250) then eliminate e by taking the modulus2πωsThat is, | H' (ω) | H (ω) |, and | H (ω) | is denoted as NSI-hks (x).
Fig. 4 is a flowchart illustrating the K-means clustering process, according to an embodiment of the present invention, including the steps of:
s410) randomly selecting K objects as initial clustering centers;
s420) calculating the distance between each object and each seed cluster center, and allocating each object to the cluster center closest to the object, wherein the cluster center and the objects allocated to the cluster center represent a cluster;
s430) after all the objects are distributed, the distribution center of each cluster is recalculated according to the existing objects in the cluster;
s440) continuously repeating the steps S420 and S430 until the data members of each cluster are not changed;
s450) obtaining the cluster to which each data object belongs.
Fig. 5 is a flowchart illustrating the steps of the similarity measure, according to an embodiment of the present invention, the steps include:
s510) comparing the distance between the first point of the model A and all the points of the model B, and selecting one group with the minimum distance for matching;
s520) comparing the Minicosky distance between the second point of the model A and all the points of the model B (except the matched points), and selecting one group with the minimum distance for matching till 60 points are all matched;
s530) calculating the average value of the distances among all matched points, wherein the smaller the average value is, the more similar the samples are, and the smaller the difference is; the larger the average, the more dissimilar the samples, and the greater the degree of difference.
According to one embodiment of the present invention, the thermonuclear feature is further described below, and for a compact riemann fluid (possibly with boundaries) M, the heat diffusion process at M depends on thermal equation (5):
wherein ΔMIs on MLaplace-beltrami operator. If M is a bounded riemann fluid, u is also required to satisfy the dirichlet boundary condition, i.e., u (x, t) ═ 0 is required to satisfy all points x on the fluid M for all times t. Given an initial heat distribution f: M → R, let Ht(f) Represents the heat distribution of the fluid M at time t, and therefore Ht(f) Thermal equation (6) is satisfied for all times t, and:
wherein HtIs a thermal operator. HtAnd ΔMAre both real function operators defined on the fluid M, so it is easy to prove that the two operators satisfy the relationSince the two operators share the same eigenfunction, if λ is ΔMOne of the characteristic values, then e-λtIs HtOne of the characteristic values. For an arbitrary Riemann fluid M, there is a function kt(x,y):R+XM M → R is such that:
where dy is the convolution form of y ∈ M. Minimum value k satisfying formula (7)t(x, t) is the thermal kernel and can be viewed as the amount of heat conducted from point x to point y in a given time t. That is to say kt(x,·)=Ht(δx) Wherein δxIs a function of δ (dirac), i.e. δ is given for any z ≠ xx(z) 0 andfor a compact fluid M, the thermal nuclei decompose with the following characteristics:
thermal nucleation can also be understood as a transfer density function of brownian motion on the riemann fluid M, which means for any polaier subset of the riemann fluid Mthe transition probability of the brownian motion starting from point x at time t isBrownian motionIs the most basic continuous-time Markov process of Riemann fluid M, which well explains the abundant characteristic information of the model contained in the thermonuclear. Since the transition probability of brownian motion is related not only to the shortest path between two points, but also to the weighted average of all possible paths at time t, the thermokernel contains more information than the shortest distance between two points. The thermonuclear contains a lot of redundant information because the thermal diffusion process depends on the thermal equation (1), which means that the characteristic equation of the spatial domain varies with time. To overcome the above difficulties, Sun et al propose a thermonuclear signature (HKS) that discards all information of the spatial domain of the thermonuclear. For a point x on the riemann fluid M, the thermonuclear signature is defined as a function hks (x) over a time domain:
wherein λiAnd phii(x) The ith eigenvalue and eigenfunction of the Laplace-Beltrami operator for that shape.
According to another embodiment of the present invention, most of the signal information is contained in the low frequency part after fourier transform, so a compact local descriptor is created by sampling | H (ω) | low frequency, and therefore the amplitudes of the first six low frequency components are taken as local features.
According to another embodiment of the present invention, different choices of the time parameter affect the characteristics of the models of different scales, and in order to better adapt the time parameter to the models of different scales, the time parameter, i.e., τ, is determined from the median value of the semi-sphere radiimin=floor(lbtmin),τmax=ceil(lbtmax) When τ > lbtmaxThen HKS will not change, and for models of different dimensions, tmaxIn contrast, the larger the scale of the model, tmaxThe larger.
According to another embodiment of the present invention, further describing the K-means clustering algorithm, the K-means clustering algorithm is to randomly select K objects as initial clustering centers, then calculate the distance between each object and each seed clustering center, and assign each object to the nearest clustering center. The cluster centers and the objects assigned to them represent a cluster. Once all objects are assigned, the cluster center for each cluster is recalculated based on the objects existing in the cluster. This process will be repeated until some termination condition is met. The termination condition may be that no (or minimum number) objects are reassigned to different clusters, no (or minimum number) cluster centers are changed again, and the sum of squared errors is locally minimal.
The similarity metric is further illustrated according to one embodiment of the present invention, assuming that a given dataset is X ═ XmWhere m is 1,2, …, total, and the samples in X describe the attribute a with d numbers1,A2,…,AdAnd d description attributes are all continuity attributes. Data sample xi=(xi1,xi2,…,xid),xj=(xj1,xj2,…,xjd). Wherein xi1,xi2,…,xidAnd xj1,xj2,…,xjdAre respectively a sample xiAnd xjCorresponding d description attributes A1,A2,…,AdThe specific value of (a). Sample xiAnd xjThe similarity between them is usually determined by the distance d (x) between themi,xj) To show that the smaller the distance, the more similar the sample is, and the smaller the difference is; conversely, the more dissimilar, the greater the degree of difference.
While the present invention has been described in considerable detail and with particular reference to a few illustrative embodiments thereof, it is not intended to be limited to any such details or embodiments or any particular embodiments, but it is to be construed as effectively covering the intended scope of the invention by providing a broad, potential interpretation of such claims in view of the prior art with reference to the appended claims. Furthermore, the foregoing describes the invention in terms of embodiments foreseen by the inventor for which an enabling description was available, notwithstanding that insubstantial modifications of the invention, not presently foreseen, may nonetheless represent equivalent modifications thereto.
Claims (9)
1. A three-dimensional model identification and retrieval method based on thermonuclear is characterized by comprising the following steps:
s100) extracting the size-independent thermonuclear characteristics of the three-dimensional model, and expressing the thermonuclear characteristics of the three-dimensional model as a function HKS (x) in a time domain:
<mrow> <mi>H</mi> <mi>K</mi> <mi>S</mi> <mrow> <mo>(</mo> <mi>x</mi> <mo>)</mo> </mrow> <mo>:</mo> <msup> <mi>R</mi> <mo>+</mo> </msup> <mo>&RightArrow;</mo> <mi>R</mi> <mo>,</mo> <mi>H</mi> <mi>K</mi> <mi>S</mi> <mrow> <mo>(</mo> <mi>x</mi> <mo>,</mo> <mi>t</mi> <mo>)</mo> </mrow> <mo>=</mo> <msub> <mi>k</mi> <mi>t</mi> </msub> <mrow> <mo>(</mo> <mi>x</mi> <mo>,</mo> <mi>x</mi> <mo>)</mo> </mrow> <mo>=</mo> <munderover> <mi>&Sigma;</mi> <mrow> <mi>i</mi> <mo>=</mo> <mn>0</mn> </mrow> <mi>&infin;</mi> </munderover> <msup> <mi>e</mi> <mrow> <mo>-</mo> <msub> <mi>&lambda;</mi> <mi>i</mi> </msub> <mi>t</mi> </mrow> </msup> <msup> <msub> <mi>&phi;</mi> <mi>i</mi> </msub> <mn>2</mn> </msup> <mrow> <mo>(</mo> <mi>x</mi> <mo>)</mo> </mrow> </mrow>
wherein λiAnd phii(x) The ith eigenvalue and the characteristic function of the Laplace-Beltrami operator of the shape;
s200) improving the thermonuclear characteristics to enable the thermonuclear characteristics to have scale transformation invariance, so as to obtain improved thermonuclear characteristics NSI-HKS (x);
s300) selecting amplitudes of second to sixth low-frequency components of NSI-HKS (x) as local features for sampling;
s400) carrying out K-means clustering processing on the sampled thermonuclear characteristics to obtain a cluster to which each data object belongs;
s500) measuring the similarity of the three-dimensional model, and identifying and retrieving the three-dimensional model.
2. The thermonuclear-based three-dimensional model identification and retrieval method of claim 1, wherein said step of extracting size-independent thermonuclear features of the three-dimensional model comprises:
s110) calculating Laplace-beltrami operator delta according to a formulaX=A-1W, wherein A and W are an area normalization matrix and a cosine weight matrix respectively;
s120) carrying out characteristic decomposition on the Laplace-beltrami operator to obtain lambdaiIs phiiRespectively, the ith eigenvalue and eigenvector.
3. The thermonuclear-based three-dimensional model identification and retrieval method of claim 1, wherein the step of improving thermonuclear characteristics comprises:
s210) for each point x on the model, α with a time tτThe thermal characteristics are sampled, and the discrete function is shown as formula (1):
hτ=h(x,ατ) (1)
the scaling β of the S220 model is converted into a time shift S of 2logαβ and amplitude scaling β2As shown in formula (2):
h′τ=β2hτ+s(2);
s230) h takes a logarithmic form, and then takes a discrete derivative to eliminate the constant β2As shown in formula (3):
<mrow> <msubsup> <mover> <mi>h</mi> <mo>&CenterDot;</mo> </mover> <mi>&tau;</mi> <mo>&prime;</mo> </msubsup> <mo>=</mo> <msub> <mover> <mi>h</mi> <mo>&CenterDot;</mo> </mover> <mrow> <mi>&tau;</mi> <mo>+</mo> <mi>s</mi> </mrow> </msub> <mo>-</mo> <mo>-</mo> <mo>-</mo> <mrow> <mo>(</mo> <mn>3</mn> <mo>)</mo> </mrow> </mrow>
wherein,
namely, it is
<mrow> <mover> <mi>h</mi> <mo>~</mo> </mover> <mrow> <mo>(</mo> <mi>x</mi> <mo>,</mo> <msup> <mi>&alpha;</mi> <mi>&tau;</mi> </msup> <mo>)</mo> </mrow> <mo>=</mo> <mfrac> <mrow> <mo>-</mo> <munderover> <mo>&Sigma;</mo> <mrow> <mi>i</mi> <mo>=</mo> <mn>0</mn> </mrow> <mi>&infin;</mi> </munderover> <msub> <mi>&lambda;</mi> <mi>i</mi> </msub> <msup> <mi>&alpha;</mi> <mi>&tau;</mi> </msup> <msup> <mi>log&alpha;e</mi> <mrow> <mo>-</mo> <msub> <mi>&lambda;</mi> <mi>i</mi> </msub> <msup> <mi>&alpha;</mi> <mi>&tau;</mi> </msup> </mrow> </msup> <msubsup> <mi>&phi;</mi> <mi>i</mi> <mn>2</mn> </msubsup> <mrow> <mo>(</mo> <mi>x</mi> <mo>)</mo> </mrow> </mrow> <mrow> <munderover> <mo>&Sigma;</mo> <mrow> <mi>i</mi> <mo>=</mo> <mn>0</mn> </mrow> <mi>&infin;</mi> </munderover> <msup> <mi>e</mi> <mrow> <mo>-</mo> <msub> <mi>&lambda;</mi> <mi>i</mi> </msub> <msup> <mi>&alpha;</mi> <mi>&tau;</mi> </msup> </mrow> </msup> <msubsup> <mi>&phi;</mi> <mi>i</mi> <mn>2</mn> </msubsup> <mrow> <mo>(</mo> <mi>x</mi> <mo>)</mo> </mrow> </mrow> </mfrac> <mo>;</mo> </mrow>
S240) pairsPerforming discrete-time Fourier transform, as shown in equation (4):
H′(ω)=H(ω)e2πωs(4)
wherein H and H' are each independentlyAndis the Fourier transform of (a), omega ∈ [0,2 π ∈]
S250) then eliminate e by taking the modulus2πωsThat is, | H' (ω) | H (ω) |, and | H (ω) | is denoted as NSI-hks (x).
4. The thermonuclear-based three-dimensional model identification and retrieval method of claim 3, wherein τ is selected as τ e [ τ ] in the feature function NSI-HKS (x)min,τmax]The amplitudes of the second to sixth low frequency components of NSI-HKS (x) are sampled as local features.
5. The thermonuclear-based three-dimensional model identification and retrieval method of claim 1, wherein the K-means clustering process comprises the steps of:
s410) randomly selecting K objects as initial clustering centers;
s420) calculating the distance between each object and each seed cluster center, and allocating each object to the cluster center closest to the object, wherein the cluster center and the objects allocated to the cluster center represent a cluster;
s430) after all the objects are distributed, the distribution center of each cluster is recalculated according to the existing objects in the cluster;
s440) continuously repeating the steps S420 and S430 until the data members of each cluster are not changed;
s450) obtaining the cluster to which each data object belongs.
6. The thermonuclear-based three-dimensional model identification and retrieval method of claim 5, wherein K is 60 in the K-means clustering process.
7. The thermonuclear-based three-dimensional model identification and retrieval method of claim 1, wherein the similarity measure comprises the method of Minkowski distance comparison.
8. The thermonuclear-based three-dimensional model identification and retrieval method of claim 7, wherein the Minkowski distance formula is:
<mrow> <mi>d</mi> <mrow> <mo>(</mo> <msub> <mi>x</mi> <mi>i</mi> </msub> <mo>,</mo> <msub> <mi>x</mi> <mi>j</mi> </msub> <mo>)</mo> </mrow> <mo>=</mo> <msup> <mrow> <mo>(</mo> <munderover> <mo>&Sigma;</mo> <mrow> <mi>k</mi> <mo>=</mo> <mn>1</mn> </mrow> <mi>d</mi> </munderover> <mo>|</mo> <msub> <mi>x</mi> <mrow> <mi>i</mi> <mi>k</mi> </mrow> </msub> <mo>-</mo> <msub> <mi>x</mi> <mrow> <mi>j</mi> <mi>k</mi> </mrow> </msub> <msup> <mo>|</mo> <mi>q</mi> </msup> <mo>)</mo> </mrow> <mrow> <mn>1</mn> <mo>/</mo> <mi>q</mi> </mrow> </msup> </mrow>
9. the thermonuclear-based three-dimensional model identification and retrieval method of claim 7, wherein the similarity measure step comprises:
s510) comparing the distance between the first point of the model A and all the points of the model B, and selecting one group with the minimum distance for matching;
s520) comparing the Minicosky distance between the second point of the model A and all the points of the model B (except the matched points), and selecting one group with the minimum distance for matching till 60 points are all matched;
s530) calculating the average value of the distances among all matched points, wherein the smaller the average value is, the more similar the samples are, and the smaller the difference is; the larger the average, the more dissimilar the samples, and the greater the degree of difference.
Priority Applications (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
CN201711103152.4A CN107909099A (en) | 2017-11-10 | 2017-11-10 | A kind of threedimensional model identification and search method based on thermonuclear |
Applications Claiming Priority (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
CN201711103152.4A CN107909099A (en) | 2017-11-10 | 2017-11-10 | A kind of threedimensional model identification and search method based on thermonuclear |
Publications (1)
Publication Number | Publication Date |
---|---|
CN107909099A true CN107909099A (en) | 2018-04-13 |
Family
ID=61844580
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
CN201711103152.4A Pending CN107909099A (en) | 2017-11-10 | 2017-11-10 | A kind of threedimensional model identification and search method based on thermonuclear |
Country Status (1)
Country | Link |
---|---|
CN (1) | CN107909099A (en) |
Cited By (3)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN108875813A (en) * | 2018-06-04 | 2018-11-23 | 北京工商大学 | A kind of three-dimensional grid model search method based on several picture |
CN109783887A (en) * | 2018-12-25 | 2019-05-21 | 西安交通大学 | A kind of intelligent recognition and search method towards Three-dimension process feature |
CN110070096A (en) * | 2019-05-31 | 2019-07-30 | 中国科学院自动化研究所 | Sub- generation method and device are described for the matched local frequency domain of non-rigid shape |
Citations (9)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN102663087A (en) * | 2012-04-09 | 2012-09-12 | 北京邮电大学 | Three-dimensional model search method based on topology and visual feature |
CN102945569A (en) * | 2012-10-23 | 2013-02-27 | 西北工业大学 | Three-dimensional model symmetry analysis method based on heat kernel signal |
CN103700090A (en) * | 2013-12-01 | 2014-04-02 | 北京航空航天大学 | Three-dimensional image multi-scale feature extraction method based on anisotropic thermonuclear analysis |
CN104462163A (en) * | 2014-03-06 | 2015-03-25 | 北京工商大学 | Three-dimensional model characterization method, search method and search system |
CN104680127A (en) * | 2014-12-18 | 2015-06-03 | 闻泰通讯股份有限公司 | Gesture identification method and gesture identification system |
CN105354593A (en) * | 2015-10-22 | 2016-02-24 | 南京大学 | NMF (Non-negative Matrix Factorization)-based three-dimensional model classification method |
CN105930497A (en) * | 2016-05-06 | 2016-09-07 | 浙江工业大学 | Image edge and line feature based three-dimensional model retrieval method |
CN106355202A (en) * | 2016-08-31 | 2017-01-25 | 广州精点计算机科技有限公司 | Image feature extraction method based on K-means clustering |
CN106446010A (en) * | 2016-08-23 | 2017-02-22 | 北京三体高创科技有限公司 | Local retrieval method and device of 3D model on the basis of fuzzy corresponding function |
-
2017
- 2017-11-10 CN CN201711103152.4A patent/CN107909099A/en active Pending
Patent Citations (9)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN102663087A (en) * | 2012-04-09 | 2012-09-12 | 北京邮电大学 | Three-dimensional model search method based on topology and visual feature |
CN102945569A (en) * | 2012-10-23 | 2013-02-27 | 西北工业大学 | Three-dimensional model symmetry analysis method based on heat kernel signal |
CN103700090A (en) * | 2013-12-01 | 2014-04-02 | 北京航空航天大学 | Three-dimensional image multi-scale feature extraction method based on anisotropic thermonuclear analysis |
CN104462163A (en) * | 2014-03-06 | 2015-03-25 | 北京工商大学 | Three-dimensional model characterization method, search method and search system |
CN104680127A (en) * | 2014-12-18 | 2015-06-03 | 闻泰通讯股份有限公司 | Gesture identification method and gesture identification system |
CN105354593A (en) * | 2015-10-22 | 2016-02-24 | 南京大学 | NMF (Non-negative Matrix Factorization)-based three-dimensional model classification method |
CN105930497A (en) * | 2016-05-06 | 2016-09-07 | 浙江工业大学 | Image edge and line feature based three-dimensional model retrieval method |
CN106446010A (en) * | 2016-08-23 | 2017-02-22 | 北京三体高创科技有限公司 | Local retrieval method and device of 3D model on the basis of fuzzy corresponding function |
CN106355202A (en) * | 2016-08-31 | 2017-01-25 | 广州精点计算机科技有限公司 | Image feature extraction method based on K-means clustering |
Non-Patent Citations (4)
Title |
---|
KOKKINOS I 等: "Dense Scale Invariant Descriptors for Images and Surfaces", 《HAL》 * |
MICHAEL M. BRONSTEIN 等: "Scale-invariant heat kernel signatures for non-rigid shape recognition", 《2010 IEEE COMPUTER SOCIETY CONFERENCE ON COMPUTER VISION AND PATTERN RECOGNITION》 * |
徐健乔: "具有尺度变换不变性的非刚体三维模型检索研究", 《中国优秀硕士学位论文全文数据库 信息科技辑(月刊)》 * |
李雅洁: "基于HKS的非刚体三维模型检索与语义标注研究", 《中国优秀硕士学位论文全文数据库 信息科技辑(月刊)》 * |
Cited By (5)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN108875813A (en) * | 2018-06-04 | 2018-11-23 | 北京工商大学 | A kind of three-dimensional grid model search method based on several picture |
CN108875813B (en) * | 2018-06-04 | 2021-10-08 | 北京工商大学 | Three-dimensional grid model retrieval method based on geometric image |
CN109783887A (en) * | 2018-12-25 | 2019-05-21 | 西安交通大学 | A kind of intelligent recognition and search method towards Three-dimension process feature |
CN110070096A (en) * | 2019-05-31 | 2019-07-30 | 中国科学院自动化研究所 | Sub- generation method and device are described for the matched local frequency domain of non-rigid shape |
CN110070096B (en) * | 2019-05-31 | 2021-01-12 | 中国科学院自动化研究所 | Local frequency domain descriptor generation method and device for non-rigid shape matching |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
USRE47340E1 (en) | Image retrieval apparatus | |
Dutta et al. | In situ distribution guided analysis and visualization of transonic jet engine simulations | |
US7653646B2 (en) | Method and apparatus for quantum clustering | |
US6633817B1 (en) | Sequence database search with sequence search trees | |
CN110188763B (en) | Image significance detection method based on improved graph model | |
WO2010064414A1 (en) | Gene clustering program, gene clustering method, and gene cluster analyzing device | |
JP2004532458A (en) | Image retrieval using distance measurement | |
JPH11242674A (en) | Method for displaying multi-dimensional data, program storage device, and program product for computer | |
CN109299301B (en) | Three-dimensional model retrieval method based on shape distribution and curvature | |
CN106844620B (en) | View-based feature matching three-dimensional model retrieval method | |
CN108846261B (en) | Gene expression time sequence data classification method based on visual graph algorithm | |
CN107909099A (en) | A kind of threedimensional model identification and search method based on thermonuclear | |
CN109492796A (en) | A kind of Urban Spatial Morphology automatic Mesh Partition Method and system | |
CN113221065A (en) | Data density estimation and regression method, corresponding device, electronic device, and medium | |
Hazarika et al. | Codda: A flexible copula-based distribution driven analysis framework for large-scale multivariate data | |
Ma et al. | An interactive framework for visualization of weather forecast ensembles | |
CN105868352A (en) | High-dimensional data dimension ordering method based on dimension correlation analysis | |
CN115168326A (en) | Hadoop big data platform distributed energy data cleaning method and system | |
KR20090069874A (en) | Method of selecting keyword and similarity coefficient for knowledge map analysis, and system thereof and media that can record computer program sources for method therof | |
CN110472659A (en) | Data processing method, device, computer readable storage medium and computer equipment | |
CN101599077A (en) | A kind of method of retrieving three-dimensional objects | |
EP4214715A1 (en) | Method and system for subsampling of cells from single-cell genomics dataset | |
CN111611714B (en) | Supersonic mixed layer order reduction method and system | |
CN110987751B (en) | Quantitative grading evaluation method for pore throat of compact reservoir in three-dimensional space | |
CN117423391A (en) | Method, system and equipment for establishing gene regulation network database |
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 | ||
CB02 | Change of applicant information |
Country or region after: China Address after: 528000 No. 18, Jiangwan Road, Chancheng District, Guangdong, Foshan Applicant after: Foshan University Address before: 528000 No. 18, Jiangwan Road, Chancheng District, Guangdong, Foshan Applicant before: FOSHAN University Country or region before: China |
|
CB02 | Change of applicant information |