摘要:
A specific item within an item class is identified by defining sets of descriptor data from a training library. The collected descriptor data is grouped and organized into a hierarchical tree, where each leaf node is defined by relations between corresponding parts of the descriptor data. Registrable sets of descriptor data are then identified from a collection of registrable samples. The registrable sets of descriptors are sorted into the hierarchical tree. When an input sample to be identified is received, a test set of descriptor data is generated from the input sample. The test set is then sorted into the hierarchical tree. Each leaf node that receives a part of the test set provides a vote for the registered samples it contains. The registered sample with the most votes is deemed a match for the input sample.
摘要:
An indexed hierarchical tree search structure converts each registration sample into an equivalent registration model based on the clustering of its registration item descriptors in the leaf nodes of the hierarchical tree. Query item descriptors from a query sample from someone wanting to be recognized are distributed into the hierarchical tree. A query model is defined based on the clustering of query item descriptors at the leaf nodes, and registration and verification are made based on comparison of the query model and the registration models.
摘要:
Magnetocardiogram (MCG) provides temporal and spatial measurements of cardiac electric activities, which permits current localization. An MCG device usually consists of a small number of magnetic sensors in a planar array. Each sensor provides a highly low-resolution 2D MCG map. Such a low-res map is insufficient for cardiac electric current localization. To create a high resolution MCG image from the sparse measurements, an algorithm based on model learning is used. The model is constructed using a large number of randomly generated high resolution MCG images based on the Biot-Savart Law. By fitting the model with the sparse measurements, high resolution MCG image are created. Next, the 2D position of the electric current is localized by finding the peak in the tangential components of the high resolution MCG images. Finally, the 2D current localization is refined by a non-linear optimization algorithm, which simultaneously recovers the depth of the electric current from the sensor and its magnitude and orientation.
摘要:
In a face recognition system, overlapping patches are defined on a canonical face. Random clusters of pixel pairs are defined within each patch, and binary features are determined for each pixel pair by comparing their respective feature values. An inverted index hash table is constructed of the binary features. Similar binary features are then determined on a library of registrable samples of identified faces. A log probability of each registrable sample generating a binary feature from a corresponding cluster of pixel pairs at each specific patch location is determined and stored in the hash table. In a search phase, similar binary features are determined, and a hash key is determined for each binary feature. The log probabilities for each identity found in the hash table are summed for all clusters of pixel pairs and locations and sorted to find the high probability match.
摘要:
Aspects of the present invention includes systems and methods for generating detection models that consider contextual information of an image patch and for using detection models that consider contextual information. In embodiments, a multi-scale image context descriptor is generated to represent the contextual cues in multiple parameters, such as spatial, scaling, and color spaces. In embodiments, a classification context is defined using the contextual features and is used in a contextual boost classification scheme. In embodiments, the contextual boost propagates contextual cues to larger coverage through iterations to improve the detection accuracy.
摘要:
Embodiments of the present invention include systems and methods for improved state space modeling (SSM) comprising two added layers to model the substructure transition dynamics and action duration distribution. In embodiments, the first layer represents a substructure transition model that encodes the sparse and global temporal transition probability. In embodiments, the second layer models the action boundary characteristics by injecting discriminative information into a logistic duration model such that transition boundaries between successive actions can be located more accurately; thus, the second layer exploits discriminative information to discover action boundaries adaptively.
摘要:
A catadioptric camera creates image light fields from a 3D scene by creating ray images defined as 2D arrays of ray-structure picture-elements (ray-xels). Each ray-xel captures light intensity, mirror-reflection location, and mirror-incident light ray direction. A 3D image is then rendered from the ray images by combining the corresponding ray-xels.
摘要:
Similarities between simplex projection with upper bounds and L1 projection are explored. Criteria for a-priori determination of sequence in which various constraints become active are derived, and this sequence is used to develop efficient algorithms for projecting a vector onto the L1-ball while observing box constraints. Three projection methods are presented. The first projection method performs exact projection in O(n2) worst case complexity, where n is the space dimension. Using a novel criteria for ordering constraints, the second projection method has a worst case complexity of O(n log n). The third projection method is a worst case linear time algorithm having O(n) complexity. The upper bounds defined for the projected entries guide the L1-ball projection to more meaningful predictions.
摘要:
The invention relates generally to methods for isolation and culture of umbilical cord blood stem cells, cells isolated by the methods, and therapeutic uses for those cells.
摘要:
An active appearance model is built by arranging the training images in its training library into a hierarchical tree with the training images at each parent node being divided into two child nodes according to similarities in characteristic features. The number of node levels is such that the number of training images associated with each leaf node is smaller than a predefined maximum. A separate AAM, one per leaf node, is constructed using each leaf node's corresponding training images. In operation, starting at the root node, a test image is compared with each parent node's two child nodes and follows a node-path of model images that most closely matches the test image. The test image is submitted to an AAM selected for being associated with the leaf node at which the test image rests. The selected AAM's output aligned image may be resubmitted to the hierarchical tree if sufficient alignment is not achieved.