This specification generally relates to data processing.
People take photographs (photos) to document events and to keep memories. People often share the photos with friends and family. In recent years, digital photography has become more mainstream. Using digital photography, a photographer can capture a photograph and store the photograph as a digital file. The digital file can be stored to computer-readable memory, can be copied and can be electronically distributed. The Internet has made the sharing of photos much easier. People can email photos to friends, or post them on websites for others to view. Social networking websites are also used to share photos with friends and acquaintances.
Implementations of the present disclosure are generally directed to event recognition and cross-user photo clustering. In some implementations, first image data corresponding to a first image and second image data corresponding to a second image are compared to determine whether the first image and the second image correspond to a coincident event. The first image and the second image include respective digital photographs (photos) taken of an event by one or more users. In some implementations, two or more of timestamp data, geo-location data, content data and ancillary data are compared between the first image and the second image. In some implementations, if the first image and the second image correspond to a coincident event, a first user associated with the first image and a second user associated with the second image are notified. The first image and the second image can be published to an event page.
In general, innovative aspects of the subject matter described in this specification may be embodied in methods that include the actions of receiving, from a first user, first image data corresponding to a first image, receiving, from a second user, second image data corresponding to a second image, comparing the first image data and the second image data, and determining that the first image and the second image each correspond to an event based on the comparing, the event being coincident with respect to the first image and the second image.
These and other implementations may each optionally include one or more of the following features. For instance, actions further include providing an indication to the first user, the indication indicating that the second user has an image corresponding to the coincident event; actions further include receiving input from the first user, the input indicating a request to add the second image to a collection of images associated with the coincident event; actions further include providing the request to the second user; actions further include receiving input from the second user, the input indicating a response to the request; the second user is a member of a social network of the first user; the second user is a person determined to be in the first of image; the second user is a member of a social network of a person determined to be in the first image; the first image data includes a first timestamp and the second image data includes a second timestamp; comparing the first image data and the second image data includes: determining a difference between the first timestamp and the second timestamp, and determining that the difference is less than a threshold difference; the first image data includes first geo-location data and the second image data includes second geo-location data; comparing the first image data and the second image data includes: determining a distance between the first geo-location and the second geo-location, and determining that the distance is less than a threshold distance; the first image data includes first check-in data and the second image data includes second check-in data; comparing the first image data and the second image data includes: determining a first location specified by the first check-in data, determining a second location specified by the second check-in data, and determining that the first and second locations refer to a same geographical location; the first image data and the second image data each include at least one of timestamp data, geo-location data, check-in data and content data; comparing the first image data and the second image data includes: processing the content data of the first image data and the second image data, and identifying a landmark as being present in both the first image and the second image; comparing the first image data and the second image data includes: processing the content data of the first image data and the second image data, and identifying a human face as being present in both the first image and the second image; the first image data and the second image data each include ancillary data, the ancillary data including data added to the first image data and the second image data after generation of the first image data and the second image data; the ancillary data includes one or more tags indicating a presence of one or more particular persons in each of the first image and the second image; and actions further include: generating a confidence score based on the comparing, and determining that the confidence score exceeds a threshold confidence score, wherein determining that the first image and the second image correspond to a coincident event is based on the confidence score exceeding the threshold confidence score.
The details of one or more implementations of the subject matter described in this specification are set forth in the accompanying drawings and the description below. Other potential features, aspects, and advantages of the subject matter will become apparent from the description, the drawings, and the claims.
Like reference numbers represent corresponding parts throughout.
The present disclosure describes systems and techniques for recognizing the occurrence of an event from digital images provided as digital photographs (photos). Photos corresponding to the event can be clustered across multiple users. In particular, different users can take photos of a coincident event. For example, a first user can take photos of an event and a second user can take photos of the same event. The users can each upload their respective photos to a server or a system of servers for publication to a viewing audience. For example, each user can upload their respective photos to a social networking website for publication to other users of the social networking website. Data corresponding to each of the photos can be processed to determine that the photos of the different users correspond the same event. The data can include timestamp data, data regarding people identified within the photos, data regarding landmarks identified within the photos, and/or geographic location (geo-location) data indicating where the photos were taken. The data can also include other image analysis data, such as license plates, street signs, store fronts, bar codes, and other data.
In some implementations, photos of the same event are clustered across the multiple users. The clustering can include adding photos published by the second user to an event webpage created by the first user, and/or creating an event webpage or webpages designated for the event and uploading photos of the first and second users to the event webpage. In some implementations, user permission is requested before uploading their respective photos to the event webpage. In some implementations, the event data is displayed on an application on a computing device, rather than a webpage.
In some implementations, event recognition and photo clustering can be achieved based on one or more social graphs associated with a user of a social networking service. For example, a particular user of the social networking service can publish photos using the social networking service. Other users of the social networking service can also publish photos using the social networking service. Photos published by the other users can be reviewed in view of and can be selectively clustered with photos of the particular user. The review and clustering can be based on a social relationship between the particular user and the other users within the social networking service. The other users' photos can be searched to find more photos of the coincident event.
By way of non-limiting example, Alice and Bob can attend the wedding of Claire and David. In this example, the wedding of Claire and David is defined as an event. Alice and Bob can both take photos of the event and upload the photos for publication using a social networking service. Data underlying the photos can be processed such that the photos uploaded by Alice and Bob are recognized as being photos of the same event. For example, the data underlying the photos can indicate that at least a subset of Alice's photos and of Bob's photos each include Claire and David, and that the photos were both taken within a threshold timeframe of one another. In response to recognizing that the photos correspond to the same event, a request can be issued to Alice and Bob. The request can request whether Alice and Bob each want to include their photos in an event webpage created for event. The request can also include a request for a proposed event title (e.g., “Claire and David's wedding”). Alice and Bob can individually approve the inclusion of their photos in the event webpage.
Using Alice as an example user, photos taken by other users that are socially connected to Alice in the social networking service can be reviewed to determine whether photos uploaded by the other users also correspond to the event. This can also be done in view of Bob's social connections, as well as the social connections of each of Claire and David. In this manner, photos of a coincident event can be aggregated from different users, such that more photos of the event can be shared with the family and friends, beyond only the photos taken by a particular user. Photos of users indirectly connected to Alice (e.g., a connection of a connection, a connection of a connection of a connection, etc.) can also be reviewed to determine whether the photos correspond to the event.
Each computing device 102, 106 can represent various forms of processing devices. Example processing devices can include a desktop computer, a laptop computer, a handheld computer, a personal digital assistant (PDA), a cellular telephone, a network appliance, a camera, a smart phone, an enhanced general packet radio service (EGPRS) mobile phone, a media player, a navigation device, an email device, a game console, or a combination of any these data processing devices or other data processing devices. The computing devices 102, 106, 116 may be provided access to and/or receive application software executed and/or stored on any of the other computing systems 102, 106, 116. The computing device 116 can represent various forms of servers including, but not limited to a web server, an application server, a proxy server, a network server, or a server farm.
In some implementations, the computing devices may communicate wirelessly through a communication interface (not shown), which may include digital signal processing circuitry where necessary. The communication interface may provide for communications under various modes or protocols, such as Global System for Mobile communication (GSM) voice calls, Short Message Service (SMS), Enhanced Messaging Service (EMS), or Multimedia Messaging Service (MMS) messaging, Code Division Multiple Access (CDMA), Time Division Multiple Access (TDMA), Personal Digital Cellular (PDC), Wideband Code Division Multiple Access (WCDMA), CDMA2000, or General Packet Radio System (GPRS), among others. For example, the communication may occur through a radio-frequency transceiver (not shown). In addition, short-range communication may occur, such as using a Bluetooth, WiFi, or other such transceiver.
In some implementations, the system 100 can be a distributed client/server system that spans one or more networks such as network 110. The network 110 can be a large computer network, such as a local area network (LAN), wide area network (WAN), the Internet, a cellular network, or a combination thereof connecting any number of mobile clients, fixed clients, and servers. In some implementations, each client (e.g., computing devices 102, 106) can communicate with servers (e.g., computing device 116) via a virtual private network (VPN), Secure Shell (SSH) tunnel, or other secure network connection. In some implementations, the network 110 may further include a corporate network (e.g., intranet) and one or more wireless access points.
By way of non-limiting example, each user 104, 108 takes photos of an event 220 using, for example, a digital camera or a smart phone. The users 104, 108 can transfer the digital photos to user devices 102, 106. That is, the users 104, 108 can each transfer files corresponding to their respective digital photos to computer-readable memory of the computing devices 102, 106. Using the respective computing devices 102, 106, the users 104, 108 can each upload respective files 208, 210 corresponding to the digital photos taken of the event 220 to their respective user pages 204, 206. In this manner, data stored in the files 208, 210 can be processed to publish the photos to the respective user pages 204, 206. The users 104, 108 can share their photos with their acquaintances through the social networking service. The users 104, 108, however, may not be aware of each other's photos of the event.
The photo clustering system 202 can compare data associated with the photos and stored in the files 208, 210 received from the users 104, 108 on the user pages 204, 206. In some implementations, the files 208, 210 include data corresponding to the photos taken by the users 104, 108. The data can include image content data, timestamp data, geo-location data, and/or check-in data. The timestamp data can correspond to when a particular photo was taken and the geo-location data and check-in data can correspond to where a particular photo was taken. The timestamp, geo-location, and check-in data can be associated with the particular photo as metadata by, for example, a smart phone that stores with the photo the time and location of the smart phone when the photo is taken. Digital cameras can also store time and location information with photos. The photo clustering system 202 can compare the data of the photos. Further, the system 202 can also compare the contents of photos. For example, the users 104, 108 or other users of the social networking service can tag the photos, providing identities of people in the photos. The system 202 can also use facial recognition techniques to identify people in photos. The system 202 can also detect recognizable landmarks in the photos, such as famous buildings or other unique backgrounds.
The photos can also include check-in data, which can be data provided by the user that the user was at a certain location at a certain time or for a certain duration of time, including when the photo was taken. For example, the users 104, 108, can check in at a specific location, such as a restaurant, indicating that the users 104, 108 were at the location at a specific time. Additionally, the check-in data can be provided automatically to the user. For example, a smart phone can be configured to automatically check in a user when the user is in certain locations. The check-in data can also refer to events in addition to, or instead of, locations. For example, a user can check in to a birthday party of a friend of the user.
The system 202 can compare photos at a time to detect coincident elements between the photos. When the system 202 detects coincident elements, the system 202 can determine that the photos 208, 210 are of the same event. In some implementations, the system 202 determines the photos are of the same event if the data associated with the photos indicates that the photos were taken at approximately the same time and near the same location. The system 202 can use the timestamp data to determine the time each photo was taken. The system 202 can include a threshold amount of time that is used to determine whether the photos are deemed to have been taken at approximately the same time. The system 202 can determine that photos taken within the threshold amount of time (e.g., X minutes, where X can be any positive number) of each other are close enough in time that the photos might be of the same event. For example, a difference between a first timestamp associated with a first photo and a second timestamp associated with a second photo can be determined. If the difference is less than or equal to the threshold amount of time, the first and second photos can be deemed to have been taken at approximately the same time. If the difference is greater than the threshold amount of time, the first and second photos can be deemed to have not been taken at approximately the same time.
With regard to whether the photos were taken at the same or approximately the same location, the system 202 can determine whether at least a particular person is in each of the photos, whether a particular landmark is in each of the photos, and/or whether respective geo-locations of the photos correspond to one another. For example, if two photos each include a particular person and were taken at the same or approximately the same time (discussed above), the photos can be deemed to have been taken at the same or approximately the same location. As another example, if a particular landmark (e.g., a building, a statue, a monument) is present in each of the photos, the photos can be deemed to have been taken at the same or approximately the same location.
As another example, geo-location data of the photos can indicate that the photos were taken at the same or approximately the same location. With regard to geo-location data, the system 202 can use a threshold distance of the respective geo-locations of the photos. If the distance between the geo-locations is less than the threshold distance, the photos are considered as having been taken at the same or approximately the same location. For example, a difference between a first geo-location associated with a first photo and a second geo-location associated with a second photo can be determined. If the difference is less than or equal to the threshold distance, the first and second photos can be deemed to have been taken at approximately the same location. If the difference is greater than the threshold distance, the first and second photos can be deemed to have not been taken at the same location.
As another example, check-in data can indicate that the photos were taken at the same or approximately the same location or event. For example, if two users check in to the same restaurant and each user takes a photo, the photos can be determined to have been taken at the same location. Or the two users can check in to a same event, such as the same birthday party. If the check-in data for two photos indicate the photos were taken at the same birthday party, the photos can be determined to have been taken at the same event.
The system 202 can also determine that a set of photos from one user are of one event. The system 202 can use information provided by the user, for example, the user can label a set of photos with an event title. Additionally, the system 202 can determine that two of the photos provided by one user are of the same event using the techniques described herein. The system 202 may also determine that photos received from one user and that were taken within a threshold time of one another are of the same event. The system 202 can use this information to determine that sets of photos provided by two users are of the same event. For example, the user 104 can upload a set of ten photos for publication to the user page 204. The user 108 can upload a set of five photos for publication to the user page 206. The photo clustering system 202 can process the photos and determine that the ten photos uploaded by the user 104 are of a coincident event. Similarly, the system 202 can process the photos and determine that the five photos uploaded by the user 108 are also of a coincident event. The photo clustering system 202 may then determine that at least one photo of the set uploaded by the user 104 is of a coincident event as at least one photo of the set uploaded by the user 108. For example, the photo clustering system can compare timestamp data, geo-location data, check-in data, and/or photo content, as discussed herein. The photo clustering system 202 can determine that all ten photos uploaded by the user 104 and all five photos uploaded by the user 108 are of the same event.
The photo clustering system 202 can also generate a confidence score as to whether photos are of a coincident event. The confidence score can be based on factors including a difference between the timestamps of the photos, a difference between the geo-locations of the photos, a confidence measure corresponding to whether a person detected in each of the photos is the same person, a confidence measure corresponding to whether a landmark detected in each of the photos is the same landmark, and/or a confidence measure corresponding to whether two check-in locations/events are the same location/event. The confidence score can also be based on how many elements of information the system determines to be the same or sufficiently similar between the photos. For example, if the timestamps of the two photos are within the threshold time, the same person is detected in each of the photos, and the same landmark is detected in each of the photos, a first confidence score can be provided. If the timestamps of the two photos are within the threshold time, but the same person is not detected in each of the photos, and/or the same landmark is not detected in each of the photos, a second confidence score can be provided, the second confidence score being less than the first confidence score. In some implementations, the confidence score can be lower when elements of the photos are different. For example, although photos may be taken at a similar time and each includes a person that is deemed to be the same person in both photos (e.g., based on facial recognition techniques and/or tagging), but the difference between the geo-locations of the photos is greater than the threshold distance, a relatively low confidence score can be provided.
The photo clustering system 202 can cluster the photos that are determined to be of the same event. In some implementations, an event page 222 can be generated. The event page 22 can include a webpage corresponding to the coincident event in the photos, and the photos can be published to the event page (e.g., upon approval of the owner of the photos). For example, the event page 222 can be a webpage provided by the social networking service, and can display information about the coincident event including the photos provided by the users 104, 108. The event page 222 can include privacy settings that allow only some users of the social networking service to view the page. For example, viewing of the event page 222 can be limited only to the social networking contacts of the users whose photos are included on the event page 222. Other privacy settings can also be used.
In some implementations, the event page 222 can be generated by a user. For example, a user (e.g., the user 104) can generate the event page 222 using the social networking service and can publish the photos to the event page 222. The photo clustering system 202 can determine that photos posted by another user (e.g., the user 108) of the social networking service correspond to the event associated with the event page 222. The other user (e.g., the user 108) can be notified of the existence of the event page 222, as discussed herein, and can provide permission to add their photos to the event page. In this manner, the photos of both users are published through the event page 222. In some implementations, the photo clustering system 202 can determine photos that are private to another user (e.g., the user 108) correspond to the event of the event page 222. The system can notify the user 108 and ask if the user 108 wants to publish and include the photos through the event page 222.
The users 104, 108 can each receive notifications requesting permission to add their photos to an event page 222. The notifications can include information about the other users who have added photos to the event page 222. Consequently, users can determine whether they want to share their photos with the users who have photos published to the event page 222. In some implementations, the users 104, 108 can upload photos and other media directly to an event page. Further, notifications can be used to confirm that the photos determined to be of a coincident event were, in fact, taken at the coincident event. For example, a user may receive a notification that an event page 222 has been created and that the user's photos may correspond to the event associated with the event page 222. The user can provide feedback indicating that the user's photos indeed do not correspond to the event associated with the event page 222. In this manner, the photo clustering system 202 can process the feedback to further improve the accuracy of coincident event detection.
In some implementations, the photo clustering system 202 can cluster photos based on different sets of similar elements. For example, if two photos do not both have timestamp data, but contain both a same landmark and a same person, the two photos can still be clustered as corresponding to a same event. Additionally, if two photos have check-in data corresponding to a same event, the two photos can be clustered as corresponding to a same event. In some implementations, the confidence score can be weighted depending on which elements are found to be similar.
In some implementations, photos with similar elements that do not include a similar time element (e.g., a similar timestamp or check-in data corresponding to a similar time) can be clustered together as corresponding to each other. For example, photos that include the Eiffel Tower can be clustered together regardless of time. These clustered photos can be further clustered as events if a subset of the clustered photos include data corresponding to a similar time that the subset of photos was taken.
A first photo file is received (302). The first photo file can be received by the computing system 114 of
Corresponding data between the first and second photo files is compared (306). For example, the computing system 114 of
In some implementations, if the data of two or more common data fields between the first and second photo files correspond the first and second photo files are deemed to be of the same event. For example, if the timestamp data indicates that the first and second photos were taken at approximately the same time and the geo-location data indicates that the first and second photos were taken at approximately the same location, the first and second photo files are deemed to be of the same event. As another example, if the timestamp data indicates that the first and second photos were taken at approximately the same time and the content data indicates that the first and second photos include coincident content (e.g., at least one person common to both the first and second photos, at least one landmark common to both the first and second photos), the first and second photo files are deemed to be of the same event. As another example, if the content data indicates that the first and second photos include coincident content (e.g., at least one person common to both the first and second photos, at least one landmark common to both the first and second photos) and the geo-location data indicates that the first and second photos were taken at approximately the same location, the first and second photo files are deemed to be of the same event. Other combinations of correspondence between the data of the first and second photo files can also indicate that the first and second photo files are deemed to be of the same event.
In some implementations, facial recognition techniques can be applied to the content data of the first and second photo files to determine whether a particular person is in both the first and second photos. The identity of the person can remain anonymous. In some implementations, user-supplied information regarding identities of people in photos can be used to determine whether the same person is in both pictures. For example, one or more tags associated with the first and second photos can be compared to determine whether one or more particular people are in the first and second photos.
A first set of photos of an event is generated (402). For example, a first user (e.g., user 104) takes photos of an event (e.g., event 220) using a digital camera that generates the first set of photos. A second set of photos of the event is generated (404). For example, a second user (e.g., user 108) takes photos of the same event (e.g., event 220) using a digital camera that generates the second set of photos. As the first and second users take photos of the same event, the photos are generated at a similar time (i.e., within a threshold time of one another) and in a similar location (i.e., within a threshold distance of one another).
The first set of photos are uploaded (406). The first user can upload the first set of photos to a computer system (e.g., the computing system 114 of
An event page is generated (410). The event page can include information about the event as well as the first set of photos. The information about the event can be received from the first user. Additionally, information about the event can be determined from the first set of photos. For example, the time and location of the event can be determined from data included with the photos of the first set of photos. The data can include a timestamp of when each photo was taken and a geo-location of where each photo was taken. The time and location can correspond to the time and location of the event. The first user can also provide information about the event such as a title of the event. The first user can also designate which photos were taken at the event.
The second set of photos is uploaded (412). The second user can upload the second set of photos to a computer system (e.g., the computing system 114 of
Photos of the first set of photos and photos of the second set of photos are determined to be of a coincident event (416). Data associated with the photos received from the first user and the second user is compared to determine whether the photos are of the same event. The data can be compared using the techniques described herein. If the photos are determined to be photos of the same event, notifications are sent to the first and second users regarding combining the photos (418).
The first and second users can receive the notifications alerting them of the other user's photos of the event. The first and second users can respond to the permission requests (420, 422). If the first and second users both allow their respective photos to be combined on the same event page, the photos are clustered, or otherwise combined to the event page (424). If the first and second users both create event pages of the same event, the system can request permission to merge the two pages into one event page. Alternatively, the first or second user can decline the inclusion of their photos on the same event page as the other user. The system can provide separate event pages for each of the users, or no event page at all, depending on their responses to the permission requests. In addition, the system can have additional privacy settings, for example, users can prevent the system from notifying other users about their photos without their permission.
In the example social graph 500 of
In the example social graph of
The system can find Bob's photos of the event by searching through Alice's social contacts. The system can determine that Bob's photos, or a subset of Bob's photos corresponds to the event. The system can notify Alice that Bob has also uploaded photos of the event. The system can also notify Bob that Alice has created an event page for the photos of the event. If both Alice and Bob approve, the system can include both Alice and Bob's photos on the event page 510.
The system can also find Zach's photos of the event, even though neither Alice nor Bob are contacts of Zach. The photos can include pictures of Claire and David, as the event photographed is their wedding. The system can then search through Claire and David's contacts to determine if any of the photos they uploaded are also of the event. The system can therefore find Zach's photos of the event, and notify Zach of the event page 510. The system can also notify Alice to request permission to include Zach's photos in the event page. In some implementations, the system can request permission from both Alice and Bob. Alternative permission and privacy settings can be used for the event pages.
Implementations of the present disclosure and all of the functional operations provided herein can be realized in digital electronic circuitry, or in computer software, firmware, or hardware, including the structures disclosed in this specification and their structural equivalents, or in combinations of one or more of them. Implementations of the present disclosure can be realized as one or more computer program products, i.e., one or more modules of computer program instructions encoded on a computer readable medium for execution by, or to control the operation of, data processing apparatus. The computer readable medium can be a machine-readable storage device, a machine-readable storage substrate, a memory device, a composition of matter effecting a machine-readable propagated signal, or a combination of one or more of them. The term “data processing apparatus” encompasses all apparatus, devices, and machines for processing data, including by way of example a programmable processor, a computer, or multiple processors or computers. The apparatus can include, in addition to hardware, code that creates an execution environment for the computer program in question, e.g., code that constitutes processor firmware, a protocol stack, a database management system, an operating system, or a combination of one or more of them.
A computer program (also known as a program, software, software application, script, or code) can be written in any form of programming language, including compiled or interpreted languages, and it can be deployed in any form, including as a stand alone program or as a module, component, subroutine, or other unit suitable for use in a computing environment. A computer program does not necessarily correspond to a file in a file system. A program can be stored in a portion of a file that holds other programs or data (e.g., one or more scripts stored in a markup language document), in a single file dedicated to the program in question, or in multiple coordinated files (e.g., files that store one or more modules, sub programs, or portions of code). A computer program can be deployed to be executed on one computer or on multiple computers that are located at one site or distributed across multiple sites and interconnected by a communication network.
The processes and logic flows described in this disclose can be performed by one or more programmable processors executing one or more computer programs to perform functions by operating on input data and generating output. The processes and logic flows can also be performed by, and apparatus can also be implemented as, special purpose logic circuitry, e.g., an FPGA (field programmable gate array) or an ASIC (application specific integrated circuit).
Processors suitable for the execution of a computer program include, by way of example, both general and special purpose microprocessors, and any one or more processors of any kind of digital computer. Generally, a processor will receive instructions and data from a read only memory or a random access memory or both. Elements of a computer can include a processor for performing instructions and one or more memory devices for storing instructions and data. Generally, a computer will also include, or be operatively coupled to receive data from or transfer data to, or both, one or more mass storage devices for storing data, e.g., magnetic, magneto optical disks, or optical disks. However, a computer need not have such devices. Moreover, a computer can be embedded in another device, e.g., a mobile telephone, a personal digital assistant (PDA), a mobile audio player, a Global Positioning System (GPS) receiver, to name just a few. Computer readable media suitable for storing computer program instructions and data include all forms of non volatile memory, media and memory devices, including by way of example semiconductor memory devices, e.g., EPROM, EEPROM, and flash memory devices; magnetic disks, e.g., internal hard disks or removable disks; magneto optical disks; and CD ROM and DVD-ROM disks. The processor and the memory can be supplemented by, or incorporated in, special purpose logic circuitry.
To provide for interaction with a user, implementations of the present disclosure can be implemented on a computer having a display device, e.g., a CRT (cathode ray tube) or LCD (liquid crystal display) monitor, for displaying information to the user and a keyboard and a pointing device, e.g., a mouse or a trackball, by which the user can provide input to the computer. Other kinds of devices can be used to provide for interaction with a user as well; for example, feedback provided to the user can be any form of sensory feedback, e.g., visual feedback, auditory feedback, or tactile feedback; and input from the user can be received in any form, including acoustic, speech, or tactile input.
The computing system can include clients and servers. A client and server are generally remote from each other and typically interact through a communication network. The relationship of client and server arises by virtue of computer programs running on the respective computers and having a client-server relationship to each other.
While this disclosure includes some specifics, these should not be construed as limitations on the scope of the disclosure or of what may be claimed, but rather as descriptions of features of example implementations of the disclosure. Certain features that are described in this disclosure in the context of separate implementations can also be provided in combination in a single implementation. Conversely, various features that are described in the context of a single implementation can also be provided in multiple implementations separately or in any suitable subcombination. Moreover, although features may be described above as acting in certain combinations and even initially claimed as such, one or more features from a claimed combination can in some cases be excised from the combination, and the claimed combination may be directed to a subcombination or variation of a subcombination.
Similarly, while operations are depicted in the drawings in a particular order, this should not be understood as requiring that such operations be performed in the particular order shown or in sequential order, or that all illustrated operations be performed, to achieve desirable results. In certain circumstances, multitasking and parallel processing may be advantageous. Moreover, the separation of various system components in the implementations described above should not be understood as requiring such separation in all implementations, and it should be understood that the described program components and systems can generally be integrated together in a single software product or packaged into multiple software products.
A number of implementations have been described. Nevertheless, it will be understood that various modifications may be made without departing from the spirit and scope of the disclosure. For example, various forms of the flows shown above may be used, with steps re-ordered, added, or removed. Accordingly, other implementations are within the scope of the following claims.
This application is a continuation of U.S. application Ser. No. 13/219,835, filed Aug. 29, 2011, which claims the benefit of U.S. Prov. Pat. App. No. 61/444,520, filed Feb. 18, 2011, the disclosure of which is expressly incorporated herein by reference in its entirety.
Number | Name | Date | Kind |
---|---|---|---|
6421358 | Stimmel et al. | Jul 2002 | B1 |
6513014 | Walker et al. | Jan 2003 | B1 |
6557041 | Mallart | Apr 2003 | B2 |
6940998 | Garoutte | Sep 2005 | B2 |
6947976 | Devitt et al. | Sep 2005 | B1 |
7298960 | Taylor | Nov 2007 | B1 |
7489946 | Srinivasan et al. | Feb 2009 | B2 |
7512829 | Mital et al. | Mar 2009 | B2 |
7539747 | Lucovsky et al. | May 2009 | B2 |
7552068 | Brinkerhoff | Jun 2009 | B1 |
7620902 | Manion et al. | Nov 2009 | B2 |
7804426 | Etcheson | Sep 2010 | B2 |
7812998 | Miers | Oct 2010 | B2 |
7844482 | Larson | Nov 2010 | B1 |
7849481 | Moon et al. | Dec 2010 | B2 |
7903904 | Loeb et al. | Mar 2011 | B1 |
7917859 | Singh et al. | Mar 2011 | B1 |
8332512 | Wu et al. | Dec 2012 | B1 |
8359285 | Dicker et al. | Jan 2013 | B1 |
8359540 | Darling | Jan 2013 | B2 |
8380039 | Luo | Feb 2013 | B2 |
8412773 | Chapweske et al. | Apr 2013 | B1 |
8630494 | Svendsen | Jan 2014 | B1 |
8730397 | Zhang | May 2014 | B1 |
8761523 | Cok et al. | Jun 2014 | B2 |
8914483 | Dixon et al. | Dec 2014 | B1 |
9021045 | Pennington | Apr 2015 | B2 |
20030099379 | Monk | May 2003 | A1 |
20030214128 | Roberts et al. | Nov 2003 | A1 |
20040073615 | Darling | Apr 2004 | A1 |
20050010470 | Marino | Jan 2005 | A1 |
20050021822 | Cherkasova et al. | Jan 2005 | A1 |
20050105396 | Schybergson | May 2005 | A1 |
20050187943 | Finke-Anlauff et al. | Aug 2005 | A1 |
20060112080 | Chen et al. | May 2006 | A1 |
20060125930 | Mindrum et al. | Jun 2006 | A1 |
20060159007 | Frutiger et al. | Jul 2006 | A1 |
20060234769 | Srinvasan et al. | Oct 2006 | A1 |
20060287105 | Willis | Dec 2006 | A1 |
20070022447 | Arseneau et al. | Jan 2007 | A1 |
20070219949 | Mekikian | Sep 2007 | A1 |
20070260361 | Etcheson | Nov 2007 | A1 |
20070266047 | Cortes et al. | Nov 2007 | A1 |
20070294177 | Volk et al. | Dec 2007 | A1 |
20080005761 | Repasi et al. | Jan 2008 | A1 |
20080086511 | Takao | Apr 2008 | A1 |
20080114844 | Sanchez et al. | May 2008 | A1 |
20080133697 | Stewart et al. | Jun 2008 | A1 |
20080136930 | Nagai | Jun 2008 | A1 |
20080144135 | Miers | Jun 2008 | A1 |
20080184139 | Stewart et al. | Jul 2008 | A1 |
20080186926 | Baio et al. | Aug 2008 | A1 |
20080189175 | Chan | Aug 2008 | A1 |
20080201299 | Lehikoinen et al. | Aug 2008 | A1 |
20080301736 | Heilbron et al. | Dec 2008 | A1 |
20090019902 | Baranek | Jan 2009 | A1 |
20090070412 | D'Angelo et al. | Mar 2009 | A1 |
20090171873 | Dolin et al. | Jul 2009 | A1 |
20090191902 | Osbourne | Jul 2009 | A1 |
20090248692 | Tsukagoshi | Oct 2009 | A1 |
20090248703 | Tsukagoshi et al. | Oct 2009 | A1 |
20090276531 | Myka et al. | Nov 2009 | A1 |
20090319472 | Jain et al. | Dec 2009 | A1 |
20100088182 | Ryder | Apr 2010 | A1 |
20100088336 | Johnston et al. | Apr 2010 | A1 |
20100124378 | Das et al. | May 2010 | A1 |
20100138295 | Carson et al. | Jun 2010 | A1 |
20100158315 | Martin | Jun 2010 | A1 |
20100169389 | Weber et al. | Jul 2010 | A1 |
20100198880 | Petersen | Aug 2010 | A1 |
20100241945 | Chen et al. | Sep 2010 | A1 |
20100250633 | Hannuksela et al. | Sep 2010 | A1 |
20100262916 | Jones et al. | Oct 2010 | A1 |
20100290699 | Adam | Nov 2010 | A1 |
20100315664 | Miers | Dec 2010 | A1 |
20100318611 | Curtin et al. | Dec 2010 | A1 |
20110013845 | Tu | Jan 2011 | A1 |
20110066743 | Hurley et al. | Mar 2011 | A1 |
20110080424 | Peters et al. | Apr 2011 | A1 |
20110099199 | Stalenhoef | Apr 2011 | A1 |
20110137709 | Mayer et al. | Jun 2011 | A1 |
20110138003 | Yoon et al. | Jun 2011 | A1 |
20110150324 | Ngan | Jun 2011 | A1 |
20110161423 | Pratt et al. | Jun 2011 | A1 |
20110167136 | Naimark et al. | Jul 2011 | A1 |
20110183651 | Mundy | Jul 2011 | A1 |
20110208702 | Minde | Aug 2011 | A1 |
20110211737 | Krupka | Sep 2011 | A1 |
20110214077 | Singh et al. | Sep 2011 | A1 |
20110231240 | Schoen et al. | Sep 2011 | A1 |
20110238631 | Cortes et al. | Sep 2011 | A1 |
20110252340 | Thomas | Oct 2011 | A1 |
20110270923 | Jones | Nov 2011 | A1 |
20110276396 | Rathod | Nov 2011 | A1 |
20110276513 | Erhart et al. | Nov 2011 | A1 |
20110295667 | Butler | Dec 2011 | A1 |
20110296536 | Muller et al. | Dec 2011 | A1 |
20120007995 | Barrett | Jan 2012 | A1 |
20120016948 | Sinha | Jan 2012 | A1 |
20120023129 | Vedula et al. | Jan 2012 | A1 |
20120027256 | Kiyohara | Feb 2012 | A1 |
20120030194 | Jain | Feb 2012 | A1 |
20120047147 | Redstone et al. | Feb 2012 | A1 |
20120072428 | Kao et al. | Mar 2012 | A1 |
20120079396 | Neer et al. | Mar 2012 | A1 |
20120082378 | Peters et al. | Apr 2012 | A1 |
20120092685 | Barrett | Apr 2012 | A1 |
20120100869 | Liang et al. | Apr 2012 | A1 |
20120102409 | Fan et al. | Apr 2012 | A1 |
20120109901 | Mase | May 2012 | A1 |
20120114296 | Luo et al. | May 2012 | A1 |
20120122554 | Paquet et al. | May 2012 | A1 |
20120123867 | Hannan | May 2012 | A1 |
20120130823 | Levin | May 2012 | A1 |
20120136689 | Ickman et al. | May 2012 | A1 |
20120153016 | Slaby et al. | Jun 2012 | A1 |
20120158871 | Amano et al. | Jun 2012 | A1 |
20120179664 | Auerbach et al. | Jul 2012 | A1 |
20120213404 | Steiner | Aug 2012 | A1 |
20120214568 | Herrmann | Aug 2012 | A1 |
20120220314 | Altman et al. | Aug 2012 | A1 |
20120246003 | Hart et al. | Sep 2012 | A1 |
20120251011 | Gao | Oct 2012 | A1 |
20120278387 | Garcia | Nov 2012 | A1 |
20120324589 | Nukala et al. | Dec 2012 | A1 |
20130006882 | Galliani | Jan 2013 | A1 |
20130013683 | Elliott | Jan 2013 | A1 |
20130039547 | Liu | Feb 2013 | A1 |
20130066963 | Odio et al. | Mar 2013 | A1 |
20130101220 | Bosworth et al. | Apr 2013 | A1 |
20130117365 | Padmanabhan et al. | May 2013 | A1 |
20130124311 | Sivanandan et al. | May 2013 | A1 |
20130129232 | Cok et al. | May 2013 | A1 |
20130141529 | Sathish | Jun 2013 | A1 |
20130166639 | Shaffer et al. | Jun 2013 | A1 |
20130232251 | Pauley | Sep 2013 | A1 |
20130305287 | Wong et al. | Nov 2013 | A1 |
20140047335 | Lewis et al. | Feb 2014 | A1 |
20140129942 | Rathod | May 2014 | A1 |
20150005010 | Zhang et al. | Jan 2015 | A1 |
20160070809 | Rathus | Mar 2016 | A1 |
20170124385 | Ganong | May 2017 | A1 |
Number | Date | Country |
---|---|---|
101167066 | Apr 2008 | CN |
102265649 | Nov 2011 | CN |
2000-067057 | Mar 2000 | JP |
2004-222056 | Aug 2004 | JP |
2006-101095 | Apr 2006 | JP |
2007-249821 | Sep 2007 | JP |
2008-077445 | Apr 2008 | JP |
2008-146174 | Jun 2008 | JP |
2008-146230 | Jun 2008 | JP |
2010-237751 | Oct 2010 | JP |
2010-263621 | Nov 2010 | JP |
2012-514276 | Jun 2012 | JP |
2009009204 | Jan 2015 | JP |
10-2009-0080063 | Jul 2009 | KR |
10-2010-0120282 | Nov 2010 | KR |
10-2012-0029861 | Mar 2012 | KR |
10-2012-0034600 | Apr 2012 | KR |
2007113462 | Oct 2007 | WO |
2007135871 | Nov 2007 | WO |
2007135971 | Nov 2007 | WO |
2008045701 | Apr 2008 | WO |
2009076555 | Jun 2009 | WO |
2009082814 | Jul 2009 | WO |
2010075049 | Jul 2010 | WO |
2010108157 | Sep 2010 | WO |
2011001587 | Jan 2011 | WO |
2011149961 | Dec 2011 | WO |
2011149961 | Dec 2011 | WO |
2011149961 | Dec 2011 | WO |
WO 2011149961 | Dec 2011 | WO |
Entry |
---|
Unpublished U.S. Appl. No. 13/346,385, filed Jan. 9, 2012. |
Non-Final Rejection, dated Sep. 20, 2013 for U.S. Appl. No. 13/346,385, filed Jan. 9, 2012. |
Korean Notice of Preliminary Rejection received in Korean Patent Application No. 10-2015-7002159 (with Translation), Jan. 26, 2016, 15 pages. |
“Extended European Search Report”, EP Application No. 13737075.5, dated Jan. 13, 2016, 8 Pages. |
USPTO, Final Office Action for U.S. Appl. No. 13/346,385, dated Feb. 5, 2016, 11 pages. |
Notice of Allowance for U.S. Appl. No. 13/661,425, dated Dec. 8, 2015. |
PCT. International Search Report and the Written Opinion of the International Search Authority received in related PCT Application No. PCT/US2013/066414, dated Jan. 29, 2014. |
Final Rejection for U.S. Appl. No. 13/661,425, dated Mar. 10, 2015. |
Non-Final Rejection for U.S. Appl. No. 13/542,379, filed Jul. 5, 2012, dated Nov. 19, 2015. |
Notice of Allowance for Japanese Application No. 2013-554527, dated Nov. 20, 2015. |
Notice of Allowance received for U.S. Appl. No. 13/534,555, filed Jun. 27, 2012, dated Oct. 23, 2015. |
Non-Final Rejection for U.S. Appl. No. 13/661,425, dated Sep. 18, 2014 |
Australian Patent Office. Patent Examination Report No. 1 for Australian Patent Application No. 2013334606, 2 pages. |
Non-Final Rejection received for U.S. Appl. No. 14/571,213, dated Sep. 24, 2015. |
“KIPO Notice of Preliminary Rejection”, Korean Patent Application No. 10-2015-7013481, dated Feb. 5, 2016, 11 Pages. |
“Notice of Reasons for Rejection”, Japanese Application No. 2015-520534, dated Mar. 7, 2016, 9 pages. |
“USPTO”, Notice of Allowance in U.S. Appl. No. 13/534,555, dated Mar. 8, 2016. |
“USPTO,”, Final Rejection in U.S. Appl. No. 13/929,498, dated Feb. 25, 2016. |
“JPO Notice of Reasons for Rejection”, Japanese Application No. 2015-539724, dated Apr. 4, 2016. |
KIPO, Notice of Preliminary Rejection (with English translation) for Korean Patent Application No. 10-2015-7010982, dated Mar. 8, 2016, 9 pages. |
Australian Patent Office, Patent Examination Report No. 2 for Australian Patent Application No. 2012217920, dated Feb. 5, 2016. |
Final Rejection dated May 12, 2015 for U.S. Appl. No. 13/542,379, filed Jul. 5, 2012. |
Non-Final Rejection dated Oct. 3, 2014, U.S. Appl. No. 13/542,379, filed Jul. 5, 2012. |
Notice of Allowance dated Jun. 11. 2015 for U.S. Appl. No. 13/534,555, filed Jun. 27, 2012. |
Non-Final Rejection dated Sep. 30, 2014, U.S. Appl. No. 13/534,555, filed Jun. 27, 2012 |
Notice of Allowance dated Aug. 11, 2015, U.S. Appl. No. 13/050,195, filed Mar. 17, 2011. |
Florian, Alt et al., Location-based Crowdsourcing:Extending Crowdsourcing to the Real World, Oct. 2010, Proceedings NordiCHI Oct. 16-20, 2010, pp. 13-22. |
Final Rejection dated Nov. 7, 2014, U.S. Appl. No. 13/658,490, filed Oct. 23, 2012. |
First Action Interview Office Action dated Jul. 24, 2014, U.S. Appl. No. 13/658,490, filed Oct. 23, 2012. |
Pre-Interview First Office Action dated Mar. 18, 2014, U.S. Appl. No. 13/658,490, filed Oct. 23, 2012. |
International Preliminary Report on Patentability dated Jan. 8, 2015 and International Search Report and Written Opinion From ISA dated Dec. 9, 2014 for related PCT Application No. PCT/US2013/048318. |
Non-Final Rejection, dated Apr. 2, 2013, for U.S. Appl. No. 13/219,835, filed Aug. 29, 2011. |
Non-Final Rejection, dated Oct. 24, 2014, for U.S. Appl. No. 13/219,835, filed Aug. 29, 2011. |
Final Rejection, dated Jun. 4, 2015, U.S. Appl. No. 13/219,835, filed Aug. 29, 2011. |
Non-Final Rejection dated Mar. 28, 2014, U.S. Appl. No. 13/050,195, filed Mar. 17, 2011. |
Final Rejection, dated Oct. 9, 2013, U.S. Appl. No. 13/219,835, filed Aug. 29, 2011. |
Supplementary Search Report in European Application No. 13786816.2, dated Jun. 3, 2016, 7 pp. |
USPTO, Non-final Office Action for U.S. Appl. No. 13/346,385, dated Jun. 30, 2016, 12 pages. |
USPTO, Non-final Office Action for U.S. Appl. No. 13/219,835, dated Jul. 15, 2016, 49 pages. |
Final Office Action, dated Feb. 14, 2014, for U.S. Appl. No. 13/346,385, filed Jan. 9, 2012. |
Notice of Allowance, dated Jan. 24, 2014, U.S. Appl. No. 13/050,195, filed Mar. 17, 2011. |
Office Action, dated Jan. 29, 2013, U.S. Appl. No. 13/050,195, filed Mar. 17, 2011. |
Office Action, dated Sep. 10, 2013, U.S. Appl. No. 13/050,195, filed Mar. 17, 2011. |
Office Action, dated Mar. 28, 2014, U.S. Appl. No. 13/050,195, filed Mar. 17, 2011. |
International Search Report and Written Opinion for corresponding PCT application No. PCT/US2013/066257 dated Apr. 25, 2014. |
Atsushi Hayakawa, “Remarkable Sofware at the Cutting Edge,” MacPeople, ASCII Media Works Inc., Aug. 1, 2009, vol. 15, No. 8, p. 176. |
Non-Final Rejection—dated Jul. 2, 2015, U.S. Appl. No. 13/658,490, filed Oct. 23, 2012. |
Non-Final Rejection, dated Jul. 22, 2015 for U.S. Appl. No. 13/346,385, filed Jan. 9, 2012. |
Japanese Office Action dated Aug. 18, 2015 in Japanese Application No. 2013-554527. |
Non-Final Rejection dated Jul. 15, 2015, U.S. Appl. No. 13/929,498, filed Jun. 27, 2013. |
Examination Report, dated Nov. 25, 2014 for Australian Patent Application No. 2012217920. |
International Preliminary Report on Patentability dated Aug. 21, 2013 for related PCT Application No. PCT/US2012/024874. |
International Search Report dated Aug. 23, 2012 for related PCT Application No. PCT/2012/024874. |
Written Opinion From ISA dated Aug. 18, 2013 for related PCT Application No. PCT/US2012/024874. |
“USPTO”, Notice of Allowance for U.S. Appl. No. 13/658,490, dated Feb. 19, 2016, 40 Pages. |
KIPO, Notice of Allowance in Korean Patent Application No. 10-2015-7010982, dated Sep. 29, 2016. |
KIPO, Notice of Allowance mailed in Korean Patent Application No. 10-2015-7013481, dated Oct. 24, 2016. |
USPTO, Final Office Action for U.S. Appl. No. 13/346,385, dated Oct. 20, 2016, 15 pages. |
“Australian Patent Examination Report No. 3”, in Australian Application No. 2012217920, dated Aug. 19, 2016. |
“KIPO Notice of Last Preliminary Rejection”, in Korean Patent Application No. 10-2015-7002159, dated Aug. 10, 2016. |
JPO, Notice of Reasons for Rejection in Japanese Application No. 2015-520534, dated Jan. 16, 2017, 8 pages. |
Notice of Acceptance for Application No. 2013334606, dated Nov. 18, 2016, 2 pages. |
JPO, Notice of Allowance for U.S. Appl. No. 2015-539724, dated Dec. 12, 2016, 3 pages. |
JPO, Notice of Allowance for Japanese Patent Application No. 2015-538160, dated Dec. 5, 2016, 3 Pages. |
USPTO, Non-Final Rejection in U.S. Appl. No. 13/929,498, dated Feb. 13, 2017, 32 Pages. |
SIPO, Notification of First Office Action mailed in Chinese application No. 201380040026.2, dated Nov. 28, 2016, 25 pages. |
Communication pursuant to Article 94(3) EPC in European Application No. 12711045.0, dated Feb. 10, 2017, 6 pp. |
Final Rejection in U.S. Appl. No. 13/219,835, dated Feb. 27, 2017. |
Notification of First Office Action mailed in Chinese application No. 201380055474.X, dated Feb. 27, 2017, 25 pp. |
First Office Action in Chinese Application No. 201380055926.4, dated May 31, 2017. |
Non-Final Office Action for U.S. Appl. No. 13/346,385, dated Jan. 7, 2017, 18 pp. |
Notice of Allowance in Canadian Application No. 2885504, dated May 2, 2017. |
Notice of Allowance in Korean Application No. 10-2015-7002159, dated Jun. 19, 2017. |
Notice of Final Rejection in Korean Application No. 10-2015-7002159, dated Feb. 10, 2017. |
Office Action mailed in EP Application No. 13737075.5, dated Jul. 6, 2017. |
First Examination Report mailed in Australian Application No. 2016219660, dated May 12, 2017. |
US Office Action mailed in U.S. Appl. No. 13/929,498, dated Jul. 13, 2017. |
US Office Action mailed in U.S. Appl. No. 15/205,602, dated Jul. 13, 2017. |
Notification of Grant in Chinese Application No. 201380040026.2, 3 pages, dated Jul. 27, 2017. |
Decision of Rejection and Decision to Reject the Amendments in Japanese Application No. 2015-520534, 6 pages, dated Aug. 7, 2017. |
Second Examination Report in Australian Application No. 2016219660, 3 pages, dated Sep. 25, 2017. |
Non-Final Office Action in U.S. Appl. No. 13/219,835, 31 pages, dated Dec. 15, 2017. |
Notice of Allowance in U.S. Appl. No. 15/205,602, 33 pages, dated Dec. 12, 2017. |
Notification of Grant in Chinese Application No. 201380055926.4, 3 pages, dated Dec. 1, 2017. |
Final Office Action in U.S. Appl. No. 15/159,188, 14 pages, dated Feb. 3, 2018. |
Non-Final Office Action in U.S. Appl. No. 15/159,188, 36 pages, dated Nov. 2, 2017. |
Second Office Action in Chinese Application No. 201380055474.X, 20 pages, dated Nov. 3, 2017. |
Notice of Allowance in CN Application No. 201380055474.X, 3 pages, dated Feb. 24, 2018. |
Communication under Rule 71(3) in European Patent Application No. 13737075.5, 37 pages, dated Mar. 20, 2018. |
Final Office Action in U.S. Appl. No. 13/219,835, 15 pages, dated May 10, 2018. |
Notice of Allowance for U.S. Appl. No. 15/159,188, 15 pages, dated Jun. 26, 2018. |
Non-Final Office Action in U.S. Appl. No. 15/960,394, 6 pages, dated Jul. 27, 2018. |
Notice of Preliminary Rejection for Korean Patent Application No. 10-2017-7026395, 3 pages, dated Jul. 10, 2018. |
Notice of Allowance in U.S. Appl. No. 15/159,188, 15 pages, dated Jun. 26, 2018. |
Number | Date | Country | |
---|---|---|---|
20140153837 A1 | Jun 2014 | US |
Number | Date | Country | |
---|---|---|---|
61444520 | Feb 2011 | US |
Number | Date | Country | |
---|---|---|---|
Parent | 13219835 | Aug 2011 | US |
Child | 14162708 | US |