Looking for breakthrough ideas for innovation challenges? Try Patsnap Eureka!

A Search Method Based on Binary Code Dictionary Tree

A binary code and dictionary technology, applied in the search field based on binary code dictionary tree, can solve the problem of wasting time, and achieve the effect of reducing the number of searches, avoiding missing searches, and improving search speed.

Active Publication Date: 2018-07-10
PEKING UNIV
View PDF4 Cites 0 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

However, in practical applications, it is found that most of the hash buckets are empty, and accessing empty buckets (called missing lookups) is unnecessary and will waste a lot of time

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
  • A Search Method Based on Binary Code Dictionary Tree
  • A Search Method Based on Binary Code Dictionary Tree
  • A Search Method Based on Binary Code Dictionary Tree

Examples

Experimental program
Comparison scheme
Effect test

Embodiment Construction

[0068] In order to make the purpose, technical solutions and advantages of the embodiments of the present invention clearer, the technical solutions in the embodiments of the present invention will be clearly described below in conjunction with the accompanying drawings in the embodiments of the present invention. Obviously, the described embodiments are the Some, but not all, embodiments are invented.

[0069] There are two nearest neighbor search problems in Hamming space, namely K nearest neighbor search and r nearest neighbor search. Among them, the K nearest neighbor search is to find the K vectors with the closest Hamming distance compared with the given query vector in the data set; the r nearest neighbor search is to find all the Hamming distances in the data set that do not exceed a fixed value (r) compared with the query vector All vectors. These two issues are essentially interchangeable.

[0070] In the embodiment of the present invention, the second problem is m...

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

Disclosed is a search method based on a binary code trie. The search method comprises: acquiring a binary code of each image in a database, and dividing each binary code into m segments of sub-strings (301); for the jth segment of sub-strings of all images in the database, creating a binary code trie of the jth segments of sub-strings (302), wherein the number of the binary code tries is m; and each of the binary code tries comprises: internal nodes and leaf nodes; acquiring a binary code of an image to be queried, and m segments of sub-strings of the binary code (303); for the jth segment of sub-strings of the binary code of the image to be queried, looking up, in the binary code tries corresponding to the jth segment of sub-strings of all the images in the database, binary codes of which the Hamming distances do not exceed r' (304); traversing all the sub-strings of the binary code of the image to be queried, so as to obtain a query result of each sub-string (305), wherein j is less than or equal to m; and according to the query results of all the sub-strings of the binary code of the image to be queried, performing a combination and deduplication test, so as to acquire a search result of the image to be queried (306). The method can reduce the quantity for lookup and improve the search speed during an accurate neighbor search in a Hamming space.

Description

technical field [0001] The invention relates to computer vision technology, in particular to a search method based on binary code dictionary tree. Background technique [0002] In recent years, the problem of binary representation of high-dimensional vectors has gained extensive attention. The goal of binary encoding is to compress features into a compact binary code. Binary codes have the advantages of easy storage, easy indexing, and fast comparison, and are the first choice for processing large-scale data applications. Although the Hamming distance comparison between binary codes is very fast (millions of comparisons can be completed within 1 second), when the data size is particularly large, the method of linearly scanning the entire data set still cannot achieve real-time retrieval . Therefore, it is necessary to design an efficient indexing algorithm to improve the retrieval speed of binary codes under large-scale data sets. [0003] A common method of indexing a b...

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
Patent Type & Authority Patents(China)
IPC IPC(8): G06F17/30
CPCG06F16/51
Inventor 段凌宇黄祎程王哲高文
Owner PEKING UNIV
Who we serve
  • R&D Engineer
  • R&D Manager
  • IP Professional
Why Patsnap Eureka
  • Industry Leading Data Capabilities
  • Powerful AI technology
  • Patent DNA Extraction
Social media
Patsnap Eureka Blog
Learn More
PatSnap group products

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