1546 results about "Optimal matching" patented technology

The current disclosure uses the disciplines of Ontology and Epistemology to implement a context / content-based “multimedia conceptual search and planning”, in which the formation of conceptualization is supported by embedding multimedia sensation and perception into a hybrid database. The disclosed system comprises: 1) A hybrid database model to host concept setup. 2) A graphic user interface to let user freely issue searching request in text and graphic mode. 3) A parsing engine conducting the best match between user query and dictionaries, analyzing queried images, detecting and presenting shape and chroma, extracting features / texture of an object. (4) A translation engine built for search engine and inference engine in text and graphic mode. 5) A search engine using partitioned, parallel, hashed indexes from web crawler result, conducting search in formal / natural language in text and graphic mode. 6) A logic interference engine working in text and graphic mode, and 7) A learning / feedback interface.

Methods and apparatus are disclosed for generating and using an enhanced tree bitmap data structure in determining a longest prefix match, such as in a router, packet switching system. One implementation organizes the tree bitmap to minimize the number of internal nodes that must be accessed during a lookup operation. A pointer is included in each of the trie or search nodes to the best match so far entry in the leaf or results array which allows direct access to this result without having to parse a corresponding internal node. Moreover, one implementation stores the internal node for a particular level as a first element in its child array. Additionally, one implementation uses a general purpose lookup engine that can traverse multiple tree bitmaps or other data structures simultaneously, and perform complete searches, partial searches, and resume partial searches such as after receiving additional data on which to search.

The present invention provides a data-structure to store a search database and provides techniques to build this datastructure given a list of prefixes (P) and to search this database efficiently for a best matching prefix for an address D. The data-structure can be stored in standard memory (14), where values are stored associated with memory address locations. The data structure includes representations of addressable linked tables (FIG. 3b). The representations are related to a binary search trie (FIG. 1) and each linked table (T) has at least one entry. Entries in a table span more than one level of the binary search trie. The spanning feature relates to compression of a binary search trie into a finite number of levels (and hence tables). The finite number is less than the number of levels in the binary search trie. Hence the search algorithm is restricted to a finite, and predetermined number of search accesses to the tables to obtain a best-match result.

Systems and methods are provided for a utility meter assembly comprising: a plurality of meter components configured for measuring and collecting data, wherein the meter components include a transceiver operative for signal communications over a network; a faceplate, configured such that meter reading information is displayed on the front of the faceplate; an exterior cover configured to enclose the meter components and the faceplate, wherein the faceplate is forward of the plurality of meter components; and an internal dipole antenna situated within the exterior cover, wherein the internal dipole antenna is beyond the front of the faceplate and toward the front of the utility meter assembly. The internal dipole antenna is typically situated away from the meter components, so as to minimize interference by the meter components. The internal dipole antenna is typically tuned for optimal matching impedance in an 850 MHz or 1900 MHz receiving band, so that the desired receiving band Standing Wave Ration (SWR) is achieved, and also a specified minimum radiated power threshold is maintained.

A device for matching an antenna impedance in a portable radio telephone having transmission and receiving circuits, a foldable casing enclosing the radio, the foldable casing movable between an unfolded position and a folded position, an antenna movable between an extracted position from the foldable casing and a retracted position into the foldable casing includes means for sensing whether the foldable casing is in the unfolded position and for sensing whether the antenna is in the extracted position, and for providing a sensing signal in response thereto, and means for matching an impedance of the antenna and an impedance of the radio in response to the sensing signal, thereby making an optimal matching of impedances between the antenna and the radio according to the states of the folder casings and the antenna, and according to the transmission / reception mode.

Motion estimation is the science of predicting the current frame in a video sequence from the past frame (or frames), by slicing it into rectangular blocks of pixels, and matching these to past such blocks. The displacement in the spatial position of the block in the current frame with respect to the past frame is called the motion vector. This method of temporally decorrelating the video sequence by finding the best matching blocks from past reference frames—motion estimation—makes up about 80% or more of the computation in a video encoder. That is, it is enormously expensive, and methods do so that are efficient are in high demand. Thus the field of motion estimation within video coding is rich in the breadth and diversity of approaches that have been put forward. Yet it is often the simplest methods that are the most effective. So it is in this case. While it is well-known that a full search over all possible positions within a fixed window is an optimal method in terms of performance, it is generally prohibitive in computation. In this patent disclosure, we define an efficient, new method of searching only a very sparse subset of possible displacement positions (or motion vectors) among all possible ones, to see if we can get a good enough match, and terminate early. This set of sparse subset of motion vectors is preselected, using a priori knowledge and extensive testing on video sequences, so that these “predictors” for the motion vector are essentially magic. The art of this method is the preselection of excellent sparse subsets of vectors, the smart thresholds for acceptance or rejection, and even in the order of the testing prior to decision.

The invention relates to methods and apparatus for matching a query data object with a candidate data object by esetracting and comparing fingerprints of said data objects. In an embodiment of the invention apparatus comprising a fingerprint extraction module (110), a fingerprint matching module (210), a statistical module (120) and an identification module is provided. The fingerprint extraction module (110) receives an information signal forming part of a query object and constructs a query fingerprint. The fingerprint matching module (210) compares the query fingerprint to candidates stored in a database (215) to find at least on potentially best matching candidate. Meanwhile, the statistical module determines a statistical model of the query fingerprint so as to, for instance, determine the statistical distribution of certain information inside the query fingerprint. The threshold determiner (120) is arranged, on the basis of the distribution of the query fingerprint to derive an adaptive threshold distance within which the query fingerprint and a potentially best matching candidate may be declared similar by the identification module (130). By setting a threshold which may depend on statistical data derived from the query and / or candidate fingerprint, an improved false acceptance rate F.A.R. may be achieved.

The present invention includes a method and system for determining the profile of a structure in an integrated circuit from a measured signal, the signal measured off the structure with a metrology device, selecting a best match of the measured signal in a profile data space, the profile data space having data points with a specified extent of non-linearity, and performing a refinement procedure to determine refined profile parameters. One embodiment includes a refinement procedure comprising finding a polyhedron in a function domain of cost functions of the profile library signals and profile parameters and minimizing the total cost function using the weighted average method. Other embodiments include profile parameter refinement procedures using sensitivity analysis, a clustering approach, regression-based methods, localized fine-resolution refinement library method, iterative library refinement method, and other cost optimization or refinement algorithms, procedures, and methods. Refinement of profile parameters may be invoked automatically or invoked based on predetermined criteria such as exceeding an error metric between the measured signal versus the best match profile library.

The present invention relates to a television system (50) and a method for automatically suggesting suitable programs to a viewer from a large number of available programs. The system (50) includes a DTV-agent system (21). Title information and characteristics of programs are made available as EPG (Electronic Program Guide) data, which including at least one Electronic Program Guide Database (22). A learning module (39) records characteristics associated with each program viewed by the user, and forms sets of these characteristics. The frequency of occurrence of each set is also determined. A recommendation module (40) uses a number of tasks to compile a list of viewer recommendations (67). Various tasks are defined, with each task defining a unique combination of a manner of ordering the viewer profile (500), and particular Relevance Filters for filtering the ordered viewer profile. Upon entry of a user request for a list of program recommendations (67), a search is performed of the EPG data for programs with characteristics that best match sets selected by the task(s). The user is notified of the availability such programs, allowing selection of a particular program.

A differential compression method and computer program product combines hash value techniques and suffix array techniques. The invention finds the best matches for every offset of the version file, with respect to a certain granularity and above a certain length threshold. The invention has two variations depending on block size choice. If the block size is kept fixed, the compression performance of the invention is similar to that of the greedy algorithm, without the expensive space and time requirements. If the block size is varied linearly with the reference file size, the invention can run in linear-time and constant-space. It has been shown empirically that the invention performs better than certain known differential compression algorithms in terms of compression and speed.

A system for matching potential buyers and sellers of complex offers, comprising a plurality of data collection devices, each connected to at least one packet-based data network and adapted to collect data pertaining to a plurality of potential buyers or sellers of complex offers, a summary data generator software module operating on a server computer and connected via a data network to a database, an attribute index generator software module operating on a server computer and connected via a data network to the database, a categorization software module operating on a server computer and connected via a data network to the database, a buyer analysis engine software module operating on a server computer and connected via a data network to the database, an analysis engine software module operating on a server computer and connected via a data network to the database, and a matching engine software module operating on a server computer and connected via a data network to the database. Data collected by the data collection devices is stored in the database and is used by the summary data generator software module to generate a plurality of summary data elements pertaining to a potential buyer of a complex offer, and the plurality of summary data elements is stored in the database and used by the attribute index generator software module to generate attribute indices each based on at least two summary data elements using a weighted relational algorithm, and at least some data collected by the data collection devices is used by the buyer analysis engine software module to determine at least a probability that a buyer will buy a specific complex offer, and the marching engine software module uses an optimization algorithm to determine an optimal matching of potential buyers and complex offers based at least in part on a plurality of attribute indices and a likelihood to buy for each potential pair of offers and potential buyers.

The invention provides a remote sensing image registration method of a multi-source sensor, relating to an image processing technology. The remote sensing image registration method comprises the following steps of: respectively carrying out scale-invariant feature transform (SIFT) on a reference image and a registration image, extracting feature points, calculating the nearest Euclidean distances and the nearer Euclidean distances of the feature points in the image to be registered and the reference image, and screening an optimal matching point pair according to a ratio; rejecting error registration points through a random consistency sampling algorithm, and screening an original registration point pair; calculating distribution quality parameters of feature point pairs and selecting effective control point parts with uniform distribution according to a feature point weight coefficient; searching an optimal registration point in control points of the image to be registered according to a mutual information assimilation judging criteria, thus obtaining an optimal registration point pair of the control points; and acquiring a geometric deformation parameter of the image to be registered by polynomial parameter transformation, thus realizing the accurate registration of the image to be registered and the reference image. The remote sensing image registration method provided by the invention has the advantages of high calculation speed and high registration precision, and can meet the registration requirements of a multi-sensor, multi-temporal and multi-view remote sensing image.

A system that automatically matches schema elements is provided. In one aspect, given a selected element of one schema, the system can calculate the best matching candidate elements of another schema. The calculation can be based on a heuristic combination of factors, such as element names, element types, schema structure, existing matches, and the history of actions taken by the user. Accordingly, the best candidate (according to the calculation) can be emphasized and / or highlighted. The tool can auto-scroll to the best choice. Similarly, the user can request the calculation and display to best candidates by pressing a keyboard key or hot key. As well, the user can prompt display of the best candidates by using the mouse (e.g., moving the mouse over the element E or clicking on E), or both (e.g., mouse over with hot key depressed).

An optimization technique that reorders outerjoins and antijoins with inner joins in a bottom-up optimizer of a relational database management system (RDBMS). Each join predicate is associated with a normal eligibility list (NEL) that includes tables that are referenced in the join predicate and an extended eligibility list (EEL) that includes additional tables that are referenced in conflicting join predicates. An EEL includes all the tables needed by a predicate to preserve the semantics of the original query. During join enumeration, the optimizer determines whether a join predicate's EEL is a subset of all the tables in two subplans to be merged, i.e., whose EEL is covered. If so, the two subplans are combined using the join predicate. Otherwise, the two subplans cannot be joined. Two approaches are used to reordering: without compensation and with compensation. The "without compensation" approach only allows join reorderings that are valid under associative rules. Thus, the optimizer will not combine subplans using a join predicate whose EEL is not covered. The "with compensation" approach allows two subplans to be combined using the join predicate, when a join predicate's EEL is not covered, as long as the join predicate's NEL is covered. Compensation is performed through nullification and best match. Multiple compensations may be merged and performed at any time.

Novel data structures, methods and apparatus for finding the longest prefix match search when searching tables with variable length patterns or prefixes. To find the exact match or the best matching prefix, patterns have to be compared a bit at a time until the exact or first match is found. This requires “n” number of comparisons or memory accesses to identify the closest matching pattern. The trees are built in such a way that the matching result is guaranteed to be a best match, whether it is an exact match or a longest prefix match. Using the trail of all the birds and associated prefix lengths enables determination of the correct prefix result from the trail. By construction, the search tree provides the best matching prefix at or after the first compare during walking of the trail or tree.

A method for compensating for reduced picture quality when combining a multi-chip encoding chipset into a single integrated semiconductor IC. The method includes additional functions provided on the single IC to compensate for the negative effects on picture quality produced as a result of rounding 8 bit luminance pixel data to 5 bits, where the luminance data values are supplied as input to the search function. The additional functions are collectively referred to as motion biasing and are applied to influence the choice of a "best match" motion type, which is well known in the art. The biasing is performed by the addition of a weight factor to a total difference result that is calculated by the search function. The biasing is applied only for the purpose of influencing the choice of a reference frame that is not necessarily the frame which produces an optimal motion vector, but rather will result in using fewer bits to encode macroblocks.

The invention relates to a multiple-template matching identity recognition method based on an ECG (Electrocardiogram) under an electrocardiogram abnormality state, and belongs to the technical field of biological characteristic identity recognition. The ECG data of a user to be recognized is compared with the data of a registered user in a template library to obtain an identity recognition result. The key technology of the method comprises the following steps: carrying out electrocardiosignal preprocessing for eliminating noise interference; carrying out electrocardiosignal decomposition to separate an electrocardiogram waveform of each period; carrying out standardized processing for independently achieving standardization on time and amplitude scales; carrying out characteristic extraction: in the step, characteristics are extracted by wavelet transform, and clustering analysis is carried out by an ISODATA (Iterative Self-organizing Data Analysis Techniques Algorithm) so as to construct an ECC template library; and carrying out correlation analysis: in the step, correlation between ECG test data and each template is calculated, an optimal matching template is selected, and finally, an identity recognition result is obtained. The multiple-template matching identity recognition method provided by the invention utilizes the intrinsic electrocardiosignal of a human body to recognize an identity, and the ECG data under the abnormality state is considered.

A motion estimation algorithm finds the best match for a given block or macroblock so that the resulting error signal has very low energy level which is computed, for e.g., by the SAD method. The motion estimation algorithm also provides for an optional sub-pixel level estimation and an inter4v search, and allows for restricting the number of searches for a Frame-frame ME (motion estimation) using Top-Top and Bottom-Bottom field MEs. The algorithm provides for a selective early exit and enables selecting a suitable search area with N candidate points (4 to 8) for starting the search. The search is conducted progressively till a minimum error signal (low energy level signal) is reached. The candidate points for search may be in a diamond shaped configuration, and there may be a plurality of successive diamond configurations, the number of which is configurable. The invention has application in MPEG-4 and H.264 standards.

The invention discloses a bi-directional prediction method for video coding / decoding. When bi-directional prediction coding at the coding end, firstly the given forward candidate motion vector of the current image block is obtained for every image block of the current B-frame; the backward candidate motion vector is obtained through calculation, and the candidate bi-directional prediction reference block is obtained through bi-directional prediction method; the match is computed within the given searching scope and / or the given matching threshold; finally the optimal matching block is selected to determine the final forward motion vector, and the backward motion vector and the block residual. The present invention achieves the object of bi-directional prediction by coding a single motion vector, furthermore, it will not enhance the complexity of searching for a matching block at the coding end, and may save amount of coding the motion vector and represent the motion of the objects in video more actually. The present invention realizes a new prediction coding type by combining the forward prediction coding with the backward.

The invention provides a micro-service dynamic disposition system based on cloud calculation. The system is characterized in that the system comprises a service management Portal, a system management Portal, a service disposition scheduling apparatus, a service program management device and a service container and belongs to the technical field of Internet cloud calculation. According to the invention, multi-dimensional parameters are configured for the system, and condition matching algorithms corresponding to data structures of the parameters are designed, and the micro-service dynamic disposition and management method and system are disclosed, so that premise matching of cloud calculation micro-service under a multi-dimensional condition is available, the optimal matching of limit factors in the aspects of target service areas, concurrence capability requirements and operation environment are ensured for each piece of service, the service disposition is enabled to reach the granularity of an API level, the calculation resources are more fully utilized, and the dynamic distribution capability of the calculation resources are optimized in a platform level (PaaS).

The invention provides a road sign drawing and vehicle positioning method and system for automatic drive.Through cooperation use of a binocular camera and laser radar, a high-precision road surface characteristic map is generated semi-automatically, edge points of a road sign on an image acquired by the binocular camera are detected through the binocular camera, the edge points are matched with sampling points of a line segment on the high-precision road surface characteristic map, a Kalman filtering positioning model is used for optimization to find out optimal matching, and then vehicle positioning is completed.Through the road sign drawing and vehicle positioning method and system for automatic drive, positioning is stable, robustness is high, and the influence of shielding and reflection by vegetation barriers is avoided; meanwhile, compared with a radar sensor, the binocular camera is more suitable for commercial popularization due to price, low in price and suitable for civil use.

A system, method, and computer-readable medium for detecting and eliminating correspondence errors associated with image occlusions. In a first embodiment of the invention, the method applies traditional correspondence methods for matching points in two images, a left image (FIG. 1A) and a right image (FIG. 1B), taken of the same scene. The method applies the correspondence method to locate a matching a point (310) in the right image (FIG. 1B) with a “best match” point (320) in the left image (FIG. 1A). A set of matching points (310, 320) is generated. A second search is then performed by using the best match point (320) in the right image (FIG. 1B) as the basis for an additional correspondence search in the left image (FIG. 1A). The range of match candidates in the second search is such that points to the left of the starting point (310) are not tested as match candidates. The point (330) generated in the second search may be the same point (310) that was used in the first search or may be a different point altogether. The results of the second search are selected as the match candidates.

A system and method for finding a business entity in a database that matches input data. A web services interface accepts a match request and provides a best match. A pre-processing layer cleans, parses, and standardizes input data into terms. An application layer includes a match engine for processing the match request using the terms. The match engine evaluates and scores match candidates from the database to provide the best match and, optionally, an ordered list of match candidates.

A method of automatically matching schemas begins by extracting schemas from sources and targets. Then, source and target attributes are extracted from the schemas. Each source schema will have multiple source attributes and each target schema will also have multiple target attributes. The source attributes and the target attributes are presented as nodes in a bipartite graph. This bipartite graph has edges between nodes that are related to each other. A plurality of similarity scores are defined between each set of related nodes. Each of the similarity scores is based on a different context-specific cue of the attributes that the nodes represent. These context-specific cues can comprise lexical name, semantic name, type, structure, functional mappings, etc. An overall weight is computed for each edge in the bipartite graph by combining the similarity scores of each set of nodes that form an edge. In addition, an optimal matching of the schemas is assembled, so as to indicate the level of similarity between each of the source and target schemas. The optimal matching selects pairs of nodes between source and target schemas that maximizes the number of nodes matched as well as the overall score of match for the nodes selected.

The invention discloses a bi-directional prediction method for video coding / decoding. When bi-directional prediction coding at the coding end, firstly the given forward candidate motion vector of the current image block is obtained for every image block of the current B-frame; the backward candidate motion vector is obtained through calculation, and the candidate bi-directional prediction reference block is obtained through bi-directional prediction method; the match is computed within the given searching scope and / or the given matching threshold; finally the optimal matching block is selected to determine the final forward motion vector, and the backward motion vector and the block residual. The present invention achieves the object of bi-directional prediction by coding a single motion vector, furthermore, it will not enhance the complexity of searching for a matching block at the coding end, and may save amount of coding the motion vector and represent the motion of the objects in video more actually. The present invention realizes a new prediction coding type by combining the forward prediction coding with the backward.

The invention relates to a system and method for recognition, classification and spatial localization of bounded 3D-objects. In particular it relates to a computerized method for recognition, classification and localization of objects. The method comprises generation of a training database based on a large number of training views recorded by a camera or constructed using a CAD representation of an object. Characteristic curves are derived from the training views, and primitives of the curves are detected. Intrinsic and extrinsic descriptors of features are stored in the database together with data about the object class and pose of the view. Finally the recognition takes place in two stages: First the intrinsic descriptors of the recognition view are compared with those of the database. Second, among the best matching features it is explored which features agree mutually in the sense that they suggest the same object class at the same pose.

A phishing webpage detection method based on Hungary matching algorithm is characterized by firstly extracting the text feature signatures, image feature signatures and general webpage feature signatures of the rendered webpages and more comprehensively depicting the features after access to webpages; and then computing the optimal matching of bipartite graphs by Hungary algorithm to search for the matched feature pairs among different webpage signatures and more objectively measuring the similarity among the webpages on the basis, thereby improving the phishing webpage detection efficiency. The method is also characterized by determining the inside weights of the text features, image features and global image features by utilizing the area under curve and determining the relative weightsamong the text similarity, image similarity and global image similarity during webpage similarity computation by utilizing logarithmic regression analysis. The precision and the recall rate are greatly improved in the method provided by the invention.

The invention relates to a vehicle GPS data map matching method based on a hidden markov model. The method comprises the following steps: acquiring route data from a shpefile electronic map; extracting original vehicle trajectory data, and preprocessing vehicle GPS data; taking a road section with a certain distance of each GPS observation point as a candidate road section; calculating the observation probability of each GPS point and transition probability of an adjacent candidate road section on the basis of the hidden markov model; and calculating an optimal matching trajectory by using a viterbi algorithm. The vehicle GPS data map matching method is based on the hidden markov model, by consideration of the positions of the GPS points, speed and direction, topology of a road network and the associated information between trajectory points and the road network, new observation probability and new transition probability are raised, and therefore, map matching accuracy is improved further.