Unlock instant, AI-driven research and patent intelligence for your innovation.

Data filtering method and system for high-dimensional image data retrieval

A technology of image data and filtering method, which is applied in the field of image processing, can solve the problems of not establishing a sampling index and the disaster of dimensionality, etc., and achieve the effect of improving efficiency

Active Publication Date: 2020-08-25
BEIJING UNION UNIVERSITY
View PDF4 Cites 0 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

The disadvantage of this method is that no sampling index is established, and it cannot solve the problem caused by the curse of dimensionality.

Method used

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
View more

Image

Smart Image Click on the blue labels to locate them in the text.
Viewing Examples
Smart Image
  • Data filtering method and system for high-dimensional image data retrieval
  • Data filtering method and system for high-dimensional image data retrieval
  • Data filtering method and system for high-dimensional image data retrieval

Examples

Experimental program
Comparison scheme
Effect test

Embodiment 1

[0065] like figure 1 As shown, step 100 is executed to generate a set D of high-dimensional image data points. The range of high-dimensional image data point set D is D={d i |d i ∈D}, where, d i is a high-dimensional image data point, i∈N, and N represents the number of high-dimensional image data points.

[0066] Step 110 is executed to select a reference point set f from the high-dimensional image data point set. The range of reference point set f is f={f k | f k ∈F}, where f k is the reference point, k∈K, K represents the number of the reference point. like Figure 1A As shown, in this step, step 111 is executed to randomly select a data point in the high-dimensional image data points as the first reference point f 1 . Execute step 112, select the first reference point f from the remaining high-dimensional image data points 1 The farthest point is the second reference point f 2 . Execute step 113, select f from the remaining high-dimensional image data points ...

Embodiment 2

[0071] like figure 2 As shown, a data filtering system for high-dimensional image data retrieval includes a set generation module 200 , a selection module 210 , a model generation module 220 , a filtering module 230 and an output module 240 .

[0072] Set generating module 200: for generating a set D of high-dimensional image data points. The range of high-dimensional image data point set D is D={d i |d i ∈D}, where, d i is a high-dimensional image data point, i∈N, and N represents the number of high-dimensional image data points.

[0073] Selection module 210: for selecting a reference point set F from the high-dimensional image data point set. The range of reference point set F is F={f k | f k ∈F}, where f k is the reference point, k∈K, K represents the number of the reference point. The selection method of the selection module 210 includes the following steps: Step 11: Randomly select a data point in the high-dimensional image data points as the first reference poi...

Embodiment 3

[0078] The invention proposes a data filtering method oriented to high-dimensional image data search, which performs effective pruning operation on the data to be compared, and greatly improves the search efficiency.

[0079] The implementation method is as follows:

[0080] 1. The set of data points is D, D={d i |d i ∈D}, i∈N, where N represents the number of data in the dataset.

[0081] 2. Select the reference point set F in the global data set D, F={f k | f k ∈F}, k∈K, K represents the number of reference points.

[0082] First randomly select a data point among the data points as the first reference point f 1 ;

[0083] Select and f among the remaining data points 1 The farthest point is used as the second reference point f 2 ;

[0084] Among the remaining data points select with f 1 and f 2 The distance and maximum data point is used as the new reference point;

[0085]Repeat the above process until enough datum points are selected.

[0086] 3. Calculate the...

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to View More

PUM

No PUM Login to View More

Abstract

The invention provides a data filtering method and system for high-dimensional image data retrieval, and the method comprises the steps: generating a high-dimensional image data point set D, and alsocomprises the following steps: selecting a reference point set F from the high-dimensional image data point set; generating a retrieval model; inputting each datum point in the datum point set F intothe retrieval model for filtering; and outputting the filtered high-dimensional image data point set. According to the data filtering method and system for high-dimensional image data retrieval, the datum point set is selected and established to achieve filtering of the data point set, and therefore the retrieval speed is increased.

Description

technical field [0001] The invention relates to the technical field of image processing, in particular to a data filtering method and system for high-dimensional image data retrieval. Background technique [0002] In the fields of image, bioinformatics, medical imaging, time series, etc., it is necessary to perform similarity query on large data sets. Through feature conversion, the data object feature is mapped to the feature vector of high-dimensional vector space, and the similarity query is converted into the nearest neighbor query of the vector space, that is, given the query data q and the query radius r, find the distance q from the database as r data points. In order to improve query efficiency, researchers have proposed various index structures to manage feature vectors, such as KD tree, R tree, R* tree, TV tree, SR tree, etc. The performance of these index structures will drop sharply when the dimensionality increases, so that the performance of most high-dimensi...

Claims

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to View More

Application Information

Patent Timeline
no application Login to View More
IPC IPC(8): G06F16/535G06F16/583
CPCG06F16/535G06F16/583
Inventor 梁晔马楠何勤高跃李文法姬厚国
Owner BEIJING UNION UNIVERSITY