Patent Document ID: 10073861
Application ID: 14844660

Base Claim:
1. A method, comprising: assigning each of a plurality of nodes of a graph to a distinct image, of a plurality of images including a first image and a second image, wherein the graph represents a story, wherein each node corresponds to a respective element of the story, wherein each node comprises: (i) an attribute and (ii) a predefined text of the respective element of the story, wherein a first edge of a plurality of edges of the graph specifies a constraint between the attributes of a first node and a second node of the plurality of nodes, wherein the plurality of nodes are assigned based on an attribute of each of the plurality of images and the attribute of each node, wherein the first and second nodes are assigned to the first and second images, respectively, based on the attributes of the first and second images satisfying the constraint specified by the first edge; and generating a visual depiction of the story, wherein the visual depiction comprises an ordered representation of each of the distinct images and the predefined text of each respective element of the story.

---

Claim 4:
4. The method of claim 1 , wherein a third node of the plurality of nodes further specifies one or more permissive constraints for the attribute of the third node, wherein assigning each node to an image further comprises: identifying a first set of images having an attribute satisfying at least one of the permissive constraints of the attribute of the third node; upon determining that the first set of images comprises at least two images: computing a fitness score for each image in the first set of images, wherein the fitness score is based at least in part on: (i) a quality of each respective image in the first set of images, and (ii) a number of permissive constraints satisfied by the respective image in the first set of images; creating a priority queue comprising each node that has not been assigned to an image, including the third node, wherein the priority queue is ordered based at least in part on a number of images in a set of images matching a set of mandatory constraints for the respective node; extracting the third node from the priority queue; and assigning the third node to a first image from the first set of images for the third node, wherein the fitness score of the first image is the highest fitness score relative to the fitness scores of the remaining images in the set of images for the third node.