Abstract: A system for dynamically parallelizing the loading operation for loading a data file onto a database. The dynamic parallelization of the loading operation involves scanning the data file in segments, such that scanning of an individual segment terminates when the scanned information is enough to enable loading of the segment across a plurality of exclusive-access memory blocks. Following the scanning of the first data file segment, the parallelized loading of each scanned segment occurs in a lock-step-mode with the scanning operation. As such, the loading of each scanned data segment is performed in parallel across multiple exclusive-access memory location, as determined by the prior scanning results, and furthermore in parallel with the scanning of a subsequent segment of the data file.

Abstract: A system for generating a parallel calculation plan to evaluate a rule-set or a rule-based expression list by spilling the list of rule-based expressions into multiple task units and reconfiguring all independent task units at the same calculation levels into several parallelized task groups such that task units within each task group may be scheduled for parallel execution across a cluster of processing nodes. The parallelization may be dynamically determined based on generated tasks but may further be subject to an additional layer of parallelization based on range-based splitting of each task into multiple parallel executable subtasks. The final parallelized calculation plan may include a set of sequentially ordered task groups based on logical dependencies and problem partitioning with information regarding parallelized execution of each task group.

Abstract: A system for generating a parallel calculation plan to evaluate a rule-set or a rule-based expression list by spilling the list of rule-based expressions into multiple task units and reconfiguring all independent task units at the same calculation levels into several parallelized task groups such that task units within each task group may be scheduled for parallel execution across a cluster of processing nodes. The parallelization may be dynamically determined based on generated tasks but may further be subject to an additional layer of parallelization based on range-based splitting of each task into multiple parallel executable subtasks. The final parallelized calculation plan may include a set of sequentially ordered task groups based on logical dependencies and problem partitioning with information regarding parallelized execution of each task group.

Abstract: A system for dynamically parallelizing the loading operation for loading a data file onto a database. The dynamic parallelization of the loading operation involves scanning the data file in segments, such that scanning of an individual segment terminates when the scanned information is enough to enable loading of the segment across a plurality of exclusive-access memory blocks. Following the scanning of the first data file segment, the parallelized loading of each scanned segment occurs in a lock-step-mode with the scanning operation. As such, the loading of each scanned data segment is performed in parallel across multiple exclusive-access memory location, as determined by the prior scanning results, and furthermore in parallel with the scanning of a subsequent segment of the data file.

Abstract: One embodiment is directed to a method for controlling access to a domain. The method includes receiving a request from a workbook process for a shared lock on a primary lock file and a secondary lock file controlling access to the domain, and providing the shared lock(s) when there is not an exclusive lock. While the workbook process is still in progress, the method may further include receiving a request from a batch process for an exclusive lock on the primary lock file, immediately providing an exclusive lock on the primary lock file the batch process, receiving a request from the batch process for an exclusive lock on the secondary lock file, and providing the exclusive lock on the secondary lock file to the batch process when there is not a shared lock on the secondary lock file.

Abstract: One embodiment is directed to a method for controlling access to a domain. The method includes receiving a request from a workbook process for a shared lock on a primary lock file and a secondary lock file controlling access to the domain, and providing the shared lock(s) when there is not an exclusive lock. While the workbook process is still in progress, the method may further include receiving a request from a batch process for an exclusive lock on the primary lock file, immediately providing an exclusive lock on the primary lock file the batch process, receiving a request from the batch process for an exclusive lock on the secondary lock file, and providing the exclusive lock on the secondary lock file to the batch process when there is not a shared lock on the secondary lock file.

Abstract: The methods of the invention can be used with image data divided into domain blocks. A predetermined search pattern of range blocks centered on a domain block is defined for use in the methods. The first method includes a step of generating at least one error descriptor data based on domain block data and range block data. The error descriptor data can be derived by scaling the range blocks to the pixel size of a domain block, and subtracting the means of the range blocks and domain block from each pixel thereof. The mean-adjusted, scaled pixel intensity levels of the scaled range blocks are subtracted from mean-adjusted pixel intensity levels of the domain block to produce difference data. The absolute value of the difference data is taken and the positive difference data are summed to produce summed error data for each range block. The summed error data is used to derive at least one error descriptor data for the image.

Abstract: A system and method for tracking movement of objects in a scene from a stream of video frames using first and second correspondence graphs. A first correspondence graph, called an object correspondence graph, is formed comprising a plurality of nodes representing region clusterss in the scene which are hypotheses of objects to be tracked, and a plurality of tracks. Each track comprises an ordered sequence of nodes in consecutive video frames that represents a track segment of an object through the scene. A second correspondence graph, called a track correspondence graph, is created, comprising a plurality of nodes, each node corresponding to at least one track in the first correspondence graph. A track comprising an ordered sequence of nodes in the second correspondence graph represents the path of an object through the scene. Tracking information for objects, such as persons, in the scene, is accumulated based on the first correspondence graph and second correspondence graph.

Abstract: A system and method for tracking movement of objects, such as people, through a scene. A background image comprising image information representing a background of the scene is generated. Image information for a video frame is compared with image information of the background image to generate regions in a video frame which potentially represent objects to be tracked in the scene. Region clusters are formed by combinations of regions if such combination satisfy predetermined criteria, and the region clusters are hypotheses of objects to be tracked. Each region cluster is evaluated to determine whether each represents an object to be tracked, based on object model information and correspondence to region clusters in a prior video frame. A confidence value is generated for each region cluster that represents a likelihood that the region represents an object to be tracked. A correspondence is determined between region clusters in consecutive video frames.

Abstract: A tracking system and method for evaluating whether image information for a region cluster of a video frame of a scene represents an hypothesis of an object to be tracked, such as a person. At least one real-world feature of a region cluster corresponding to an object to be tracked is generated. For example, the at least feature is at least one possible location of a predetermined portion of an object represented by the region cluster is determined based on a viewing angle of the scene of the video camera. A distance from the video camera to the object corresponding to the region is determined in real-world coordinates for each possible location of the predetermined portion of the region cluster. Real-world size and location information for the region cluster is determined based on the distance.

Abstract: The present invention provides for the detection of human heads, faces and eyes in real-time and in uncontrolled environments. The present invention may be implemented with commercially available components, such as a standard video camera and a frame grabber, on a personal computer (PC) platform. The approach used by the present invention is based on a probabilistic framework that uses a deformable template model to describe the human face. The present invention works both with simple head-and-shoulder video sequences, as well as with complex video scenes with multiple people and random motion. The present invention is able to locate the eyes from different head poses (rotations in image plane as well as in depth). The information provided by the location of the eyes may be used to extract faces from a frontal pose in a video sequence. The extracted frontal frames can be passed to recognition and classification systems (or the like) for further processing.

Abstract: A multi-resolution background adaptation system and method wherein image information for a video frame is analyzed to update a background image in as great a resolution as possible. The video frame is partitioned into a plurality of cell levels, each cell level comprising at least one cell. Each cell is further partitioned into children cells for several hierarchical levels. Background image adaptation begins at the frame level and proceeds to lower cell levels of smaller cells when the lower cell levels are not substantially occluded by objects.