JP2021114305A5

JP2021114305A5 -

Info

Publication number: JP2021114305A5
Application number: JP2021058595A
Authority: JP
Filing date: 2021-03-30
Publication date: 2021-09-16

Claims

A computer-implemented method of searching a database of images based on one or more query tiles included in a query.
The process of searching for the initial capture resolution of an image in the image database using query tiles for comparison and providing this query tile.
In response to the determination that the magnification level of the query tile is larger than the first threshold value, the image stored in the database whose magnification level is equal to or higher than the magnification level of the query tile is searched, and the query tile The process of returning the result tile of the first list that satisfies the query tile at that magnification level,
In response to the determination that the magnification level of the query tile is equal to or less than the first threshold value, the image stored in the database is searched, and the tile having the next lowest magnification level after the magnification level of the query tile is selected. The process of retrieving and returning the result tile of the second list that satisfies the query tile at the next lowest magnification level,
In the process of processing the result tiles of each list, for each of the result tiles
Adding the result tile to a subset of the result tiles of multiple subsets,
Recursively searching the subset for the query tile in response to a determination that the total number of result tiles in the subset of result tiles is greater than or equal to the second threshold.
Saving the results of each recursive search for a subset of the result tiles into the remaining subsets of the plurality of subsets.
Recursively searching the remaining subset for the query tile and saving the results of the search for the remaining subset.
Have a process and
Including methods.

The method of claim 1, wherein each magnification level corresponds to one level in the quadtree, and each level in the quadtree comprises a result tile representing an image.

The method of claim 2, wherein the child tile has an association with the parent tile.

The method of claim 3, wherein the parent tile is at least one of the downsampled tiles and the lowpass spatially filtered tiles of the corresponding at least one child tile.

In the method of claim 1, in response to the determination that the total number of result tiles in the subset of result tiles is less than the second threshold.
Recursively search for a subset of the result tiles for the query tile
Add recursive search results to the tentative result set and
Clear the subset and then
Recursively search the remaining subset for the query tile and
Add the search results to the provisional result set and
Clear the remaining subset and
A method of returning the provisional result set.

The method of claim 1, wherein the query includes an image and the magnification level of the query is the magnification level of the image.

In the method of claim 6 , the result tile is at least one of the magnification of the result tile, the image of the query, the filename of the index associated with the result tile, the size of the result, and the type of index. How to be included in the returned list based on.

The method of claim 1, wherein the predetermined second threshold is defined so that the method terminates in response to a determination that the number of search results falls below a certain number.

The method of claim 6 , wherein the query is updated after the process of returning a tentative result set.

The method of claim 1, wherein the query comprises a quality threshold level.

The method of claim 1, wherein the query includes a time limit and the search is performed with this time limit.

A computer-implemented way to perform a recursive search of tile sets based on query tiles,
For each tile in the current tile set in a recursive search, until the result set for the query tile is complete.
Extracting a set of tiles from the next level of the current tile set, and adding the next level tile set to the result set,
And the process of executing
A process of evaluating the degree of matching of the result set with respect to the query tile in response to the determination that the magnification level of the query tile is a predetermined target level.
For each tile in the result set, in response to the determination that the magnification level of the query tile is below the target level.
Adding tiles to a subset in response to a determination that the number of tiles in the subset is greater than or equal to a third threshold.
In response to the determination that the number of tiles in the subset is less than the third threshold,
Recursively searching the subset for the query tile
Adding the results of this recursive search to the tentative result set,
Clearing the above subset and
To do,
Recursively searching the subset for the query tile,
Adding the search results to the provisional result set,
Clearing the subset and returning the provisional result set,
And the process of executing
Including methods.

In the method according to claim 12 , in the process of evaluating the degree of matching with respect to the query tile, the match value of the first tile in the result set as compared with the query tile is less than a predetermined value. A method having to determine if there is.

In the method of claim 12 , each pixel in a tile has at least one numerical value representing at least one of the color and brightness of each pixel, and each tile is that tile. A method having the vector of at least one numerical value for all pixels in.