Image retrieval method based on group sparse feature selection
A feature selection and image retrieval technology, applied in special data processing applications, instruments, electrical digital data processing, etc., can solve the problems of limited description ability, unrealistic, information loss, etc., to reduce time complexity, superior performance, improve performance effect
Patent Information
- Authority / Receiving Office
- CN · China
- Current Assignee / Owner
- Publication Date
- 2014-05-21
- Estimated Expiration
- Not applicable · inactive patent
Smart Images

Figure 1 
Figure 2 
Figure 3
Abstract
Description
technical field
[0001] The invention relates to the technical field of image information processing, in particular to an image retrieval method based on group sparse feature selection. Background technique
[0002] With the rapid development of database technology, multimedia technology, and network technology, people are more and more exposed to databases with a large number of digital images. In order to manage the image database effectively, people urgently need an efficient image retrieval system. Due to technical reasons, many popular commercial Web image search engines such as Google, Baidu, 360 Search, etc. are traditional text-based image retrieval. Text-based image retrieval uses the text information associated with images in web pages to complete the search task, but it has the following disadvantages: 1. The description ability is limited, such as texture, irregular shape, etc. cannot be accurately described. 2. The description is subjective, and different people...
Examples
Embodiment Construction
[0032] The technical scheme of the present invention is described in detail below in conjunction with accompanying drawing:
[0033] A method for image retrieval based on group sparse feature selection in the present invention includes two parts: feature selection and image retrieval, such as figure 1 shown.
[0034] The feature selection steps include:
[0035] Step 1. Acquisition of image pairs and formation of similarity measure vectors: Selecting image pairs in the image library is an important preparatory work for the algorithm proposed in this paper. Starting from the first image, the selection process of image similarity pairs is shown in Fig. 2(a). Since the time complexity of keyword comparison is very low compared to the comparison of image Euclidean distance, this paper first compares the keywords of the first image in the image database with the keywords of the rest of the images, if there are more than two-thirds of the keywords If they are the same, a similar ...