3631 results about "Matching methods" patented technology

A method of determining at least one match item corresponding to a source item. A database of multiple items such as songs is created. Each song is also represented by an n-dimensional database vector in which each element corresponding to one of n musical characteristics of the song. An n-dimensional source song vector that corresponds to the musical characteristics of a source song is determined. A Distance between the source song vector and each of database song vector is calculated, each distance being a function of the differences between the n musical characteristics of the source song vector and one of source database song vector. The calculation of the distances may include the application of a weighted factor to the musical characteristics of resulting vector. A match song is selected based on the magnitude of the distance between the source song and each database songs after applying any weighted factors.

A computer implemented method for allocating drivers and passengers sharing a trip, the method being executed by a trip sharing service, the method comprising:

• • receiving a first service request;
  • specifying a first potential trip data object by the trip sharing service;
  • executing a matching method, the matching method checking the first potential trip data object against at least a second potential trip data object, the matching method comprising for each checking of the first against the second potential trip data objects the steps of:
    • comparing the specifications of the first potential trip data object with the specifications of the at least one second potential trip data object,
    • determining the degree of congruency of the specifications of the compared potential trip data objects,
    • assigning one role to the first and the second user;
    • adding the second potential trip data object to a result list in case the determined degree of congruency between the first and the second potential trip data object exceeds a predefined threshold.

An image matching method and system for use with multiple images of a scene captured from different angles. Image matching is performed by identifying a plurality of segments within at least two images, determining an initial disparity values for pixels in the images and then determining initial disparity planes for the segments by fitting a plane to initial disparity values for the segments. A refined disparity plane set is created by iteratively refitting the disparity planes by using various fitting cost functions and weighted linear systems. A labeling of each segment to a disparity plane is made by minimizing a global energy function that includes energy terms for segment to disparity plane matching as well as penalizing disparity plane discontinuities between adjacent image segments.

A string matching method, system, and a computer-readable medium storing instructions for determining and obtaining a representative string for a plurality of strings that are written in various manners but share the same meaning. The string matching method includes: converting the input string into one or more second-language strings with reference to a language mapping table, which stores a plurality of pieces of mapping information for mapping a first-language string to a second-language string, and generating a conversion list; searching a representative list database, which storing a plurality of records each with a representative string and a corresponding second-language representative string, for records including the same second-language representative strings as the respective second-language strings in the conversion list and generating a candidate list; and determining a representative string from the candidate list to be an output representative string. Therefore, the string matching can provide string-based multimedia data classification scenarios.

Disclosed is a method and system for multi-character multi-pattern pattern matching. In the multi-character multi-pattern pattern matching method, patterns in an input stream are detected by transitioning between states of a “compressed deterministic finite state automaton (DFA)”, with each transition based on multiple characters of the input stream. The compressed DFA is created by compressing an original DFA, such as an Aho-Corasick DFA, such that each state of the compressed DFA represents multiple consecutive states of the original DFA and each transition between the states of the compressed DFA is a combination of all of the transitions between the multiple consecutive states of the original DFA. This method can be implemented using a Ternary Content-Addressable Memory (TCAM) to store the transitions of the compressed DFA and compares the transitions with multiple characters of an input stream at a time to detect patterns in the input stream.

The invention discloses a bus GPS track data road network matching method which includes 1 collecting all GPS track data of a bus in a period; 2 determining at least one candidate matching road section for one track point to form a candidate matching road section set in the bus road network data structure; 3 judging the candidate matching road section set of surplus track points of the first track point one by one and determining at least one matching point for each track point; 4 connecting matching points of all the track points to form multiple candidate running tracks and judging the candidate running track with the most matching points as the running track; 5 determining that each road section is matched with k track points due to the fact that the running track passes through a plurality of road sections. By means of the matching method, the GPS track points are classified into the bus road network data structure as real as possible to accurately judge the actual running position of one bus at certain time to accurately obtain the road condition information.

The scene matching method for raising navigation precision includes the following steps: 1. for the topographic scene matching module in combined navigation system to read in topographic data based on the digital topographic picture; 2. to search mapping point in the topographic picture based on the current geographic location the inertial navigation system obtains; 3. to intercept the reference map data from the topographic picture around the mapping point; 4. matching the measured map and the reference map; and 5. correcting inertial navigation with the matched result so as to raise the precision of inertial navigation system greatly. One simulating combined navigation system is also disclosed, which includes an aviation trace planning module, a flight control module, an aviation trace generator, an inertial navigation module, a topographic scene matching module matching module and an image displaying module. It has high locating precision, high autonomy and excellent man-computer operation interface.

A ride matching method is disclosed herein. The ride matching method addresses many of the limitations associated with traditional dynamic ride matching applications. The method is unique in its ability to accept trips with schedules that cannot be expressed in terms of a simple recurrence pattern (e.g. Monday thru Friday work schedule). It can handle one-time and occasional trips. It is also distinct in its use of spatial analysis techniques to locate matches. Specifically, the use of a shortest path solver enables the ride matching method to perform a search along the path of a user's trip, in addition to the customary radial search around the endpoints. The shortest path solver is also used to calculate the driving distance between the user and a match. This provides a more accurate measurement than the straight-line distance used by other methods, especially in the presence of barriers.

Disclosed are a matching device and a matching method for electronic atomization device based on mobile terminal. The device includes a Bluetooth control module, an information reading module, an information transmission module and a comparing and matching module. The method includes steps of: building a Bluetooth connection between battery and mobile terminal; controlling the battery to read identification information of identification chip of atomizer; sending the identification information to the mobile terminal via Bluetooth and then carrying out a match by comparing the atomizer identification information and original identification information; and carrying out a match by comparing the identification information and original identification information. By connecting the electronic atomization device with mobile terminal via Bluetooth and by means of powerful computing ability of the mobile terminal, match between the battery and atomizer of electronic atomization device can be achieved on the mobile terminal directly.

Methods and apparatus for reducing the search space processed by mask matching methods. The search space is reduced by grouping the candidate bit patterns into groups and subgroups that have internal bit agreement between the members. By only applying the mask matching methods to a select number of groups selected by their bit agreement with the target bit pattern, the computation time and memory requirement of the mask matching method is reduced.

Methods, software and systems to determine channel ownership and physical block location within the channel in non-uniformly distributed DRAM configurations and also to detect in-range memory address matches are presented. A first method, which may also be implemented in software and/or hardware, allocates memory non-uniformly between a number of memory channels, determines a selected memory channel from the memory channels for a program address, and maps the program address to a physical address within the selected memory channel. A second method, which may also be implemented in software and/or hardware, designates a range of memory to perform address matching, monitors memory accesses and when a memory access occurs with the specified range, perform a particular function.

The invention discloses an inter-city road network index and a matching method. The invention belongs to the field of intelligent transportation. The method comprises the steps that: an inter-city road network is partitioned; a large-grid index of the partitioned inter-city road network is established, such that road section sets contained in the large-grids of the regions after partitioning can be acquired; GPS information is received from a GPS receiving system; the grid in which the GPS information exists is positioned, and a candidate matching set of road sections is acquired; an exclusion positioning method is operated in the grid; and the candidate matching set obtained after exclusion is subjected to map matching with the GPS information, such that a matching road section is found. According to the invention, the inter-city road network is partitioned, the large-grid index is established, and an algorithm is operated in the large-grid, such that inter-city road network index and matching problems are solved with high efficiency.

Systems and methods are disclosed that allow for indexing, processing, or both of information from physical media or electronic media, which may be received from a plurality of sources. In embodiments, a document file may be matched using pattern matching methods and may include comparisons with a comparison reference database to improve or accelerate the indexing process. In embodiments, information may be presented to a user as potential matches thereby improving manual indexing processes. In embodiments, one or more additional actions may occur as part of the processing, including without limitation, association additional data with a document file, making observations from the document file, notifying individuals, creating composite messages, and billing events. In an embodiment, data from a document file may be associated with a key word, key phrase, or word frequency value that enables adaptive learning so that unindexed data may be automatically indexed based on user interaction history.

A method, system, and computer program product for obtaining structured data from text includes inputting text to be transformed into structured data, defining at least one criterion relating to content of the text, applying a first matching method to the text to identify a value in the text for each of the criterion, and applying a second matching method to the text to identify a value in the text for each of the criterion that the first matching method fails to identify a value for. Each of the criterion is then associated with a value obtained by the first or second matching method to create at least one criterion-value pair, and structured data is created based on the at least one criterion-value pair. The first matching method has a higher reliability than the second matching method.

The invention discloses an information matching method and device, relates to the technical field of internet, and can solve the problem of complicated and inconvenient information matching in a chatting process. The information matching method comprises the steps as follows: a chatting record generated in an instant messaging application is detected in real time, a search application interface is called under the condition that default key words are included in the chatting record, key information corresponding to the key words is acquired through the search application interface, and finally, the key information corresponding to the key words is loaded to an interface of the instant messaging application. The information matching method and device are mainly applied to a process for displaying streetscape pictures according to the chatting record.

A dual-stage regular expression pattern matching method and system is proposed, which is designed for integration to a data processing system, such as a computer platform, a firewall, a network intrusion detention system (NIDS), or a DNA sequence analysis system, for checking whether an input code sequence (such as a network data packet) is matched to specific patterns predefined by regular expressions. The proposed system and method includes a first-stage comparison procedure for comparison of the prefix string of each input code sequence and a second-stage comparison procedure for comparison of the postfix string of the same input code sequence. This feature can be used for processing code sequences having a special pattern without producing an enormous amount of state data that would cause the problem of insufficient memory during operation.

This invention relates to one visual frequency stable method based on property matching in the computer image visual frequency process technique field, which comprises the following steps: finding out each frame of visual SIFT property points; adopting simulation module as parameters estimation module for total estimation; adopting Gauss filter and curve matching method to process visual sequence process to fill unknown area.

The invention discloses an address match method and device of logistics business. The method comprises the following steps: 1) reading an address text, 2) carrying out word segmentation on the address text according to a place name in an address database to obtain word segmentation information comprising administrative division information and interest point information, 3) matching the administrative division information of the word segmentation information with administrative division in the address database to obtain administrative division to which interest points belong, 4) matching the interest point information in the word segmentation information with all the interest points in the administrative division, executing Step 5) if the same interest point can be obtained by matching, or else, calculating an interest point matching degree, judging whether the interest point matching degree is greater than an interest point matching degree threshold, and executing Step 5) if so, 5) matching a corresponding address coordinate for the interest point, and 6) judging whether the address coordinate is within a delivery scope according to a delivery address database, and outputting a name of a corresponding delivery point if so.

The invention provides a text information similarity matching method and device on the basis of TF-IDF. The method includes the steps of acquiring text information; performing word segmentation on thetext information to obtain word segments w1, w2, ..., wn-1 and wn; using a CBOW model for calculating word vectors V(w1), V(w2), ..., V(wn-1) and V(wn) of the word segments respectively; using the TF-IDF algorithm for calculating TF-IDF values k1, k2, ..., kn-1 and kn of the word segments respectively; according to products of the word vectors of the word segments and the corresponding TF-IDF values, obtaining a sentence vector V; calculating the cosine similarity between the sentence vector V and sentence vectors of pre-stored statements, and determining the pre-stored statement with the maximum cosine similarity. Through the process above, the pre-stored statement which is the most similar to the text information can be found, the accuracy of problem recognition can be improved in the aspects of robot dialogue, information classification and the like, and therefore the dialogue efficiency or the classification efficiency is improved. A computer device and a storage medium are also provided.

The invention provides a feature extraction and matching method and device for a digital image based on PCA (principal component analysis), belonging to the technical field of image analysis. The method comprises the following steps of: 1) detecting scale space extreme points; 2) locating the extreme points; 3) distributing directions of the extreme points; 4) reducing dimension of PCA and generating image feature descriptors; and 5) judging similarity measurement and feature matching. The device mainly comprises a numerical value preprocessing module, a feature point extraction module and a feature point matching module. Compared with the existing SIFI (Scale Invariant Feature Transform) feature extraction and matching algorithm, the feature extraction and matching method has higher accuracy and matching speed. The method and device provided by the invention can be directly applied to such machine vision fields as digital image retrieval based on contents, digital video retrieval based on contents, digital image fusion and super-resolution image reconstruction.