System and method for recommending pleasant routes from the sentiment of geo-tagged photographs

US11965745B2 · US · B2

Patent metadata
FieldValue
Publication numberUS-11965745-B2
Application numberUS-202117403603-A
CountryUS
Kind codeB2
Filing dateAug 16, 2021
Priority dateMay 7, 2014
Publication dateApr 23, 2024
Grant dateApr 23, 2024

How to read this patent

A practical reading order for non-experts. Skip the full description unless you need deep technical detail.

  1. Title

    What the patent document calls the invention.

  2. Abstract

    A short plain-language summary of the technical disclosure.

  3. Assignees and inventors

    Who owns or filed the patent and who is credited as inventor.

  4. Key dates

    Filing, priority, publication, and grant dates set the timeline.

  5. First independent claim

    The legal scope of protection — read this for what is actually claimed.

  6. CPC / IPC classifications

    Technology tags used to group this patent with similar filings.

  7. Citations and related patents

    Prior art links and similar publications in this corpus.

Abstract

Official abstract text for this publication.

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.

First claim

Opening claim text (preview).

The invention claimed is: 1. A method, comprising: computing one or more pleasantness scores for nodes representing sites within a geographic location, wherein the one or more pleasantness scores comprise a first pleasantness score for a first node of the nodes and a second pleasantness score for a second node of the nodes; determining, based upon the one or more pleasantness scores, a route between a source address and a destination address within the geographic location by performing: identifying M paths connecting the source address and the destination address; and computing an average rank for locations within m paths, wherein m is less than M; and presenting the route on a map of the geographic location, wherein at least one of: computing the one or more pleasantness scores comprises accessing geo-tagged photos of the geographic location; computing the one or more pleasantness scores comprises retrieving data about the nodes from a website; the geographic location comprises at least one of a city or a city center; or computing the one or more pleasantness scores is based upon one or more words expressing cognitive perceptions of a node. 2. The method of claim 1 , comprising selecting the route from amongst two or more routes comprising the route and a second route. 3. The method of claim 1 , comprising building a location graph of the geographic location with the nodes. 4. The method of claim 1 , wherein computing the one or more pleasantness scores comprises accessing the geo-tagged photos of the geographic location, the method comprising processing tags associated with the geo-tagged photos to capture one or more words expressing emotional perceptions of a second node. 5. The method of claim 1 , wherein computing the one or more pleasantness scores comprises retrieving the data about the nodes from the website. 6. The method of claim 1 , wherein computing the one or more pleasantness scores comprises accessing the geo-tagged photos of the geographic location. 7. The method of claim 6 , comprising processing tags associated with the geo-tagged photos to capture the one or more words expressing cognitive perceptions of the node. 8. The method of claim 1 , wherein the geographic location comprises at least one of the city or the city center. 9. A computer program product comprising a non-transitory computer-readable storage medium with computer-executable instructions stored thereon, the computer-executable instructions comprising: building a location graph of a geographic location with nodes representing sites within the geographic location, wherein a size of each cell of the location graph is associated with a walkable distance; computing one or more pleasantness scores for the nodes; and presenting a route on a map of the geographic location based upon the location graph and the one or more pleasantness scores, wherein at least one of: computing the one or more pleasantness scores comprises accessing geo-tagged photos of the geographic location; the geographic location comprises at least one of a city or a city center; computing the one or more pleasantness scores is based upon one or more words expressing cognitive perceptions of a node; the route is from a source address to a destination address; or computing the one or more pleasantness scores comprises retrieving data about the nodes from a website. 10. The computer program product of claim 9 , wherein the computer-executable instructions for computing the one or more pleasantness scores is based upon one or more words expressing emotional perceptions of a second node. 11. The computer program product of claim 9 , wherein the computer-executable instructions for computing the one or more pleasantness scores is based upon the one or more words expressing cognitive perceptions of the node. 12. The computer program product of claim 9 , wherein the route is from the source address to the destination address. 13. The computer program product of claim 9 , wherein the computer-executable instructions for computing the one or more pleasantness scores comprises retrieving the data about the nodes from the website. 14. An 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: building a location graph of a geographic location with nodes representing sites within the geographic location, wherein building the location graph comprises: linking geographic neighboring cells of a plurality of cells to form the location graph; computing one or more pleasantness scores for the nodes; and presenting a route on a map of the geographic location based upon the location graph and the one or more pleasantness scores. 15. The information processing system of claim 14 , wherein the computer-executable instructions for computing the one or more pleasantness scores comprises retrieving data about the nodes from a crowdsourcing website. 16. The information processing system of claim 14 , wherein the computer-executable instructions for computing the one or more pleasantness scores is based upon one or more words expressing emotional perceptions of a node. 17. The information processing system of claim 14 , wherein the computer-executable instructions for computing the one or more pleasantness scores is based upon one or more words expressing cognitive perceptions of a node. 18. The information processing system of claim 14 , wherein the computer-executable instructions for computing the one or more pleasantness scores comprises retrieving data about the nodes from a website. 19. The information processing system of claim 14 , wherein the route is from a source address to a destination address. 20. The computer program product of claim 9 , wherein the computer-executable instructions for computing the one or more pleasantness scores comprises accessing the geo-tagged photos of the geographic location.

Assignees

Inventors

Classifications

  • specially adapted for specific applications · CPC title

  • Special cost functions, i.e. other than distance or default speed limit of road segments · CPC title

  • using point of interest [POI] information, e.g. a route passing visible POIs · CPC title

  • Input/output arrangements for on-board computers · CPC title

  • Overview of the route on the road map · CPC title

Patent family

Related publications grouped by family.

External sources

Frequently asked questions

Answers are generated from the same data shown on this page.

What does patent US11965745B2 cover?
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.
Who is the assignee on this patent?
Verizon Patent & Licensing Inc
What technology area does this patent fall under?
Primary CPC classification G01C21/3407. Mapped technology areas include Physics.
When was this patent published?
Publication date Tue Apr 23 2024 00:00:00 GMT+0000 (Coordinated Universal Time) (B2). Legal status and post-grant events are not shown on this page.
What related patents are in patentsdb?
We list 3 related publications on this page (citations in our corpus or others sharing the same primary CPC).