Abstract: A modular tracking system is described comprising of the network of independent tracking units optionally accompanied by a LIDAR scanner and/or (one or more) elevated cameras. Tracking units are combining panoramic and zoomed cameras to imitate the working principle of the human eye. Markerless computer vision algorithms are executed directly on the units and provide feedback to motorized mirror placed in front of the zoomed camera to keep tracked objects/people in its field of view. Microphones are used to detect and localize sound events. Inference from different sensor is fused in real time to reconstruct high-level events and full skeleton representation for each participant.

Abstract: A modular tracking system is described comprising of the network of independent tracking units optionally accompanied by a LIDAR scanner and/or (one or more) elevated cameras. Tracking units are combining panoramic and zoomed cameras to imitate the working principle of the human eye. Markerless computer vision algorithms are executed directly on the units and provide feedback to motorized mirror placed in front of the zoomed camera to keep tracked objects/people in its field of view. Microphones are used to detect and localize sound events. Inference from different sensor is fused in real time to reconstruct high-level events and full skeleton representation for each participant.

Abstract: The sport data tracking systems available today are based on specialized hardware to detect and track targets on the field. While effective, implementing and maintaining these systems pose a number of challenges, including high cost and need for close human monitoring. On the other hand, the sports analytics community has been exploring human computation and crowdsourcing in order to produce tracking data that is trustworthy, cheaper and more accessible. However, state-of-the-art methods require a large number of users to perform the annotation, or put too much burden into a single user. Example methods, systems and user interfaces that facilitate the creation of tracking data sequences of events (e.g., plays of baseball games) by warm-starting a manual annotation process using a vast collection of historical data are described.

Abstract: A modular tracking system is described comprising of the network of independent tracking units optionally accompanied by a LIDAR scanner and/or (one or more) elevated cameras. Tracking units are combining panoramic and zoomed cameras to imitate the working principle of the human eye. Markerless computer vision algorithms are executed directly on the units and provide feedback to motorized mirror placed in front of the zoomed camera to keep tracked objects/people in its field of view. Microphones are used to detect and localize sound events. Inference from different sensor is fused in real time to reconstruct high-level events and full skeleton representation for each participant.

Abstract: The sport data tracking systems available today are based on specialized hardware to detect and track targets on the field. While effective, implementing and maintaining these systems pose a number of challenges, including high cost and need for close human monitoring. On the other hand, the sports analytics community has been exploring human computation and crowdsourcing in order to produce tracking data that is trustworthy, cheaper and more accessible. However, state-of-the-art methods require a large number of users to perform the annotation, or put too much burden into a single user. Example methods, systems and user interfaces that facilitate the creation of tracking data sequences of events (e.g., plays of baseball games) by warm-starting a manual annotation process using a vast collection of historical data are described.

Abstract: A method of creating an analogous workflow is provided. A first workflow is received at a first device, the first workflow including a plurality of first modules that are connected. A second workflow is received at the first device, the second workflow including a plurality of second modules that are connected. A third workflow is received at the first device, the third workflow including a plurality of third modules that are connected. An analogy workflow is determined based on a difference between the received first workflow and the received second workflow. The determined analogy workflow is applied to the received third workflow to define a fourth workflow. A method of identifying a workflow of a plurality of workflows is provided. A query workflow includes a plurality of modules that are connected. A workflow is identified that at least partially matches the received query workflow.

Abstract: A method of visually representing pedigree data is provided. A root individual in a genealogical dataset is identified. A first parent and a second parent of the identified root individual are identified from the genealogical dataset. A third parent and a fourth parent of the identified first parent are identified from the genealogical dataset. A pedigree visualization relative to the identified root individual is presented which includes a root indicator, a first parent indicator, a second parent indicator, a third parent indicator, and a fourth parent indicator.

Abstract: A method of providing provenance management for a pre-existing application is provided. A provenance data selection is received. The provenance data selection indicates provenance data to present to a user. The provenance data is presented to the user as a version tree comprising a plurality of connected nodes. A node selection is received. The node selection indicates a node selected from the version tree. One or more nodes from a root node of the plurality of connected nodes to the node selected from the version tree are identified. One or more action parameters associated with the identified one or more nodes are identified. An action parameter of the one or more action parameters is associated with a previous interaction with a pre-existing application. Presentation of a state of the pre-existing application associated with the node selected from the version tree is triggered.

Abstract: A method of creating an analogous workflow is provided. A first workflow is received at a first device, the first workflow including a plurality of first modules that are connected. A second workflow is received at the first device, the second workflow including a plurality of second modules that are connected. A third workflow is received at the first device, the third workflow including a plurality of third modules that are connected. An analogy workflow is determined based on a difference between the received first workflow and the received second workflow. The determined analogy workflow is applied to the received third workflow to define a fourth workflow. A method of identifying a workflow of a plurality of workflows is provided. A query workflow includes a plurality of modules that are connected. A workflow is identified that at least partially matches the received query workflow.

Abstract: A method of creating an analogous workflow is provided. A first workflow is received at a first device, the first workflow including a plurality of first modules that are connected. A second workflow is received at the first device, the second workflow including a plurality of second modules that are connected. A third workflow is received at the first device, the third workflow including a plurality of third modules that are connected. An analogy workflow is determined based on a difference between the received first workflow and the received second workflow. The determined analogy workflow is applied to the received third workflow to define a fourth workflow. The defined fourth workflow is presented to a user at the first device. A method of identifying a workflow of a plurality of workflows is provided. A query workflow is received at a first device, which includes a plurality of modules that are connected.

Abstract: A method of automatically completing a workflow is provided. An indicator of a partial workflow is received in a computing device. The partial workflow includes a module configured to process data. A workflow completion is determined for the partial workflow based on the partial workflow and a plurality of workflows stored in a computer-readable medium. The workflow completion is configured to further process the data. A workflow is presented in a display operably coupled to the computing device. The workflow includes the determined workflow completion and the partial workflow.

Abstract: A method of visually representing pedigree data is provided. A root individual in a genealogical dataset is identified. A first parent and a second parent of the identified root individual are identified from the genealogical dataset. A third parent and a fourth parent of the identified first parent are identified from the genealogical dataset. A pedigree visualization relative to the identified root individual is presented which includes a root indicator, a first parent indicator, a second parent indicator, a third parent indicator, and a fourth parent indicator.

Abstract: A method of providing provenance management for a pre-existing application is provided. A provenance data selection is received. The provenance data selection indicates provenance data to present to a user. The provenance data is presented to the user as a version tree comprising a plurality of connected nodes. A node selection is received. The node selection indicates a node selected from the version tree. One or more nodes from a root node of the plurality of connected nodes to the node selected from the version tree are identified. One or more action parameters associated with the identified one or more nodes are identified. An action parameter of the one or more action parameters is associated with a previous interaction with a pre-existing application. Presentation of a state of the pre-existing application associated with the node selected from the version tree is triggered.

Abstract: A method and apparatus are disclosed for finding a triangle mesh that interpolates a set of points obtained from a scanning system. A ball-pivoting algorithm computes a triangle mesh interpolating a given point cloud. The disclosed ball-pivoting algorithm triangulates a set of points by “rolling” a ball of radius r on the point cloud. The points are surface samples acquired with multiple range scans of an object. The ball-pivoting algorithm starts with a seed triangle, and pivots the ball of a given radius, r, around an edge of the triangle. During the pivoting operation, the ball revolves around the edge while keeping in contact with the edge's endpoints. The ball pivots until it touches another scan point, forming another triangle. The ball-pivoting operation continues until all reachable edges have been tried, and then starts from another seed triangle, until all scan points have been considered.

Abstract: The present invention is a method and system for interactive rendering of large polygonal environments on commodity PC hardware. The system allows a user to walk through a large model at interactive frame rates on machines with limited memory. It works by first creating a hierarchical spatial decomposition of the model on disk using a fast and incremental out-of-core preprocessing algorithm. At running time, the system and method uses an approximate from-point visibility algorithm to dynamically determine which parts of the model to retrieve from disk. Multiple threads and a speculative prefetching algorithm are used to improve frame rates.

Abstract: A technique and system for selecting level-of-detail representations of geometric models to be rendered within an image processing system. For each geometric model, fractional visibility estimations are computed, thereby ranking how likely it is that a model is visible. Using these rankings, an appropriate level-of-detail for each geometric model is selected to optimize the rendering process by reducing the number of primitives that need to be rendered, while preserving the quality of the final image produced and displayed upon the screen. Visibility estimates for the geometric models are summed to produce a number which is then used to scale the number of primitives used in the level-of-detail representation of the geometric models.

Abstract: A hardware assisted system and method for computing a visibility ordering of a set of primitives and rendering the set of primitives is described, comprising the steps of and means for locating primitives potentially in a layer and removing occluded primitives from the layer. The hardware assisted locating step further includes the steps of initializing hardware buffers, initializing a layer number, assigning the layer number to each primitive, extracting a subset of the primitives from the set of primitives assigned to the layer number, and storing the subset of primitives in a color buffer.

Abstract: A data structure for representing a general n-dimensional polygonal mesh. The data structure includes a structure record and a data record for each three dimensional shape. The structural record contains polygonal model connectivity information and further includes a stitching record that defines corresponding polygonal (triangular) mesh edge pairs and a polygonal (triangular) tree record representing a polygon (triangle) tree. The stitching record includes a vertex tree and a set of jump edges. The data record includes at least three polygonal records, each corresponding to a polygon. Each polygonal record is associated with a face of said polygonal model and classifies its corresponding polygon as either a leaf polygon, a running polygon or a branching polygon. Polygonal shapes are encoded into the data structure by first building a spanning tree for the polygonal mesh. A set of cut edges are derived for the polygonal mesh. The stitching record is constructed for the set of cut edges.

Abstract: A Prioritized-Layered Projection (PLP) method and system for optimizing the rendering high-depth complexity scenes. Objects in each frame are prioritized with an estimation of the visible set within the rendered frame. A priority order for only the primitives in visible sets within the frame are computed “on demand” to maximize the likelihood of rendering visible primitives before rendering occluded ones. For a fixed budget, such as, time or number of triangles, rendering is constrained to a geometry budgeted priority. The method includes two main steps: an occupancy-based tessellation of space; and a solidity-based traversal algorithm. By first computing an occupancy-based tessellation of space, more cells result where there are more geometric primitives. In this spatial tessellation, each cell is assigned a “solidity” value directly proportional to its likelihood of occluding other cells.

Abstract: The visibility ordering of polyhedral cells is efficiently determined by building an ordering graph, comprising oriented edges between two cells. Each edge (A,B) corresponds to the fact that cell A has to be projected, or rendered, before B. A set of ordering relations and rules that can be shown to generate, if one exists, a global ordering of the polyhedral cell complex. Three different types of edges are used to accomplish this: MPVO, BSP and PPC edges. MPVO edges exist between two cells that share a face. To define the BSP edges, a BSP-tree of the boundary faces of the cell complex is constructed. During this construction, some of the boundary faces of the cells will be ‘cut’ by the BSP-tree ‘extended’ faces, into multiple pieces. If C is the boundary cell, and c′, c″, and so on, are the pieces of its boundary faces, the BSP_edge (c′, C) is defined to mean that cell C can only be projected after c′ has been projected by the BSP.