115 results about "Spatial search" patented technology

A system and method for collaboratively designing optimized beamforming vectors is disclosed for a wireless multiple input, multiple output (MIMO) space division multiple access (SDMA) communication system to optimize an aggregate SNR performance metric across the different users, thereby permitting the flexibility to trade off computational requirements and size of control information exchanged with performance. Using adaptive vector space search methods, the space of all receive beamformers is searched to find the set which maximizes either the sum or product of SNRs of the users.

This invention provides a sound source locating method including: dividing a 3-D space into several spacial searching points in a pick-up sphere based on a pre-designed 3-D spacial coordinate, determining the research position vector of each spacial search point based on the pre-designed frequency points to determine a 3-D spacial spectrum matrix of the frequency points to determine the 3-D position information of the sound source based on said matrix.

A method, apparatus and computer program product are provided to process probe data in accordance with a map-centric map matching technique. In the context of a method, a plurality of vertices are defined along a polyline representative of a road segment such that the polyline includes one or more edges. Each edge extends between a pair of neighboring vertices. For each vertex of a respective edge, spatial searches are conducted to identify each probe point within a region about a respective vertex. For each probe point identified within a region about a respective vertex, a determination is made as to whether the probe point satisfies a projection criteria in order for the probe point to be projected onto the edge or one of the neighboring vertices between which the edge extends.

A system and method for detection of hand-drawn objects in ink input is provided. A detector may detect a drawing such as a diagram or chart from ink input by detecting closed containers and / or unclosed connectors in the drawing. An efficient grid-based approach may be used for fitting the ink strokes into an image grid with an appropriate size. A flood-fill algorithm may be used to detect the containers and connectors. A time order search may also be performed after a spatial search to handle overlapping of drawing strokes. Finally, content detection may be performed for each detected container. Once any containers and their associated content have been detected in the image grid, connector detection may be performed. By using the present invention, a user may draw diagrams and flow charts freely and without restrictions on the hand-drawn input.

A method of searching an inventory of satellite remote sensing data for data granules, scenes, or images that cover a specified area of interest whereby each data granule is indexed to the relevant ascending equatorial crossing of the satellite. Representative points in the area of interest are traced backwards along the orbital track to determine where the satellite must have crossed the equator on the ascending pass in order for the sensor to have seen the area of interest. Spatial search of the data is thereby reduced to a simple search on a range of crossing longitudes.

A method of identifying substantially similar data fields may include accessing a first / second text strings, performing an approximate string-matching algorithm that generates a first score, and comparing the first score to a first threshold. The method also includes performing an exact string-matching algorithm that generates a second score and comparing the second score to a second threshold. The method further includes generating a third score by combining a weighted first score with a weighted second score and comparing the third score to a third threshold. The method also includes determining whether the first text string is substantially similar to the second text string based on the three score comparisons.

A navigable map database, stored on a computer-readable medium and used with a navigation application program, includes data which are spatially parcelized into a plurality of parcels. Associated with each of the plurality of parcels is a first index which associates the area represented by the data in the parcel with a plurality of sub-areas formed of the area. Also associated with each of the parcels is a second index associating each of the data in the parcel with at least one of the sub-areas. Further disclosed is a method for producing a navigable map database which is parcelized into a plurality of parcels, wherein each of the plurality of parcels includes a first index which associates the area represented by the data in the parcel with a plurality of sub-areas formed of the area and a second index associating each of the data in the parcel with at least one of the sub-areas. Also further disclosed are a program and method for finding data in one or more parcels that match a spatial search criterion using a navigable map database that is parcelized into a plurality of parcels, wherein each of the plurality of parcels includes a first index which associates the area represented by the data in the parcel with a plurality of sub-areas formed of the area and a second index associating each of the data in the parcel with at least one of the sub-areas. The program and method use the first and second indices to identify which of the data in at least one of the plurality of parcels satisfy the spatial search criterion.

The invention relates to a spatial index method of two-dimension vector graphics and a device thereof. The spatial index method comprises the following steps: step one: the two-dimension vector graphics is drawn into bitmap, pixels in bitmap corresponding to visual primitive objects of the two-dimension vector graphics are set in different colors, and corresponding relationship between each visual primitive object and set colors thereof is stored; step two: corresponding pixel color of coordinate point of target position in bitmap is determined after the coordinate point of target position of the visual primitive object to be indexed which is input by an input equipment is received; step three: the determined color of the coordinate point of target position in step two is indexed into the corresponding visual primitive object of the two-dimension vector graphics. Compared with the prior art, the invention transfers complicated spatial search in wide range to linear search, and avoids complex mathematical operation in mapping progress, thus realizing rapid position of search target.

The invention provides a spatial search method for multi-modal protein conformations. According to the spatial search method, the thoughts of a spatial locality principle and an assembly process are integrated based on a crowding differential evolution algorithm, and the protein conformations obtained through experiments are processed by adopting an energy minimization process. Due to the spatial locality principle, the convergence rate of the algorithm is increased, and the problems of local convergence and modal diversity in multi-modal optimization are effectively solved; in the assembly process, different crossover strategies are randomly selected, so that better segments in the conformations are prevented from being damaged by the algorithm, and the diversity of the multi-modal protein conformations is improved; and due to the energy minimization process, the complexity of space solution of the protein conformations is reduced, and the search space of feasible zones of the protein conformations is effectively shortened. According to the spatial search method, enkephalin is taken as an example, not only is the well-known most global stable structure of the enkephalin obtained, but also a series of high-quality local stable structure are obtained, so that the problem of multi-gene and multi-target paths of diseases which cannot be solved by the traditional single-target-directed single-modal research method is solved, and the requirements of computer-aided drug design on multi-modal protein structures at the present stage are met.

The invention discloses an access control method of a spatial database. The access control method comprises the following steps of realizing authorization of the spatial database by adding access rules into an R+ tree, searching the R+ tree added with the access rules according to an access request, obtaining a spatial entity from the spatial database according to the searched result, further cutting the spatial entity according to the access request and the corresponding access rules, and returning the cut spatial entity to a user. The access control method disclosed by the invention not only supports the authorization of the spatial entity, but also supports the authorization of fine-grit splitting of the entities; the access control rules can only cover one part of the spatial entity, simultaneously, the twice queries such as judgment of the access rules and the spatial search are combined into once query, and in once query, the result of query of the user is determined and corresponding information is returned, so that the query efficiency of authorization is improved and the response speed in accessing spatial vector data with permission limitation is ensured.

The invention discloses a conformation diversity policy-based protein three-dimensional structure prediction method. Under a framework of a genetic algorithm, a Rosetta standard protocol is adopted; aloop region of a conformation is operated by utilizing a genetic operator, so that spatial search for the loop region is enhanced; and a secondary protein structure information-based diversity indexis introduced, and an energy value of the conformation serves as a selection standard of population update, so that the negative influence caused by an inaccurate energy function is reduced while thepopulation diversity is enhanced, and a near-native conformation with higher precision is predicted. The conformation diversity policy-based protein three-dimensional structure prediction method provided by the invention is relatively high in prediction precision.

A method for processing data performed in a data processing system having a storage unit is provided which includes: creating a spatial index comprising a leaf containing location information and attribute information with respect to a plurality of objects to be searched, and storing the spatial index in the storage unit; and referring to the spatial index stored in the storage unit in response to an input of a search request including location information and attribute information for searching the object to be searched, and extracting the object to be searched that agrees with the search request. With this configuration, a spatial search with subsidiary condition search can be processed at high speed, without merging results of both searches.

The invention provides a visual question and answer method based on network structure search. The method comprises the following steps: performing feature extraction on an original picture by adopting a first artificial neural network model; performing feature extraction on the text information by adopting a second artificial neural network model; a to-be-searched network structure framework being a coding-decoder framework, defining three search operators for framework network search, and the input of the search operators being image features or text features extracted based on the original picture or / and the text information; searching the architecture weight of the network structure and the operation weight of an operator by using a gradient-based alternative optimization strategy; and enabling the search network to output candidate word vectors according to a multi-classification method, and selecting the word vector with the maximum probability as an answer to be output. The visual question and answer method based on network structure search has the beneficial effect that a better effect can be searched in a larger space.

A brain tumor keyhole operation path planning method based on image guidance comprises the following steps: (1) acquiring a T1 and dMRI tumor segmentation data set, and registering an image sequence to the same coordinate space system after preprocessing; 2) using the training sample to realize accurate positioning of important functional regions of brain tumors, blood vessels and ventricles through a 3D convolutional network, and taking the segmented tumor centroid as an end point of surgical path planning; 3) establishing operation path risk estimation of voxels; 4) establishing risk estimation of each operation path through voxel risk estimation and operation path length constraint; 5) through spatial search, selecting five paths with the minimum risk from the surgical paths as candidate paths, and taking the path with the minimum risk as a planned path; 6) normalizing risk values, and establishing surgical path risk map through color coding. According to the brain tumor resection keyhole operation path planning method, the dependence of brain tumor resection keyhole operation path planning on doctors is reduced, and the track optimality is guaranteed.