Mobile visual search framework based on CRBM and Fisher network
A visual search and network technology, applied in the field of mobile visual search framework, can solve the problems of local feature information damage, the degree of convergence of the EM algorithm has a great influence, and the speed is slow.
- Summary
- Abstract
- Description
- Claims
- Application Information
AI Technical Summary
Problems solved by technology
Method used
Image
Examples
Embodiment Construction
[0070] Use the trained CRBM network and Fisher network to aggregate global compact binary features using the following algorithm, as follows:
[0071] 1) Enter:
[0072] a) GMM model trained offline
[0073] b) Image X local feature SIFT set {x j ,j=1,...,t},
[0074] 2) Image X local feature SIFT set {x j ,j=1...t}, Each local feature x in j ;
[0075] 3) Use a continuous restricted Boltzmann machine to convert x j Dimension reduction from 128 dimensions to 32 dimensions;
[0076] 4) Exit the loop;
[0077] 5) For each Gaussian function i;
[0078] 6) For each local feature SIFT descriptor j;
[0079] 7) Calculate the local feature x j The posterior probability γ corresponding to the i-th Gaussian function j (i);
[0080]
[0081] 8) Exit the loop;
[0082] 9) For each Gaussian function i, aggregate the Gaussian mean gradient vector g of all local feature likelihoods ui and the variance gradient vector Both are 32-dimensional, i=1,...,512);
[0083]1...
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