System and method for recommending pleasant routes from the sentiment of geo-tagged photographs
First Claim
Patent Images
1. A method for providing a pleasant route within a geographic location, comprising:
- receiving a source address and a destination address within the geographic location;
building a location graph of the geographic location with nodes representing sites within the geographic location, wherein building the location graph comprises;
building a geographical bounding box for the geographic location;
dividing the geographical bounding box into a plurality of cells, wherein a size of each cell is associated with a walkable distance; and
linking geographic neighboring cells of the plurality of cells to form the location graph;
computing one or more pleasantness scores for the nodes;
selecting a route from the source address to the destination address responsive to determining that one or more pleasantness scores associated with the route are higher than one or more other pleasantness scores; and
presenting the route on a map of the geographic location.
5 Assignments
0 Petitions
Accused Products
Abstract
A system and method generates and recommends a short and pleasant path between a source s and destination d in a geo-location such as a city or city center. The routes are not only short but emotionally pleasant, offering an engaging user experience, going beyond just showing paths on a map.
3 Citations
20 Claims
-
1. A method for providing a pleasant route within a geographic location, comprising:
-
receiving a source address and a destination address within the geographic location; building a location graph of the geographic location with nodes representing sites within the geographic location, wherein building the location graph comprises; building a geographical bounding box for the geographic location; dividing the geographical bounding box into a plurality of cells, wherein a size of each cell is associated with a walkable distance; and linking geographic neighboring cells of the plurality of cells to form the location graph; computing one or more pleasantness scores for the nodes; selecting a route from the source address to the destination address responsive to determining that one or more pleasantness scores associated with the route are higher than one or more other pleasantness scores; and presenting the route on a map of the geographic location. - View Dependent Claims (2, 3, 4, 5, 6, 7, 8)
-
-
9. An information processing system for providing a pleasant route within a geographic location, the information processing system comprising:
-
a processor device; and a memory operably coupled with the processor device, the memory comprising computer-executable instructions causing a computer to perform; receiving a source address and a destination address within the geographic location; building a location graph of the geographic location with nodes representing sites within the geographic location; computing one or more pleasantness scores for the nodes, wherein computing the one or more pleasantness scores comprises accessing geo-tagged photos of the geographic location and at least one of; processing tags associated with the geo-tagged photos to capture words expressing emotional and cognitive perceptions of a node;
orgathering statistics for the geo-tagged photos to predict one or more scores for the node in association with each of the attributes of quiet, happy, and beauty; selecting a route from the source address to the destination address responsive to determining that one or more pleasantness scores associated with the route are higher than one or more other pleasantness scores; and presenting the route on a map of the geographic location. - View Dependent Claims (10, 11, 12, 13, 14, 15, 16)
-
-
17. A computer program product comprising a non-transitory computer-readable storage medium with computer-executable instructions stored thereon, the computer-executable instructions comprising:
-
receiving a source address and a destination address within a geographic location; building a location graph of the geographic location with nodes representing sites within the geographic location; computing one or more pleasantness scores for the nodes; selecting a route from the source address to the destination address responsive to determining that one or more pleasantness scores associated with the route are higher than one or more other pleasantness scores, wherein selecting the route comprises obtaining three paths between the source address and the destination address by repeating the following acts in association with attributes of beauty, quiet, and happy; identifying M shortest paths connecting the source address and the destination address; iteratively computing an average rank for locations within m paths, wherein m is less than M; at each iteration, recording a path with a best average rank; and terminating when the best average rank improves less than a predetermined amount; and presenting the route on a map of the geographic location. - View Dependent Claims (18, 19, 20)
-
Specification