Target retrieval method based on group of randomized visual vocabularies and context semantic information
A visual dictionary and semantic information technology, applied in computer components, secure communication devices, character and pattern recognition, etc., can solve problems such as high computational complexity, achieve enhanced differentiation, reduce semantic gap, and solve computational complexity Effect
- Summary
- Abstract
- Description
- Claims
- Application Information
AI Technical Summary
Problems solved by technology
Method used
Image
Examples
Example Embodiment
[0071] Embodiment 1: This embodiment is a target retrieval method based on randomized visual dictionary sets and contextual semantic information. First of all, for the low efficiency of traditional clustering algorithms and the problem of visual word synonymy and ambiguity, E 2 LSH clusters the local feature points of the training image database to generate a set of randomized visual dictionary groups that support dynamic expansion; secondly, select the query image and define the target area with a rectangular frame, and then extract the query image and image database according to Lowe's method SIFT features and E 2 LSH mapping realizes the matching of feature points and visual words; then, based on the language model, use the rectangular frame area and image saliency detection to calculate the retrieval score of each visual word in the query image and obtain the target model containing the semantic information of the target context ; Finally, for the problem of large memory cons...
Example Embodiment
[0073] Example 2: see figure 2 , image 3 , Figure 4 , The target retrieval method based on randomized visual dictionary group and contextual semantic information of this embodiment adopts the following steps to generate E 2 LSH's randomized visual dictionary group:
[0074] For each hash function g i (i=1,...,L), using it to hash the SIFT points of the training image library, the points that are very close in the space will be stored in the same bucket of the hash table, with the center of each bucket Represents a visual word, then each function g i Can generate a hash table, that is, a visual dictionary. Then, L functions g 1 ,...,G L Can generate a visual dictionary group, the process is like figure 2 Shown.
[0075] Among them, the detailed process of generating a single visual dictionary can be described as follows:
[0076] (1) SIFT feature extraction of training image library. This paper uses Oxford5K, a commonly used database for target retrieval, as the training image l...
Example Embodiment
[0103] Embodiment 3: The difference between this embodiment and the second embodiment is that the following steps are used to measure the similarity:
[0104] The similarity between the query image q and any image d in the image library can be measured by the query likelihood p(q|d), then:
[0105] p ( q | d ) = Π i = 1 M q p ( q i | d ) - - - ( 14 )
[0106] Turn it into a risk minimization problem, that is, given the query image q, the risk function of the returned image d is defined as follows:
[0107]
[0108]
[0109] p(θ D |d)p(r|θ Q ,θ D )dθ Q dθ D
[0110] Where a=d means that the returned image is d, The set of images returned from the search results in the database, r represents the similarity between the query image q and the image d, θ D Represents the language model of d, L is the loss function, which can be determined by θ Q ,θ D K-L divergence calculation between, then the risk function R can be trans...
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.
© 2024 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap