SYSTEM AND METHOD FOR GRAPH ENCODING OF PHYSICAL ACTIVITY DATA

• US 20150260849A1
• Filed: 03/13/2015
• Published: 09/17/2015
• Est. Priority Date: 03/14/2014
• Status: Active Grant

• Current Assignee: Under Armour Incorporated
• Original Assignee: Under Armour Incorporated
• Inventors: Eastman, Kyler Maxwell
• Granted Patent: US 10,048,383 B2
• Time in Patent Office: Days
• US Class Current: 1/1
• CPC Class Codes: G01C 21/20 Instruments for performing navigational calculations G01C21/24, G01C21/26 take precedence
• CPC Class Codes: G01S 19/19 Sporting applications
• CPC Class Codes: G01S 19/42 Determining position

Abstract

A method for expanding a graph includes receiving GPS data points for a GPS track associated with the graph. The graph includes a plurality of nodes and a plurality of connections between the nodes. The GPS data points are mapped to the graph by determining an activity track based on the GPS track, the activity track including a plurality of nodes from the graph and at least one connection between the nodes. The method further includes determining that the activity track includes an unidentified connection that is not included on the graph. Thereafter, a determination is made whether the unidentified connection should be included in the graph. If it is determined that the unidentified connection should be included as a connection in the graph, the graph is amended to include the unidentified connection.

Claims

1. A method for expanding a graph, the graph including a plurality of nodes and a plurality of connections between the nodes, the method comprising:

receiving GPS data points for a GPS track associated with the graph;

mapping the GPS data points for the GPS track to the graph by determining an activity track based on the GPS track, the activity track including a plurality of nodes from the graph and at least one connection between the nodes;

determining that the activity track includes an unidentified connection that is not included on the graph;

determining whether the unidentified connection should be included in the graph; and

amending the graph to include the unidentified connection if it is determined that the unidentified connection should be included as a connection in the graph.

2. The method of claim 1 wherein determining that the activity track includes an unidentified connection comprises (i) preparing a path matrix, the path matrix including a plurality of values with each value associated with one of the plurality of connections of the graph, and (ii) identifying any connection from the activity track is not associated with one of the plurality of connections of the graph as an unidentified connection.

3. The method of claim 2 wherein each row of the path matrix is associated with one of the plurality of connections between nodes of the graph, and each column of the path matrix is associated with one of a plurality of activity tracks.

4. The method of claim 3 wherein each of the plurality of activity tracks is associated with a user profile.

5. The method of claim 1 further comprising storing the unidentified connection on the graph as a value in a suggestion matrix, the suggestion matrix including a plurality of values with each value associated with a suggested connection between nodes on the graph.

6. The method of claim 5 further comprising comparing the value in the suggestion matrix to a threshold value.

7. The method of claim 6 further comprising dismissing the suggested connection associated with the value in the suggestion matrix if the value is below the threshold value, and treating the suggested connection associated with the value in the suggestion matrix as a new connection on the graph if the value is above the threshold value.

8. The method of claim 7 wherein the threshold value is determined as a value in a lower twenty percentile of all values in a path matrix, the path matrix including a plurality of values with each value associated with a number of connections between nodes for a plurality of activity tracks.

9. A computer readable medium containing instructions for expanding a graph by:

receiving GPS data points for a GPS track associated with the graph;

mapping the GPS data points for the GPS track to the graph by determining an activity track based on the GPS track, the activity track including a plurality of nodes from the graph and at least one connection between the nodes;

determining that the activity track includes an unidentified connection that is not included on the graph;

determining whether the unidentified connection should be included in the graph; and

amending the graph to include the unidentified connection if it is determined that the unidentified connection should be included as a connection in the graph.

10. The computer readable medium of claim 9 wherein determining that the activity track includes an unidentified connection comprises preparing a path matrix, the path matrix including a plurality of values with each value associated with one of a plurality of connections of the graph, and identifying any connection from the activity track is not associated with one of the plurality of connections of the graph as an unidentified connection.

11. The computer readable medium of claim 9 further containing instructions for expanding the graph by storing the unidentified connection on the graph as a value in a suggestion matrix, the suggestion matrix including a plurality of values with each value associated with a suggested connection between nodes on the graph.

12. The computer readable medium of claim 11 further containing instructions for expanding the graph by comparing the value in the suggestion matrix to a threshold value.

13. The computer readable medium of claim 12 further containing instructions for expanding the graph by dismissing the suggested connection associated with the value in the suggestion matrix if the value is below the threshold value, and treating the suggested connection associated with the value in the suggestion matrix as a new connection on the graph if the value is above the threshold value.

14. The computer readable medium of claim 12 wherein the threshold value is determined as a value in the lower twenty percentile of all values in a path matrix, the path matrix including a plurality of values with each value associated with a number of connections between nodes for a plurality of activity tracks.

15. A method for determining properties associated with a graph, the graph including a plurality of nodes and a plurality of connections between the nodes, the method comprising:

receiving GPS data points for a plurality of GPS tracks associated with the graph;

mapping the GPS data points for each of the plurality of the GPS tracks to the graph by determining an activity track based on the GPS track, the activity track including a plurality of nodes from the graph and at least one connection between the nodes; and

creating a path matrix including a plurality of values, each value in the path matrix associated with (i) one of the plurality of connections between nodes of the graph and (ii) one of the determined activity tracks.

16. The method of claim 15 further comprising performing a mathematical operation on the path matrix in order to determine at least one property for the graph.

17. The method of claim 16 wherein performing a mathematical operation on the path matrix includes multiplying the path matrix by a first vector to provide a second vector, the second vector having properties indicative of frequency of traversal of the plurality of connections of the graph.

18. The method of claim 17 wherein each of the activity tracks is associated with profile data, and wherein the first vector is derived based on the profile data.

19. The method of claim 18 wherein the profile data includes user gender and type of activity.

20. The method of claim 15 wherein the at least one property associated with the graph is indicative of (i) a frequency of traversal of the plurality of connections of the graph for a selected demographic of users or (ii) activity tracks that utilized a particular connection between the nodes of the graph.

21. The method of claim 15 wherein the graph is bounded within a bounding box that includes the plurality of nodes.