A multi-level image retrieval method
A technology of image retrieval and image, which is applied in the field of retrieval, can solve problems such as retrieval failure, image interference content, etc., and achieve the effect of reducing interference and achieving successful retrieval
- Summary
- Abstract
- Description
- Claims
- Application Information
AI Technical Summary
Problems solved by technology
Method used
Image
Examples
Embodiment 1
[0041] A multi-level image retrieval method, comprising the following steps:
[0042] Step 1: Extract local feature points of all images in the image database;
[0043] The local feature points in the step 1 can be SIFT feature points, SURF feature points, ORB feature points, HOG feature points, FAST feature points, BRISK feature points or LBP feature points;
[0044] Step 2: Use the K-means clustering algorithm to cluster all the local feature points extracted in step 1 to obtain K cluster centers, where the value of K is K=1-1000;
[0045] Step 3: For each image in the database, calculate its local feature aggregation descriptor based on the local feature points extracted in step 1 and the K cluster centers obtained in step 2;
[0046] Step 4: For the retrieved image, extract its local feature points, and calculate the local feature aggregation descriptor of the image based on the K cluster centers obtained in step 2 (the method of calculating its local feature aggregation ...
Embodiment 2
[0055] On the basis of embodiment 1. In the step 7, the region of interest in the retrieved image can be selected manually, and can be set as a fixed region in the retrieved image by using a saliency detection method.
Embodiment 3
[0057] On the basis of embodiment 1. The specific method of step 3 is as follows:
[0058] Step 3-1: Calculate the class number of each feature point in the image:
[0059] (Formula 1)
[0060] in, Indicates the tth feature point of the image, , n represents the number of image feature points, Indicates the jth cluster center, and i indicates the obtained Class number;
[0061] Step 3-2: Calculate the residual vector for each cluster:
[0062] (Formula 2)
[0063] in, Indicates the i-th cluster center, Indicates the kth feature point belonging to the i-th cluster in the image, and m indicates the total number of feature points in the image belonging to the i-th cluster; Represents the residual vector of the i-th cluster;
[0064] Step 3-3: Combine the k residual vectors obtained in step 3-2 into a one-dimensional vector using the following formula:
[0065] (Formula 3)
[0066] Step 3-4: Perform power-law normalization on each component in the one-dimensional...
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