Managing the selection and presentation sequence of visual elements

Patent metadata

Field	Value
Publication number	US-2022004894-A1
Application number	US-202016918040-A
Country	US
Kind code	A1
Filing date	Jul 1, 2020
Priority date	Jul 1, 2020
Publication date	Jan 6, 2022
Grant date	—

Abstract

A method for managing the composition and presentation sequencing of compound visual elements, the method including generating a graph of all possible compound visual element combinations, generating a set of possible visual element presentation sequences according to a depth-first search (DFS) of the graph, generating a score for each member of the set of possible visual element presentation sequences according to visual element attributes, and enumerating a visual element presentation sequence according to a visual element presentation sequence score.

First claim

What is claimed is:

1 . A computer implemented method for managing visual element composition and presentation sequencing for compound visual elements, the method comprising:
generating, by one or more computer processors, a graph of all possible compound visual element combinations; generating, by the one or more computer processors, a set of possible visual element presentation sequences according to a depth-first search (DFS) of the graph; generating, by the one or more computer processors, a visual element presentation sequence score for each member of the set of possible visual element presentation sequences according to visual element attributes; and enumerating, by the one or more computer processors, a visual element presentation sequence according to a visual element presentation sequence score.

2 . The computer implemented method according to claim 1 , further comprising generating a score for each possible compound visual element combination.

3 . The computer implemented method according to claim 2 , further comprising generating a score for each possible compound visual element combination according to attributes associated with each possible element of the compound visual element.

4 . The computer implemented method according to claim 1 , further comprising reducing the set of possible visual element presentation sequences according to a defined presentation constraint.

5 . The computer implemented method according to claim 4 , wherein the defined presentation constraint comprises an end of sequence constraint.

6 . The computer implemented method according to claim 1 , wherein generating the set of possible visual element presentation sequences according to a depth-first search (DFS) of the graph comprises:
forming a stack of nodes for each possible presentation; and considering all nodes outside the stack for inclusion in the stack.

7 . The computer implemented method according to claim 1 , wherein the compound visual elements comprise a combination of a presentation model and a visual design.

8 . A computer program product for managing visual element composition and presentation sequencing for compound visual elements, the computer program product comprising one or more computer readable storage devices and program instructions collectively stored on the one or more computer readable storage devices, the stored program instructions comprising:
program instructions to generate a graph of all possible compound visual element combinations; program instructions to generate a set of possible visual element presentation sequences according to a depth-first search (DFS) of the graph; program instructions to generate a visual element presentation sequence score for each member of the set of possible visual element presentation sequences according to visual element attributes; and program instructions to enumerate a visual element presentation sequence according to a visual element presentation sequence score.

9 . The computer program product according to claim 8 , the stored program instructions further comprising program instructions to generate a score for each possible compound visual element combination.

10 . The computer program product according to claim 9 , the stored program instructions further comprising program instructions to generate a score for each possible compound visual element combination according to attributes associated with each possible element of the compound visual element.

11 . The computer program product according to claim 8 , the stored program instructions further comprising program instructions to reduce the set of possible visual element presentation sequences according to a defined presentation constraint.

12 . The computer program product according to claim 11 , wherein the defined presentation constraint comprises an end of sequence constraint.

13 . The computer program product according to claim 8 , wherein program instructions to generate the set of possible visual element presentation sequences according to a depth-first search (DFS) of the graph comprises:
program instructions to form a stack of nodes for each possible presentation; and program instructions to consider all nodes outside the stack for inclusion in the stack.

14 . The computer program product according to claim 8 , wherein the compound visual elements comprise a combination of a presentation model and a visual design.

15 . A computer system for managing visual element composition and presentation sequencing for compound visual elements, the computer system comprising:
one or more computer processors; one or more computer readable storage devices; and stored program instructions on the one or more computer readable storage devices for execution by the one or more computer processors, the stored program instructions comprising:
program instructions to generate a graph of all possible compound visual element combinations;
program instructions to generate a set of possible visual element presentation sequences according to a depth-first search (DFS) of the graph;
program instructions to generate a visual element presentation sequence score for each member of the set of possible visual element presentation sequences according to visual element attributes; and
program instructions to enumerate a visual element presentation sequence according to a visual element presentation sequence score.

16 . The computer system according to claim 15 , the stored program instructions further comprising program instructions to generate a score for each possible compound visual element combination.

17 . The computer system according to claim 16 , the stored program instructions further comprising program instructions to generate a score for each possible compound visual element combination according to attributes associated with each possible element of the compound visual element.

18 . The computer system according to claim 15 , the stored program instructions further comprising program instructions to reduce the set of possible visual element presentation sequences according to a defined presentation constraint.

19 . The computer system according to claim 15 , wherein the program instructions to generate the set of possible visual element presentation sequences according to a depth-first search (DFS) of the graph comprise:
program instructions to form a stack of nodes for each possible presentation; and program instructions to consider all nodes outside the stack for inclusion in the stack.

20 . The computer system according to claim 15 , wherein the compound visual elements comprise a combination of a presentation model and a visual design.

Assignees

• IBM

Inventors

• Seshadri Padmanabha Venkatagiri
• Aggarwal Nupur
• Mukherjee Sumanta
• Dwivedi Satyam

Classifications

• G06N3/044

  Recurrent networks, e.g. Hopfield networks · CPC title

• G06N3/045

  Combinations of networks · CPC title

• G06N3/09

  Supervised learning · CPC title

• G06N3/0442

  characterised by memory or gating, e.g. long short-term memory [LSTM] or gated recurrent units [GRU] · CPC title

• G06T11/00

  Two-dimensional [2D] image generation · CPC title