Destination sharing in location sharing system

Information

  • Patent Grant
  • 12213028
  • Patent Number
    12,213,028
  • Date Filed
    Tuesday, November 21, 2023
    a year ago
  • Date Issued
    Tuesday, January 28, 2025
    11 days ago
Abstract
Methods, systems, and devices are described for predicting a destination of a user and sharing the presumed destination with the other users via a geographically-based graphical user interface. Consistent with some embodiments, an electronic communication containing location information is received from a location sensor coupled to a first client device. A current trajectory of the first user is determined based on the location information. A presumed destination of the first user is determined, by correlating the current trajectory of the first user with historical location information of the first user. A map depicting an icon associated with the presumed destination of the first user is displayed, on a display screen of a second client device of a second user.
Description
BACKGROUND

The popularity of location sharing, particularly real-time location sharing, used in conjunction with a social networking application continues to grow. Users increasingly share their location with each other, providing challenges to social networking systems seeking to help their members share their location. Embodiments of the present disclosure address these and other issues.





BRIEF DESCRIPTION OF THE SEVERAL VIEWS OF THE DRAWINGS

To easily identify the discussion of any particular element or act, the most significant digit or digits in a reference number refer to the figure number in which that element is first introduced.



FIG. 1 is a diagrammatic representation of a networked environment in which the present disclosure may be deployed, in accordance with some example embodiments.



FIG. 2 is a diagrammatic representation of a data structure as maintained in a database, in accordance with some example embodiments.



FIG. 3 is a diagrammatic representation of a processing environment, in accordance with some example embodiments.



FIG. 4 is block diagram showing a software architecture within which the present disclosure may be implemented, in accordance with some example embodiments.



FIG. 5 is a diagrammatic representation of a machine, in the form of a computer system within which a set of instructions may be executed for causing the machine to perform any one or more of the methodologies discussed, in accordance with some example embodiments.



FIG. 6 illustrates a method in accordance with one embodiment.



FIG. 7 illustrates a method in accordance with one embodiment.



FIG. 8 illustrates a method in accordance with one embodiment.



FIG. 9 illustrates a method in accordance with one embodiment.



FIG. 10 illustrates a method in accordance with one embodiment.



FIG. 11 illustrates a user interface displayed on a client device in accordance with one embodiment.



FIG. 12 illustrates a user interface displayed on a client device in accordance with one embodiment.





DETAILED DESCRIPTION

Embodiments of the present disclosure provide a geographically-based graphical user interface (GUI). This user interface may be referred to herein as a “map GUI,” and may be used in conjunction with a social media application. In some embodiments, the map GUI may include representations of at least approximate respective positions of a user and a user's friends in a social network graph accessed by the social media application using avatars for each respective user.


Various embodiments of the present disclosure provide systems, methods, techniques, instruction sequences, and computing machine program products for predicting a destination of a user. Some embodiments share the presumed destination with the user's friends via the map GUI. Some embodiments may additionally provide an estimated time of arrival at the presumed destination.


In some embodiments, the social network system receives, from a first client device of the user, via a wireless communication over a network, an electronic communication containing location information from a location sensor coupled to the first client device. The system then determines, based on the location information, a current trajectory of the user. The system accesses, from a database, historical location information of the user, and determines, by correlating the current trajectory of the user and the historical location information of the user, a presumed destination of the user. The system then displays, on display screens of client devices of the user's friends, a map depicting an icon associated with the presumed destination of the user, the location of the icon on the map being representative of the location of the presumed destination of the user.


The description that follows includes systems, methods, techniques, instruction sequences, and computing machine program products that embody illustrative embodiments of the disclosure. In the following description, for the purposes of explanation, numerous specific details are set forth in order to provide an understanding of various embodiments of the inventive subject matter. It will be evident, however, to those skilled in the art, that embodiments of the inventive subject matter may be practiced without these specific details. In general, well-known instruction instances, protocols, structures, and techniques are not necessarily shown in detail.



FIG. 1 is a block diagram showing an example location sharing system 100 for exchanging location data over a network. The location sharing system 100 includes multiple instances of a client device 102, each of which hosts a number of applications including a location sharing client application 104. Each location sharing client application 104 is communicatively coupled to other instances of the location sharing client application 104 and a location sharing server system 108 via a network 106 (e.g., the Internet).


A location sharing client application 104 is able to communicate and exchange data with another location sharing client application 104 and with the location sharing server system 108 via the network 106. The data exchanged between location sharing client application 104, and between a location sharing client application 104 and the location sharing server system 108, includes functions (e.g., commands to invoke functions) as well as payload data (e.g., location data, text, audio, video or other multimedia data).


The location sharing server system 108 provides server-side functionality via the network 106 to a particular location sharing client application 104. While certain functions of the location sharing system 100 are described herein as being performed by either a location sharing client application 104 or by the location sharing server system 108, the location of certain functionality either within the location sharing client application 104 or the location sharing server system 108 is a design choice. For example, it may be technically preferable to initially deploy certain technology and functionality within the location sharing server system 108, but to later migrate this technology and functionality to the location sharing client application 104 where a client device 102 has a sufficient processing capacity.


The location sharing server system 108 supports various services and operations that are provided to the location sharing client application 104. Such operations include transmitting data to, receiving data from, and processing data generated by the location sharing client application 104. This data may include, geolocation information, message content, client device information, media annotation and overlays, message content persistence conditions, social network information, and live event information, as examples. Data exchanges within the location sharing system 100 are invoked and controlled through functions available via user interfaces (UIs) of the location sharing client application 104.


Turning now specifically to the location sharing server system 108, an Application Program Interface (API) server 110 is coupled to, and provides a programmatic interface to, an application server 112. The application server 112 is communicatively coupled to a database server 118, which facilitates access to a database 120 in which is stored data associated with messages processed by the application server 112.


The Application Program Interface (API) server 110 receives and transmits message data (e.g., commands and message payloads) between the client device 102 and the application server 112. Specifically, the Application Program Interface (API) server 110 provides a set of interfaces (e.g., routines and protocols) that can be called or queried by the location sharing client application 104 in order to invoke functionality of the application server 112. The Application Program Interface (API) server 110 exposes various functions supported by the application server 112, including account registration, login functionality, the sending of messages, via the application server 112, from a particular location sharing client application 104 to another location sharing client application 104, the sending of media files (e.g., images or video) from a location sharing client application 104 to the location sharing server application 114, and for possible access by another location sharing client application 104, the setting of a collection of media data (e.g., story), the retrieval of a list of friends of a user of a client device 102, the retrieval of such collections, the retrieval of messages and content, the adding and deletion of friends to a social graph, the location of friends within a social graph, and opening an application event (e.g., relating to the location sharing client application 104).


The application server 112 hosts a number of applications and subsystems, including a location sharing server application 114, a messaging system 116 and a social network system 122.


Examples of functions and services supported by the location sharing server application 114 include generating a map GUI. In some embodiments, the map GUI may include representations of at least approximate respective positions of a user and a user's friends in a social network graph accessed by the social media application using avatars for each respective user.


The location sharing server application 114 may receive user authorization to use, or refrain from using, the user's location information. In some embodiments, the location sharing server application 114 may likewise opt to share or not share the user's location with others via the map GUI. In some cases, the user's avatar may be displayed to the user on the display screen of the user's computing device regardless of whether the user is sharing his or her location with other users.


In some embodiments, a user can select groups of other users to which his/her location will be displayed, and may in specify different display attributes for the different respective groups or for different respective individuals. In one example, audience options include: “Best Friends,” “Friends,” and “Custom” (which is an individual-level whitelist of people). In this example, if “Friends” are selected, all new people added to the user's friends list will automatically be able to see their location. If they are already sharing with the user, their avatars will appear on the user's map.


In some embodiments, when viewing the map GUI, the user is able to see the location of all his/her friends that have shared their location with the user on the map, each friend represented by their respective avatar. In some embodiments, if the friend does not have an avatar, the friend may be represented using a profile picture or a default icon displayed at the corresponding location for the friend.


In some embodiments, the user can select between friends on the map via a menu, such as a carousel. In some embodiments, selecting a particular friend automatically centers the map view on the avatar of that friend. Embodiments of the present disclosure may also allow the user to take a variety of actions with the user's friends from within the map GUI. For example, the system may allow the user to chat with the user's friends without leaving the map. In one particular example, the user may select a chat icon from a menu presented in conjunction with the map GUI to initiate a chat session.


The messaging system 116 implements a number of message processing technologies and functions, particularly related to the aggregation and other processing of content (e.g., textual and multimedia content) included in messages received from multiple instances of the location sharing client application 104. As will be described in further detail, the text and media content from multiple sources may be aggregated into collections of content (e.g., called stories or galleries). These collections are then made available, by the location sharing server application 114, to the location sharing client application 104. Other processor and memory intensive processing of data may also be performed server-side by the location sharing server application 114, in view of the hardware requirements for such processing.


The application server 112 is communicatively coupled to a database server 118, which facilitates access to a database 120 in which is stored data processed by the location sharing server application 114.


The social network system 122 supports various social networking functions services, and makes these functions and services available to the location sharing server application 114. To this end, the social network system 122 maintains and accesses an entity graph 204 (as shown in FIG. 2) within the database 120. Examples of functions and services supported by the social network system 122 include the identification of other users of the location sharing system 100 with which a particular user has relationships or is “following”, and also the identification of other entities and interests of a particular user.



FIG. 2 is a schematic diagram illustrating data structures 200 which may be stored in the database 120 of the location sharing server system 108, according to certain example embodiments. While the content of the database 120 is shown to comprise a number of tables, it will be appreciated that the data could be stored in other types of data structures (e.g., as an object-oriented database).


The database 120 includes message data stored within a message table 208. An entity table 202 stores entity data, including an entity graph 204. Entities for which records are maintained within the entity table 202 may include individuals (e.g., users), corporate entities, organizations, objects, places, events, etc. Regardless of type, any entity regarding which the location sharing server system 108 stores data may be a recognized entity. Each entity is provided with a unique identifier, as well as an entity type identifier (not shown). The entity graph 204 furthermore stores information regarding relationships and associations between entities. Such relationships may be social, professional (e.g., work at a common corporation or organization) interested-based or activity-based, merely for example. A location table 206 stores location information of users (e.g., geolocation information determined by the position components 538 of the client device 102). Location information may include a plurality of location points defined by at least a set of geographical coordinates and a time stamp.


Turning now to FIG. 3, there is shown a diagrammatic representation of a processing environment 300, which includes at least a processor 302 (e.g., a GPU, CPU or combination thereof).


The processor 302 is shown to be coupled to a power source 304, and to include (either permanently configured or temporarily instantiated) modules, namely a location component 308, a historical location component 314, a prediction component 312, and a map GUI component 310. The location component 308 operationally determines location of users based on location information. The location component 308 generates historical location information of a user by consolidating location information collected over time from one or more client device (e.g., client device 102) associated with the user. The prediction component 312 generates predictions regarding the presumed destination of a user. The map GUI component 310 operationally generates user interfaces and causes the user interfaces to be displayed on client devices. As illustrated, the processor 302 may be communicatively coupled to another processor 306.



FIG. 4 is a block diagram 400 illustrating a software architecture 404, which can be installed on any one or more of the devices described herein. The software architecture 404 is supported by hardware such as a machine 402 that includes processors 420, memory 426, and I/O components 438. In this example, the software architecture 404 can be conceptualized as a stack of layers, where each layer provides a particular functionality. The software architecture 404 includes layers such as an operating system 412, libraries 410, frameworks 408, and applications 406. Operationally, the applications 406 invoke API calls 450 through the software stack and receive messages 452 in response to the API calls 450.


The operating system 412 manages hardware resources and provides common services. The operating system 412 includes, for example, a kernel 414, services 416, and drivers 422. The kernel 414 acts as an abstraction layer between the hardware and the other software layers. For example, the kernel 414 provides memory management, processor management (e.g., scheduling), component management, networking, and security settings, among other functionality. The services 416 can provide other common services for the other software layers. The drivers 422 are responsible for controlling or interfacing with the underlying hardware. For instance, the drivers 422 can include display drivers, camera drivers, BLUETOOTH® or BLUETOOTH® Low Energy drivers, flash memory drivers, serial communication drivers (e.g., Universal Serial Bus (USB) drivers), WI-FI® drivers, audio drivers, power management drivers, and so forth.


The libraries 410 provide a low-level common infrastructure used by the applications 406. The libraries 410 can include system libraries 418 (e.g., C standard library) that provide functions such as memory allocation functions, string manipulation functions, mathematic functions, and the like. In addition, the libraries 410 can include API libraries 424 such as media libraries (e.g., libraries to support presentation and manipulation of various media formats such as Moving Picture Experts Group-4 (MPEG4), Advanced Video Coding (H.264 or AVC), Moving Picture Experts Group Layer-3 (MP3), Advanced Audio Coding (AAC), Adaptive Multi-Rate (AMR) audio codec, Joint Photographic Experts Group (JPEG or JPG), or Portable Network Graphics (PNG)), graphics libraries (e.g., an OpenGL framework used to render in two dimensions (2D) and three dimensions (3D) in a graphic content on a display), database libraries (e.g., SQLite to provide various relational database functions), web libraries (e.g., WebKit to provide web browsing functionality), and the like. The libraries 410 can also include a wide variety of other libraries 428 to provide many other APIs to the applications 406.


The frameworks 408 provide a high-level common infrastructure that is used by the applications 406. For example, the frameworks 408 provide various graphical user interface (GUI) functions, high-level resource management, and high-level location services. The frameworks 408 can provide a broad spectrum of other APIs that can be used by the applications 406, some of which may be specific to a particular operating system or platform.


In an example embodiment, the applications 406 may include a home application 436, a contacts application 430, a browser application 432, a book reader application 434, a location application 442, a media application 444, a messaging application 446, a game application 448, and a broad assortment of other applications such as third-party applications 440. The applications 406 are programs that execute functions defined in the programs. Various programming languages can be employed to create one or more of the applications 406, structured in a variety of manners, such as object-oriented programming languages (e.g., Objective-C, Java, or C++) or procedural programming languages (e.g., C or assembly language). In a specific example, the third-party applications 440 (e.g., applications developed using the ANDROID™ or IOS™ software development kit (SDK) by an entity other than the vendor of the particular platform) may be mobile software running on a mobile operating system such as IOS™, ANDROID™, WINDOWS® Phone, or another mobile operating system. In this example, the third-party applications 440 can invoke the API calls 450 provided by the operating system 412 to facilitate functionality described herein.



FIG. 5 is a diagrammatic representation of a machine 500 within which instructions 508 (e.g., software, a program, an application, an applet, an app, or other executable code) for causing the machine 500 to perform any one or more of the methodologies discussed herein may be executed. For example, the instructions 508 may cause the machine 500 to execute any one or more of the methods described herein. The instructions 508 transform the general, non-programmed machine 500 into a particular machine 500 programmed to carry out the described and illustrated functions in the manner described. The machine 500 may operate as a standalone device or may be coupled (e.g., networked) to other machines. In a networked deployment, the machine 500 may operate in the capacity of a server machine or a client machine in a server-client network environment, or as a peer machine in a peer-to-peer (or distributed) network environment. The machine 500 may comprise, but not be limited to, a server computer, a client computer, a personal computer (PC), a tablet computer, a laptop computer, a netbook, a set-top box (STB), a PDA, an entertainment media system, a cellular telephone, a smart phone, a mobile device, a wearable device (e.g., a smart watch), a smart home device (e.g., a smart appliance), other smart devices, a web appliance, a network router, a network switch, a network bridge, or any machine capable of executing the instructions 508, sequentially or otherwise, that specify actions to be taken by the machine 500. Further, while only a single machine 500 is illustrated, the term “machine” shall also be taken to include a collection of machines that individually or jointly execute the instructions 508 to perform any one or more of the methodologies discussed herein.


The machine 500 may include processors 502, memory 504, and I/O components 542, which may be configured to communicate with each other via a bus 544. In an example embodiment, the processors 502 (e.g., a Central Processing Unit (CPU), a Reduced Instruction Set Computing (RISC) processor, a Complex Instruction Set Computing (CISC) processor, a Graphics Processing Unit (GPU), a Digital Signal Processor (DSP), an ASIC, a Radio-Frequency Integrated Circuit (RFIC), another processor, or any suitable combination thereof) may include, for example, a processor 506 and a processor 510 that execute the instructions 508. The term “processor” is intended to include multi-core processors that may comprise two or more independent processors (sometimes referred to as “cores”) that may execute instructions contemporaneously. Although FIG. 5 shows multiple processors 502, the machine 500 may include a single processor with a single core, a single processor with multiple cores (e.g., a multi-core processor), multiple processors with a single core, multiple processors with multiples cores, or any combination thereof.


The memory 504 includes a main memory 512, a static memory 514, and a storage unit 516, both accessible to the processors 502 via the bus 544. The main memory 504, the static memory 514, and storage unit 516 store the instructions 508 embodying any one or more of the methodologies or functions described herein. The instructions 508 may also reside, completely or partially, within the main memory 512, within the static memory 514, within machine-readable medium 518 within the storage unit 516, within at least one of the processors 502 (e.g., within the processor's cache memory), or any suitable combination thereof, during execution thereof by the machine 500.


The I/O components 542 may include a wide variety of components to receive input, provide output, produce output, transmit information, exchange information, capture measurements, and so on. The specific I/O components 542 that are included in a particular machine will depend on the type of machine. For example, portable machines such as mobile phones may include a touch input device or other such input mechanisms, while a headless server machine will likely not include such a touch input device. It will be appreciated that the I/O components 542 may include many other components that are not shown in FIG. 5. In various example embodiments, the I/O components 542 may include output components 528 and input components 530. The output components 528 may include visual components (e.g., a display such as a plasma display panel (PDP), a light emitting diode (LED) display, a liquid crystal display (LCD), a projector, or a cathode ray tube (CRT)), acoustic components (e.g., speakers), haptic components (e.g., a vibratory motor, resistance mechanisms), other signal generators, and so forth. The input components 530 may include alphanumeric input components (e.g., a keyboard, a touch screen configured to receive alphanumeric input, a photo-optical keyboard, or other alphanumeric input components), point-based input components (e.g., a mouse, a touchpad, a trackball, a joystick, a motion sensor, or another pointing instrument), tactile input components (e.g., a physical button, a touch screen that provides location and/or force of touches or touch gestures, or other tactile input components), audio input components (e.g., a microphone), and the like.


In further example embodiments, the I/O components 542 may include biometric components 532, motion components 534, environmental components 536, or position components 538, among a wide array of other components. For example, the biometric components 532 include components to detect expressions (e.g., hand expressions, facial expressions, vocal expressions, body gestures, or eye tracking), measure biosignals (e.g., blood pressure, heart rate, body temperature, perspiration, or brain waves), identify a person (e.g., voice identification, retinal identification, facial identification, fingerprint identification, or electroencephalogram-based identification), and the like. The motion components 534 include acceleration sensor components (e.g., accelerometer), gravitation sensor components, rotation sensor components (e.g., gyroscope), and so forth. The environmental components 536 include, for example, illumination sensor components (e.g., photometer), temperature sensor components (e.g., one or more thermometers that detect ambient temperature), humidity sensor components, pressure sensor components (e.g., barometer), acoustic sensor components (e.g., one or more microphones that detect background noise), proximity sensor components (e.g., infrared sensors that detect nearby objects), gas sensors (e.g., gas detection sensors to detection concentrations of hazardous gases for safety or to measure pollutants in the atmosphere), or other components that may provide indications, measurements, or signals corresponding to a surrounding physical environment. The position components 538 include location sensor components (e.g., a GPS receiver component), altitude sensor components (e.g., altimeters or barometers that detect air pressure from which altitude may be derived), orientation sensor components (e.g., magnetometers), and the like.


Communication may be implemented using a wide variety of technologies. The I/O components 542 further include communication components 540 operable to couple the machine 500 to a network 520 or devices 522 via a coupling 524 and a coupling 526, respectively. For example, the communication components 540 may include a network interface component or another suitable device to interface with the network 520. In further examples, the communication components 540 may include wired communication components, wireless communication components, cellular communication components, Near Field Communication (NFC) components, Bluetooth® components (e.g., Bluetooth® Low Energy), Wi-Fi® components, and other communication components to provide communication via other modalities. The devices 522 may be another machine or any of a wide variety of peripheral devices (e.g., a peripheral device coupled via a USB).


Moreover, the communication components 540 may detect identifiers or include components operable to detect identifiers. For example, the communication components 540 may include Radio Frequency Identification (RFID) tag reader components, NFC smart tag detection components, optical reader components (e.g., an optical sensor to detect one-dimensional bar codes such as Universal Product Code (UPC) bar code, multi-dimensional bar codes such as Quick Response (QR) code, Aztec code, Data Matrix, Dataglyph, MaxiCode, PDF417, Ultra Code, UCC RSS-2D bar code, and other optical codes), or acoustic detection components (e.g., microphones to identify tagged audio signals). In addition, a variety of information may be derived via the communication components 540, such as location via Internet Protocol (IP) geolocation, location via Wi-Fi® signal triangulation, location via detecting an NFC beacon signal that may indicate a particular location, and so forth.


The various memories (e.g., memory 504, main memory 512, static memory 514, and/or memory of the processors 502) and/or storage unit 516 may store one or more sets of instructions and data structures (e.g., software) embodying or used by any one or more of the methodologies or functions described herein. These instructions (e.g., the instructions 508), when executed by processors 502, cause various operations to implement the disclosed embodiments.


The instructions 508 may be transmitted or received over the network 520, using a transmission medium, via a network interface device (e.g., a network interface component included in the communication components 540) and using any one of a number of well-known transfer protocols (e.g., hypertext transfer protocol (HTTP)). Similarly, the instructions 508 may be transmitted or received using a transmission medium via the coupling 526 (e.g., a peer-to-peer coupling) to the devices 522.



FIG. 6 is a flowchart illustrating a method 600 for generating and presenting various interfaces to display an icon associated with the presumed destination of a first user on a display screen of a client device of a second user. The method 300 may be embodied in computer-readable instructions for execution by one or more processors (e.g., processor 302) such that the steps of the method 600 may be performed in part or in whole by functional components (e.g., location component 308, map GUI component 310, prediction component 312) of a processing environment 300 of a system (e.g., social network system 122); accordingly, the method 600 is described below by way of example with reference thereto. However, the method 600 may be deployed on various other hardware configurations and is not intended to be limited to the functional components of the processing environment 300.


In some embodiments, the system may need to receive authorization from a first user to utilize location information from a first client device of the first user (e.g., client device 102) and/or to display the first user's avatar or location on a display screen of a second client device associated with a second user prior to performing the remaining steps of method 700. Such authorization may be obtained via acceptance of a terms of service for utilizing an online social network or other service provided by the system, by acceptance on a case-by-case basis by the first user (e.g., via popups displayed on the user's computing device) or using any other suitable method for obtaining authorization by the user(s).


In operation 602, the system receives, from a first client device (e.g., client device 102) associated with a first user, via a wireless communication, over a network (e.g., network 106), an electronic communication containing location information from a location sensor (e.g., position components 538) coupled to the first client device. In some embodiments, the location sensor may include a global positioning sensor (GPS) component integrated in the first client device, as well as other types of location sensors.


The system may receive location information on a periodic basis or on an irregular basis and may request information from the first user's client device or receive such information from the first user's client device without such a request. In one embodiment, for instance, the first user's client device contains software that monitors the location sensor information from the first user's client device and transmits updates to the system in response to the location changing. In some cases, the first user's client device may update the system with a new location only after the location changes by at least a predetermined distance to allow a user to move about a building or other location without triggering updates.


In operation 604, the system determines, based on the location information, a current trajectory of the first user. A trajectory is a consecutive sequence of points in geographical space (e.g., GPS points) in chronological order, each point being defined by at least a set of geographical coordinates and a time stamp. The current trajectory of the first user may be generated by consolidating instant location information collected over time from one or more client devices (e.g., client device 102) associated with the first user. The system may use any number of different location measurements to determine a user's current trajectory. In some embodiments, for example, the system may determine a speed of the first user's client device (e.g., in real-time or near-real-time) based on first location information from the location sensor on the first user's device at a first time, and second location information from the location sensor at a second (subsequent) time. The speed and location information can be analyzed together to help determine the first user's current trajectory. Other information can be used to determine the first user's current trajectory. For example, if a mode of transportation (car, train, etc) of the user has been identified, the current trajectory can be determined by mapping the location information to infrastructure elements (road, railroad, etc) or other map elements.


In operation 606, the system accesses, from a database (e.g., entity table 206), information regarding the first user. The information may include habitual places of the user, which are places where the user spends a significant amount of time, such as home, work or school. Habitual places of a user may be inferred by analyzing the historical location information of the user. Habitual places of a user may be associated with a category such as “home”, “work”, “school”. For example, the place where the user spends most of his time during the day may be identified as the user's work place or school. The place where the user spends most of his time during the night may be identified as the user's domicile. The user may also identify his/her habitual places.


In operation 608, the system determines, by correlating the current trajectory of the first user and the historical location information of the first user, a presumed destination of the first user. The system may select candidate destination from among the habitual places of the first user, and compute, for each candidate destination, a probability that the candidate destination is the destination of the user. In particular, the system may compute this probability based on one or more of the following: a distance trend representative of how fast the first user is getting closer to a candidate destination, a probability that the first user will be in the candidate destination within a preset amount of time, a conditional probability that the first user will stay at least a preset amount of time at the candidate destination; and a score representative of how the behavior of the user matches his habitual behavior. Based on the computed probability exceeding a preset threshold, the system may determine that the candidate destination is the presumed destination of the first user.


As described in reference to FIG. 7, the system may also compute a correlation score between the current trajectory of the first user and a candidate trajectory pattern, and, based on the correlation score exceeding a preset threshold, determining that the presumed destination of the first user is the arrival point of the candidate trajectory pattern.


In operation 610, method 600 causes display, on a display screen of a second client device of a second user, of a user interface (e.g., user interface 1100 of FIG. 11) including a map depicting an icon associated with the habitual place of the first user that has been identified as the presumed destination of the first user. The location of the icon on the map is representative of the location of the presumed destination.


The system may compute, as new location information is received for the first user, an updated probability that the presumed destination is the actual destination of the first user. If the updated probability falls below a second preset threshold, the system may determine that the presumed destination is not the actual destination of the first user. In this case, the system may interrupt the display of the presumed destination of the first user on the second client device.


As shown in FIG. 7, method 700 may include the operations of method 600 as well as operation 702 and operation 704, according to some embodiments. Consistent with some embodiments, block operation 702 and operation 704 may be performed as part of (e.g., as sub-operations or as a subroutine) operation 608.


In embodiments, the historical location information includes one or more trajectory patterns of the user. A trajectory pattern corresponds to a recurring route that the user follows on a regular basis. A trajectory pattern may be defined by a plurality of location points (e.g., GPS points) in chronological order from a starting point to an arrival point. Exemplary methods for extracting trajectory patterns from historical location information are discussed in reference to FIG. 8.


In operation 702, method 700 computes a correlation score between the current trajectory of the first user and one or more of the trajectory patterns. Operation 702 may be triggered based on detecting that the current location of the first user is inside or within a preset distance of one of the trajectory patterns. In operation 704, based on the correlation score between the current trajectory and one of the trajectory patterns exceeding a preset threshold, the system selects the arrival point of the trajectory pattern as the presumed destination of the first user.



FIG. 8 is a flowchart illustrating a method 800 for extracting trajectory patterns from historical location information. The method 800 may be embodied in computer-readable instructions for execution by one or more processors (e.g., processor 302) such that the steps of the method 800 may be performed in part or in whole by functional components (e.g., map GUI component 310, prediction component 312) of a processing environment 300 of a system (e.g., social network system 122); accordingly, the method 800 is described below by way of example with reference thereto. However, it shall be appreciated that the method 800 may be deployed on various other hardware configurations and is not intended to be limited to the functional components of the processing environment 300. Consistent with some embodiments, method 800 may be performed as part of (e.g., as sub-operations or as a subroutine) operation 608.


In operation 802, the system extracts a plurality of historical trajectories from the historical location information. A historical trajectory is a consecutive sequence of points in geographical space (e.g., GPS points) in chronological order, each point being defined by at least a set of geographical coordinates and a time stamp. The sequence of points includes a start point and an end point. The start point, and the end point may be selected based on being in the neighborhood (e.g., within a preset distance) of a respective habitual place of the user. An historical trajectory may be generated from the historical location information by consolidating location information collected over a period of time spanning from the timestamp of the start point to the timestamp of the end point.


In operation 804, the system clusters the plurality of historical trajectories into a plurality of clusters. The plurality of historical trajectories is allocated into cohesive groups according to their mutual similarities. A variety of distance functions may be used to measure the similarity between historical trajectories (e.g., Euclidean Distance, Hausdorff Distance, Dynamic Time Warping (DTW) Distance, Longest Common Subsequence (LCSS) Distance). A variety of trajectory clustering methods may be used, including methods based on unsupervised, supervised and semi-supervised algorithms. A variety of models may be used including Densely Clustering models, Hierarchical Clustering models and Spectral Clustering models.


In operation 806, for each cluster, the system extracts a trajectory pattern by aligning and averaging the plurality of historical trajectories of the cluster. The plurality of historical trajectories of the cluster may be aligned in time and space using a variety of multiple sequence alignment techniques, such as progressive alignment construction methods, iterative methods, or consensus methods. Averaging the historical trajectories of a cluster is the problem of finding an average sequence for a set of sequences. The average sequence may be defined as the sequence that minimizes the sum of the squares to the set of objects. Various techniques may be used to average a set of sequences, such as bucketization techniques or Dynamic time warping. For each trajectory pattern, the system may also extract characteristics such as an average duration, a schedule, and a mode of transport. In particular, the mode of transport may be inferred based on mapping the trajectory pattern to infrastructure elements, such as roads, railroads.


In embodiments, the identified trajectory pattern may be used to extrapolate the current location of the first user based on the current trajectory of the user, for example in cases where the communication with the client device is lost. As shown in FIG. 9, method 900 may include the operations of method 700 as well as decision operation 902, operation 904, operation 906, operation 908, and operation 910, according to some embodiments. Consistent with some embodiments, decision operation 902, operation 904, operation 906, operation 908, and operation 910 may be performed after operation 610.


In decision operation 902, the system determines whether new location information has been received from the first client device.


If new location information has been received from the first client device, the system determines, in operation 904, an updated location of the first user based on the new location information. In operation 906, the system updates the location of the avatar of the first user on the map based on the updated location of the first user.


If no electronic communication has been received from the first client device for a period exceeding a preset period of time, the system determines, in operation 908, a predicted updated location of the first user based on the assumption that the user is following the trajectory pattern identified at operation 704. The system may for example predict the updated location of the first user by projecting the current location of the first user on the identified trajectory pattern based on the time elapsed since the last time location information has been received from the first client device. In operation 910, the system updates the location of the avatar of the first user on the map based on the predicted updated location of the first user.


In embodiments, the identified trajectory pattern may be used to infer the current mode of transport of the first user. This information can be used to predict a delay associated with the mode of transport of the first user. For example, the system infers that the first user in on a particular train, the system can access schedule and delay information of the particular train to more precisely predict a time of arrival of the first user.


In embodiments, the social network system 122 may compute an estimated time of arrival of the first user at the presumed destination and display the estimated time of arrival on the map GUI. As shown in FIG. 10, method 1000 may include the blocks of method 700 as well as operation 1002, operation 1004, operation 1006, and operation 1008, according to some embodiments. Consistent with some embodiments, operation 1002, operation 1004, operation 1006, and operation 1008 are be performed after operation 608.


In operation 1002, the system computes an estimated time of arrival of the first user at the presumed destination based the average duration of the trajectory pattern identified at operation 704. The system may also consider other factors such as weather, traffic conditions, and public transport schedule. In operation 1006, the system displays, on the display screen of the second client device of the second user, of the estimated time of arrival of the first user. In operation 1006, the system computes an average speed of the first user. For example, the system may determine an average speed of the first user's client device based on location information subsequently received from the location sensor of the first user's device over a rolling window. In operation 1008, the system updates the estimated time of arrival of the first user based on the average speed of the first user.


As shown in FIG. 11, exemplary user interface 1100 includes a map GUI 1104 depicting the first user's avatar 1106. The avatar 1106 is a media content item associated with the first user and that may include a still image, animated image, video, or other content. In particular, the avatar 1106 may include a profile picture of the first user or a default icon.


The location of the first user's avatar 1106 on the map GUI 1104 is representative of the current location of the first user. The system updates the location of the first user's avatar 1106 on the map GUI 1104 as the location of the client device of the first user changes. The first user's avatar 1106 may be a selectable UI element triggering the display of a user interface (e.g., user interface 1200 of FIG. 12) including map view centered on the selected avatar.


If a habitual place of the first user has been identified as the presumed destination of the first user, the map GUI 1104 includes an icon 1110 associated with the habitual place the first user is heading to. The icon 1110 is a media content item associated with the habitual place of the user and that may include a still image, animated image, video, or other content. The icon 1110 of a habitual place may be based on information (e.g., a category) stored in relation with the habitual place. The information may be retrieved from a variety of sources, such as form the entity table as well as from other systems and devices. For example, if the habitual place is identified as the home of the user, the icon 1110 may be an image depicting a house. The location of the icon 1110 on the map GUI 1104 is representative of the location of the presumed destination. If the current trajectory of the user has been matched to a pattern trajectory, the map GUI 1104 may also include an illustration of the pattern trajectory. The map GUI 1104 may also include an icon 1102 associated with the starting point of the pattern trajectory. The user interface 1100 may also include a selectable user interface element 1108 for requesting to be notified when the first user reaches his/her presumed destination.


As shown in FIG. 12, exemplary user interface 1200 includes a map GUI 1204 centered around the first user's avatar 1106. The user interface 1200 includes an indication 1210 of the destination of the first user. The user interface 1200 may also include an indication 1202 of the estimated time of arrival of the first user at the presumed destination, and optionally an instantaneous speed 1208 of the first user. The user interface 1200 may also include a selectable UI element 1206 to send a message or share media content with the first user (e.g., via the online social network, text message, or other electronic communication).


Throughout this specification, plural instances may implement components, operations, or structures described as a single instance. Although individual operations of one or more methods are illustrated and described as separate operations, one or more of the individual operations may be performed concurrently, and nothing requires that the operations be performed in the order illustrated. Structures and functionality presented as separate components in example configurations may be implemented as a combined structure or component. Similarly, structures and functionality presented as a single component may be implemented as separate components. These and other variations, modifications, additions, and improvements fall within the scope of the subject matter herein.


Although an overview of the inventive subject matter has been described with reference to specific example embodiments, various modifications and changes may be made to these embodiments without departing from the broader scope of embodiments of the present disclosure.


The embodiments illustrated herein are described in sufficient detail to enable those skilled in the art to practice the teachings disclosed. Other embodiments may be used and derived therefrom, such that structural and logical substitutions and changes may be made without departing from the scope of this disclosure. The Detailed Description, therefore, is not to be taken in a limiting sense, and the scope of various embodiments is defined only by the appended claims, along with the full range of equivalents to which such claims are entitled.


As used herein, the term “or” may be construed in either an inclusive or exclusive sense. Moreover, plural instances may be provided for resources, operations, or structures described herein as a single instance. Additionally, boundaries between various resources, operations, modules, engines, and data stores are somewhat arbitrary, and particular operations are illustrated in a context of specific illustrative configurations. Other allocations of functionality are envisioned and may fall within a scope of various embodiments of the present disclosure. In general, structures and functionality presented as separate resources in the example configurations may be implemented as a combined structure or resource. Similarly, structures and functionality presented as a single resource may be implemented as separate resources. These and other variations, modifications, additions, and improvements fall within a scope of embodiments of the present disclosure as represented by the appended claims. The specification and drawings are, accordingly, to be regarded in an illustrative rather than a restrictive sense.


“Signal Medium” refers to any intangible medium that is capable of storing, encoding, or carrying the instructions for execution by a machine and includes digital or analog communications signals or other intangible media to facilitate communication of software or data. The term “signal medium” shall be taken to include any form of a modulated data signal, carrier wave, and so forth. The term “modulated data signal” means a signal that has one or more of its characteristics set or changed in such a matter as to encode information in the signal. The terms “transmission medium” and “signal medium” mean the same thing and may be used interchangeably in this disclosure.


“Communication Network” refers to one or more portions of a network that may be an ad hoc network, an intranet, an extranet, a virtual private network (VPN), a local area network (LAN), a wireless LAN (WLAN), a wide area network (WAN), a wireless WAN (WWAN), a metropolitan area network (MAN), the Internet, a portion of the Internet, a portion of the Public Switched Telephone Network (PSTN), a plain old telephone service (POTS) network, a cellular telephone network, a wireless network, a Wi-Fi® network, another type of network, or a combination of two or more such networks. For example, a network or a portion of a network may include a wireless or cellular network and the coupling may be a Code Division Multiple Access (CDMA) connection, a Global System for Mobile communications (GSM) connection, or other types of cellular or wireless coupling. In this example, the coupling may implement any of a variety of types of data transfer technology, such as Single Carrier Radio Transmission Technology (1×RTT), Evolution-Data Optimized (EVDO) technology, General Packet Radio Service (GPRS) technology, Enhanced Data rates for GSM Evolution (EDGE) technology, third Generation Partnership Project (3GPP) including 3G, fourth generation wireless (4G) networks, Universal Mobile Telecommunications System (UMTS), High Speed Packet Access (HSPA), Worldwide Interoperability for Microwave Access (WiMAX), Long Term Evolution (LTE) standard, others defined by various standard-setting organizations, other long-range protocols, or other data transfer technology.


“Processor” refers to any circuit or virtual circuit (a physical circuit emulated by logic executing on an actual processor) that manipulates data values according to control signals (e.g., “commands”, “op codes”, “machine code”, etc.) and which produces corresponding output signals that are applied to operate a machine. A processor may, for example, be a Central Processing Unit (CPU), a Reduced Instruction Set Computing (RISC) processor, a Complex Instruction Set Computing (CISC) processor, a Graphics Processing Unit (GPU), a Digital Signal Processor (DSP), an Application Specific Integrated Circuit (ASIC), a Radio-Frequency Integrated Circuit (RFIC) or any combination thereof. A processor may further be a multi-core processor having two or more independent processors (sometimes referred to as “cores”) that may execute instructions contemporaneously.


“Machine-Storage Medium” refers to a single or multiple storage devices and/or media (e.g., a centralized or distributed database, and/or associated caches and servers) that store executable instructions, routines and/or data. The term shall accordingly be taken to include, but not be limited to, solid-state memories, and optical and magnetic media, including memory internal or external to processors. Specific examples of machine-storage media, computer-storage media and/or device-storage media include non-volatile memory, including by way of example semiconductor memory devices, e.g., erasable programmable read-only memory (EPROM), electrically erasable programmable read-only memory (EEPROM), FPGA, and flash memory devices; magnetic disks such as internal hard disks and removable disks; magneto-optical disks; and CD-ROM and DVD-ROM disks The terms “machine-storage medium,” “device-storage medium,” “computer-storage medium” mean the same thing and may be used interchangeably in this disclosure. The terms “machine-storage media,” “computer-storage media,” and “device-storage media” specifically exclude carrier waves, modulated data signals, and other such media, at least some of which are covered under the term “signal medium.”


“Component” refers to a device, physical entity, or logic having boundaries defined by function or subroutine calls, branch points, APIs, or other technologies that provide for the partitioning or modularization of particular processing or control functions. Components may be combined via their interfaces with other components to carry out a machine process. A component may be a packaged functional hardware unit designed for use with other components and a part of a program that usually performs a particular function of related functions. Components may constitute either software components (e.g., code embodied on a machine-readable medium) or hardware components. A “hardware component” is a tangible unit capable of performing certain operations and may be configured or arranged in a certain physical manner. In various example embodiments, one or more computer systems (e.g., a standalone computer system, a client computer system, or a server computer system) or one or more hardware components of a computer system (e.g., a processor or a group of processors) may be configured by software (e.g., an application or application portion) as a hardware component that operates to perform certain operations as described herein. A hardware component may also be implemented mechanically, electronically, or any suitable combination thereof. For example, a hardware component may include dedicated circuitry or logic that is permanently configured to perform certain operations. A hardware component may be a special-purpose processor, such as a field-programmable gate array (FPGA) or an application specific integrated circuit (ASIC). A hardware component may also include programmable logic or circuitry that is temporarily configured by software to perform certain operations. For example, a hardware component may include software executed by a general-purpose processor or other programmable processor. Once configured by such software, hardware components become specific machines (or specific components of a machine) uniquely tailored to perform the configured functions and are no longer general-purpose processors. It will be appreciated that the decision to implement a hardware component mechanically, in dedicated and permanently configured circuitry, or in temporarily configured circuitry (e.g., configured by software), may be driven by cost and time considerations. Accordingly, the phrase “hardware component” (or “hardware-implemented component”) should be understood to encompass a tangible entity, be that an entity that is physically constructed, permanently configured (e.g., hardwired), or temporarily configured (e.g., programmed) to operate in a certain manner or to perform certain operations described herein. Considering embodiments in which hardware components are temporarily configured (e.g., programmed), each of the hardware components need not be configured or instantiated at any one instance in time. For example, where a hardware component comprises a general-purpose processor configured by software to become a special-purpose processor, the general-purpose processor may be configured as respectively different special-purpose processors (e.g., comprising different hardware components) at different times. Software accordingly configures a particular processor or processors, for example, to constitute a particular hardware component at one instance of time and to constitute a different hardware component at a different instance of time. Hardware components can provide information to, and receive information from, other hardware components. Accordingly, the described hardware components may be regarded as being communicatively coupled. Where multiple hardware components exist contemporaneously, communications may be achieved through signal transmission (e.g., over appropriate circuits and buses) between or among two or more of the hardware components. In embodiments in which multiple hardware components are configured or instantiated at different times, communications between such hardware components may be achieved, for example, through the storage and retrieval of information in memory structures to which the multiple hardware components have access. For example, one hardware component may perform an operation and store the output of that operation in a memory device to which it is communicatively coupled. A further hardware component may then, at a later time, access the memory device to retrieve and process the stored output. Hardware components may also initiate communications with input or output devices, and can operate on a resource (e.g., a collection of information). The various operations of example methods described herein may be performed, at least partially, by one or more processors that are temporarily configured (e.g., by software) or permanently configured to perform the relevant operations. Whether temporarily or permanently configured, such processors may constitute processor-implemented components that operate to perform one or more operations or functions described herein. As used herein, “processor-implemented component” refers to a hardware component implemented using one or more processors. Similarly, the methods described herein may be at least partially processor-implemented, with a particular processor or processors being an example of hardware. For example, at least some of the operations of a method may be performed by one or more processors 1004 or processor-implemented components. Moreover, the one or more processors may also operate to support performance of the relevant operations in a “cloud computing” environment or as a “software as a service” (SaaS). For example, at least some of the operations may be performed by a group of computers (as examples of machines including processors), with these operations being accessible via a network (e.g., the Internet) and via one or more appropriate interfaces (e.g., an API). The performance of certain of the operations may be distributed among the processors, not only residing within a single machine, but deployed across a number of machines. In some example embodiments, the processors or processor-implemented components may be located in a single geographic location (e.g., within a home environment, an office environment, or a server farm). In other example embodiments, the processors or processor-implemented components may be distributed across a number of geographic locations.


“Carrier Signal” refers to any intangible medium that is capable of storing, encoding, or carrying instructions for execution by the machine, and includes digital or analog communications signals or other intangible media to facilitate communication of such instructions. Instructions may be transmitted or received over a network using a transmission medium via a network interface device.


“Computer-Readable Medium” refers to both machine-storage media and transmission media. Thus, the terms include both storage devices/media and carrier waves/modulated data signals. The terms “machine-readable medium,” “computer-readable medium” and “device-readable medium” mean the same thing and may be used interchangeably in this disclosure.


“Client Device” refers to any machine that interfaces to a communications network to obtain resources from one or more server systems or other client devices. A client device may be, but is not limited to, a mobile phone, desktop computer, laptop, portable digital assistants (PDAs), smartphones, tablets, ultrabooks, netbooks, laptops, multi-processor systems, microprocessor-based or programmable consumer electronics, game consoles, set-top boxes, or any other communication device that a user may use to access a network.

Claims
  • 1. A method comprising: determining, based on location information of a first client device of a first user, a current trajectory of the first user;accessing, from a database, historical location information of the first user;determining, by correlating the current trajectory of the first user and the historical location information of the first user, a presumed destination of the first user; andinitiating transmission of destination data to a second client device of a second user, the destination data comprising the presumed destination of the first user for display of a user interface on the second client device,wherein the user interface includes a map which depicts an icon representing the presumed destination, a position of the icon on the map corresponding to a location of the presumed destination,wherein the map further depicts an avatar of the first user, a position of the avatar of the first user on the map corresponding to a current location of the first user,wherein the user interface further includes a user-selectable element for composing a message for sending to the first user or for sharing a media content item with the first user, andwherein the historical location information includes a plurality of historical trajectories, each historical trajectory corresponding to a respective consecutive sequence of points, each point defined by a set of geographical coordinates and a time stamp.
  • 2. The method of claim 1, further comprising: clustering the plurality of historical trajectories into a plurality of clusters, the presumed destination being determined based at least in part on the plurality of clusters; andextracting, for each cluster, a trajectory pattern by aligning and averaging the plurality of historical trajectories of the cluster, the trajectory pattern being associated with an arrival point.
  • 3. The method of claim 2, wherein determining the presumed destination of the first user comprises: computing, for each trajectory pattern, a correlation score between the current trajectory of the first user and the trajectory pattern; anddetermining, based on the correlation score exceeding a preset threshold for one of the trajectory patterns, that the presumed destination of the first user is the arrival point of the one of the trajectory patterns.
  • 4. The method of claim 2, wherein the trajectory pattern is associated with an average duration, the method further comprising: computing an estimated time of arrival of the first user at the presumed destination based on the average duration of the trajectory pattern.
  • 5. The method of claim 4, further comprising: computing an average speed of the first user, wherein the estimated time of arrival of the first user is further computed based on the average speed of the first user.
  • 6. The method of claim 1, further comprising: determining an updated location of the first user based on new location information of the first client device; andupdating the location of the avatar of the first user on the map based on the updated location of the first user.
  • 7. The method of claim 1, further comprising: determining that a preset period of time has passed since receiving the location information without having received a new location information from the first client device;determining, in response to determining that the preset period of time has passed, a first updated location of the first user based on the location information and the historical location information; andupdating the location of the avatar of the first user on the map based on the first updated location of the first user.
  • 8. The method of claim 1, wherein the user interface further includes a first user-selectable element for sending a request to be notified when the first user reaches the presumed destination.
  • 9. A system comprising: at least one processor; anda memory storing instructions that, when executed by the at least one processor, configure the at least one processor to perform operations comprising:determining, based on location information of a first client device of a first user, a current trajectory of the first user;accessing, from a database, historical location information of the first user;determining, by correlating the current trajectory of the first user and the historical location information of the first user, a presumed destination of the first user; andinitiating transmission of destination data to a second client device of a second user, the destination data comprising the presumed destination of the first user for display of a user interface on the second client device,wherein the user interface includes a map which depicts an icon representing the presumed destination, a position of the icon on the map corresponding to a location of the presumed destination,wherein the map further depicts an avatar of the first user, a position of the avatar of the first user on the map corresponding to a current location of the first user,wherein the user interface further includes a user-selectable element for composing a message for sending to the first user or for sharing a media content item with the first user, andwherein the historical location information includes a plurality of historical trajectories, each historical trajectory corresponding to a respective consecutive sequence of points, each point defined by a set of geographical coordinates and a time stamp.
  • 10. The system of claim 9, further comprising: clustering the plurality of historical trajectories into a plurality of clusters, the presumed destination being determined based at least in part on the plurality of clusters; andextracting, for each cluster, a trajectory pattern by aligning and averaging the plurality of historical trajectories of the cluster, the trajectory pattern being associated with an arrival point.
  • 11. The system of claim 10, wherein determining the presumed destination of the first user comprises: computing, for each trajectory pattern, a correlation score between the current trajectory of the first user and the trajectory pattern; anddetermining, based on the correlation score exceeding a preset threshold for one of the trajectory patterns, that the presumed destination of the first user is the arrival point of the one of the trajectory patterns.
  • 12. The system of claim 10, wherein the trajectory pattern is associated with an average duration, the operations further comprising: computing an estimated time of arrival of the first user at the presumed destination based on the average duration of the trajectory pattern.
  • 13. The system of claim 12, further comprising: computing an average speed of the first user, wherein the estimated time of arrival of the first user is further computed based on the average speed of the first user.
  • 14. The system of claim 9, further comprising: determining an updated location of the first user based on new location information of the first client device; andupdating the location of the avatar of the first user on the map based on the updated location of the first user.
  • 15. The system of claim 9, further comprising: determining that a preset period of time has passed since receiving the location information without having received a new location information from the first client device;determining, in response to determining that the preset period of time has passed, a first updated location of the first user based on the location information and the historical location information; andupdating the location of the avatar of the first user on the map based on the first updated location of the first user.
  • 16. The system of claim 9, wherein the user interface further includes a first user-selectable element for sending a request to be notified when the first user reaches the presumed destination.
  • 17. A non-transitory computer-readable storage medium, the computer-readable storage medium including instructions that when executed by a computer, cause the computer to perform operations comprising: determining, based on location information of a first client device of a first user, a current trajectory of the first user;accessing, from a database, historical location information of the first user;determining, by correlating the current trajectory of the first user and the historical location information of the first user, a presumed destination of the first user; andinitiating transmission of destination data to a second client device of a second user, the destination data comprising the presumed destination of the first user for display of a user interface on the second client device,wherein the user interface includes a map which depicts an icon representing the presumed destination, a position of the icon on the map corresponding to a location of the presumed destination,wherein the map further depicts an avatar of the first user, a position of the avatar of the first user on the map corresponding to a current location of the first user,wherein the user interface further includes a user-selectable element for composing a message for sending to the first user or for sharing a media content item with the first user, andwherein the historical location information includes a plurality of historical trajectories, each historical trajectory corresponding to a respective consecutive sequence of points, each point defined by a set of geographical coordinates and a time stamp.
  • 18. The non-transitory computer-readable storage medium of claim 17, further comprising: clustering the plurality of historical trajectories into a plurality of clusters, the presumed destination being determined based at least in part on the plurality of clusters; andextracting, for each cluster, a trajectory pattern by aligning and averaging the plurality of historical trajectories of the cluster, the trajectory pattern being associated with an arrival point.
  • 19. The non-transitory computer-readable storage medium of claim 18, wherein determining the presumed destination of the first user comprises: computing, for each trajectory pattern, a correlation score between the current trajectory of the first user and the trajectory pattern; anddetermining, based on the correlation score exceeding a preset threshold for one of the trajectory patterns, that the presumed destination of the first user is the arrival point of the one of the trajectory patterns.
  • 20. The non-transitory computer-readable storage medium of claim 18, wherein the trajectory pattern is associated with an average duration, the operations further comprising: computing an estimated time of arrival of the first user at the presumed destination based on the average duration of the trajectory pattern.
CROSS-REFERENCE TO RELATED APPLICATION

This application is a continuation of U.S. patent application Ser. No. 17/339,394, filed Jun. 4, 2021, which application is a continuation of U.S. patent application Ser. No. 16/453,690, filed Jun. 26, 2019, now issued as U.S. Pat. No. 11,032,670, which application claims priority to U.S. Provisional Patent Application Ser. No. 62/792,251 filed on Jan. 14, 2019, which applications and publications are incorporated herein by reference in their entireties.

US Referenced Citations (786)
Number Name Date Kind
666223 Shedlock Jan 1901 A
4581634 Williams Apr 1986 A
4975690 Torres Dec 1990 A
5072412 Henderson, Jr. et al. Dec 1991 A
5493692 Theimer et al. Feb 1996 A
5713073 Warsta Jan 1998 A
5754939 Herz et al. May 1998 A
5855008 Goldhaber et al. Dec 1998 A
5880731 Liles et al. Mar 1999 A
5883639 Walton et al. Mar 1999 A
5999932 Paul Dec 1999 A
6012098 Bayeh et al. Jan 2000 A
6014090 Rosen et al. Jan 2000 A
6023270 Brush, II et al. Feb 2000 A
6029141 Bezos et al. Feb 2000 A
6038295 Mattes Mar 2000 A
6049711 Yehezkel et al. Apr 2000 A
6154764 Nitta et al. Nov 2000 A
6167435 Druckenmiller et al. Dec 2000 A
6204840 Petelycky et al. Mar 2001 B1
6205432 Gabbard et al. Mar 2001 B1
6216141 Straub et al. Apr 2001 B1
6223165 Lauffer Apr 2001 B1
6285381 Sawano et al. Sep 2001 B1
6285987 Roth et al. Sep 2001 B1
6310694 Okimoto et al. Oct 2001 B1
6317789 Rakavy et al. Nov 2001 B1
6334149 Davis, Jr. et al. Dec 2001 B1
6349203 Asaoka et al. Feb 2002 B1
6353170 Eyzaguirre et al. Mar 2002 B1
6446004 Cao et al. Sep 2002 B1
6449657 Stanbach et al. Sep 2002 B2
6456852 Bar et al. Sep 2002 B2
6484196 Maurille Nov 2002 B1
6487601 Hubacher et al. Nov 2002 B1
6523008 Avrunin Feb 2003 B1
6542749 Tanaka et al. Apr 2003 B2
6549768 Fraccaroli Apr 2003 B1
6618593 Drutman et al. Sep 2003 B1
6622174 Ukita et al. Sep 2003 B1
6631463 Floyd et al. Oct 2003 B1
6636247 Hamzy et al. Oct 2003 B1
6636855 Holloway et al. Oct 2003 B2
6643684 Malkin et al. Nov 2003 B1
6658095 Yoakum et al. Dec 2003 B1
6665531 Soderbacka et al. Dec 2003 B1
6668173 Greene Dec 2003 B2
6684238 Dutta Jan 2004 B1
6684257 Camut et al. Jan 2004 B1
6698020 Zigmond et al. Feb 2004 B1
6700506 Winkler Mar 2004 B1
6720860 Narayanaswami Apr 2004 B1
6724403 Santoro et al. Apr 2004 B1
6728605 Lash et al. Apr 2004 B2
6757713 Ogilvie et al. Jun 2004 B1
6772195 Hatlelid et al. Aug 2004 B1
6832222 Zimowski Dec 2004 B1
6834195 Brandenberg et al. Dec 2004 B2
6836792 Chen Dec 2004 B1
6842779 Nishizawa Jan 2005 B1
6898626 Ohashi May 2005 B2
6959324 Kubik et al. Oct 2005 B1
6970088 Kovach Nov 2005 B2
6970907 Ullmann et al. Nov 2005 B1
6980909 Root et al. Dec 2005 B2
6981040 Konig et al. Dec 2005 B1
7020494 Spriestersbach et al. Mar 2006 B2
7027124 Foote et al. Apr 2006 B2
7072963 Anderson et al. Jul 2006 B2
7085571 Kalhan et al. Aug 2006 B2
7110744 Freeny, Jr. Sep 2006 B2
7124164 Chemtob Oct 2006 B1
7149893 Leonard et al. Dec 2006 B1
7173651 Knowles Feb 2007 B1
7188143 Szeto Mar 2007 B2
7203380 Chiu et al. Apr 2007 B2
7206568 Sudit Apr 2007 B2
7227937 Yoakum et al. Jun 2007 B1
7237002 Estrada et al. Jun 2007 B1
7240089 Boudreau Jul 2007 B2
7269426 Kokkonen et al. Sep 2007 B2
7280658 Amini et al. Oct 2007 B2
7315823 Brondrup Jan 2008 B2
7342587 Danzig et al. Mar 2008 B2
7349768 Bruce et al. Mar 2008 B2
7356564 Hartselle et al. Apr 2008 B2
7394345 Ehlinger et al. Jul 2008 B1
7411493 Smith Aug 2008 B2
7423580 Markhovsky et al. Sep 2008 B2
7454442 Cobleigh et al. Nov 2008 B2
7468729 Levinson Dec 2008 B1
7508419 Toyama et al. Mar 2009 B2
7512649 Faybishenko et al. Mar 2009 B2
7519670 Hagale et al. Apr 2009 B2
7535890 Rojas May 2009 B2
7546554 Chiu et al. Jun 2009 B2
7607096 Oreizy et al. Oct 2009 B2
7636755 Blattner et al. Dec 2009 B2
7639251 Gu et al. Dec 2009 B2
7639943 Kalajan Dec 2009 B1
7650231 Gadler Jan 2010 B2
7668537 DeVries Feb 2010 B2
7770137 Forbes et al. Aug 2010 B2
7775885 Van et al. Aug 2010 B2
7778973 Choi Aug 2010 B2
7779444 Glad Aug 2010 B2
7787886 Markhovsky et al. Aug 2010 B2
7796946 Eisenbach Sep 2010 B2
7801954 Cadiz et al. Sep 2010 B2
7856360 Kramer et al. Dec 2010 B2
7859551 Bulman et al. Dec 2010 B2
7885931 Seo et al. Feb 2011 B2
7925703 Dinan et al. Apr 2011 B2
8001204 Burtner et al. Aug 2011 B2
8032586 Challenger et al. Oct 2011 B2
8082255 Carlson, Jr. et al. Dec 2011 B1
8088044 Tchao et al. Jan 2012 B2
8090351 Klein Jan 2012 B2
8095878 Bates et al. Jan 2012 B2
8098904 Loffe et al. Jan 2012 B2
8099109 Altman et al. Jan 2012 B2
8108774 Finn et al. Jan 2012 B2
8112716 Kobayashi Feb 2012 B2
8117281 Robinson et al. Feb 2012 B2
8130219 Fleury et al. Mar 2012 B2
8131597 Hudetz Mar 2012 B2
8135166 Rhoads Mar 2012 B2
8136028 Loeb et al. Mar 2012 B1
8146001 Reese Mar 2012 B1
8146005 Jones et al. Mar 2012 B2
8151191 Nicol Apr 2012 B2
8161115 Yamamoto Apr 2012 B2
8161417 Lee Apr 2012 B1
8195203 Tseng Jun 2012 B1
8199747 Rojas et al. Jun 2012 B2
8208943 Petersen Jun 2012 B2
8214443 Hamburg Jul 2012 B2
8234350 Gu et al. Jul 2012 B1
8276092 Narayanan et al. Sep 2012 B1
8279319 Date Oct 2012 B2
8280406 Ziskind et al. Oct 2012 B2
8285199 Hsu et al. Oct 2012 B2
8287380 Nguyen et al. Oct 2012 B2
8301159 Hamynen et al. Oct 2012 B2
8306922 Kunal et al. Nov 2012 B1
8312086 Velusamy et al. Nov 2012 B2
8312097 Siegel et al. Nov 2012 B1
8326315 Phillips et al. Dec 2012 B2
8326327 Hymel et al. Dec 2012 B2
8332475 Rosen et al. Dec 2012 B2
8352546 Dollard Jan 2013 B1
8379130 Forutanpour et al. Feb 2013 B2
8384719 Reville et al. Feb 2013 B2
8385950 Wagner et al. Feb 2013 B1
RE44054 Kim Mar 2013 E
8396708 Park et al. Mar 2013 B2
8402097 Szeto Mar 2013 B2
8405773 Hayashi et al. Mar 2013 B2
8418067 Cheng et al. Apr 2013 B2
8423409 Rao Apr 2013 B2
8425322 Gillo et al. Apr 2013 B2
8458601 Castelli et al. Jun 2013 B2
8462198 Lin et al. Jun 2013 B2
8471914 Sakiyama et al. Jun 2013 B2
8472935 Fujisaki Jun 2013 B1
8484158 Deluca et al. Jul 2013 B2
8495503 Brown et al. Jul 2013 B2
8495505 Smith et al. Jul 2013 B2
8504926 Wolf Aug 2013 B2
8510383 Hurley et al. Aug 2013 B2
8527345 Rothschild et al. Sep 2013 B2
8554627 Svendsen et al. Oct 2013 B2
8559980 Pujol Oct 2013 B2
8560612 Kilmer et al. Oct 2013 B2
8564621 Branson et al. Oct 2013 B2
8564710 Nonaka et al. Oct 2013 B2
8581911 Becker et al. Nov 2013 B2
8594680 Ledlie et al. Nov 2013 B2
8597121 Andres del Valle Dec 2013 B2
8601051 Wang Dec 2013 B2
8601379 Marks et al. Dec 2013 B2
8613089 Holloway et al. Dec 2013 B1
8632408 Gillo et al. Jan 2014 B2
8648865 Dawson et al. Feb 2014 B2
8659548 Hildreth Feb 2014 B2
8660358 Bergboer et al. Feb 2014 B1
8660369 Llano et al. Feb 2014 B2
8660793 Ngo et al. Feb 2014 B2
8682350 Altman et al. Mar 2014 B2
8683354 Khandelwal et al. Mar 2014 B2
8692830 Nelson et al. Apr 2014 B2
8718333 Wolf et al. May 2014 B2
8724622 Rojas May 2014 B2
8732168 Johnson May 2014 B2
8744523 Fan et al. Jun 2014 B2
8745132 Obradovich Jun 2014 B2
8761800 Kuwahara Jun 2014 B2
8768876 Shim et al. Jul 2014 B2
8775972 Spiegel Jul 2014 B2
8788680 Naik Jul 2014 B1
8790187 Walker et al. Jul 2014 B2
8797415 Arnold Aug 2014 B2
8798646 Wang et al. Aug 2014 B1
8810513 Ptucha et al. Aug 2014 B2
8812171 Filev et al. Aug 2014 B2
8832201 Wall Sep 2014 B2
8832552 Arrasvuori et al. Sep 2014 B2
8839327 Amento et al. Sep 2014 B2
8856349 Jain et al. Oct 2014 B2
8874677 Rosen et al. Oct 2014 B2
8886227 Schmidt et al. Nov 2014 B2
8890926 Tandon et al. Nov 2014 B2
8892999 Nims et al. Nov 2014 B2
8909679 Root et al. Dec 2014 B2
8909725 Sehn Dec 2014 B1
8924250 Bates et al. Dec 2014 B2
8963926 Brown et al. Feb 2015 B2
8972357 Shim et al. Mar 2015 B2
8989786 Feghali Mar 2015 B2
8995433 Rojas Mar 2015 B2
9015285 Ebsen et al. Apr 2015 B1
9020745 Johnston et al. Apr 2015 B2
9040574 Wang et al. May 2015 B2
9055416 Rosen et al. Jun 2015 B2
9086776 Ye et al. Jul 2015 B2
9094137 Sehn et al. Jul 2015 B1
9100806 Rosen et al. Aug 2015 B2
9100807 Rosen et al. Aug 2015 B2
9105014 Collet et al. Aug 2015 B2
9113301 Spiegel et al. Aug 2015 B1
9119027 Sharon et al. Aug 2015 B2
9123074 Jacobs et al. Sep 2015 B2
9143382 Bhogal et al. Sep 2015 B2
9143681 Ebsen et al. Sep 2015 B1
9152477 Campbell et al. Oct 2015 B1
9191776 Root et al. Nov 2015 B2
9204252 Root Dec 2015 B2
9225897 Sehn et al. Dec 2015 B1
9241184 Weerasinghe Jan 2016 B2
9256860 Herger et al. Feb 2016 B2
9258459 Hartley Feb 2016 B2
9298257 Hwang et al. Mar 2016 B2
9314692 Konoplev et al. Apr 2016 B2
9330483 Du et al. May 2016 B2
9344606 Hartley et al. May 2016 B2
9357174 Li et al. May 2016 B2
9361510 Yao et al. Jun 2016 B2
9378576 Bouaziz et al. Jun 2016 B2
9385983 Sehn Jul 2016 B1
9396354 Murphy et al. Jul 2016 B1
9402057 Kaytaz et al. Jul 2016 B2
9407712 Sehn Aug 2016 B1
9407816 Sehn Aug 2016 B1
9412192 Mandel et al. Aug 2016 B2
9430783 Sehn Aug 2016 B1
9439041 Parvizi et al. Sep 2016 B2
9443227 Evans et al. Sep 2016 B2
9450907 Pridmore et al. Sep 2016 B2
9459778 Hogeg et al. Oct 2016 B2
9460541 Li et al. Oct 2016 B2
9489661 Evans et al. Nov 2016 B2
9489760 Li et al. Nov 2016 B2
9491134 Rosen et al. Nov 2016 B2
9503845 Vincent Nov 2016 B2
9508197 Quinn et al. Nov 2016 B2
9532171 Allen et al. Dec 2016 B2
9537811 Allen et al. Jan 2017 B2
9544257 Ogundokun et al. Jan 2017 B2
9576400 Van Os et al. Feb 2017 B2
9589357 Li et al. Mar 2017 B2
9592449 Barbalet et al. Mar 2017 B2
9628950 Noeth et al. Apr 2017 B1
9648376 Chang et al. May 2017 B2
9697635 Quinn et al. Jul 2017 B2
9706040 Kadirvel et al. Jul 2017 B2
9710821 Heath Jul 2017 B2
9744466 Fujioka Aug 2017 B2
9746990 Anderson et al. Aug 2017 B2
9749270 Collet et al. Aug 2017 B2
9792714 Li et al. Oct 2017 B2
9839844 Dunstan et al. Dec 2017 B2
9854219 Sehn Dec 2017 B2
9883838 Kaleal, III et al. Feb 2018 B2
9898849 Du et al. Feb 2018 B2
9911073 Spiegel et al. Mar 2018 B1
9936165 Li et al. Apr 2018 B2
9959037 Chaudhri et al. May 2018 B2
9980100 Charlton et al. May 2018 B1
9990373 Fortkort Jun 2018 B2
10039988 Lobb et al. Aug 2018 B2
10097492 Tsuda et al. Oct 2018 B2
10116598 Tucker et al. Oct 2018 B2
10155168 Blackstock et al. Dec 2018 B2
10242477 Charlton et al. Mar 2019 B1
10242503 McPhee et al. Mar 2019 B2
10262250 Spiegel et al. Apr 2019 B1
10362219 Wilson et al. Jul 2019 B2
10475225 Park et al. Nov 2019 B2
10504266 Blattner et al. Dec 2019 B2
10573048 Ni et al. Feb 2020 B2
10657701 Osman et al. May 2020 B2
10674311 Bouba et al. Jun 2020 B1
10893385 Berardino et al. Jan 2021 B1
10936066 Jaureguiberry et al. Mar 2021 B1
10939246 Dancie et al. Mar 2021 B1
10945098 Dancie et al. Mar 2021 B2
11032670 Baylin et al. Jun 2021 B1
11039270 Bouba et al. Jun 2021 B2
11166123 Guillaume Nov 2021 B1
11275439 Jaureguiberry et al. Mar 2022 B2
11294936 Jaureguiberry Apr 2022 B1
11307747 Dancie et al. Apr 2022 B2
20020047868 Miyazawa Apr 2002 A1
20020067362 Agostino Nocera et al. Jun 2002 A1
20020078456 Hudson et al. Jun 2002 A1
20020087631 Sharma Jul 2002 A1
20020097257 Miller et al. Jul 2002 A1
20020122659 Mcgrath et al. Sep 2002 A1
20020128047 Gates Sep 2002 A1
20020144154 Tomkow Oct 2002 A1
20020169644 Greene Nov 2002 A1
20030001846 Davis et al. Jan 2003 A1
20030016247 Lai et al. Jan 2003 A1
20030017823 Mager et al. Jan 2003 A1
20030020623 Cao et al. Jan 2003 A1
20030023874 Prokupets et al. Jan 2003 A1
20030037124 Yamaura et al. Feb 2003 A1
20030052925 Daimon et al. Mar 2003 A1
20030101230 Benschoter et al. May 2003 A1
20030110503 Perkes Jun 2003 A1
20030126215 Udell Jul 2003 A1
20030148773 Spriestersbach et al. Aug 2003 A1
20030164856 Prager et al. Sep 2003 A1
20030229607 Zellweger et al. Dec 2003 A1
20040027371 Jaeger Feb 2004 A1
20040064429 Hirstius et al. Apr 2004 A1
20040078367 Anderson et al. Apr 2004 A1
20040111467 Willis Jun 2004 A1
20040158739 Wakai et al. Aug 2004 A1
20040189465 Capobianco et al. Sep 2004 A1
20040203959 Coombes Oct 2004 A1
20040215625 Svendsen et al. Oct 2004 A1
20040243531 Dean Dec 2004 A1
20040243688 Wugofski Dec 2004 A1
20050021444 Bauer et al. Jan 2005 A1
20050022211 Veselov et al. Jan 2005 A1
20050048989 Jung Mar 2005 A1
20050078804 Yomoda Apr 2005 A1
20050097176 Schatz et al. May 2005 A1
20050102381 Jiang et al. May 2005 A1
20050104976 Currans May 2005 A1
20050114783 Szeto May 2005 A1
20050119936 Buchanan et al. Jun 2005 A1
20050122405 Voss et al. Jun 2005 A1
20050162419 Kim et al. Jul 2005 A1
20050193340 Amburgey et al. Sep 2005 A1
20050193345 Klassen et al. Sep 2005 A1
20050198128 Anderson Sep 2005 A1
20050206610 Cordelli Sep 2005 A1
20050223066 Buchheit et al. Oct 2005 A1
20050288954 McCarthy et al. Dec 2005 A1
20060026067 Nicholas et al. Feb 2006 A1
20060107297 Toyama et al. May 2006 A1
20060114338 Rothschild Jun 2006 A1
20060119882 Harris et al. Jun 2006 A1
20060242239 Morishima et al. Oct 2006 A1
20060252438 Ansamaa et al. Nov 2006 A1
20060265417 Amato et al. Nov 2006 A1
20060270419 Crowley et al. Nov 2006 A1
20060287878 Wadhwa et al. Dec 2006 A1
20060294465 Ronen et al. Dec 2006 A1
20070004426 Pfleging et al. Jan 2007 A1
20070038715 Collins et al. Feb 2007 A1
20070040931 Nishizawa Feb 2007 A1
20070073517 Panje Mar 2007 A1
20070073823 Cohen et al. Mar 2007 A1
20070075898 Markhovsky et al. Apr 2007 A1
20070082707 Flynt et al. Apr 2007 A1
20070113181 Blattner et al. May 2007 A1
20070136228 Petersen Jun 2007 A1
20070168863 Blattner et al. Jul 2007 A1
20070176921 Iwasaki et al. Aug 2007 A1
20070192128 Celestini Aug 2007 A1
20070198340 Lucovsky et al. Aug 2007 A1
20070198495 Buron et al. Aug 2007 A1
20070208751 Cowan et al. Sep 2007 A1
20070210936 Nicholson Sep 2007 A1
20070214180 Crawford Sep 2007 A1
20070214216 Carrer et al. Sep 2007 A1
20070233556 Koningstein Oct 2007 A1
20070233801 Eren et al. Oct 2007 A1
20070233859 Zhao et al. Oct 2007 A1
20070243887 Bandhole et al. Oct 2007 A1
20070244750 Grannan et al. Oct 2007 A1
20070255456 Funayama Nov 2007 A1
20070281690 Altman et al. Dec 2007 A1
20080022329 Glad Jan 2008 A1
20080025701 Ikeda Jan 2008 A1
20080032703 Krumm et al. Feb 2008 A1
20080033930 Warren Feb 2008 A1
20080043041 Hedenstroem et al. Feb 2008 A2
20080049704 Witteman et al. Feb 2008 A1
20080062141 Chandhri Mar 2008 A1
20080070593 Altman et al. Mar 2008 A1
20080076505 Ngyen et al. Mar 2008 A1
20080092233 Tian et al. Apr 2008 A1
20080094387 Chen Apr 2008 A1
20080104503 Beall et al. May 2008 A1
20080109844 Baldeschweiler et al. May 2008 A1
20080120409 Sun et al. May 2008 A1
20080147730 Lee et al. Jun 2008 A1
20080148150 Mall Jun 2008 A1
20080158222 Li et al. Jul 2008 A1
20080158230 Sharma et al. Jul 2008 A1
20080168033 Ott et al. Jul 2008 A1
20080168489 Schraga Jul 2008 A1
20080189177 Anderton et al. Aug 2008 A1
20080207176 Brackbill et al. Aug 2008 A1
20080208692 Garaventi et al. Aug 2008 A1
20080214210 Rasanen et al. Sep 2008 A1
20080222545 Lemay Sep 2008 A1
20080255976 Altberg et al. Oct 2008 A1
20080256446 Yamamoto Oct 2008 A1
20080256577 Funaki et al. Oct 2008 A1
20080266421 Takahata et al. Oct 2008 A1
20080270938 Carlson Oct 2008 A1
20080288338 Wiseman et al. Nov 2008 A1
20080306826 Kramer et al. Dec 2008 A1
20080313329 Wang et al. Dec 2008 A1
20080313346 Kujawa et al. Dec 2008 A1
20080318616 Chipalkatti et al. Dec 2008 A1
20090006191 Arankalle et al. Jan 2009 A1
20090006565 Velusamy et al. Jan 2009 A1
20090015703 Kim et al. Jan 2009 A1
20090016617 Bregman-Amitai et al. Jan 2009 A1
20090024956 Kobayashi Jan 2009 A1
20090030774 Rothschild et al. Jan 2009 A1
20090030999 Gatzke et al. Jan 2009 A1
20090040324 Nonaka Feb 2009 A1
20090042588 Lottin et al. Feb 2009 A1
20090055484 Vuong et al. Feb 2009 A1
20090058822 Chaudhri Mar 2009 A1
20090070688 Gyorfi et al. Mar 2009 A1
20090079846 Chou Mar 2009 A1
20090089678 Sacco et al. Apr 2009 A1
20090089710 Wood et al. Apr 2009 A1
20090093261 Ziskind Apr 2009 A1
20090099925 Mehta et al. Apr 2009 A1
20090106672 Burstrom Apr 2009 A1
20090132341 Klinger May 2009 A1
20090132453 Hangartner et al. May 2009 A1
20090132665 Thomsen et al. May 2009 A1
20090148045 Lee et al. Jun 2009 A1
20090153492 Popp Jun 2009 A1
20090157450 Athsani et al. Jun 2009 A1
20090157752 Gonzalez Jun 2009 A1
20090158170 Narayanan et al. Jun 2009 A1
20090160970 Fredlund et al. Jun 2009 A1
20090163182 Gatti et al. Jun 2009 A1
20090177299 Van De Sluis Jul 2009 A1
20090177976 Bokor et al. Jul 2009 A1
20090192900 Collision Jul 2009 A1
20090199242 Johnson et al. Aug 2009 A1
20090202114 Morin et al. Aug 2009 A1
20090215469 Fisher et al. Aug 2009 A1
20090232354 Camp, Jr. et al. Sep 2009 A1
20090234815 Boerries et al. Sep 2009 A1
20090239552 Churchill et al. Sep 2009 A1
20090249222 Schmidt et al. Oct 2009 A1
20090249244 Robinson et al. Oct 2009 A1
20090265604 Howard et al. Oct 2009 A1
20090265647 Martin et al. Oct 2009 A1
20090288022 Almstrand et al. Nov 2009 A1
20090291672 Treves et al. Nov 2009 A1
20090292608 Polachek Nov 2009 A1
20090300525 Jolliff et al. Dec 2009 A1
20090303984 Clark et al. Dec 2009 A1
20090319172 Almeida et al. Dec 2009 A1
20090319607 Belz et al. Dec 2009 A1
20090327073 Li Dec 2009 A1
20100011422 Mason et al. Jan 2010 A1
20100014443 Cristian et al. Jan 2010 A1
20100023885 Reville et al. Jan 2010 A1
20100062794 Han Mar 2010 A1
20100082427 Burgener et al. Apr 2010 A1
20100082693 Hugg et al. Apr 2010 A1
20100100568 Papin et al. Apr 2010 A1
20100113065 Narayan et al. May 2010 A1
20100115426 Liu et al. May 2010 A1
20100130233 Parker May 2010 A1
20100131880 Lee et al. May 2010 A1
20100131895 Wohlert May 2010 A1
20100153144 Miller et al. Jun 2010 A1
20100159944 Pascal et al. Jun 2010 A1
20100161658 Hamynen et al. Jun 2010 A1
20100161831 Haas et al. Jun 2010 A1
20100162149 Sheleheda et al. Jun 2010 A1
20100183280 Beauregard et al. Jul 2010 A1
20100185552 Deluca et al. Jul 2010 A1
20100185665 Horn et al. Jul 2010 A1
20100191631 Weidmann Jul 2010 A1
20100197318 Petersen et al. Aug 2010 A1
20100197319 Petersen et al. Aug 2010 A1
20100198683 Aarabi Aug 2010 A1
20100198694 Muthukrishnan Aug 2010 A1
20100198826 Petersen et al. Aug 2010 A1
20100198828 Petersen et al. Aug 2010 A1
20100198862 Jennings et al. Aug 2010 A1
20100198870 Petersen et al. Aug 2010 A1
20100198917 Petersen et al. Aug 2010 A1
20100201482 Robertson et al. Aug 2010 A1
20100201536 Robertson et al. Aug 2010 A1
20100203968 Gill et al. Aug 2010 A1
20100214436 Kim et al. Aug 2010 A1
20100223128 Dukellis et al. Sep 2010 A1
20100223343 Bosan et al. Sep 2010 A1
20100227682 Reville et al. Sep 2010 A1
20100250109 Johnston et al. Sep 2010 A1
20100257196 Waters et al. Oct 2010 A1
20100259386 Holley et al. Oct 2010 A1
20100273509 Sweeney et al. Oct 2010 A1
20100281045 Dean Nov 2010 A1
20100306669 Della Pasqua Dec 2010 A1
20110004071 Faiola et al. Jan 2011 A1
20110010205 Richards Jan 2011 A1
20110029512 Folgner et al. Feb 2011 A1
20110040783 Uemichi et al. Feb 2011 A1
20110040804 Peirce et al. Feb 2011 A1
20110050909 Ellenby et al. Mar 2011 A1
20110050915 Wang et al. Mar 2011 A1
20110064388 Brown et al. Mar 2011 A1
20110066743 Hurley et al. Mar 2011 A1
20110083101 Sharon et al. Apr 2011 A1
20110093780 Dunn Apr 2011 A1
20110102630 Rukes May 2011 A1
20110115798 Nayar et al. May 2011 A1
20110119133 Igelman et al. May 2011 A1
20110137881 Cheng et al. Jun 2011 A1
20110145564 Moshir et al. Jun 2011 A1
20110148864 Lee et al. Jun 2011 A1
20110159890 Fortescue et al. Jun 2011 A1
20110164163 Bilbrey et al. Jul 2011 A1
20110166777 Chavakula Jul 2011 A1
20110197194 D'Angelo et al. Aug 2011 A1
20110202598 Evans et al. Aug 2011 A1
20110202968 Nurmi Aug 2011 A1
20110208425 Zheng et al. Aug 2011 A1
20110211534 Schmidt et al. Sep 2011 A1
20110213845 Logan et al. Sep 2011 A1
20110215966 Kim et al. Sep 2011 A1
20110225048 Nair Sep 2011 A1
20110238289 Lehmann Sep 2011 A1
20110238763 Shin et al. Sep 2011 A1
20110239136 Goldman et al. Sep 2011 A1
20110255736 Thompson et al. Oct 2011 A1
20110273575 Lee Nov 2011 A1
20110282799 Huston Nov 2011 A1
20110283188 Farrenkopf Nov 2011 A1
20110314419 Dunn et al. Dec 2011 A1
20110320373 Lee et al. Dec 2011 A1
20120028659 Whitney et al. Feb 2012 A1
20120033718 Kauffman et al. Feb 2012 A1
20120036015 Sheikh Feb 2012 A1
20120036443 Ohmori et al. Feb 2012 A1
20120054797 Skog et al. Mar 2012 A1
20120059722 Rao Mar 2012 A1
20120062805 Candelore Mar 2012 A1
20120084731 Filman et al. Apr 2012 A1
20120084835 Thomas et al. Apr 2012 A1
20120099800 Llano et al. Apr 2012 A1
20120108293 Law et al. May 2012 A1
20120110096 Smarr et al. May 2012 A1
20120113106 Choi et al. May 2012 A1
20120113143 Adhikari et al. May 2012 A1
20120113272 Hata May 2012 A1
20120123830 Svendsen et al. May 2012 A1
20120123871 Svendsen et al. May 2012 A1
20120123875 Svendsen et al. May 2012 A1
20120124126 Alcazar et al. May 2012 A1
20120124176 Curtis et al. May 2012 A1
20120124458 Cruzada May 2012 A1
20120130717 Xu et al. May 2012 A1
20120131507 Sparandara et al. May 2012 A1
20120131512 Takeuchi et al. May 2012 A1
20120143760 Abulafia et al. Jun 2012 A1
20120150978 Monaco Jun 2012 A1
20120158289 Bernheim Brush Jun 2012 A1
20120165100 Lalancette et al. Jun 2012 A1
20120166971 Sachson et al. Jun 2012 A1
20120169855 Oh Jul 2012 A1
20120172062 Altman et al. Jul 2012 A1
20120173991 Roberts et al. Jul 2012 A1
20120176401 Hayward et al. Jul 2012 A1
20120184248 Speede Jul 2012 A1
20120197724 Kendall Aug 2012 A1
20120200743 Blanchflower et al. Aug 2012 A1
20120209924 Evans et al. Aug 2012 A1
20120210244 De Francisco Lopez et al. Aug 2012 A1
20120212632 Mate et al. Aug 2012 A1
20120220264 Kawabata Aug 2012 A1
20120226748 Bosworth et al. Sep 2012 A1
20120233000 Fisher et al. Sep 2012 A1
20120236162 Imamura Sep 2012 A1
20120239584 Yariv Sep 2012 A1
20120239761 Linner et al. Sep 2012 A1
20120250951 Chen Oct 2012 A1
20120252418 Kandekar et al. Oct 2012 A1
20120254325 Majeti et al. Oct 2012 A1
20120278387 Garcia et al. Nov 2012 A1
20120278692 Shi Nov 2012 A1
20120290637 Perantatos et al. Nov 2012 A1
20120299954 Wada et al. Nov 2012 A1
20120304052 Tanaka et al. Nov 2012 A1
20120304080 Wormald et al. Nov 2012 A1
20120307096 Ford et al. Dec 2012 A1
20120307112 Kunishige et al. Dec 2012 A1
20120319904 Lee et al. Dec 2012 A1
20120323933 He et al. Dec 2012 A1
20120324018 Metcalf et al. Dec 2012 A1
20130006759 Srivastava et al. Jan 2013 A1
20130024757 Doll et al. Jan 2013 A1
20130036364 Johnson Feb 2013 A1
20130045753 Obermeyer et al. Feb 2013 A1
20130050260 Reitan Feb 2013 A1
20130055083 Fino Feb 2013 A1
20130057587 Leonard et al. Mar 2013 A1
20130059607 Herz et al. Mar 2013 A1
20130060690 Oskolkov et al. Mar 2013 A1
20130063369 Malhotra et al. Mar 2013 A1
20130067027 Song et al. Mar 2013 A1
20130071093 Hanks et al. Mar 2013 A1
20130080254 Thramann Mar 2013 A1
20130085790 Palmer et al. Apr 2013 A1
20130086072 Peng et al. Apr 2013 A1
20130090171 Holton et al. Apr 2013 A1
20130095857 Garcia et al. Apr 2013 A1
20130103760 Golding et al. Apr 2013 A1
20130104053 Thornton et al. Apr 2013 A1
20130110885 Brundrett, III May 2013 A1
20130111514 Slavin et al. May 2013 A1
20130128059 Kristensson May 2013 A1
20130129252 Lauper May 2013 A1
20130132477 Bosworth et al. May 2013 A1
20130145286 Feng et al. Jun 2013 A1
20130159110 Rajaram et al. Jun 2013 A1
20130159919 Leydon Jun 2013 A1
20130169822 Zhu et al. Jul 2013 A1
20130173729 Starenky et al. Jul 2013 A1
20130182133 Tanabe Jul 2013 A1
20130185131 Sinha et al. Jul 2013 A1
20130191198 Carlson et al. Jul 2013 A1
20130194301 Robbins et al. Aug 2013 A1
20130198176 Kim Aug 2013 A1
20130201187 Tong et al. Aug 2013 A1
20130218965 Abrol et al. Aug 2013 A1
20130218968 Mcevilly et al. Aug 2013 A1
20130222323 Mckenzie Aug 2013 A1
20130227476 Frey Aug 2013 A1
20130232194 Knapp et al. Sep 2013 A1
20130249948 Reitan Sep 2013 A1
20130257877 Davis Oct 2013 A1
20130263031 Oshiro et al. Oct 2013 A1
20130265450 Barnes, Jr. Oct 2013 A1
20130267253 Case et al. Oct 2013 A1
20130275505 Gauglitz et al. Oct 2013 A1
20130290443 Collins et al. Oct 2013 A1
20130304646 De Geer Nov 2013 A1
20130311255 Cummins et al. Nov 2013 A1
20130325964 Berberat Dec 2013 A1
20130344896 Kirmse et al. Dec 2013 A1
20130345961 Leader Dec 2013 A1
20130346869 Asver et al. Dec 2013 A1
20130346877 Borovoy et al. Dec 2013 A1
20140006129 Heath Jan 2014 A1
20140011538 Mulcahy et al. Jan 2014 A1
20140019264 Wachman et al. Jan 2014 A1
20140024354 Haik et al. Jan 2014 A1
20140032682 Prado et al. Jan 2014 A1
20140043204 Basnayake et al. Feb 2014 A1
20140043329 Wang et al. Feb 2014 A1
20140045530 Gordon et al. Feb 2014 A1
20140047016 Rao Feb 2014 A1
20140047045 Baldwin et al. Feb 2014 A1
20140047335 Lewis et al. Feb 2014 A1
20140049652 Moon et al. Feb 2014 A1
20140052485 Shidfar Feb 2014 A1
20140052633 Gandhi Feb 2014 A1
20140055554 Du et al. Feb 2014 A1
20140057660 Wager Feb 2014 A1
20140082651 Sharifi Mar 2014 A1
20140092130 Anderson et al. Apr 2014 A1
20140096029 Schultz Apr 2014 A1
20140114565 Aziz et al. Apr 2014 A1
20140122658 Haeger et al. May 2014 A1
20140122787 Shalvi et al. May 2014 A1
20140125678 Wang et al. May 2014 A1
20140129343 Finster et al. May 2014 A1
20140129953 Spiegel May 2014 A1
20140143143 Fasoli et al. May 2014 A1
20140149519 Redfern et al. May 2014 A1
20140155102 Cooper et al. Jun 2014 A1
20140173424 Hogeg et al. Jun 2014 A1
20140173457 Wang et al. Jun 2014 A1
20140189592 Benchenaa et al. Jul 2014 A1
20140207679 Cho Jul 2014 A1
20140214471 Schreiner, III Jul 2014 A1
20140222564 Kranendonk et al. Aug 2014 A1
20140258405 Perkin Sep 2014 A1
20140265359 Cheng et al. Sep 2014 A1
20140266703 Dalley, Jr. et al. Sep 2014 A1
20140279061 Elimeliah et al. Sep 2014 A1
20140279436 Dorsey et al. Sep 2014 A1
20140279540 Jackson Sep 2014 A1
20140280537 Pridmore et al. Sep 2014 A1
20140282096 Rubinstein et al. Sep 2014 A1
20140287779 O'Keefe et al. Sep 2014 A1
20140289833 Briceno Sep 2014 A1
20140306986 Gottesman et al. Oct 2014 A1
20140317302 Naik Oct 2014 A1
20140324627 Haver et al. Oct 2014 A1
20140324629 Jacobs Oct 2014 A1
20140325383 Brown et al. Oct 2014 A1
20150020086 Chen et al. Jan 2015 A1
20150046278 Pei et al. Feb 2015 A1
20150071619 Brough Mar 2015 A1
20150087263 Branscomb et al. Mar 2015 A1
20150088622 Ganschow et al. Mar 2015 A1
20150095020 Leydon Apr 2015 A1
20150096042 Mizrachi Apr 2015 A1
20150116529 Wu et al. Apr 2015 A1
20150169827 Laborde Jun 2015 A1
20150172534 Miyakawa et al. Jun 2015 A1
20150178260 Brunson Jun 2015 A1
20150185030 Monroe et al. Jul 2015 A1
20150206349 Rosenthal et al. Jul 2015 A1
20150222814 Li et al. Aug 2015 A1
20150261917 Smith Sep 2015 A1
20150312184 Langholz et al. Oct 2015 A1
20150350136 Flynn, III et al. Dec 2015 A1
20150365795 Allen et al. Dec 2015 A1
20150378502 Hu et al. Dec 2015 A1
20160006927 Sehn Jan 2016 A1
20160014063 Hogeg et al. Jan 2016 A1
20160018969 Sundarraman Jan 2016 A1
20160085773 Chang et al. Mar 2016 A1
20160085863 Allen et al. Mar 2016 A1
20160099901 Allen et al. Apr 2016 A1
20160134840 Mcculloch May 2016 A1
20160180887 Sehn Jun 2016 A1
20160182422 Sehn et al. Jun 2016 A1
20160182875 Sehn Jun 2016 A1
20160234149 Tsuda et al. Aug 2016 A1
20160239248 Sehn Aug 2016 A1
20160277419 Allen et al. Sep 2016 A1
20160321708 Sehn Nov 2016 A1
20170006094 Abou Mahmoud et al. Jan 2017 A1
20170061308 Chen et al. Mar 2017 A1
20170080346 Abbas Mar 2017 A1
20170087473 Siegel et al. Mar 2017 A1
20170113140 Blackstock et al. Apr 2017 A1
20170118145 Aittoniemi et al. Apr 2017 A1
20170199855 Fishbeck Jul 2017 A1
20170235848 Van Dusen et al. Aug 2017 A1
20170287006 Azmoodeh et al. Oct 2017 A1
20170310934 Du et al. Oct 2017 A1
20170312634 Ledoux et al. Nov 2017 A1
20180047200 O'hara et al. Feb 2018 A1
20180113587 Allen et al. Apr 2018 A1
20180115503 Baldwin et al. Apr 2018 A1
20180315076 Andreou Nov 2018 A1
20180315133 Brody et al. Nov 2018 A1
20180315134 Amitay et al. Nov 2018 A1
20190001223 Blackstock et al. Jan 2019 A1
20190057616 Cohen et al. Feb 2019 A1
20190120629 Gum Apr 2019 A1
20190188920 Mcphee et al. Jun 2019 A1
20200314586 Bouba et al. Oct 2020 A1
20200382912 Dancie et al. Dec 2020 A1
20200401225 Jaureguiberry et al. Dec 2020 A1
20210011612 Dancie et al. Jan 2021 A1
20210152979 Berardino et al. May 2021 A1
20210266704 Dancie et al. Aug 2021 A1
20210377693 Bouba et al. Dec 2021 A1
20210409904 Baylin et al. Dec 2021 A1
20220174455 Guillaume Jun 2022 A1
20220269345 Jaureguiberry et al. Aug 2022 A1
Foreign Referenced Citations (52)
Number Date Country
2887596 Jul 2015 CA
109863532 Jun 2019 CN
110168478 Aug 2019 CN
2051480 Apr 2009 EP
2151797 Feb 2010 EP
2184092 May 2010 EP
2399928 Sep 2004 GB
2001230801 Aug 2001 JP
5497931 Mar 2014 JP
19990073076 Oct 1999 KR
20010078417 Aug 2001 KR
101445263 Sep 2014 KR
WO-1996024213 Aug 1996 WO
WO-1999063453 Dec 1999 WO
WO-2000058882 Oct 2000 WO
WO-2001029642 Apr 2001 WO
WO-2001050703 Jul 2001 WO
WO-2003094072 Nov 2003 WO
WO-2004095308 Nov 2004 WO
WO-2006107182 Oct 2006 WO
WO-2006118755 Nov 2006 WO
WO-2007092668 Aug 2007 WO
WO-2007134402 Nov 2007 WO
WO-2009043020 Apr 2009 WO
WO-2011040821 Apr 2011 WO
WO-2011119407 Sep 2011 WO
WO-2012139276 Oct 2012 WO
WO-2013008238 Jan 2013 WO
WO-2013027893 Feb 2013 WO
WO-2013045753 Apr 2013 WO
WO-2013152454 Oct 2013 WO
WO-2013166588 Nov 2013 WO
WO-2014006129 Jan 2014 WO
WO-2014031899 Feb 2014 WO
WO-2014068573 May 2014 WO
WO-2014115136 Jul 2014 WO
WO-2014194262 Dec 2014 WO
WO-2014194439 Dec 2014 WO
WO-2015192026 Dec 2015 WO
WO-2016044424 Mar 2016 WO
WO-2016054562 Apr 2016 WO
WO-2016065131 Apr 2016 WO
WO-2016090605 Jun 2016 WO
WO-2016100318 Jun 2016 WO
WO-2016100318 Jun 2016 WO
WO-2016100342 Jun 2016 WO
WO-2016149594 Sep 2016 WO
WO-2016179166 Nov 2016 WO
WO-2018081013 May 2018 WO
WO-2018102562 Jun 2018 WO
WO-2018129531 Jul 2018 WO
WO-2019089613 May 2019 WO
Non-Patent Literature Citations (37)
Entry
U.S. Appl. No. 16/453,690 U.S. Appl. No. 11,032,670, filed Jun. 26, 2019 Destination Sharing in Location Sharing System.
U.S. Appl. No. 17/339,394, filed Jun. 4, 2021 Destination Sharing in Location Sharing System.
“A Whole New Story”, Snap, Inc., [Online] Retrieved from the Internet: <URL: https://www.snap.com/en-US/news/>, (2017), 13 pgs.
“Adding photos to your listing”, eBay, [Online] Retrieved from the Internet: <URL: http://pages.ebay.com/help/sell/pictures.html>, (accessed May 24, 2017), 4 pgs.
“U.S. Appl. No. 16/453,690, Examiner Interview Summary mailed Nov. 5, 2020”, 3 pgs.
“U.S. Appl. No. 16/453,690, Final Office Action mailed Apr. 16, 2020”, 19 pgs.
“U.S. Appl. No. 16/453,690, Non Final Office Action mailed Aug. 21, 2020”, 15 pgs.
“U.S. Appl. No. 16/453,690, Non Final Office Action mailed Nov. 18, 2019”, 15 pgs.
“U.S. Appl. No. 16/453,690, Notice of Allowance mailed Feb. 5, 2021”, 8 pgs.
“U.S. Appl. No. 16/453,690, Response filed Jan. 21, 2020 to Non Final Office Action mailed Nov. 18, 2019”.
“U.S. Appl. No. 16/453,690, Response filed Jul. 16, 2020 to Final Office Action mailed Apr. 16, 2020”, 11 pgs.
“U.S. Appl. No. 16/453,690, Response filed Nov. 2, 2020 to Non Final Office Action mailed Aug. 21, 2020”, 11 pgs.
“U.S. Appl. No. 17/339,394, Final Office Action mailed Jan. 17, 2023”, 18 pgs.
“U.S. Appl. No. 17/339,394, Non Final Office Action mailed May 8, 2023”, 15 pgs.
“U.S. Appl. No. 17/339,394, Non Final Office Action mailed Jul. 22, 2022”, 10 pgs.
“U.S. Appl. No. 17/339,394, Notice of Allowance mailed Aug. 18, 2023”, 8 pgs.
“U.S. Appl. No. 17/339,394, Response filed Apr. 17, 2023 to Final Office Action mailed Jan. 17, 2023”, 11 pgs.
“U.S. Appl. No. 17/339,394, Response filed Aug. 8, 2023 to Non Final Office Action mailed May 8, 2023”, 9 pgs.
“U.S. Appl. No. 17/339,394, Response filed Oct. 24, 2022 to Non Final Office Action mailed Jul. 22, 2022”, 9 pgs.
“BlogStomp”, StompSoftware, [Online] Retrieved from the Internet: <URL: http://stompsoftware.com/blogstomp>, (accessed May 24, 2017), 12 pgs.
“Cup Magic Starbucks Holiday Red Cups come to life with AR app”, Blast Radius, [Online] Retrieved from the Internet: <URL: https://web.archive.org/web/20160711202454/http://www.blastradius.com/work/cup-magic>, (2016), 7 pgs.
“Daily App: InstaPlace (iOS/Android): Give Pictures a Sense of Place”, TechPP, [Online] Retrieved from the Internet: <URL: http://techpp.com/2013/02/15/instaplace-app-review>, (2013), 13 pgs.
“InstaPlace Photo App Tell The Whole Story”, [Online] Retrieved from the Internet: <URL: youtu.be/uF_gFkg1hBM>, (Nov. 8, 2013), 113 pgs. , 1:02 min.
“International Application Serial No. PCT/US2015/037251, International Search Report mailed Sep. 29, 2015”, 2 pgs.
“Introducing Snapchat Stories”, [Online] Retrieved from the Internet: <URL: https://web.archive.org/web/20131026084921/https://www.youtube.com/watch?v=88Cu3yN-LIM>, (Oct. 3, 2013), 92 pgs.; 00:47 min.
“Macy's Believe-o-Magic”, [Online] Retrieved from the Internet: <URL: https://web.archive.org/web/20190422101854/https://www.youtube.com/watch?v=xvzRXy3J0Z0&feature=youtu.be>, (Nov. 7, 2011), 102 pgs.; 00:51 min.
“Macy's Introduces Augmented Reality Experience in Stores across Country as Part of Its 2011 Believe Campaign”, Business Wire, [Online] Retrieved from the Internet: <URL: https://www.businesswire.com/news/home/20111102006759/en/Macys-Introduces-Augmented-Reality-Experience-Stores-Country>, (Nov. 2, 2011), 6 pgs.
“Starbucks Cup Magic”, [Online] Retrieved from the Internet: <URL: https://www.youtube.com/watch?v=RWwQXi9RGOw>, (Nov. 8, 2011), 87 pgs.; 00:47 min.
“Starbucks Cup Magic for Valentine's Day”, [Online] Retrieved from the Internet: <URL: https://www.youtube.com/watch?v=8nvqOzjq10w>, (Feb. 6, 2012), 88 pgs.; 00:45 min.
“Starbucks Holiday Red Cups Come to Life, Signaling the Return of the Merriest Season”, Business Wire, [Online] Retrieved from the Internet: <URL: http://www.businesswire.com/news/home/20111115005744/en/2479513/Starbucks-Holiday-Red-Cups-Life-Signaling-Return>, (Nov. 15, 2011), 5 pgs.
Carthy, Roi, “Dear All Photo Apps: Mobli Just Won Filters”, TechCrunch, [Online] Retrieved from the Internet: <URL: https://techcrunch.com/2011/09/08/mobli-filters>, (Sep. 8, 2011), 10 pgs.
Janthong, Isaranu, “Instaplace ready on Android Google Play store”, Android App Review Thailand, [Online] Retrieved from the Internet: <URL: http://www.android-free-app-review.com/2013/01/instaplace-android-google-play-store.html>, (Jan. 23, 2013), 9 pgs.
Macleod, Duncan, “Macys Believe-o-Magic App”, [Online] Retrieved from the Internet: <URL: http://theinspirationroom.com/daily/2011/macys-believe-o-magic-app>, (Nov. 14, 2011), 10 pgs.
Macleod, Duncan, “Starbucks Cup Magic Lets Merry”, [Online] Retrieved from the Internet: <URL: http://theinspirationroom.com/daily/2011/starbucks-cup-magic>, (Nov. 12, 2011), 8 pgs.
Notopoulos, Katie, “A Guide To The New Snapchat Filters And Big Fonts”, [Online] Retrieved from the Internet: <URL: https://www.buzzfeed.com/katienotopoulos/a-guide-to-the-new-snapchat-filters-and-big-fonts?utm_term =.bkQ9qVZWe#.nv58YXpkV>, (Dec. 22, 2013), 13 pgs.
Panzarino, Matthew, “Snapchat Adds Filters, A Replay Function And For Whatever Reason, Time, Temperature And Speed Overlays”, TechCrunch, [Online] Retrieved form the Internet: <URL: https://techcrunch.com/2013/12/20/snapchat-adds-filters-new-font-and-for-some-reason-time-temperature-and-speed-overlays/>, (Dec. 20, 2013), 12 pgs.
Tripathi, Rohit, “Watermark Images in PHP And Save File on Server”, [Online] Retrieved from the Internet: <URL: http://code.rohitink.com/2012/12/28/watermark-images-in-php-and-save-file-on-server>, (Dec. 28, 2012), 4 pgs.
Related Publications (1)
Number Date Country
20240089703 A1 Mar 2024 US
Provisional Applications (1)
Number Date Country
62792251 Jan 2019 US
Continuations (2)
Number Date Country
Parent 17339394 Jun 2021 US
Child 18516785 US
Parent 16453690 Jun 2019 US
Child 17339394 US