An activity recognition system is disclosed. A plurality of temporal features is generated from a digital representation of an observed activity using a feature detection algorithm. An observed activity graph comprising one or more clusters of temporal features generated from the digital representation is established, wherein each one of the one or more clusters of temporal features defines a node of the observed activity graph. At least one contextually relevant scoring technique is selected from similarity scoring techniques for known activity graphs, the at least one contextually relevant scoring technique being associated with activity ingestion metadata that satisfies device context criteria defined based on device contextual attributes of the digital representation, and a similarity activity score is calculated for the observed activity graph as a function of the at least one contextually relevant scoring technique, the similarity activity score being relative to at least one known activity graph.

An activity recognition system is disclosed. A plurality of temporal features is generated from a digital representation of an observed activity using a feature detection algorithm. An observed activity graph comprising one or more clusters of temporal features generated from the digital representation is established, wherein each one of the one or more clusters of temporal features defines a node of the observed activity graph. At least one contextually relevant scoring technique is selected from similarity scoring techniques for known activity graphs, the at least one contextually relevant scoring technique being associated with activity ingestion metadata that satisfies device context criteria defined based on device contextual attributes of the digital representation, and a similarity activity score is calculated for the observed activity graph as a function of the at least one contextually relevant scoring technique, the similarity activity score being relative to at least one known activity graph.

Methods and systems for automated video segmentation are disclosed. A sequence of video frames having video segments of contextually-related sub-sequences may be received. Each frame may be labeled according to segment and segment class. A video graph may be constructed in which each node corresponds to a different frame, and each edge connects a different pair of nodes, and is associated with a time between video frames and a similarity metric of the connected frames. An artificial neural network (ANN) may be trained to predict both labels for the nodes and clusters of the nodes corresponding to predicted membership among the segments, using the video graph as input to the ANN, and ground-truth clusters of ground-truth labeled nodes. The ANN may be further trained to predict segment classes of the predicted clusters, using the segment classes as ground truths. The trained ANN may be configured for application runtime video sequences.

Methods and systems for automated video segmentation are disclosed. A sequence of video frames having video segments of contextually-related sub-sequences may be received. Each frame may be labeled according to segment and segment class. A video graph may be constructed in which each node corresponds to a different frame, and each edge connects a different pair of nodes, and is associated with a time between video frames and a similarity metric of the connected frames. An artificial neural network (ANN) may be trained to predict both labels for the nodes and clusters of the nodes corresponding to predicted membership among the segments, using the video graph as input to the ANN, and ground-truth clusters of ground-truth labeled nodes. The ANN may be further trained to predict segment classes of the predicted clusters, using the segment classes as ground truths. The trained ANN may be configured for application runtime video sequences.

Provide is a novel mixed-noise removal method for HSI with large size. First, the underlying structure of the HSI is modeled by a two-layer architecture graph. The upper layer, called a skeleton graph, is a rough graph constructed by using the modified k-nearest-neighborhood algorithm and its nodes correspond to a series of superpixels formed by HSI segmentation, which can efficiently characterize the inter-correlations between superpixels, while preserving the boundary information and reducing the computational complexity. The lower layer, called detailed graph, consists of a series of local graphs which are constructed to model the similarities between pixels. Second, based on the two-layer graph architecture, the HSI restoration problem is formulated as a series of optimization problems each of which resides on a subgraph. Third, a novel distributed algorithm is tailored for the restoration problem, by using the information interaction between the nodes of skeleton graph and subgraphs.

Provide is a novel mixed-noise removal method for HSI with large size. First, the underlying structure of the HSI is modeled by a two-layer architecture graph. The upper layer, called a skeleton graph, is a rough graph constructed by using the modified k-nearest-neighborhood algorithm and its nodes correspond to a series of superpixels formed by HSI segmentation, which can efficiently characterize the inter-correlations between superpixels, while preserving the boundary information and reducing the computational complexity. The lower layer, called detailed graph, consists of a series of local graphs which are constructed to model the similarities between pixels. Second, based on the two-layer graph architecture, the HSI restoration problem is formulated as a series of optimization problems each of which resides on a subgraph. Third, a novel distributed algorithm is tailored for the restoration problem, by using the information interaction between the nodes of skeleton graph and subgraphs.

A non-transitory computer-readable storage medium storing a determination program that causes at least one computer to execute a process, the process includes obtaining a plurality of pair images of a person obtained from a overlapping region of images captured by each of a plurality of cameras; generating a directed graph including nodes corresponding to person features obtained from each of a plurality of person images included in the plurality of obtained pair images; acquiring weights of links between the nodes in the generated directed graph based on a number of person images with similar person features between the nodes; and determining a combination of the person features in which a number of the person images with the similar person features in the plurality of pair images is maximized based on the acquired weights of the links.

A non-transitory computer-readable storage medium storing a determination program that causes at least one computer to execute a process, the process includes obtaining a plurality of pair images of a person obtained from a overlapping region of images captured by each of a plurality of cameras; generating a directed graph including nodes corresponding to person features obtained from each of a plurality of person images included in the plurality of obtained pair images; acquiring weights of links between the nodes in the generated directed graph based on a number of person images with similar person features between the nodes; and determining a combination of the person features in which a number of the person images with the similar person features in the plurality of pair images is maximized based on the acquired weights of the links.

A relative atlas may be used to lay out elements in a digital map used in the control of an autonomous vehicle. A vehicle pose for the autonomous vehicle within a geographical area may be determined, and the relative atlas may be accessed to identify elements in the geographical area and to determine relative poses between those elements. The elements may then be laid out within the digital map using the determined relative poses, e.g., for use in planning vehicle trajectories, for estimating the states of traffic controls, or for tracking and/or identifying dynamic objects, among other purposes.

Techniques to use keypoint detection to highlight a subject of interest are disclosed. In various embodiments, image data comprising an image is processed to detect a set of keypoints on a human subject included in an image comprising the image data. The image data is processed to detect a set of additional points associated with a surface of the human subject. At least adjacent ones of said keypoints and additional points are connected to generate a mesh overlay. The mesh overlay is combined with the image to generate a composite in which the mesh overlay is superimposed over the human subject.