Patents
Literature
Hiro is an intelligent assistant for R&D personnel, combined with Patent DNA, to facilitate innovative research.
Hiro

294 results about "Hash coding" patented technology

A hash code is a numeric value that is used to identify an object during equality testing. To address the issue of integrity, it is common to make use of hash codes. The goal is for every object to return a distinct hash code, but this often cannot be absolutely guaranteed.

Rapid image retrieval method based on supervised topology keeping hash

ActiveCN105069173AStrong semantic expression abilityStrong intra-class differential expression abilityStill image data retrievalCharacter and pattern recognitionFeature extractionAlgorithm
The invention discloses a rapid image retrieval method based on supervised topology keeping hash. The method includes the steps of S1, extracting features of obtained training images and inquiry images, converting feature spaces into new nuclear spaces, and obtaining nuclear space representation of each image; S3, conducting binary coding on the training images and the inquiry images; S4, conducting image retrieval through binary codes. For solving the rapid image retrieval problem, hash coding is studied in the nuclear space with higher expression capacity, supervise information and topology keeping information are added in the hash mapping matrix studying process, a studied mapping matrix has higher semantic expression capacity and higher within-cluster variation expression capacity, and therefore the studied binary codes are more suitable for image retrieval tasks, retrieval accuracy is improved, and retrieval result sequencing is optimized.
Owner:天津中科智能识别有限公司

Matrix decomposition cross-model Hash retrieval method on basis of cooperative training

ActiveCN106777318AImprove mutual search performanceImprove mutual search accuracyStill image data retrievalText database queryingMatrix decompositionHat matrix
The invention discloses a cross-model Hash retrieval method on the basis of cooperative training and matrix decomposition. By the aid of the cross-model Hash retrieval method, the similarity between models and the internal similarity of the models can be effectively constrained for unlabeled cross-model data. The cross-model Hash retrieval method includes implementation steps of acquiring original data and carrying out normalization processing on the original data; carrying out cooperative training to obtain constraints between the models; acquiring internal constraints of the models by the aid of neighbor relations; decomposing training data matrixes and adding the constraints between the models and the internal constraints of the models into the training data matrixes to obtain objective functions; carrying out alternate iteration to obtain expressions of basis matrixes, coefficient matrixes and projection matrixes; carrying out quantization to obtain Hash codes of training data sets and test data sets; computing the Hamming distances between every two Hash codes of the data sets; sorting the Hamming distances to obtain retrieval results. The cross-model Hash retrieval method has the advantages that constraints on the similarity between the models of the cross-model data can be obtained by the aid of cooperative training processes, accordingly, the image and text mutual retrieval performance can be improved, and the cross-model Hash retrieval method can be used for picture and text mutual search service of mobile equipment, internets of things and electronic commerce.
Owner:XIDIAN UNIV

Large-scale image library retrieval method based on local similarity hash algorithm

The invention provides a large-scale image library retrieval method based on the local similarity hash algorithm. The large-scale image library retrieval method includes the steps that a part of images are selected from an image library to be retrieved to serve as a training image set, and SIFT features of training images are extracted; a K means algorithm is used for conducting clustering on the SIFT features of the training image set to obtain a codebook; the inverse frequency of each code word in the codebook is calculated on the training image set; local sensitive hash coding is conducted on each code word; SIFT features of a queried image and images in the image library to be retrieved are extracted respectively; for each image, the word frequency of each code word in the corresponding image is calculated, and then the weight of each code word is obtained; local similarity hash codes of the images are calculated by using the similarity hash algorithm; the Hamming distances between a hash code of the queried image and the hash codes of the images to be retrieved are calculated; the Hamming distances are used for retrieving the images similar to the queried image rapidly. The large-scale image library retrieval method has good universality, reduces data storage space and also improves the query retrieval efficiency.
Owner:INST OF AUTOMATION CHINESE ACAD OF SCI

Video retrieval method based on deep learning and hash coding

The invention relates to a network training method for video data on the basis of deep learning and hash coding. The method comprises the following steps: extracting a feature matrix of a video sample by using a deep neural network; carrying out modeling by using the acquired feature matrix of the video sample as a whole body to obtain high-dimensional real value representation of the video sample; and further representing the obtained high-dimensional real value representation into binary hash coding by using a deep network.
Owner:INST OF COMPUTING TECH CHINESE ACAD OF SCI

RDF data storage and query method combined with star figure coding

InactiveCN104462609AReduce the number of query tasksReduce the number of intermediate resultsSemi-structured data indexingSpecial data processing applicationsRelevant informationMap reduce
The invention relates to an RDF data storage and query method combined with star figure coding. The RDF data storage and query method comprises the steps that S1, RDF data are preprocessed, and the RDF data are presented in an RDF data map mode; S2, an input SPARQL query statement is presented in an SPARQL query graph mode, and query decomposition is carried out; S3, the SPARQL query statement is preprocessed, and the task number of whole query, the connecting sequence of query star sub-nodes and relevant information of the query star sub-nodes are obtained; S4, the SPARQL query statement is executed, query connection planning is carried out, a Map Reduce parallel computation frame of Hadoop is adopted, and the number of times of starting a query task Job is decided according to the relevance of the SPARQL query statement; S5, subgraph query is carried out, and a Map function is adopted; S6, a result connecting algorithm is carried out, and a Reduce function is adopted. Due to the fact that a Hash coding index query strategy based on star configuration is adopted, stored data redundancy and the number of query tasks are reduced, and query efficiency is improved.
Owner:FUZHOU UNIV

Image retrieval method, device and apparatus and computer readable storage medium

The embodiment of the invention discloses an image retrieval method, device and apparatus and a computer readable storage medium. The method comprises the steps of enabling image pairs in an image database to serve as input, the distance between Hash coding pairs obtained through mapping of the image pairs, enabling the label category and the feature similarity of the image pairs to serve as lossvalues, and adopting a machine learning optimization algorithm to optimize the loss values so as to obtain a deep Hash mapping model through training; mapping the to-be-retrieved image into a to-be-retrieved Hash code by using a deep Hash mapping model; And searching a pre-constructed Hash code library for a target image whose Hamming distance difference with the to-be-retrieved Hash code satisfies a preset condition, outputting the target image as a retrieval result of the to-be-retrieved image in the image database, and mapping each image in the image database through a deep Hash mapping model to obtain the Hash code library. According to the image retrieval method and device, the problem that Hash codes of the same category of images are too consistent in the related art is effectivelysolved, and therefore accurate retrieval of the same category of images is achieved.
Owner:SUZHOU UNIV

Ultra low complexity image retrieval method based on sequence preserving hashing

The invention discloses an ultra low complexity image retrieval method based on sequence preserving hashing, and relates to image retrieval. For images in an image library, a part of images are selected randomly to serve as a training set, and corresponding image features are extracted; the dimension of an original image feature is reduced to the length same as a hash code through a nonlinear principal component analysis method; a series of supporting points are obtained through a K-means clustering algorithm to serve as the basis of follow-up hash function learning; a corresponding hash function is learned through iterative optimization; the corresponding hash function is output, and a hash code of the whole image library is calculated; for a querying image, a corresponding GIST feature is extracted, hash coding is conducted on the image feature according to the hash code function obtained through training, the hamming distance between the hash code of the querying image and an image feature code in the image library is calculated, the similarity between the querying image and a to-be-retrieved image in the image library is measured through the hamming distance, and the image high in similarity is returned.
Owner:XIAMEN UNIV

An image classification and recognition method based on a twin network

ActiveCN109840556AMake up for the shortcomings of low prediction accuracySolve balance problemsCharacter and pattern recognitionNeural architecturesData setClassification methods
The invention discloses an image classification and recognition method based on a twin network. According to the method, repeated inspection is carried out through Hash coding; preprocessing such as boundary frame prediction and affine transformation is simplified, and the data set quality is improved; Then, the test set and the training set are traversed through Hash coding, matched picture pairsand unmatched picture pairs are formed through combination in sequence, the matched picture pairs and the unmatched picture pairs are alternately input into a twin classification network for trainingfitting, and finally the classification effect that pictures of the same type are classified into the same type and different types can be effectively distinguished is achieved. According to the method, the defect of low prediction accuracy of an early-stage deep learning classification method when the test set is more than the training set and the category data is unbalanced is overcome, and theproblems that the classification data is unbalanced, the test set is more than the training set and the overall scale is small in an actual scene are solved. Besides, by encoding the picture data, the matching picture pair and the mismatching picture pair are analyzed, so that the accuracy of the twin classification network is improved, and a good example is provided for picture classification inan actual scene.
Owner:ZHEJIANG UNIV

Large-scale image library retrieval method based on self-adaptive bit allocation Hash algorithm

ActiveCN104021234ASolve the problem of large storage space and slow retrieval speedMaintain neighbor structureCharacter and pattern recognitionSpecial data processing applicationsBit allocationPrincipal component analysis
The invention discloses a large-scale image library retrieval method based on a self-adaptive bit allocation Hash algorithm. The method comprises the following steps: selecting a part of images as a training set from an image library to be retrieved, and extracting a GIST characteristic of the training set; projecting the characteristic data of the training set by using principal component analysis (PCA), and calculating the dispersion of each dimension of training data; according to the dispersion of different dimensions, allocating different bits to encode the data in a self-adaptive manner; obtaining a sub-code according to the code length of each dimension and each dimension of a threshold code, and splicing complete codes of the data in pair; corresponding to the processing and training process of a checked image and the characteristic data in the image library to be retrieved, respectively calculating Hash codes of the image to be retrieved and the characteristics of the checked images; calculating the Hamming distance of the Hash codes, thereby rapidly retrieving similar images. The method is high in universality, the neighbor structure of original characteristic data can be well maintained, and as the data are encoded by using a Hash method, the storage space of data is reduced, and the retrieval efficiency in checking is improved.
Owner:INST OF AUTOMATION CHINESE ACAD OF SCI

Image retrieval method based on multi-feature fusion

The invention provides an image retrieval method based on multi-feature fusion. The image retrieval method is used for solving the problem that an image retrieval method based on a single feature cannot meet the query requirement of a user. The method comprises the steps of performing noise reduction processing on a to-be-retrieved image by utilizing a filtering method; performing feature quantification by utilizing the improved HSV color space to extract global features of the to-be-retrieved image; performing multi-scale morphological gradient extraction on the denoised image to extract local features of the to-be-retrieved image; performing adaptive fusion on the global features and the local features to obtain an adaptive fusion image; carrying out hash coding on the self-adaptive fusion image, calculating the similarity between the to-be-retrieved image and all the images in the database through Hash codes, and selecting the first several images with the highest similarity with the to-be-retrieved image as retrieval results of the to-be-retrieved image. According to the method, the feature points of the image are fully extracted, and the edge information of the image is protected more comprehensively in the local feature extraction process, so that the retrieval accuracy is improved, and the retrieval time is shortened.
Owner:ZHENGZHOU UNIVERSITY OF LIGHT INDUSTRY

Remote sensing image content retrieval method for semi-supervised deep adversarial self-coding Hash learning

The invention discloses a remote sensing image content retrieval method for semi-supervised deep adversarial self-coding Hash learning. The method comprises the steps of establishing a remote sensingimage feature library, and selecting a plurality of samples as training samples; training an adversarial self-coding Hash learning model by using the training sample; performing Hash coding on the whole remote sensing image feature library by using an adversarial self-coding Hash coding model to obtain a Hash database; processing a query image input by a user, obtaining a feature vector corresponding to the query image through the same pre-training network, and performing Hash coding by using a confrontation self-coding Hash learning model to obtain a corresponding Hash code; and finally, calculating similar distances between the query image and all images in the image library, returning the images required by the user according to the distances from small to large, and finding the corresponding image in the remote sensing image library according to the index to complete image retrieval. According to the method, high retrieval precision can be kept under semi-supervised learning, Hashcoding is more efficient, smaller quantization loss is achieved, and the retrieval precision is further improved.
Owner:XIDIAN UNIV

Blocking perception Hash tracking method with shadow removing

InactiveCN105989611ASolve the problem of losing trackImprove robustnessImage analysisShadowingsComputer graphics (images)
The invention discloses a blocking perception Hash tracking method with shadow removing. The method comprises the steps of: determining shadow areas in an image according to the distribution characteristics of a shadow image in each channel grey-scale map of a CIELAB color space; then utilizing a color constancy theory to recover pixel points in the shadow areas to a non-shadow effect; combining blocking perception Hash coding values with color self-similarity for forming a similarity measure, and carrying out matching on tracked target sub-blocks of adjacent frames based on the similarity measure; and finally, combining the above sub-blocks to obtain the regional position of the tracked target in the current frame, and realizing the tracking of the tracked target in a video. The blocking perception Hash tracking method has the advantages that according to different moving ranges and deforming degrees of human body parts, a human body target is divided into eight sub-blocks, and on this basis, and the blocking perception Hash coding method is provided to solve the problem of an existing tracking algorithm that the tracking is unsuccessful when the human body is partially or totally shielded or partially rotated and when the illumination in the shadow areas and non-shadow areas of a natural scene changes suddenly.
Owner:NANJING UNIV OF SCI & TECH

Massive image library retrieving method based on optimal K mean value Hash algorithm

A massive image library retrieving method based on an optimal K mean value Hash algorithm comprises the steps that part of images are selected from an image library to be retrieved to serve as a training image set, and firstly GIST characteristics of images of the training image set are extracted; characteristic value allocation preprocessing is conducted on characteristic data of the training image set; the preprocessed characteristic data are divided into a plurality of sub-spaces; a codebook and codes of the codebook of the corresponding sub-space are trained out for each sub-space; the processing and training process of characteristic data in the image library to be retrieved corresponds to the processing and training process of characteristic data in inquiring images, the GIST characteristics of images to be retrieved and the GIST characteristics of the inquiring images are extracted respectively, then Hash codes of the characteristics of the images to be retrieved and Hash codes of the characteristics of the inquiring images are calculated, the Hamming distance between the codes of the characteristics of the images to be retrieved and the codes of the characteristics of the inquiring images is calculated, and thus similar images are fast retrieved. The massive image library retrieving method based on the optimal K mean value Hash algorithm has good universality, the storage space for data is reduced, and the inquiring retrieving efficiency is improved.
Owner:INST OF AUTOMATION CHINESE ACAD OF SCI
Who we serve
  • R&D Engineer
  • R&D Manager
  • IP Professional
Why Eureka
  • Industry Leading Data Capabilities
  • Powerful AI technology
  • Patent DNA Extraction
Social media
Try Eureka
PatSnap group products