Detection of a physical collision between two client devices in a location sharing system

Information

  • Patent Grant
  • 11917495
  • Patent Number
    11,917,495
  • Date Filed
    Tuesday, February 7, 2023
    a year ago
  • Date Issued
    Tuesday, February 27, 2024
    2 months ago
Abstract
The invention provides methods, systems, and devices for detecting a physical collision between two client devices based on sensor data. A server computer receives a first collision signature from a first client device, and a second collision signature from a second client device. Based on determining that a correlation of the first collision signature and the second collision signature does not achieve a detection threshold, the server computer lowers, for a limited period of time, the detection threshold. If the server computer receives, within the limited period of time, a third collision signature from the first client device, and a fourth collision signature from the second client device, and determines that a correlation of the third collision signature and the fourth collision signature achieves the lowered detection threshold, the server computer detects a collision between the first and second client devices.
Description
BACKGROUND

The popularity of electronic messaging, particularly instant messaging, continues to grow. Users increasingly share media content items such as electronic images and videos with each other, reflecting a global demand to communicate more visually. Similarly, users increasingly seek to customize the media content items they share with others, providing challenges to social networking systems seeking to generate custom media content for their members. 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 illustrates a messaging system in accordance with some example embodiments.



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



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



FIG. 5 is a flowchart for an access-limiting process, in accordance with some example embodiments.



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



FIG. 7 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. 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 method in accordance with one embodiment.



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



FIG. 13 illustrates a user interface in accordance with one embodiment.





DETAILED DESCRIPTION

Embodiments of the present disclosure provide a method for detecting a physical collision between two client devices based on sensor data. When two users tap or knock their phones together, each phone detects a collision, and sends, to the application server, a collision signature including a variety of sensor data which includes a timestamp, a location of the phone, and acceleration data acquired by an accelerometer embedded in the phone. The server computer correlates all the collision signatures received to identify two collision signatures that correspond to a same physical collision. Based on identifying two collision signatures corresponding to a same physical collision, the server computer determines that the two phones have been taped or knocked together. Because of the limited accuracy of the location and accelerometer data acquired by the phones, false positives (improper detection of a collision in the absence of a collision), and false negatives (missed detection of a collision) are frequent.


Motivated by these challenges, some embodiments of the present disclosure provide improvements in the operation of a collision detection system by reducing errors and therefore improving the collision detection system by more accurately detecting a collision between two client devices. In some embodiments, some of these improvements are achieved by setting a low detection threshold, and temporarily increasing the detection threshold of two client devices in response to receiving a collision signature from each of the two client devices and determining that the two collision signatures do not quite achieve the detection threshold.


In an example scenario, two users tap their phones together a first time. Each of the two phones generates and sends a collision signature to the server. The server correlates the two collision signatures and determines that the correlation of the two collision signatures does not achieve the detection threshold. In response to determining that the correlation of the two collision signatures does not achieve the detection threshold, the server lowers the detection threshold for a limited time. Upon noticing that the collision has not been detected, the two users tap their phones together a second time. Each of the two phones generates and sends another collision signature to the server. This time, because the detection threshold is temporarily lowered, the correlation of the two collision signatures is more likely to achieve the detection threshold. As such, even if the server does not detect the first collision, the server is more likely to detect the second collision, thereby reducing the global false negative rate. Meanwhile, because the probability of detecting two false positives in a short amount of time is low, the global false positive rate is not significantly increased.


For example, in some embodiments, a server computer receiving a first collision signature from a first client device, and a second collision signature from a second client device. Based on determining that a correlation of the first collision signature and the second collision signature does not achieve a detection threshold, the server computer lowers, for a limited period of time, the detection threshold. Within the limited period of time, the server computer receives a third collision signature from the first client device, and a fourth collision signature from the second client device. In response to determining that a correlation of the third collision signature and the fourth collision signature achieves the lowered detection threshold, the server computer detects a collision between the first and second client devices.


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). In particular, in some cases, the client device 102 accesses the network 106 via a cellular base station 128, which is a relay located at the center of a cell of a cellular network.


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 he 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., methods 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 server application 116, a social network system 122, and a collision detection system 124.


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 server application 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 304 (as shown in FIG. 3) 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.


The collision detection system 124 supports a collision detection functionality and makes this function available to the location sharing server application 114. The collision detection system 124 receives collision signatures from client devices and correlates the collision signatures received to identify pairs of collision signatures corresponding to a same physical collision.



FIG. 2. is block diagram illustrating further details regarding the messaging system 200, according to example embodiments. Specifically, the messaging system 200 includes the messaging server application 116 and the messaging client application 126, which in turn embody a number of subsystems, namely an ephemeral timer system 202, a collection management system 204, and an annotation system 206.


The ephemeral timer system 202 is responsible for enforcing the temporary access to content permitted by the messaging client application 126 and the location sharing server application 114. To this end, the ephemeral timer system 202 incorporates a number of timers that, based on duration and display parameters associated with a message, or collection of messages (e.g., a story), selectively display and enable access to messages and associated content via the messaging client application 126. Further details regarding the operation of the ephemeral timer system 202 are provided below.


The collection management system 204 is responsible for managing collections of media (e.g., collections of text, image video and audio data). In some examples, a collection of content (e.g., messages, including images, video, text and audio) may be organized into an “event gallery” or an “event story.” Such a collection may be made available for a specified time period, such as the duration of an event to which the content relates. For example, content relating to a music concert may be made available as a “story” for the duration of that music concert. The collection management system 204 may also be responsible for publishing an icon that provides notification of the existence of a particular collection to the user interface of the messaging client application 126.


The collection management system 204 furthermore includes a curation interface 208 that allows a collection manager to manage and curate a particular collection of content. For example, the curation interface 208 enables an event organizer to curate a collection of content relating to a specific event (e.g., delete inappropriate content or redundant messages). Additionally, the collection management system 204 employs machine vision (or image recognition technology) and content rules to automatically curate a content collection. In certain embodiments, compensation may be paid to a user for inclusion of user-generated content into a collection. In such cases, the curation interface 208 operates to automatically make payments to such users for the use of their content.


The annotation system 206 provides various functions that enable a user to annotate or otherwise modify or edit media content associated with a message. For example, the annotation system 206 provides functions related to the generation and publishing of media overlays for messages processed by the location sharing system 100. The annotation system 206 operatively supplies a media overlay or supplementation (e.g., an image filter) to the messaging client application 126 based on a geolocation of the client device 102. In another example, the annotation system 206 operatively supplies a media overlay to the messaging client application 126 based on other information, such as social network information of the user of the client device 102. A media overlay may include audio and visual content and visual effects. Examples of audio and visual content include pictures, texts, logos, animations, and sound effects. An example of a visual effect includes color overlaying. The audio and visual content or the visual effects can be applied to a media content item (e.g., a photo) at the client device 102. For example, the media overlay may include text that can be overlaid on top of a photograph taken by the client device 102. In another example, the media overlay includes an identification of a location overlay (e.g., Venice beach), a name of a live event, or a name of a merchant overlay (e.g., Beach Coffee House). In another example, the annotation system 206 uses the geolocation of the client device 102 to identify a media overlay that includes the name of a merchant at the geolocation of the client device 102. The media overlay may include other indicia associated with the merchant. The media overlays may be stored in the database 120 and accessed through the database server 118.


In one example embodiment, the annotation system 206 provides a user-based publication platform that enables users to select a geolocation on a map and upload content associated with the selected geolocation. The user may also specify circumstances under which a particular media overlay should be offered to other users. The annotation system 206 generates a media overlay that includes the uploaded content and associates the uploaded content with the selected geolocation.


In another example embodiment, the annotation system 206 provides a merchant-based publication platform that enables merchants to select a particular media overlay associated with a geolocation via a bidding process. For example, the annotation system 206 associates the media overlay of a highest bidding merchant with a corresponding geolocation for a predefined amount of time.



FIG. 3 is a schematic diagram illustrating data structures 300 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 310. An entity table 302 stores entity data, including an entity graph 304. Entities for which records are maintained within the entity table 302 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 304 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 306 stores location data of users (e.g., geolocation information determined by a GPS unit of the client device (e.g., client device 102)). A threshold table 308 may store threshold values for the client devices. Various thresholds (e.g., detection threshold, time threshold, distance threshold) are used to detect collisions between client devices, and the values of the different threshold may be temporally changes for a specific pair of client devices in certain circumstances.


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


The processor 402 is shown to be coupled to a power source 404, and to include (either permanently configured or temporarily instantiated) modules, namely a correlation component 406, a threshold adjustment component 408 and a detection component 410. The correlation component 406 correlates collision signatures to identify pairs of collision signatures corresponding to a same physical collision. The threshold adjustment component 408 adjusts various threshold for detecting a collision. The detection component 410 detects a collision between two client devices based on determining that the correlation of the collision signatures received from the two client devices achieves a detection threshold.



FIG. 5 is a schematic diagram illustrating an access-limiting process 500, in terms of which access to content (e.g., an ephemeral message 502, and associated multimedia payload of data) or a content collection (e.g., an ephemeral message group 506) may be time-limited (e.g., made ephemeral).


An ephemeral message 502 is shown to be associated with a message duration parameter 508, the value of which determines an amount of time that the ephemeral message 502 will be displayed to a receiving user of the ephemeral message 502 by the location sharing client application 104. In one embodiment, an ephemeral message 502 is viewable by a receiving user for up to a maximum of 10 seconds, depending on the amount of time that the sending user specifies using the message duration parameter 508.


The message duration parameter 508 and the message receiver identifier 518 are shown to be inputs to a message timer 514, which is responsible for determining the amount of time that the ephemeral message 502 is shown to a particular receiving user identified by the message receiver identifier 518. In particular, the ephemeral message 502 will only be shown to the relevant receiving user for a time period determined by the value of the message duration parameter 508. The message timer 514 is shown to provide output to a more generalized ephemeral timer system 504, which is responsible for the overall timing of display of content (e.g., an ephemeral message 502) to a receiving user.


The ephemeral message 502 is shown in FIG. 5 to be included within an ephemeral message group 506 (e.g., a collection of messages in a personal story, or an event story). The ephemeral message group 506 has an associated group duration parameter 510, a value of which determines a time-duration for which the ephemeral message group 506 is presented and accessible to users of the location sharing system 100. The group duration parameter 510, for example, may be the duration of a music concert, where the ephemeral message group 506 is a collection of content pertaining to that concert. Alternatively, a user (either the owning user or a curator user) may specify the value for the group duration parameter 510 when performing the setup and creation of the ephemeral message group 506.


Additionally, each ephemeral message 502 within the ephemeral message group 506 has an associated group participation parameter 512, a value of which determines the duration of time for which the ephemeral message 502 will be accessible within the context of the ephemeral message group 506. Accordingly, a particular ephemeral message group 506 may “expire” and become inaccessible within the context of the ephemeral message group 506, prior to the ephemeral message group 506 itself expiring in terms of the group duration parameter 510. The group duration parameter 510, group participation parameter 512, and message receiver identifier 518 each provide input to a group timer 516, which operationally determines, firstly, whether a particular ephemeral message 502 of the ephemeral message group 506 will be displayed to a particular receiving user and, if so, for how long. Note that the ephemeral message group 506 is also aware of the identity of the particular receiving user as a result of the message receiver identifier 518.


Accordingly, the group timer 516 operationally controls the overall lifespan of an associated ephemeral message group 506, as well as an individual ephemeral message 502 included in the ephemeral message group 506. In one embodiment, each and every ephemeral message 502 within the ephemeral message group 506 remains viewable and accessible for a time-period specified by the group duration parameter 510. In a further embodiment, a certain ephemeral message 502 may expire, within the context of ephemeral message group 506, based on a group participation parameter 512. Note that a message duration parameter 508 may still determine the duration of time for which a particular ephemeral message 502 is displayed to a receiving user, even within the context of the ephemeral message group 506. Accordingly, the message duration parameter 508 determines the duration of time that a particular ephemeral message 502 is displayed to a receiving user, regardless of whether the receiving user is viewing that ephemeral message 502 inside or outside the context of an ephemeral message group 506.


The ephemeral timer system 504 may furthermore operationally remove a particular ephemeral message 502 from the ephemeral message group 506 based on a determination that it has exceeded an associated group participation parameter 512. For example, when a sending user has established a group participation parameter 512 of 24 hours from posting, the ephemeral timer system 504 will remove the relevant ephemeral message 502 from the ephemeral message group 506 after the specified 24 hours. The ephemeral timer system 504 also operates to remove an ephemeral message group 506 either when the group participation parameter 512 for each and every ephemeral message 502 within the ephemeral message group 506 has expired, or when the ephemeral message group 506 itself has expired in terms of the group duration parameter 510.


In certain use cases, a creator of a particular ephemeral message group 506 may specify an indefinite group duration parameter 510. In this case, the expiration of the group participation parameter 512 for the last remaining ephemeral message 502 within the ephemeral message group 506 will determine when the ephemeral message group 506 itself expires. In this case, a new ephemeral message 502, added to the ephemeral message group 506, with a new group participation parameter 512, effectively extends the life of an ephemeral message group 506 to equal the value of the group participation parameter 512.


Responsive to the ephemeral timer system 504 determining that an ephemeral message group 506 has expired (e.g., is no longer accessible), the ephemeral timer system 504 communicates with the location sharing system 100 (and, for example, specifically the location sharing client application 104) to cause an indicium (e.g., an icon) associated with the relevant ephemeral message group 506 to no longer be displayed within a user interface of the location sharing client application 104. Similarly, when the ephemeral timer system 202 determines that the message duration parameter 508 for a particular ephemeral message 502 has expired, the ephemeral timer system 504 causes the location sharing client application 104 to no longer display an indicium (e.g., an icon or textual identification) associated with the ephemeral message 502.



FIG. 6 is a block diagram 600 illustrating a software architecture 604, which can be installed on any one or more of the devices described herein. The software architecture 604 is supported by hardware such as a machine 602 that includes processors 620, memory 626, and I/O components 638. In this example, the software architecture 604 can be conceptualized as a stack of layers, where each layer provides a particular functionality. The software architecture 604 includes layers such as an operating system 612, libraries 610, frameworks 608, and applications 606. Operationally, the applications 606 invoke API calls 650 through the software stack and receive messages 652 in response to the API calls 650.


The operating system 612 manages hardware resources and provides common services. The operating system 612 includes, for example, a kernel 614, services 616, and drivers 622. The kernel 614 acts as an abstraction layer between the hardware and the other software layers. For example, the kernel 614 provides memory management, processor management (e.g., scheduling), component management, networking, and security settings, among other functionality. The services 616 can provide other common services for the other software layers. The drivers 622 are responsible for controlling or interfacing with the underlying hardware. For instance, the drivers 622 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 610 provide a low-level common infrastructure used by the applications 606. The libraries 610 can include system libraries 618 (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 610 can include API libraries 624 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 610 can also include a wide variety of other libraries 628 to provide many other APIs to the applications 606.


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


In an example embodiment, the applications 606 may include a home application 636, a contacts application 630, a browser application 632, a book reader application 634, a location application 642, a media application 644, a messaging application 646, a game application 648, and a broad assortment of other applications such as third-party applications 640. The applications 606 are programs that execute functions defined in the programs. Various programming languages can be employed to create one or more of the applications 606, 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 640 (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 640 can invoke the API calls 650 provided by the operating system 612 to facilitate functionality described herein.



FIG. 7 is a diagrammatic representation of a machine 700 within which instructions 708 (e.g., software, a program, an application, an applet, an app, or other executable code) for causing the machine 700 to perform any one or more of the methodologies discussed herein may be executed. For example, the instructions 708 may cause the machine 700 to execute any one or more of the methods described herein. The instructions 708 transform the general, non-programmed machine 700 into a particular machine 700 programmed to carry out the described and illustrated functions in the manner described. The machine 700 may operate as a standalone device or may be coupled (e.g., networked) to other machines. In a networked deployment, the machine 700 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 700 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 708, sequentially or otherwise, that specify actions to be taken by the machine 700. Further, while only a single machine 700 is illustrated, the term “machine” shall also be taken to include a collection of machines that individually or jointly execute the instructions 708 to perform any one or more of the methodologies discussed herein.


The machine 700 may include processors 702, memory 704, and I/O components 744, which may be configured to communicate with each other via a bus 746. In an example embodiment, the processors 702 (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 706 and a processor 710 that execute the instructions 708. 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. 7 shows multiple processors 702, the machine 700 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 704 includes a main memory 712, a static memory 714, and a storage unit 716, both accessible to the processors 702 via the bus 746. The main memory 704, the static memory 714, and storage unit 716 store the instructions 708 embodying any one or more of the methodologies or functions described herein. The instructions 708 may also reside, completely or partially, within the main memory 712, within the static memory 714, within machine-readable medium 718 within the storage unit 716, within at least one of the processors 702 (e.g., within the processor's cache memory), or any suitable combination thereof, during execution thereof by the machine 700.


The I/O components 744 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 744 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 744 may include many other components that are not shown in FIG. 7. In various example embodiments, the I/O components 744 may include output components 728 and input components 730. The output components 728 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 730 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 embodiments, the I/O components 744 include a pressure component 736 (e.g., a barometer).


In further example embodiments, the I/O components 744 may further include biometric components 732, motion components 734, environmental components 738, or position components 740, among a wide array of other components. For example, the biometric components 732 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 734 include acceleration sensor components (e.g., accelerometer), gravitation sensor components, rotation sensor components (e.g., gyroscope), and so forth. The environmental components 738 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, 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 740 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 744 further include communication components 742 operable to couple the machine 700 to a network 720 or devices 722 via a coupling 724 and a coupling 726, respectively. For example, the communication components 742 may include a network interface component or another suitable device to interface with the network 720. In further examples, the communication components 742 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 722 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 742 may detect identifiers or include components operable to detect identifiers. For example, the communication components 742 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 742, 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 704, main memory 712, static memory 714, and/or memory of the processors 702) and/or storage unit 716 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 708), when executed by processors 702, cause various operations to implement the disclosed embodiments.


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



FIG. 8 is a flowchart illustrating a method 800 for detecting a physical collision between two client devices. The method 800 may be embodied in computer-readable instructions for execution by one or more processors (e.g., processor 402) such that the steps of the method 800 may be performed in part or in whole by functional components (e.g., correlation component 406, threshold adjustment component 408, detection component 410) of a processing environment 400 of a system (e.g., application server 112); 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 400.


Prior to block 802, the server computer might need to receive an authorization from each of the users to perform an action in response to detecting a collision between the user's phone and another user's phone, such as initiating a communication session between the two phones, transferring data from the user's phone to another user's phone, receiving data from another user's phone, and sending an electronic communication to a third user.


In block 802, the server computer (e.g., application server 112) receives, from a first client device, an electronic communication comprising a first collision signature, and, from a second client device, an electronic communication comprising a second collision signature. In some embodiments, each collision signature includes a timestamp, a location, and a sequence of acceleration instant values acquired by an accelerometer of the client device. In some embodiments, as described in more details in relation to FIG. 13, the client device generates a collision signature upon detecting an abrupt change of acceleration corresponding to a light blow or a jolting collision.


In block 804, the server computer correlates the first collision signature and the second collision signature. The correlation may be temporal (as described in relation to FIG. 9), spatial (as described in relation to FIG. 10), spatiotemporal (as described in relation to FIG. 11) or based on any other correlation method.


In decision block 806, the server computer determines whether the correlation of the first and second collision signatures achieves the detection threshold. In some embodiments, the correlation of the first and second collision signatures achieves the detection threshold when a distance between the location of the first collision signature and the location of the second collision signature is below a distance threshold, and a timespan between the timestamp of the first collision signature and the timestamp of the second collision signature is below a time threshold.


If the correlation of the first and second collision signatures achieves the detection threshold, the method goes to block 818, and the server computer detects a collision between the first and second client devices.


If the correlation of the first and second collision signatures does not achieve the detection threshold, the method goes to block 808, and the server computer lowers, for a limited period of time (e.g., 5 seconds), the detection threshold associated with the pair of client devices including the first and second client devices. The detection threshold is initially set at a first value. Upon receiving the first and second collision signatures and determining that the correlation of the first and second collision signatures does not achieve the first value of the detection threshold, the detection threshold is lowered to a second value for the limited period of time. The server computer stores the second value of the lowered detection threshold in the threshold table 308 together with identifiers of the first and second client devices and with a period of time during with the detection threshold will be lowered for the specific pair of client devices. In some embodiments, the detection threshold is only lowered upon determining that the correlation of the first and second collision signatures although not achieving the detection threshold, still achieves a lower threshold not sufficient to establish with sufficient certainty that the first and second signatures correspond to the same physical collision but sufficient to determine that the first and second signatures are likely to correspond to the same physical collision. In some embodiments, lowering the detection threshold comprises increasing the distance threshold and/or increasing the time threshold.


In block 810, the server computer receives, within the limited period of time, a third collision signature from the first client device, and a fourth collision signature from the second client device.


In block 812, the server computer correlates the third collision signature and the fourth collision signature. The correlation may be temporal (as described in relation to FIG. 9), spatial (as described in relation to FIG. 10), spatiotemporal (as described in relation to FIG. 11, or based on any other correlation method.


In decision block 814, the server computer determines whether the correlation of the third and fourth collision signatures achieves the lowered detection threshold associated with the pair of client devices (which is temporarily set at the lower second value).


If the correlation of the third and fourth collision signatures achieves the detection threshold associated with the pair of client devices (which is temporarily set at a lower second value), the method goes to block 818, and the server computer detects a collision between the first and second client devices. Detecting a collision between the first and second client devices may include generating an identifier indicating that a collision between the first and second client devices occurred and/or storing a record of a collision between the first and second client devices.


If the correlation of the third and fourth collision signatures does not achieve the detection threshold associated with the pair of client devices (which is temporarily set at a lower second value), the method goes to closing loop block 816, and the server computer determines that the third and fourth signatures do not correspond to a collision between the first and second client devices. The third and fourth collision signatures may still be independently matched with other signatures.


In some embodiments, the server computer spatially correlates the collision signatures to identify two collision signatures corresponding to the same physical collision. Each collision signature includes a timestamp corresponding to the acquisition time of the acceleration data by the client device. Correlating two collision signatures includes computing a timespan between the timestamps of the two collision signatures.


As shown in FIG. 9, the method 800 may further include a decision block 902, a block 904, and decision block 906 according to some embodiments. Consistent with some embodiments, decision block 902 may be performed as part (e.g., as sub-blocks or as a sub-method) of decision block 806, where the system determines whether the correlation of the first and second collision signature achieve the detection threshold. Consistent with some embodiments, block 904 may be performed as part (e.g., as sub-blocks or as a sub-method) of block 808, where the system lowers the detection threshold for a limited period of time. Consistent with some embodiments, decision block 906 may be performed as part (e.g., as sub-blocks or as a sub-method) of decision block 814, where the system determines whether the correlation of the third and fourth collision signature achieve the lowered detection threshold.


In decision block 902, the server computer computes a timespan between the timestamp of the first collision signature and the timestamp of the second collision signature and determines whether the timespan between the timestamp of the first collision signature and the timestamp of the second collision signature is below a time threshold. If the timespan between the timestamp of the first collision signature and the timestamp of the second collision signature is below the time threshold, the server computer goes to block 818 and detects a collision between the first and second client devices. If the timespan between the timestamp of the first collision signature and the timestamp of the second collision signature is above the time threshold, the method goes to block 904 and increases the time threshold associated with the pair of client devices for a limited period of time (e.g., 5 seconds).


In decision block 906, the server computer determines whether a timespan between the timestamp of the third collision signature and the timestamp of the fourth collision signature is below the time threshold associated with the pair of client devices (which is temporarily set at the higher value). If the timespan between the timestamp of the third collision signature and the timestamp of the fourth collision signature is below the time threshold associated with the pair of client devices (which is temporarily set at the higher value), the method goes to block 818, and the server computer detects a collision between the first and the second client devices. If the second timespan between the timestamp of the third collision signature and the timestamp of the fourth collision signature is the time threshold associated with the pair of client devices (which is temporarily set at the higher value), the method goes to closing loop block 816, and the server computer determines that the third and fourth collision signatures do not correspond to a collision between the first and second client devices.


In some embodiments, the server computer spatially correlates the collision signatures to identify two collision signatures corresponding to the same physical collision. Each collision signature includes a location corresponding to the location of the client device when the client device acquired the acceleration data. Correlating two collision signatures includes computing a distance between the locations of the two collision signatures. The location of the client device includes a latitude, a longitude and in some embodiments, an altitude.


As shown in FIG. 10, the method 800 may further include a decision block 1002, a block 1004, and decision block 1006 according to some embodiments. Consistent with some embodiments, decision block 1002 may be performed as part (e.g., as sub-blocks or as a sub-method) of decision block 806, where the system determines whether the correlation of the first and second collision signature achieve the detection threshold. Consistent with some embodiments, block 1004 may be performed as part (e.g., as sub-blocks or as a sub-method) of block 808, where the system lowers the detection threshold for a limited period of time. Consistent with some embodiments, decision block 1006 may be performed as part (e.g., as sub-blocks or as a sub-method) of decision block 814, where the system determines whether the correlation of the third and fourth collision signature achieve the lowered detection threshold.


In decision block 1002, the server computer computes a distance between the location of the first collision signature and the location of the second collision signature and determines whether the distance between the location of the first collision signature and the location of the second collision signature is below a distance threshold associated with the pair of client devices. In response to determining that the distance between the location of the first collision signature and the location of the second collision signature is below the distance threshold associated with the pair of client devices, the server computer goes to block 816 and detects a collision between the first and second client devices. Upon receiving the first and second collision signatures and determining that the distance between the location of the first collision signature and the location of the second collision signature is above the distance threshold associated with the pair of client devices, the server computer goes to block 1004 and increases the distance threshold associated with the pair of client devices for a limited period of time (e.g., 5 seconds).


In decision block 1006, the server computer determines whether a distance between the location of the third collision signature and the location of the fourth collision signature is below the distance threshold associated with the pair of client devices (which is temporarily set at the higher value). In response to determining that the distance between the location of the third collision signature and the location of the fourth collision signature is below the distance threshold associated with the pair of client devices (which is temporarily set at the higher value), the server computer detects a collision between the first and the second client devices via the server computer. If the distance between the location of the third collision signature and the location of the fourth collision signature is above the distance threshold associated with the pair of client devices (which is temporarily set at the higher value), the method goes to closing loop block 816, and the server computer determines that the third and fourth collision signatures do not correspond to a collision between the first and second client devices.


In some embodiments, the server computer spatio-temporally correlates the collision signatures to identify two collision signatures corresponding to the same physical collision. The server computer can correlate the collision signatures based on distance first and then based on time. However, correlating the collision signatures based on time first and then based on distance is more efficient in terms of computation time. Each collision signature includes a timestamp corresponding to the acquisition time of the acceleration data by the client device and a location corresponding to the location of the client device when the client device acquired the acceleration data. Correlating two collision signatures includes computing a distance between the locations of the two collision signatures and computing a timespan between the timestamps of the two collision signatures.


As shown in FIG. 11, the method 800 may include decision block 902, block 904, decision block 906, and decision block 1002, block 1004, and decision block 1006 according to some embodiments. Consistent with some embodiments, decision block 902 and decision block 1002 may be performed as part (e.g., as sub-blocks or as a sub-method) of decision block 806, where the system determines whether the correlation of the first and second collision signature achieve the detection threshold. Consistent with some embodiments, block 904 and block 1004 may be performed as part (e.g., as sub-blocks or as a sub-method) of block 808, where the system lowers the detection threshold for a limited period of time. Consistent with some embodiments, decision block 906 and decision block 1006 may be performed as part (e.g., as sub-blocks or as a sub-method) of decision block 814, where the system determines whether the correlation of the third and fourth collision signature achieve the lowered detection threshold.


In decision block 902, the server computer computes a timespan between the timestamp of the first collision signature and the timestamp and determines whether the timespan is below a time threshold. If the timespan is below the time threshold, the server computer goes to decision block 1002. If the first timespan is above the time threshold, the method goes to block 904 where the computer server increases the time threshold for a limited period of time (e.g., 5 seconds), and block 1004 where the server computer increases the distance threshold for a limited period of time (e.g., 5 seconds).


In decision block 1002, the server computer computes a distance between the location of the first collision signature and the location of the second collision signature and determines whether the distance between the location of the first collision signature and the location of the second signature is below a distance threshold. If the distance between the location of the first collision signature and the location of the second collision signature is below the distance threshold, the server computer goes to block 818 and detects a collision between the first and second client devices. If the distance between the location of the first collision signature and the location of the second collision signature is above the distance threshold, the method goes to block 904 where the computer server increases the time threshold for a limited period of time (e.g., 5 seconds), and block 1004 where the server computer increases the distance threshold for a limited period of time (e.g., 5 seconds).


In decision block 906, the server computer determines whether a timespan between the timestamp of the third collision signature and the timestamp of the fourth collision signature is below the increased time threshold. In response to determining that the second timespan between the timestamp of the third collision signature and the timestamp of the fourth collision signature is below the increased time threshold, the method goes to decision block 1006, where the server computer determines whether a distance between the location of the third collision signature and the location of the fourth collision signature is below the increased distance threshold. In response to determining that the distance between the location of the third collision signature and the location of the fourth collision signature is below the increased distance threshold, the server computer detects a collision between the first and the second client devices via the server computer.


GPS measurements can be affected by several types of random errors and biases. As a consequence, the location determined by a client device can be grossly inaccurate. To avoid false positives, in some embodiments, prior to correlating the first and second collision signatures, the server computer discards a collision signature if the location associated with the collision signature is not a location at which the user stayed within a maximum range for a minimum amount of time. Indeed, if the collision signature is not a location at which the user stayed within a maximum range for a minimum amount of time, the location associated with the collision is probably grossly inaccurate. In some embodiments, the server computer aggregates location data received from a client device over time into one or more visit points of the user. A visit point may be defined as a location where the user stayed within a maximum range for a minimum amount of time. The server computer determines whether the location included in the collision signature corresponds to a visit point of the user. If the location included in the first collision signature does not correspond to a visit point of the user, the server computer discards the collision signature.


In some embodiments, a Discrete Global Grid (DGG) (e.g., S2 Grid System) is used to pre-filter the collision signatures. The DGG is a mosaic which forms a partition of the Earth's surface into a plurality of geographical cells. For each collision signature, the server computer determines a geographical cell associated with the location of the collision signature. Correlating two collision signatures includes, prior to spatio-temporally correlating the two collision signatures, determining whether the two collision signatures are associated with the same geographical cell or two geographical cells that are direct neighbors. If the geographical cell associated with the one of the collision signatures is not the same as the geographical cell associated with the other collision signature, nor a geographical cell that is a direct neighbor of the geographical cell associated with the other collision signature, the server computer determines that the two collision signatures do not correspond to a same collision.



FIG. 12 is a flowchart illustrating a method 1200 for detecting, at a client device, an abrupt change of acceleration corresponding to a collision and generating a collision signature. The method 1200 may be embodied in computer-readable instructions for execution by one or more processors of a machine (e.g., machine 700) such that the steps of the method 1200 may be performed in part or in whole by functional components of a client device (e.g., client device 102); accordingly, the method 1200 is described below by way of example with reference thereto. However, it shall be appreciated that the method 1200 may be deployed on various other hardware configurations and is not intended to be limited to the functional components of the client device.


In block 1202, the client device acquires a sequence of data points. Each data point includes an instant acceleration, a location (e.g., latitude, longitude, and in some embodiments altitude) and a timestamp. The instant acceleration may be acquired by an accelerometer integrated in the client device. The instant acceleration is measured along 3 axes. In some embodiments, the client device periodically acquires data points. The frequency of acquisition may for example be 50 Hz-100 Hz.


In block 1204, the client device computes a distance (e.g., Euclidian distance) of the instant acceleration of each data point.


In decision block 1206, the client device determines whether the ratio of the distance of the instant acceleration of the most recently acquired data point to the distance of the instant acceleration of any of the other data points of the sequence exceeds a collision threshold (e.g., 15). The collision threshold can be set from the server (e.g., via the location sharing server application 114).


If the ratio exceeds the collision threshold (e.g., 15), the client device generates, in block 1208, a collision signature, and sends, in block 1210, the collision signature to the application server (e.g., application server 112). The collision signature may include a location and a timestamp associated with the most recently acquired data point. In some embodiments, the collision signature includes the sequence of data points acquired by the client device.


Knocking a phone against a horizontal surface, such as a table, may generate acceleration data similar to the acceleration data generated when the phone is knocked into another phone. In some embodiments, gravity data is used to determine whether the phone collided with another phone or with a horizontal surface.


In some embodiments, each data point further includes gravity data acquired by a gravity sensor embedded in the client device. The gravity data measures the acceleration effect of Earth's gravity on the client device. The gravity data may be derived from the acceleration data acquired by the accelerometer of the client device. Data acquired by other sensors of the client device (e.g. the magnetometer and the gyroscope) may be used to remove linear acceleration from the acceleration data acquired by the accelerometer. The client device determines a tilt of the client device relative to the face of the Earth. If the tilt of the client device relative to the face of the Earth is less than a tilt threshold (e.g., 30 degree), the collision detected is likely to be a collision against a horizontal surface such as a table as opposed to a collision against another phone, and the client device discards the data point without generating a collision signature.


User interface 1300 shown in FIG. 13 is an example of a user interface that may be displayed on a display screen of a third user. User interface 1300 includes a map 1302 depicting an avatar 1304 of the first user, and an avatar 1306 of the second user.


An avatar (e.g., avatar 1304, avatar 1306) is a media content item associated with the first user and that may include a still image, animated image, video, or other content. The avatar may include a profile picture or a default icon. The location of the user's avatar on the map GUI is representative of the current location of the user. The system updates the location of the first user's avatar on the map as the location of the user changes. If the system detects a collision between the client device of the first user and the client device of the second user, the map displays a text or an icon 1308 or a combination of both indicating that the first and second user are spending time together. An icon is a media content item that may include a still image, animated image, video, or other content.


The detection of a collision between the client device of the first user and the client device of the second user can also trigger various actions, such as sending a notification to a group of users (e.g., users that are friends with both the first and second users) and unlocking certain functionalities of the application for the first and the second users.


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.

Claims
  • 1. A method comprising: receiving, at a server computer, a first collision signature from a first client device, and a second collision signature from a second client device;determining that a first distance between a first location of the first collision signature and a second location of the second collision signature is below a distance threshold;increasing, based on determining that the distance is below the distance threshold, the distance threshold for a limited period of time;receiving, at the server computer and within the limited period of time, a third collision signature from the first client device, and a fourth collision signature from the second client device;determining that a second distance between a third location of the third collision signature and a fourth location of the fourth collision signature meets the distance threshold; anddetecting, based on determining that the second distance meets the distance threshold, a collision associated with the first and second client devices.
  • 2. The method of claim 1, wherein detecting, based on based on determining that the second distance meets the distance threshold, the collision associated with the first and second client devices, further comprises, determining that a timespan between a first timestamp of the first collision signature and a second timestamp of the second collision signature is below a time threshold.
  • 3. The method of claim 2, comprising if detecting, based on determining that the second distance meets the distance threshold, the collision associated with the first and second client devices results in no collision detected, then increasing the time threshold.
  • 4. The method of claim 3, comprising applying the increased time threshold to determining that the timespan between the first timestamp of the first collision signature and the second timestamp of the second collision signature is below the time threshold.
  • 5. The method of claim 1, wherein each collision signature includes a sequence of instant acceleration readings acquired by a corresponding client device.
  • 6. The method of claim 1, comprising, creating, in response to detecting the collision, a communication session between the first and the second client devices via the server computer.
  • 7. The method of claim 1, wherein the first client device is associated with a first user, and the second client device is associated with a second user.
  • 8. The method of claim 7, comprising sending, in response to detecting the collision, a notification to a third client device associated with a third user that is connected, in a social graph, with both the first and second users.
  • 9. The method of claim 1, comprising: receiving location data from the first client device;determining a plurality of visit points of the first client device by aggregating the location data received from the first client device;receiving location data from the second client device;determining a plurality of visit points of the second client device by aggregating the location data received from the second client device;determining that a location of the first collision signature corresponds to one of the plurality of visit points of the first client device; anddetermining that a location of the second collision signature corresponds to one of the plurality of visit points of the second client device.
  • 10. A system comprising: a processor; anda memory storing instructions that, when executed by the processor, configure the processor to perform operations comprising:receiving, at a server computer, a first collision signature from a first client device, and a second collision signature from a second client device;determining that a first distance between a first location of the first collision signature and a second location of the second collision signature is below a distance threshold;increasing, based on determining that the distance is below the distance threshold, the distance threshold for a limited period of time;receiving, at the server computer and within the limited period of time, a third collision signature from the first client device, and a fourth collision signature from the second client device;determining that a second distance between a third location of the third collision signature and a fourth location of the fourth collision signature meets the distance threshold; anddetecting, based on determining that the second distance meets the distance threshold, a collision associated with the first and second client devices.
  • 11. The system of claim 10, wherein detecting, based on based on determining that the second distance meets the distance threshold, the collision associated with the first and second client devices, further comprises, determining that a timespan between a first timestamp of the first collision signature and a second timestamp of the second collision signature is below a time threshold.
  • 12. The system of claim 11, the operations comprising if detecting, based on determining that the second distance meets the distance threshold, the collision associated with the first and second client devices results in no collision detection, then increasing the time threshold.
  • 13. The system of claim 12, the operations comprising applying the increased time threshold to determining that the timespan between the first timestamp of the first collision signature and the second timestamp of the second collision signature is below the time threshold.
  • 14. The system of claim 10, the operations comprising creating, in response to detecting the collision, a communication session between the first and the second client devices via the server computer.
  • 15. The system of claim 10, wherein the first client device is associated with a first user, and the second client device is associated with a second user, and wherein the operations comprise sending, in response to detecting the collision, a notification to a third client device associated with a third user that is connected, in a social graph, with both the first and second users.
  • 16. 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: receiving, at a server computer, a first collision signature from a first client device, and a second collision signature from a second client device;determining that a first distance between a first location of the first collision signature and a second location of the second collision signature is below a distance threshold;increasing, based on determining that the distance is below the distance threshold, the distance threshold for a limited period of time;receiving, at the server computer and within the limited period of time, a third collision signature from the first client device, and a fourth collision signature from the second client device;determining that a second distance between a third location of the third collision signature and a fourth location of the fourth collision signature meets the distance threshold; anddetecting, based on determining that the second distance meets the distance threshold, a collision associated with the first and second client devices.
  • 17. The computer-readable storage medium of claim 16, wherein detecting, based on based on determining that the second distance meets the distance threshold, the collision associated with the first and second client devices, further comprises, determining that a timespan between a first timestamp of the first collision signature and a second timestamp of the second collision signature is below a time threshold.
  • 18. The computer-readable storage medium of claim 17, the operations comprising if detecting, based on determining that the second distance meets the distance threshold, the collision associated with the first and second client devices results in no collision detection, then increasing the time threshold.
  • 19. The computer-readable storage medium of claim 18, the operations comprising applying the increased time threshold to determining that the timespan between the first timestamp of the first collision signature and the second timestamp of the second collision signature is below the time threshold.
  • 20. The computer-readable storage medium of claim 16, the operations comprising creating, in response to detecting the collision, a communication session between the first and the second client devices via the server computer.
CLAIM OF PRIORITY

This application is a continuation of U.S. patent application Ser. No. 17/247,054, filed on Nov. 25, 2020, which application is a continuation of U.S. patent application Ser. No. 16/434,547, filed Jun. 7, 2017, which are incorporated herein by reference in their entirety.

US Referenced Citations (780)
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
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
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 Luchene 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 Ioffe 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 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
11601783 Berardino et al. Mar 2023 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
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
20090319607 Belz et al. Dec 2009 A1
20090327073 Li Dec 2009 A1
20100011422 Mason 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 Lansing 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
20100167646 Alameh et al. Jul 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
20110197194 D'Angelo et al. Aug 2011 A1
20110202598 Evans et al. Aug 2011 A1
20110202968 Nurmi 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
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
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
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
20130065517 Svensson 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
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
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
20140282068 Levkovitz 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
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
20150318874 Donaldson Nov 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
20160057565 Gold Feb 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
20160344712 Ding et al. Nov 2016 A1
20170006094 Abou Mahmoud et al. Jan 2017 A1
20170032114 Turgeman Feb 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 Deusen 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
20180054509 Nuescheler 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
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 (28)
Entry
U.S. Appl. No. 16/434,547 U.S. Pat. No. 10,893,385, filed Jun. 7, 2019, Detection of a Physical Collision Between Two Client Devices in a Location Sharing System.
U.S. Appl. No. 17/247,054, filed Nov. 25, 2020, Detection of a Physical Collision Between Two Client Devices in a 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/434,547, Corrected Notice of Allowability dated Oct. 9, 2020”, 2 pgs.
“U.S. Appl. No. 16/434,547, Notice of Allowance dated Aug. 19, 2020”, 11 pgs.
“U.S. Appl. No. 17/247,054, Non Final Office Action dated May 11, 2022”, 17 pgs.
“U.S. Appl. No. 17/247,054, Notice of Allowance dated Oct. 31, 2022”, 9 pgs.
“U.S. Appl. No. 17/247,054, Preliminary Amendment filed Feb. 9, 2021”, 7 pgs.
“U.S. Appl. No. 17/247,054, Response filed Aug. 11, 2022 to Non Final Office Action dated May 11, 2022”, 8 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 dated 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 Belleve 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=RWwQXi9RG0w>, (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
20230188943 A1 Jun 2023 US
Continuations (2)
Number Date Country
Parent 17247054 Nov 2020 US
Child 18165632 US
Parent 16434547 Jun 2019 US
Child 17247054 US