Locality sensitive hash image retrieval parameter optimization method based on empirical fitting
A local sensitive hash and sensitive hash function technology, which is applied in the field of image processing, can solve problems such as errors, and achieve the effects of improving operating efficiency, reducing calculation steps, and reducing complexity
Patent Information
- Authority / Receiving Office
- CN · China
- Patent Type
- Applications(China)
- Current Assignee / Owner
- Publication Date
- 2018-12-07
Smart Images

Figure 1 
Figure 2 
Figure 3
Abstract
Description
technical field
[0001] The invention relates to a parameter optimization method, in particular to a local sensitive hash image retrieval parameter optimization method based on experience fitting, which belongs to the field of image processing. Background technique
[0002] With the advent of the data age, the processing volume of multimedia data such as images, videos, and audios on the Internet has increased dramatically. The feature dimensions to be extracted from image, video and other data reach hundreds of dimensions or even thousands of dimensions, and these high-dimensional data often show unstructured characteristics. When dealing with high-dimensional data, traditional data processing methods cannot meet the requirements. Algorithms such as data retrieval and semantic analysis pose enormous difficulties. The content-based image retrieval method does not rely on keywords to search, but performs image matching by extracting content features of images. Among them, th...
Examples
Embodiment Construction
[0033] Such as figure 1 As shown, the present invention discloses a locality-sensitive hash image retrieval parameter optimization method based on empirical fitting.
[0034] Specifically, a locality-sensitive hash image retrieval parameter optimization method based on empirical fitting includes the following steps:
[0035] S1. Define a locality-sensitive hash function family H.
[0036] S2. Let k be the number of local sensitive hash functions, and L be the number of hash index tables. When the values of L, r, and w are determined, the value of k is calculated. In this embodiment, the value range of L is [1, 1000], and the larger the value of L, the better the effect of the present invention. The w>r.
[0037] S3. Take k functions from H, and define a family G of k-dimensional locality-sensitive hash functions.
[0038] S4. Take L hash functions from G, and create L hash index tables.
[0039] The definition of locality-sensitive hash function family H described in S1...