Image retrieval method based on feature point clustering
An image retrieval and feature point technology, applied in digital data information retrieval, special data processing applications, instruments, etc., can solve the problems of retrieval failure, multiple interference content of images, etc., and achieve the effect of retrieval and reduction of interference.
- Summary
- Abstract
- Description
- Claims
- Application Information
AI Technical Summary
Problems solved by technology
Method used
Image
Examples
Embodiment 1
[0042] An image retrieval method based on feature point clustering, comprising the following steps:
[0043] Step 1: Extract local feature points of all images in the image database;
[0044] Local feature point in described step 1 can be SIFT feature point, adopts SIFT feature extraction operator vl_sift in MATLAB, extracts the SIFT feature point of all images in the image database;
[0045] 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;
[0046] Step 3: For each image in the database, calculate its local feature aggregation descriptor based on the local feature points of the image extracted in step 1 and the K cluster centers obtained in step 2;
[0047] Step 4: For the retrieved image, extract its local feature points, and use the K-means clustering algorithm to cluster the local feature points to generate K' classes and get K' class centers, where the v...
Embodiment 2
[0057] The difference from embodiment 1 is that the local feature points in step 1 may also be SURF feature points, ORB feature points, HOG feature points, FAST feature points, BRISK feature points or LBP feature points.
Embodiment 3
[0059] On the basis of embodiment 1. The specific method of step 3 is as follows:
[0060] Step 3-1: Calculate the class number of each feature point in the image:
[0061] (Formula 1)
[0062] in, Indicates the tth feature point of the image, , n represents the number of image feature points, Indicates the jth cluster center, , i means the obtained Class number;
[0063] Step 3-2: Calculate the residual vector for each cluster:
[0064] (Formula 2)
[0065] 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;
[0066] Step 3-3: Combine the k residual vectors obtained in step 3-2 into a one-dimensional vector using the following formula:
[0067] (Formula 3)
[0068] Step 3-4: Perform power-law normalization on each component in the one-dime...
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