Deep convolutional neural network-based three-dimensional model retrieval algorithm
A three-dimensional model, neural network technology, applied in the field of computer vision, can solve problems such as difficulty in expanding to unknown data sets, weak algorithm generalization ability, etc.
- Summary
- Abstract
- Description
- Claims
- Application Information
AI Technical Summary
Problems solved by technology
Method used
Image
Examples
Embodiment 1
[0061] This embodiment provides a 3D model retrieval algorithm based on a deep convolutional neural network, including the following steps:
[0062] Step 1, set the 3D model database M={m 1 ,m 2 ,...,m n};
[0063] This embodiment selects SHREC, 13 data sets;
[0064] Step 11, set the unit spherical triangular mesh U={V, T}, V is a triangle vertex set, and T is a triangle set;
[0065] Step 12, randomly select d vertices from the triangular vertex set V as seed vertices, and the d seed vertices form the seed vertex set Se,
[0066] Step 131, using all seed vertices in Seeds as the seeds of the Lloyd relaxation algorithm to obtain d Voronoi cells whose centers are respectively Cent 1 , Cent 2 ,...,Cent d ;
[0067] The Lloyd relaxation algorithm adopted in this embodiment is: Lloyd S. Least squares quantization in PCM [J]. IEEE transactions on information theory, 1982, 28 (2): 129-137.
[0068] The method used in this embodiment to calculate the centers of d Voronoi ...
Embodiment 2
[0112] On the basis of Embodiment 1, this embodiment also includes:
[0113] Step 6, set the hand-drawn sketch to be tested as x s ;
[0114] Step 61, adopt the embedding function E(x) to convert x s Embedded in the Euclidean feature space, get x s The feature point E(x in the Euclidean feature space s );
[0115] Step 62, search and test the hand-drawn sketch in the Euclidean feature space as x s The feature point set F of the projection map with the same category label, calculate each feature point in F and feature point E(x s ) between the Euclidean distance;
[0116] Step 63, select the model corresponding to the first K projection map feature points with the smallest Euclidean distance as the hand-drawn sketch x to be tested s The closest K models.
PUM
Abstract
Description
Claims
Application Information
- R&D Engineer
- R&D Manager
- IP Professional
- Industry Leading Data Capabilities
- Powerful AI technology
- Patent DNA Extraction
Browse by: Latest US Patents, China's latest patents, Technical Efficacy Thesaurus, Application Domain, Technology Topic, Popular Technical Reports.
© 2024 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap|About US| Contact US: help@patsnap.com