System and method for graph encoding of physical activity data

• US 10,048,383 B2
• Filed: 03/13/2015
• Issued: 08/14/2018
• Est. Priority Date: 03/14/2014
• Status: Active Grant

• Current Assignee: Under Armour Incorporated
• Original Assignee: Under Armour Incorporated
• Inventors: Eastman, Kyler Maxwell
• Primary Examiner(s): Ismail, Mahmoud S
• Application Number:
  US14/657,947
• Publication Number:
  US 20150260849A1
• Time in Patent Office: 1,250 Days
• Field of Search: 701482, 701 99, 707769
• 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 global positioning system (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, 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 that is not associated with one of the plurality of connections of the graph as an unidentified connection;

determining whether the unidentified connection should be included in the graph, wherein determining whether the unidentified connection should be included in the graph comprises (i) 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 on the graph, (ii) comparing each value in the suggestion matrix to a threshold value, and (iii) based on the comparison of at least one value to the threshold value, identifying the suggested connection associated with the at least one value as a new connection in the graph; and

amending the graph to include the new connection in the graph.

2. The method of claim 1 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.

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

4. The method of claim 1 wherein the suggested connection associated with a particular value in the suggestion matrix is dismissed when the particular value is below the threshold value, and the suggested connection associated with the particular value in the suggestion matrix is identified as a new connection on the graph when the particular value is above the threshold value.

5. The method of claim 4 wherein the threshold value is determined as a value in a lower twenty percentile of all values in the 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.

17. The method of claim 1 wherein the GPS data points for the GPS track are received from a GPS-enabled device, the method further comprising displaying a map based on the amended graph on the GPS-enabled device.

18. The method of claim 1 wherein the suggestion matrix includes rows and columns associated with the plurality of nodes of the graph.

6. A non-transitory computer readable medium containing instructions for expanding a graph by:

receiving global positioning system (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, wherein the determining includes preparing a path matrix including a plurality of values with each value associated with one of a plurality of connections of the graph, and identifying a connection from the activity track in not associated with one of the plurality of connections of the graph as the unidentified connection;

determining whether the unidentified connection should be included in the graph, the determining including (i) storing the unidentified connection on the graph as a value in a suggestion matrix, the value associated with a suggested connection between nodes on the graph, (ii) comparing the value in the suggestion matrix to a threshold value, and (iii) based on the comparing determining that the unidentified connection should be included as a connection in the graph; and

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

7. The computer readable medium of claim 6 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.

8. The computer readable medium of claim 6 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.

19. The computer readable medium of claim 6 wherein the GPS data points for the GPS track are received from a GPS-enabled device, the computer readable medium further containing instructions for expanding the graph by displaying a map based on the amended graph on the GPS-enabled device.

20. The computer readable medium of claim 6 wherein the suggestion matrix includes rows and columns associated with the plurality of nodes of the graph.

9. 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 global positioning system (GPS) data points for a plurality of GPS tracks associated with the graph;

mapping the GPS data points for each of the plurality of GPS tracks to the graph by determining a plurality of activity tracks based on the plurality of GPS tracks, each 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 plurality of activity tracks;

identifying a connection included on the path matrix that is not associated with one of the plurality of connections of the graph as an unidentified connection;

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 on the graph;

comparing the value in the suggestion matrix to a threshold value; and

amending the graph to include the unidentified connection based on the comparison of the value in the suggestion matrix to the threshold value.

10. The method of claim 9 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.

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

12. The method of claim 9 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.

13. The method of claim 12 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.

14. The method of claim 9 wherein the GPS data points for the plurality of GPS tracks are received from a plurality of GPS-enabled devices, the method further comprising displaying a map based on the amended graph on one of the plurality of GPS-enabled devices.

15. The method of claim 9 wherein the path matrix includes rows associated with connections between the nodes of the graph and columns associated with the plurality of GPS tracks.

16. The method of claim 9 wherein the suggestion matrix includes rows and columns associated with the plurality of nodes of the graph.