Summarization of media object collections

Information

  • Patent Grant
  • 9507778
  • Patent Number
    9,507,778
  • Date Filed
    Friday, May 19, 2006
    18 years ago
  • Date Issued
    Tuesday, November 29, 2016
    7 years ago
Abstract
In one example, an apparatus and method are provided for summarizing (or selecting a representative subset from) a collection of media objects. A method includes selecting a subset of media objects from a collection of geographically-referenced (e.g., via GPS coordinates) media objects based on a pattern of the media objects within a spatial region. The media objects may further be selected based on (or be biased by) various social aspects, temporal aspects, spatial aspects, or combinations thereof relating to the media objects and/or a user. Another method includes clustering a collection of media objects in a cluster structure having a plurality of subclusters, ranking the media objects of the plurality of subclusters, and selection logic for selecting a subset of the media objects based on the ranking of the media objects.
Description
BACKGROUND

Field


The present invention relates generally to systems and methods for the summarization of a collection of media objects, and in one example, to the summarization of a collection of geographically-referenced (or “geo-referenced”) media objects such as still or moving images, audio files, and the like.


Related Art


With the popularization of digital photography, people are now capturing and storing far more photographs than ever before leading to the creation of large collections of photographs. These large collections of photographs are generally difficult to navigate, due to their size and the inability of computers to understand the content of the photographs. Yet, viewing and interacting with such collections has a broad social and practical importance. For example, billions of images, many of which are stored and accessible on the Web, constitute a growing record of our culture and shared experiences. However, the prospect and practicality of viewing these photograph collections in a meaningful way has become difficult.


Some attempts have been made to improve viewing and navigating large collections of photographs. For example, implementations of geographical-referencing (or “geo-referencing”) of digital photographs, whereby photographs are connected to metadata describing the geographic location in which they were taken (whether by GPS, or other location technologies) may improve viewing and navigating large collections. Mobile phones, and especially camera phones, are probably the most accessible ubiquitous computing platforms. Modem camera phones, outfitted with the appropriate software and/or service plan, can associate geographic data with images and increase the number of geo-referenced photographs available online. Already, an increasing number of photographs on the Web are associated with the GPS coordinates at which they were taken. Such geo-referenced photographs can be categorized geographically or displayed on a map, providing a rich spatial context in which to view a collection of photographs.


As photograph collections grow, however, such systems are typically limited by the computing problem of being able to filter, sort, and summarize the collection of photographs in any useful manner. For example, displaying photographs on a digital map inevitably leads to the viewable space becoming cluttered as the number of photographs increases, leading to overlapping photographs and making viewing and finding specific photographs ever more difficult as the collection grows.


BRIEF SUMMARY

According to one aspect of the present invention a system and method for summarizing a collection of media objects is provided.


In one example, an apparatus is provided for summarizing a collection of geographically referenced media objects (e.g., still or moving images, audio files, and the like), the apparatus including selection logic for selecting a subset of the media objects based on a pattern of the media objects within a spatial region. The pattern may relate, for example, to the density and location of the media objects with a particular spatial region of interest.


The selection logic may further select the media objects based on (or be biased by) various social aspects, temporal aspects, spatial aspects, or combinations thereof. For example, aspects of the user such as the identity of the user, social connections, groups, etc., associated with the user and so on may be used to select the summary or subset of media objects. The selection may be based on temporal or spatial aspects of the media objects, as well as various visual features and signal properties of the media objects. Further, the selection may be based on metadata associated with the media objects (where the metadata may include automatically, semi-automatically, or manually associated metadata with the media objects, e.g., whether data, event information, and the like).


In another example, an apparatus is provided for summarizing a collection of media objects from one or more users. The apparatus generally includes clustering logic for clustering a collection of media objects (e.g., still or moving images, audio files, and the like) in a cluster structure (e.g., a hierarchical structure) having a plurality of subclusters, ranking logic for ranking the media objects of the plurality of subclusters, and selection logic for selecting a subset of the media objects based on the ranking of the media objects.


The subset may represent a summary of the collection of media objects according to the particular clustering logic and ranking logic of the apparatus. Further, inputs to the apparatus may bias the selected subset, e.g., by altering the hierarchical cluster structure and/or ranking of the media objects. In various examples, the subset may be based on spatial patterns of the media objects as well as social, temporal, and textual-topical factors. Accordingly, the summary may be biased by the content of the query, the user making the query, the context in which the query is made, or combinations thereof.


In one example, each of the media objects is geographically referenced (e.g., via GPS coordinates or other location technology), and the apparatus further includes logic for displaying the subset of media objects with or overlaying a map. Further, the apparatus may cluster the media objects based on the geographical locations associated with the media objects. Additionally, the apparatus may further comprise logic for selecting the subset of media objects based on a particular zoom level (e.g., a spatial or temporal region), and select a new subset of media objects in response to changing the zoom level, thereby providing a semantic zoom function for the collection of media objects.


The apparatus may further comprise logic for scoring each subcluster according to at least one metadata attribute of the media objects. For example, the metadata attribute may include, but is not limited to, factors such as bias (or relevance), tag-distinguishability, photographer-distinguishability, density, and the sum of image (and/or audio) qualities of the cluster. The apparatus may further interleave the media objects from the subclusters and prioritize the media objects according to the scoring of each subcluster.


In yet another example, the apparatus may select metadata tags associated with the subset of media objects selected. The tags may be displayed with a map of a particular spatial region to form a “tag map.” Additionally, the tags may be displayed in varying sizes and/or colors to indicate aspects of the tags, such as their ranking within the collection, frequency, recency, and so on.


According to another aspect, a method for summarizing a collection of media objects is provided. In one example, a method includes selecting a subset of media objects from a collection of geographically referenced media objects based on a pattern of the media objects within the spatial region. The pattern may relate, for example, to a density of the media objects within the spatial region, and the selection may further be based on other aspects such as social, spatial, temporal, or combinations thereof.


In another example, a method includes clustering a plurality of media objects according to a hierarchical cluster structure, the hierarchical cluster structure having a plurality of subclusters, ranking the media objects of the plurality of subclusters, and selecting a subset of the media objects based on the ranking of the media objects. The displayed media objects may include a geographical reference associated therewith, the method further including displaying the subset of the media objects with a map according to the geographical references


According to another aspect, computer program product including computer-executable program code for summarizing a collection of media objects is provided. In one example, the product comprises program code for selecting a subset of media objects from a collection of geographically referenced media objects based on a pattern of the media objects within the spatial region. The pattern may relate, for example, to a density of the media objects within the spatial region, and the selection may further be based on other aspects such as social, spatial, temporal, or combinations thereof.


In another example, the product comprises program code for clustering a plurality of media objects according to a hierarchical cluster structure, the hierarchical cluster structure having a plurality of subclusters, ranking the media objects of the plurality of subclusters, and selecting a subset of the media objects based on the ranking of the media objects.


The various aspects and examples of the present inventions are better understood upon consideration of the detailed description below in conjunction with the accompanying drawings and claims.





BRIEF DESCRIPTION OF THE DRAWINGS


FIG. 1 illustrates an exemplary environment in which some aspects and examples described herein may by used;



FIGS. 2A and 2B illustrate a display of a collection of media objects and a subset or summary of the media objects, respectively, according to one example;



FIG. 3 illustrates conceptually an exemplary hierarchical clustering according to one example; and



FIG. 4 illustrates an exemplary display of a map having geographically referenced tags according to one example.





DETAILED DESCRIPTION

The following description is presented to enable a person of ordinary skill in the art to make and use the inventions. Descriptions of specific devices, techniques, and applications are provided only as examples. Various modifications to the examples described herein will be readily apparent to those of ordinary skill in the art, and the general principles defined herein may be applied to other examples and applications without departing from the spirit and scope of the inventions. Thus, the present inventions are not intended to be limited to the examples described herein and shown, but are to be accorded the scope consistent with the claims.


For the sake of convenience, at times, digital photographs or still images are used and described as examples of media objects manipulated by the exemplary system, but those skilled in the art will recognize that the various examples apply similarly or equally to other media objects, subject to appropriate modifications and use of other functions where appropriate (e.g., viewing a media object may apply to viewing a still or moving image or listening to an audio media object, such as a soundtrack).



FIG. 1 illustrates an exemplary environment in which some examples of summarizing a collection of media objects as described may be used. In particular, FIG. 1 illustrates a client-server system in which one or more clients 110 may communicate with a media server 100 via a network 112. Media server 100 may include a web server 102 interfacing with network 112 and including http web server logic, for example. Further, media server 100 includes a database 106 for storing media objects and summarization logic 108 for processing one or more collections of media objects stored in database 106 (or otherwise associated with media server 100).


Clients 110 and media server 100 may communicate, e.g., via suitable communication interfaces via a network 112, such as the Internet. Clients 110 and media server 100 may communicate, in part or in whole, via wireless or hardwired communications, such as Ethernet, IEEE 802.11b wireless, or the like. Additionally, communication between clients 110 and media server 100 may include various servers such as a photograph/image server, map server, mail server, mobile server, and the like.


Media server 100 includes logic or is programmed to process media objects and format data, accessed from local or remote databases or other sources of data, for presentation to users of clients 110, preferably in the format discussed in the examples herein. To that end, media server 100 may utilize various Web data interface techniques such as Common Gateway Interface (CGI) protocol and associated applications (or “scripts”), Java® “servlets”, i.e., Java® applications running on the Web server, or the like to present information and receive input from clients 110. Media server 100, although described herein in the singular, may actually comprise plural computers, devices, backends, and the like, communicating (wired and/or wireless) and cooperating to perform some or all of the functions described herein. An exemplary media server is described in U.S. patent application Ser. No. 11/350,635, entitled “MEDIA OBJECT METADATA ASSOCIATION AND RANKING”, and filed Feb. 8, 2006, which is hereby incorporated by reference in its entirety as if fully set forth herein. Of course, media server 100 may be implemented in various fashions and include various hardware, software, or firmware to carry out the examples described herein.


In one example, media server 100 includes various components known in the art, e.g., a scripting engine (such as a PHP scripting engine), an aggregation engine, and the like. A scripting engine may include authentication logic, upload logic, metadata processing logic, and permissions handling logic. The authentication logic authenticates a user signing on to the media server web site. The upload logic may be used to upload from the client to the server data conforming to any media format, e.g., still image (e.g., JPEG, TIFF), video (e.g., MPEG, AVI), or audio (e.g., MP3, OGG). The aggregation engine may include a statistics engine and a search engine. A client for use with the server of the invention may include a typical web browser application.


Metadata processing logic permits a user to enter metadata to describe each image (as used herein, “metadata” may refer to one metadatum or plural metadata). Metadata may take the form ozone or more tags for a media object. Other types of metadata include, e.g., a title, a description of the image, annotations, and comments. Additionally, metadata associated with a device (e.g., device-supplied metadata) such as metadata from a digital camera that took the picture, including metadata regarding time of capture, aperture, shutter speed, and other settings. Such metadata may be extracted, for example, from the EXIF (Exchangeable Image File) header stored inside the uploaded file by many digital cameras, or the IPTC (International Press Telecommunications Council) header stored inside the uploaded file by many photograph management and organization software packages.


Additionally, metadata may include geographical reference data associated with the media object. For example, the device may generate a geographical location (e.g., from a GPS location device, cell identification, or other location technologies). Additionally or alternatively, a user may enter or edit the geographical location associated with a particular media object (either at the time of capture or later).


One or more clients 110 may transfer media objects and/or related metadata to media server 100 for inclusion within database 106. Further, one or more clients 10 may request summaries of a portion or all of the collection of media objects and/or related metadata included with database 106 or otherwise accessible via media server 100. For example, summarization logic 108 may process a collection of media objects stored locally, remotely, or combinations thereof.


In one example, a system and method are described for selecting and displaying a subset (or summary) of a collection of media objects. In one example, media objects of a collection are geographically referenced and pertain generally to a particular spatial region (e.g., a map or categorization of a specified spatial region). An exemplary method and system select a subset of the collection based on a pattern of the media objects within the spatial region. The pattern may be based on spatial aspects, temporal aspects, social aspects (e.g., groups, contacts, connections and the like associated with a particular user or users), or combinations thereof associated with the media objects and/or user. For example, the summary may be based on a pattern of the media objects, e.g., relating to a density of the media objects within a spatial region at particular locations, and also based on one or more characteristics of a user requesting the summary.



FIG. 2A illustrates a display of a collection of geo-referenced media objects 210 pertaining generally to a particular spatial region. In this example, the spatial region is associated with San Francisco, Calif., and accordingly, the display includes a map 200 of San Francisco, Calif., and media objects 210 displayed overlying map 200 according to their associated geo-references. In this example, each media object is represented by a square (or other indicia on the map), which may be selected by a user to access content of the media object. As the number of media objects 210 in the collection grows, the display may become cluttered and crowded, making viewing the collection of media objects difficult.


Exemplary summarization logic (included with media server 100, for example) as described in greater detail below, may produce a summary of the media objects as shown in FIG. 2B based on one or more patterns of the media objects as well as various other social, temporal, and/or spatial aspects of the media objects and/or a user requesting the summary. For example, the system and method may select a subset of media objects 220 for display with the particular spatial region of interest. Such a subset of the media objects 220, referred to herein as a summary of the collection, may enable users to find items more easily and browse more efficiently through large scale geo-referenced photograph collections in a manner that improves rather than degrades with the addition of more photographs. It is noted that map 200 may be generated or stored locally with media server 100, or alternatively generated or stored remotely to media server 100.


Additionally, display logic may present or display the media objects as thumbnail images over map 200, and which may be expanded in response to user input (e.g., scrolling over media object 220a generates the display of a larger image 230). It will be recognized that in some example a client may further expand image 230, download image 230 to a user device, transfer (e.g., via email) image 230 to other clients, and the like.


In other examples, the system could summarize a collection of media objects according to a spatial region without displaying a map. For example, a summary of the collection could be categorized within the database or presented under headings according to the summarization processing and spatial region of interest. In yet other examples, the summary of media objects (or at least data associated therewith) may be supplied to a third party, which may present the summary with a map, advertisements, and the like, for example.


An exemplary system and method having summarization logic may be used in a number of applications. For example, such an algorithm may be used for geographic image search, returning a summary of photographs from a region in response to a search query (that can be specified as a text term or a map region), and the like. The algorithm can be used to assist in map-based browsing of images, for example, by enabling a “semantic zoom,” wherein as a user changes zoom levels, panned to any region, the system displays a subset of images that represent that region. For example, FIG. 2B shows a map of San Francisco in which a limited set of eleven images that were selected by an exemplary system are marked on the map. When the user zooms in, the system logic may operate to generate a new subset or summary of images to display to the user at the new zoom level. Additionally, a user may use the exemplary system and method to browse one's own image collection or a group of other user image collections to get an overview of a location.


Selecting representative media objects from a collection of media objects and for a given spatial region posses several difficulties. For instance, image analysis alone is generally poor at understanding the semantic content of an image, for example, making purely visual relevance insufficient for summarizing a collection of media objects. In collection from multiple users, the biases of one user's data may also bias the selection towards generally insignificant subjects. The notion of relevance is not well defined, and often subjective; it is therefore difficult for an automated system to learn and assess the relevance of photographs without appropriate models of human interest.


In one example, the summarization logic 108 of media server 100 includes metadata-based heuristics associated with patterns in the photographs and users' photographic behavior. An exemplary heuristic includes the premise that photographs taken at a particular geographical location typically imply the presence of something interesting at the particular geographical location; for example, the attention paid to an object is generally an indicator of its importance. Thus, in one example, the summarization logic includes an algorithm operable to input one or more of a multitude of spatial, social, and temporal metadata, such as where the photograph was taken, by whom, at what time, etc., as well as textual-topical patterns in the data, such as textual tags associated with the photograph (e.g., user inputted tags). Furthermore, the algorithm may be adjusted to bias the set of results using various factors such as the social network distance of the photographers to the user making the query.


It is noted that the specific example and algorithms described are illustrative of a specific implementation of selecting a summary of media objects from a collection of media objects. Those of ordinary skill in the art will recognize that other systems and methods, utilizing various algorithms and inputs related to the media objects or the user, may be used to select summaries based on patterns within the collection of media objects. Accordingly, the following example is not intended to be limiting.


In this example, summarization logic 108 operates on a collection of media objects to produce a subset or summary of the collection of media objects. For instance, given a collection of n photographs, A={P1, . . . , PN}, the exemplary method and system determines a permutation π of A such that any k-length prefix of π(A) is a k-element summary of A. It is desired that a summary, generally referring to a subset of the media collection, capture representativeness, relevance, and breadth in the original collection, for example. In one example, a summary is captured through a subset of one or more metadata attributes that are associated with the photographs. Exemplary metadata attributes may include, but are not limited to, any combination of location (e.g., photograph Pi was taken at location (xi, yi)), time (e.g., photograph Pi was taken at time ti), photographer (e.g., photograph Pi was taken by user ui), tags (e.g., photograph Pi was manually assigned the list of textual tags wi), quality (photograph Pi is associated with an externally derived parameter qi that represents its image quality), bias (also referred to herein as “relevance,” e.g., photograph Pi is associated with a relevance factor ri; relevance may include arbitrary biases (or preferences) based on parameters such as recency, time of day, day of the week, social aspects such as a social network of the user, textual tags associated with that photo, etc.), user profiles, and the like.


The system includes logic for selecting a subset of the collection of photographs following a few heuristics, which may be adjusted by a user or the media server. Exemplary heuristics include, for example, that photographs are taken at locations that provide views of some interesting object or landmark, a location is more relevant if photographs were taken at the location by a large number of distinct photographers, and if available, location-specific patterns of textual tags can reflect the presence of interesting landmarks in a location.


It is noted that a distinction is made herein between the location of the camera (or other device used to capture the media object) and the location of the photographed object. For example, most geographic data associated with photographs pertains to the camera location. In some instances the two locations are near each other (for example, when the photograph is of a house or, say, a fountain), while in other cases (a photograph of, say, the Golden Gate Bridge) the camera may be a considerable distance from the object (e.g., miles away). In one example, the system receives as input the location of the camera, and associates the tags with that location even if the photographed object is remote.


In addition to heuristics listed above, an exemplary system may also operate to represent a broad range of subjects, instead of thoroughly display a few, and allow personal or query bias to modify the system's results. For example, an exemplary system may include the flexibility to allow a user to specify a personal bias, or preference, toward any of the available features of the system and/or to utilize implicit bias in the query context and history. For example, a user may bias by any quantifiable feature of the photographs, such as the social distance of the photographer to the user, preference for weekend photographs, the externally determined quality of the image, and the like.


In one example, the system includes logic for producing an ordering of photographs in the collection. Generally, producing the ordering of photographs comprises two broad processes: clustering the photographs of the collection, and ranking the photographs. These processes may be carried out by clustering logic and ranking logic included with summarization logic 108 (see, e.g., FIG. 1).


In one example, the clustering logic may cluster photographs of a media collection based on their respective geographic locations. This may be accomplished by various known clustering methods. In one example, the clustering logic is operable for clustering the photographs based on their geographical locations into a hierarchical clustered structure (for example, having a series of subclusters). The exemplary system further includes ranking logic for ordering the photographs within the cluster generated by the clustering logic. An ordering of the photographs may be generated, for example, by interleaving photographs from the collection subclusters, prioritized according to a calculated score. The ranking logic may then recursively rank the photographs for each of the subclusters, starting from the leaf clusters. A summarization of the photographs, e.g., via a display of the photographs, for a specified spatial region may then be generated based on the ranking of photographs within the collection subclusters.


To illustrate the summarization process and scoring mechanism, an exemplary hierarchical cluster structure is illustrated in FIG. 3. In particular, the leaf nodes represent photographs, each annotated with the identity of the photographer and a single textual tag (in practice, of course, different and additional tags may be used). The tree represents the hierarchy created by the clustering logic of the apparatus or system.


In one example, the clustering logic and particular clustering algorithm may include a Hungarian method, which is known in the art, or a modification thereof. One particular modification to the Hungarian method includes the method described in “The Hungarian Clustering Method,” by Jacob Goldberger and Tamir Tassa, the content of which is published at, http://www.openu.ac.il/Personal_sites/tamirtassa/Publications/hcm.pdf, and which is incorporated herein by reference. Other exemplary clustering methods may include conglomerative clustering, partitional clustering, hierarchical agglomerative, divisive clustering, or the like.


In this example, the clustering logic is generally operable to identify a hierarchy of clusters within a given dataset (e.g., generated from the collection of media objects) of points in n dimensions, based only on the distances between those points. The input to that algorithm is a set of points in the plane

A={(xi,yicustom character,,1≦i≦n},  (1)

and the output is a clustering of those points C(A), where C(A) is a tree; each node in the tree represents a subset of A; and the children of each node are a partition (or clustering) of the subset that is associated with that node.


Given a hierarchical clustering based on the locations of the photographs, for example, the ranking logic is operable to produce a ranking of each object or item in the collection. In one example, the ranking logic first assigns a score to each cluster, and performs a recursive interleaving algorithm that uses the clustered structure and the corresponding scores in order to produce a natural flat ordering. For example, given a hierarchical clustering C(A) of A, where A is possibly itself a subcluster in a larger hierarchy, the algorithm outputs a permutation π on A that represents ranking on A. That ordered sequence is denoted henceforth by S=π(A).


Assume that m subclusters are identified in A, A=Ui−1m=Ai, and that

f(A1)≧f(A2)≧. . . f(Am)

where f represents a black box determining the cluster score. In one example, each cluster represents a different site or focal point in the area where the photographs were taken. Moreover, the subclusters of each of the clusters may represent different locations within the corresponding site.


In one example, it is desired that the ranking logic produce a ranking that would balance the contradicting properties of depth and breadth of coverage. For example, consider the second level of the exemplary hierarchy shown in FIG. 3, which includes two clusters C2 and C3, and assume f(C2):f(C3)=5:3. In one example, the system interleaves the photographs from the two clusters so that in any section of the sequence S, the frequencies of photographs from the clusters relate to each other as closely as possible to their score ratio in the whole dataset, i.e., 5:3. On the other hand, for purposes of breadth, it is desired that each reasonably good subcluster should be at least somewhat represented early in the ranking of its parent.


Accordingly, in an attempt to balance some amount of depth, breadth, and consistency according to one example, the summarization logic and algorithm assumes that the photographs in each subcluster of a current A have been ranked recursively according to the algorithm. The ordered sequence of photographs for A will then have two parts: a short header H followed by a trailer T, where S(A)=H∥T.


The header H will include a photograph from all prominent clusters. To that end, a threshold 0<w<1 is defined and a cluster Ai is deemed prominent if








f


(

A
i

)






j
=
1

m







f


(

A
j

)






w
.






Assume that there are m′ prominent clusters among the m clusters, with 0≦m′≦m. Then the header is

H=(A1,1,A2,1 . . . Am′,1),

where Ai,j means the jth most relevant photograph from cluster Ai.


Next, a trailer is generated. In one example, each cluster is assigned a probability that equals its score divided by the sum of scores of all clusters. These probabilities are then used to randomly select a cluster. If cluster Ai was selected, its top-ranked remaining photograph is removed and appended to T and the score and probability of that cluster is recalculated to reflect the removal of its top photo. The process of selecting photographs and appending them to the trailer is repeated until all photographs have been selected.


The score of a cluster Ai may depend on several factors or attributes of the clusters, including, for example, the following (which will be described in greater detail below):


The sum of bias factors (e.g., relevance) of all photographs in the cluster,







ρ
i

=





P
j



A
i






r
j

.






The tag-distinguishability of the cluster, τi.


The photographer-distinguishability of the cluster, øi.


The density of the cluster. More specifically, let σx,i and σy,i denote the standard deviation of the x and y coordinates, respectively, of all points in Ai, and let

σi=((σx,i)2+(σy,i)2)1/2.


The cluster density may be defined as

δi=1/(1+σi).   (2)


The sum of image qualities of all photographs in the cluster,







κ
i

=





P
j



A
i






q
j

.






It is noted that while most of the above factors may be derived from data that is contained in the collection of media objects (e.g., included with the metadata), the bias factor depends on subjective requirements that are introduced through the query to the photograph collection (e.g., set by the system for a particular application or by a user via their particular request).


Bias (relevance) Factors: In one example, the bias factor ri of a photograph Pi may depend on one or more parameters such as recency, the time of day, the time of the week, the photographer, textual tags associated with that photo, and the like. Each photograph may be assigned a score θ(Pi) in the range [0,1] for each such parameter. The final bias score can be a weighted average of all these scores, which is the bias score ri of photograph Pi. The amount to which each feature contributes to the overall bias calculation can be specified by a user, or set by the system according to the application.


For example, a user may request photographs taken during the day, or by a set of one or more photographers (e.g., their contacts, friends, family, etc.). These inputs will weight the bias factors accordingly, thereby biasing the results per the user query.


Tag distinguishability of the cluster: In one example, tag distinguishability aims to detect distinct or unique concepts that are represented by a given cluster by examination of the tags. The assumption is that the more unique concepts a cluster represents, the more semantically meaningful a cluster tends to be. For example, in FIG. 2, the tag “bridge” appears in two photographs from Cluster 2, and does not appear elsewhere. As a consequence, the score of Cluster 2 improves. On the other hand, the tag “car” appears in photographs from both Cluster 2 and Cluster 3 and therefore does not help to distinguish either cluster over the other.


Formally, each photography Pj, 1≦j≦n, is tagged with tags that are drawn from a finite dictionary. Let Ft,i denote the frequency (count) of t in Ai, (the usual term frequency of the tag/term t in the cluster/document Ai, as often used in information retrieval). There are several ways to measure how the term t distinguishes the cluster Ai from other clusters. Denoting such measures by Tt,I; the usual measure in information retrieval is the tf-idf weight (where term frequency—inverse document frequency is also familiar and well known in the art of information retrieval). The measure is defined as

Tt,i:=tfidft,i=tft,i·idft,   (3)

where, tft,i=Ft,i, while










idf
t

=

n



{


P
j



A
:

t


T


(

P
j

)





}








(
4
)








is a measure of the overall frequency of the tag t in the entire photograph collection. Another alternative to (3) which is used in information retrieval is

Tt,i:=tfidft,i=tft,i·log(idft).   (5)


Large values of both weights indicate that the number of occurrences of t in Ai is large with respect to its number of occurrences elsewhere.


It is noted that in the usual tf-idf weight, the document-frequency is defined as the frequency of clusters in which the tag appears, as opposed to the frequency of actual tag occurrences. However, the usual definition is generally not suitable for cases where the number of clusters (documents) is small. In such cases, a single random occurrence of a tag in a cluster may have a significant effect on the usual measure, while in this instance it would be hardly noticeable.


Next, an overall tag-distinguishability measure for Ai, Ti, is defined based on the tag-distinguishability measures of all tags in the cluster, {Tt,i: t ε T}. The overall score may be computed by using the Euclidean measure based on the 12-norm,










τ
i

=



(




t

T




τ

t
,
i

2


)


1
/
2


.





(
6
)







Photographer distinguishability of clusters: In one example, a measure of photographer distinguishability (or user distinguishability) is determined, which may indicate how much a given cluster is associated with a small number of photographers, making the cluster less likely to be semantically meaningful. For example, in FIG. 3, all photographs in Cluster 3 were taken by the same user (U3), and that that user did not take any photographs at other locations. This may suggest that Cluster 3 may have less general appeal than, for example, Cluster 2 in FIG. 3, which includes photographs from two users (U1 and U2).


Hence, much like for tags, a tf-idf-like score for the correlation between a cluster Ai and a photographer u may be used. For example, let Bu denote the set of locations of photographs that were taken by the photographer u (as with the set A, (1), of all photograph locations, Bu is a multiset, in the sense that it may include repeated values). The score may then be given by

φu,i:=tfu,i·idfu   (7)

where










tf

u
,
i


=





A
i



B
u







A
i








(
8
)







idf
u

=


n



B
u




.





(
9
)








and


Note that (7) and (9) are equivalent to (3) and (4), respectively. As previously, compare (5) with (3), and (7) may be replaced with

φu,i:=tfu,i·log(idfu).   (10)


Finally, the overall photographer-distinguishability may then be defined, in this example, as:










ϕ
i

=



(



u



ϕ

u
,
i

2


)


1
/
2


.





(
11
)







When dealing with tag-distinguishability, the more a given cluster is associated with some tags, the more it is conceived as a ‘well-defined’ cluster that has prominent distinguishability from other clusters. Photographer-distinguishability, on the other hand, has an opposite effect. The more a given cluster is associated with a single photographer (or few photographers), the less interesting that cluster becomes.


Overall Cluster Score: The score s(Ai) of the cluster Ai depends, in one example, in a monotonically increasing manner on the bias factor, ρi, and the image quality factor, κi. It also depends in a monotonically increasing manner on the density measure of the cluster, δi, (2). The score s(Ai) may also depend in a monotonically increasing manner on Ti, the tag-distinguishability measure of the cluster. Finally, the score may depend in a monotonically increasingly manner on øi−1, the inverse photographer-distinguishability measure of the cluster, as discussed above. Therefore, the overall score may be represented as

h(κii,Tii−1)·ρi   (12)

where h is, for example, a weighted average of its variables, and the weights may be chosen and fine-tuned by experimentation.


It will be understood that the above scoring methods are illustrative of some exemplary methods in which a system may score clusters, and is not intended to be exhaustive or limiting. In other examples, additional or different factors may be used. Additionally, similar factors as described herein, such as bias factors, tag-distinguishability of clusters, etc., may be determined in alternative manners.


A media server including summarization logic as described herein has a number of possible applications and uses. In one example, the media server and summarization logic may be used to as part of or to support a “semantic zoom” application using a large collections of digital images (or other media objects), or assist in browsing/searching a large collection of media objects by initially showing summarized results.


Semantic zoom generally refers to changing the space of interest in which the media objects are related, such as a map, timeline, or combination thereof, where the zoom or change in space is accompanied by a corresponding shift in the level of content represented on the map or timeline. In the example of a spatial map, this may include presenting to a user a number of photographs appropriate to an initial or current zoom level for a given spatial map. The system selects images for display according to the summarization logic (e.g., based on a determined pattern, the particular ranking, etc.). As the user zooms in, more photographs (e.g., that were ranked lower) are revealed, thus bringing the content into more detail. At any zoom level, panned to any region, the system and associated logic automatically displays a summary of photographs that represent that region per the particular summarization logic inputs. Given an ordering on a collection of photographs, a system may quickly display a summary of photographs for varying levels in response to user input. When viewing any region, the system may display the k best photographs that were taken within that region. Alternatively, the system may display a fixed number of photographs for any zoom level, letting the number of photographs that appear in a particular region at that level implicitly correspond to the relevance of that particular region.


In addition, the exemplary summarization logic and algorithm described may be used to generate or seed “tag maps,” e.g., a visualization for geo-referenced collections based on textual tags that are associated with the data. FIG. 4 illustrates an exemplary tag map 400 based on a manipulation by a summarization logic as described herein. Tag map 400 displays tags 430, e.g., textual topics, that are associated with specific locations on a map. Tags that are deemed relevant (e.g., according to summarization logic or methods described) may be shown at the location where they “occur” (e.g., based on their geo-locations or user supplied metadata), and in one example may be displayed in a size that corresponds to the tag's importance (which may be based on various attributes of the collection, system, or user), as shown in FIG. 4.


In this example, exemplary summarization logic and methods as described herein generated tag map 400, which represents photo-taking in San Francisco, Calif. Rather than display representative photographs at their respective locations (e.g., as shown in FIG. 2B), this example conveys concepts represented in the dataset through the metadata tags themselves. Further, note that in this example, tags 430 displayed with tag map 400 represent “photograph spots” and not necessarily the locations of the object themselves. For example, the “Golden Gate Bridge” tags, which are shown in multiple locations, are in locations other than the physical location of the Golden Gate Bridge.


In one example, in the tag-distinguishability process described previously, a tag-distinguishability score τi is calculated for each cluster Ai at each level of the hierarchy. In the process, an individual score τt,i is calculated for each tag t. This tag score, as a variant of tf-idf, can be thought of as a measure for how well and how uniquely t represents Ai. Thus, consider the following mapping: for some ‘natural’ level of the hierarchy, (to be determined later) let qi be the tag t ε T that maximizes τt,i. The displayed size of the tag corresponds to its score. In this example, the tags are displayed above the centroids of their given cluster on the map. Additionally, in other examples, other types of information can be encoded in the tag map; for example, recency can be represented via the color of the tag text.


Various aspects described may also be combined in various manners. For example, a tag map can be displayed or selected at different zoom levels via process and methods describe with respect to the zoom aspects. Moreover, tag maps may be used for collections other than geo-referenced photographs: e.g. for visualizing popular search keywords from different areas on the map.


Additionally, the various aspects and examples may be combined or used with other known methods and system. In one example, the exemplary system may operate to select a subset of a collection of media objects (stored remotely or locally) as described herein in response to a search request or function. For example, a subset may be returned or included with search results when a text, image, or other search is performed on an object that is recognized by the system as a spatial object (e.g., Germany, San Francisco, Central Park, or the like).


The various aspects and examples of the inventions can be implemented in any suitable form including hardware, software, firmware or any combination of these. Different aspects of the invention may be implemented at least partly as computer software or firmware running on one or more data processors and/or digital signal processors. The elements and components of an embodiment of the invention may be physically, functionally, and logically implemented in any suitable way. Indeed the functionality may be implemented in a single unit, in a plurality of units or as part of other functional units. As such, the invention may be implemented in a single unit or may be physically and functionally distributed between different units and processors.


Although the present invention has been described in connection with some embodiments, it is not intended to be limited to the specific form set forth herein. Rather, the scope of the present invention is limited only by the claims. Additionally, although a feature may appear to be described in connection with a particular embodiment, one skilled in the art would recognize that various features of the described embodiments may be combined in accordance with the invention. Moreover, aspects of the invention describe in connection with an embodiment may stand alone as an invention.


Moreover, it will be appreciated that various modifications and alterations may be made by those skilled in the art without departing from the spirit and scope of the invention. The invention is not to be limited by the foregoing illustrative details, but is to be defined according to the claims.

Claims
  • 1. An apparatus comprising: a processor; anda storage medium for tangibly storing thereon program logic for execution by the processor, the program logic comprising:receiving logic executed by the processor for receiving, from a client device operated by a user, a query for a summary of media objects;determining logic, executed by the processor, for determining metadata associated with each of the media objects;summarization logic executed by the processor for summarizing a subset of the media objects into a collection based on both a pattern of the media objects within a spatial region and based on a social network of the user, the summarizing logic comprising heuristics associated with the patterns and the metadata for use with the summarizing, the summarization logic further comprising selection logic for selecting the subset based upon an identity of the user and a characteristic associated with the user; andgenerating logic executed by the processor for generating a visualization for the collection based on textual tags that are associated with the metadata, where a textual tag deemed relevant is displayed in the visualization in a size that corresponds to an importance of the relevant textual tag, the importance of the relevant textual tag based on attributes of the collection.
  • 2. The apparatus of claim 1, wherein the pattern relates to a density of the media objects within the spatial region.
  • 3. The apparatus of claim 1, further comprising selection logic for selecting the subset based upon a temporal aspect of the media objects.
  • 4. The apparatus of claim 3, wherein the temporal aspect relates to recency of the media objects.
  • 5. The apparatus of claim 1, further comprising selection logic for selecting the subset based on a visual feature of the media objects.
  • 6. The apparatus of claim 1, further comprising selection logic for selecting the subset based on text associated with the media objects.
  • 7. The apparatus of claim 1, further comprising selection logic for selecting the subset based on data associated with the media objects.
  • 8. The apparatus of claim 7, wherein the data comprises a user generated tag.
  • 9. The apparatus of claim 1, wherein the query comprises a search query, the search query on an object having a spatial aspect.
  • 10. A method comprising: receiving, by a computing device from a client device operated by a user, a query for a summary of media objects;determining, by the computing device, metadata associated with each of the media objects;summarizing, by the computing device, a subset of the media objects into a collection based on both a pattern of the media objects within a spatial region and based on a social network of the user, the summarizing logic comprising heuristics associated with the patterns and the metadata for use with the summarizing, the summarization logic further comprising selection logic for selecting the subset based upon an identity of the user and a characteristic associated with the user; andgenerating, by the computing device, a visualization for the collection based on textual tags that are associated with the metadata, where a textual tag deemed relevant is displayed in the visualization in a size that corresponds to an importance of the relevant textual tag, the importance of the relevant textual tag based on attributes of the collection.
  • 11. The method of claim 10, wherein the pattern relates to a density of the media objects within the spatial region.
  • 12. The method of claim 10, wherein the summarizing further comprises selecting the subset based upon a temporal aspect of the media objects.
  • 13. The method of claim 10, wherein the summarizing further comprises selecting the subset based on a visual feature of the media objects.
  • 14. The method of claim 10, wherein the summarizing further comprises selecting the subset based on text associated with the media objects.
  • 15. The method of claim 10, wherein the summarizing further comprises selecting the subset based on data associated with the media objects.
  • 16. The method of claim 15, wherein the data comprises a user generated tag.
  • 17. The method of claim 10, wherein the query comprises a search query, the search query on an object having a spatial aspect.
  • 18. A non-transitory computer readable storage medium comprising computer-executable instructions executed by a processor for summarizing a collection of media objects, the instructions for: receiving, by the processor from a client device operated by a user, a query for a summary of media objects;determining, by the processor, metadata associated with each of the media objects;summarizing, by the processor, a subset of the media objects into a collection based on both a pattern of the media objects within a spatial region and based on a social network of the user, the summarizing logic comprising heuristics associated with the patterns and the metadata for use with the summarizing, the summarizing further comprising selecting, by the processor, the subset based upon an identity of the user and a characteristic associated with the user; andgenerating, by the processor, a visualization for the collection based on textual tags that are associated with the metadata, where a textual tag deemed relevant is displayed in the visualization in a size that corresponds to an importance of the relevant textual tag, the importance of the relevant textual tag based on attributes of the collection.
  • 19. The non-transitory computer readable storage medium of claim 18, wherein the pattern relates to a density of the media objects within the spatial region.
  • 20. The non-transitory computer readable storage medium of claim 18, wherein the summarizing further comprises selecting the subset based upon a temporal aspect of the media objects.
  • 21. The non-transitory computer readable storage medium of claim 18, wherein the summarizing further comprises selecting the subset based on a visual feature of the media objects.
  • 22. The non-transitory computer readable storage medium of claim 18, wherein the summarizing further comprises selecting the subset based on data associated with the media objects.
  • 23. The non-transitory computer readable storage medium of claim 22, wherein the data comprises a user generated tag.
  • 24. The non-transitory computer readable storage medium of claim 18, wherein the query comprises a search query, the search query on an object having a spatial aspect.
US Referenced Citations (380)
Number Name Date Kind
5446891 Kaplan et al. Aug 1995 A
5493692 Theimer et al. Feb 1996 A
5583763 Ateheson et al. Dec 1996 A
5651068 Klemba et al. Jul 1997 A
5761662 Dasan Jun 1998 A
5764906 Edelstein et al. Jun 1998 A
5781879 Arnold et al. Jul 1998 A
5784365 Ikeda Jul 1998 A
5794210 Goldhaber et al. Aug 1998 A
5802510 Jones Sep 1998 A
5835087 Herz Nov 1998 A
5903848 Takahashi May 1999 A
5920854 Kirsch et al. Jul 1999 A
6014638 Burge et al. Jan 2000 A
6021403 Horvitz et al. Feb 2000 A
6047234 Cherveny et al. Apr 2000 A
6098065 Skillen et al. Aug 2000 A
6112181 Shear et al. Aug 2000 A
6157924 Austin Dec 2000 A
6169992 Beall et al. Jan 2001 B1
6212552 Biliris et al. Apr 2001 B1
6266667 Olsson Jul 2001 B1
6314365 Smith Nov 2001 B1
6314399 Deligne et al. Nov 2001 B1
6324519 Eldering Nov 2001 B1
6327590 Chidlovskii et al. Dec 2001 B1
6446065 Nishioka et al. Sep 2002 B1
6490698 Horvitz et al. Dec 2002 B1
6502033 Phuyal Dec 2002 B1
6523172 Martinez-Guerra et al. Feb 2003 B1
6571279 Herz et al. May 2003 B1
6601012 Horvitz et al. Jul 2003 B1
6662195 Langseth et al. Dec 2003 B1
6665640 Bennett et al. Dec 2003 B1
6694316 Langseth et al. Feb 2004 B1
6701311 Biebesheimer et al. Mar 2004 B2
6701315 Austin Mar 2004 B1
6708203 Maker et al. Mar 2004 B1
6731940 Nagendran May 2004 B1
6741980 Langseth et al. May 2004 B1
6757661 Blaser et al. Jun 2004 B1
6773344 Gabai et al. Aug 2004 B1
6781920 Bates et al. Aug 2004 B2
6785670 Chiang et al. Aug 2004 B1
6789073 Lunenfeld Sep 2004 B1
6813501 Kinnunen et al. Nov 2004 B2
6816850 Culliss Nov 2004 B2
6829333 Frazier Dec 2004 B1
6834195 Brandenberg et al. Dec 2004 B2
6842761 Diamond et al. Jan 2005 B2
6845370 Burkey et al. Jan 2005 B2
6850252 Hoffberg Feb 2005 B1
6853913 Cherveny et al. Feb 2005 B2
6853982 Smith et al. Feb 2005 B2
6882977 Miller Apr 2005 B1
6904160 Burgess Jun 2005 B2
6931254 Egner et al. Aug 2005 B1
6961660 Underbrink et al. Nov 2005 B2
6961731 Holbrook Nov 2005 B2
6985839 Motamedi et al. Jan 2006 B1
7010492 Bassett et al. Mar 2006 B1
7027801 Hall et al. Apr 2006 B1
7058508 Combs et al. Jun 2006 B2
7058626 Pan et al. Jun 2006 B1
7062510 Eldering Jun 2006 B1
7065345 Carlton et al. Jun 2006 B2
7065483 Decary et al. Jun 2006 B2
7069308 Abrams Jun 2006 B2
7073129 Robarts et al. Jul 2006 B1
7110776 Sambin Sep 2006 B2
7143091 Charnock et al. Nov 2006 B2
7149696 Shimizu et al. Dec 2006 B2
7181438 Szabo Feb 2007 B1
7185286 Zondervan Feb 2007 B2
7194512 Creemer et al. Mar 2007 B1
7203597 Sato et al. Apr 2007 B2
7209915 Taboada et al. Apr 2007 B1
7219013 Young et al. May 2007 B1
7236969 Skillen et al. Jun 2007 B1
7254581 Johnson et al. Aug 2007 B2
7257570 Riise et al. Aug 2007 B2
7305445 Singh et al. Dec 2007 B2
7320025 Steinberg et al. Jan 2008 B1
7343364 Bram et al. Mar 2008 B2
7395507 Robarts et al. Jul 2008 B2
7404084 Fransdonk Jul 2008 B2
7437312 Bhatia et al. Oct 2008 B2
7451102 Nowak Nov 2008 B2
7461168 Wan Dec 2008 B1
7496548 Ershov Feb 2009 B1
7522995 Nortrup Apr 2009 B2
7529811 Thompson May 2009 B2
7562122 Oliver et al. Jul 2009 B2
7577665 Rameer et al. Aug 2009 B2
7584215 Saari et al. Sep 2009 B2
7624104 Berkhin et al. Nov 2009 B2
7624146 Brogne et al. Nov 2009 B1
7634465 Sareen et al. Dec 2009 B2
7657907 Fennan et al. Feb 2010 B2
7681147 Richardson-Bunbury et al. Mar 2010 B2
7725492 Sittig et al. May 2010 B2
7729901 Richardson-Bunbury et al. Jun 2010 B2
7769740 Martinez Aug 2010 B2
7769745 Naaman Aug 2010 B2
7783622 Vandermolen et al. Aug 2010 B1
7792040 Nair et al. Sep 2010 B2
7802724 Nohr Sep 2010 B1
7822871 Stolorz et al. Oct 2010 B2
7831586 Reitter et al. Nov 2010 B2
7865308 Athsani Jan 2011 B2
7925708 Davis Apr 2011 B2
20010013009 Greening et al. Aug 2001 A1
20010035880 Musatov et al. Nov 2001 A1
20010047384 Croy Nov 2001 A1
20010052058 Ohran Dec 2001 A1
20020014742 Conte et al. Feb 2002 A1
20020019849 Tuvey et al. Feb 2002 A1
20020019857 Harjanto Feb 2002 A1
20020023091 Silberberg et al. Feb 2002 A1
20020023230 Bolnick et al. Feb 2002 A1
20020035605 McDowell et al. Mar 2002 A1
20020049968 Wilson et al. Apr 2002 A1
20020052786 Kim et al. May 2002 A1
20020052875 Smith et al. May 2002 A1
20020054089 Nicholas May 2002 A1
20020065844 Robinson et al. May 2002 A1
20020069218 Sull et al. Jun 2002 A1
20020099695 Abajian et al. Jul 2002 A1
20020103870 Shouji Aug 2002 A1
20020111956 Yeo et al. Aug 2002 A1
20020112035 Carey Aug 2002 A1
20020133400 Terry et al. Sep 2002 A1
20020138331 Hosea et al. Sep 2002 A1
20020152267 Lennon Oct 2002 A1
20020169840 Sheldon et al. Nov 2002 A1
20020173971 Stirpe et al. Nov 2002 A1
20020178161 Brezin et al. Nov 2002 A1
20020198786 Tripp et al. Dec 2002 A1
20030008661 Joyce et al. Jan 2003 A1
20030009367 Morrison Jan 2003 A1
20030009495 Adjaoute Jan 2003 A1
20030027558 Eisinger Feb 2003 A1
20030032409 Hutcheson et al. Feb 2003 A1
20030033331 Sena et al. Feb 2003 A1
20030033394 Stine et al. Feb 2003 A1
20030065762 Stolorz et al. Apr 2003 A1
20030069877 Grefenstette et al. Apr 2003 A1
20030069880 Harrison et al. Apr 2003 A1
20030078978 Lardin et al. Apr 2003 A1
20030080992 Haines May 2003 A1
20030126250 Jhanji Jul 2003 A1
20030149574 Rudman Aug 2003 A1
20030154293 Zmolek Aug 2003 A1
20030165241 Fransdonk Sep 2003 A1
20030191816 Landress et al. Oct 2003 A1
20040010492 Zhao et al. Jan 2004 A1
20040015588 Cotte Jan 2004 A1
20040030798 Andersson et al. Feb 2004 A1
20040034752 Ohran Feb 2004 A1
20040043758 Sorvari et al. Mar 2004 A1
20040044736 Austin-Lane et al. Mar 2004 A1
20040070602 Kobuya et al. Apr 2004 A1
20040139025 Coleman Jul 2004 A1
20040139047 Rechsteiner Jul 2004 A1
20040148341 Cotte Jul 2004 A1
20040152477 Wu et al. Aug 2004 A1
20040183829 Kontny et al. Sep 2004 A1
20040201683 Murashita et al. Oct 2004 A1
20040203851 Vetro et al. Oct 2004 A1
20040203909 Koster Oct 2004 A1
20040205629 Rosenholtz Oct 2004 A1
20040209602 Joyce et al. Oct 2004 A1
20040243623 Ozer et al. Dec 2004 A1
20040260804 Grabarnik et al. Dec 2004 A1
20040267880 Patiejunas Dec 2004 A1
20050005242 Hoyle Jan 2005 A1
20050015451 Sheldon et al. Jan 2005 A1
20050015599 Wang et al. Jan 2005 A1
20050050027 Yeh Mar 2005 A1
20050050043 Pyhalammi et al. Mar 2005 A1
20050055321 Fratkina Mar 2005 A1
20050060381 Huynh et al. Mar 2005 A1
20050065950 Chaganti et al. Mar 2005 A1
20050065980 Hyatt et al. Mar 2005 A1
20050076060 Finn et al. Apr 2005 A1
20050086187 Grosser et al. Apr 2005 A1
20050105552 Osterling May 2005 A1
20050108213 Riise et al. May 2005 A1
20050120006 Nye Jun 2005 A1
20050131727 Sezan Jun 2005 A1
20050149397 Morgenstern et al. Jul 2005 A1
20050151849 Fitzhugh et al. Jul 2005 A1
20050159220 Wilson et al. Jul 2005 A1
20050159970 Buyukkokten et al. Jul 2005 A1
20050160080 Dawson Jul 2005 A1
20050165699 Hahn-Carlson Jul 2005 A1
20050166240 Kim Jul 2005 A1
20050171955 Hull et al. Aug 2005 A1
20050177385 Hull et al. Aug 2005 A1
20050182824 Cotte Aug 2005 A1
20050183110 Anderson Aug 2005 A1
20050187786 Tsai Aug 2005 A1
20050192025 Kaplan Sep 2005 A1
20050203801 Morgenstern et al. Sep 2005 A1
20050216295 Abrahamsohn Sep 2005 A1
20050216300 Appelman et al. Sep 2005 A1
20050219375 Hasegawa et al. Oct 2005 A1
20050234781 Morgenstern Oct 2005 A1
20050273510 Schuh Dec 2005 A1
20060020631 Cheong Wan et al. Jan 2006 A1
20060026013 Kraft Feb 2006 A1
20060026067 Nicholas et al. Feb 2006 A1
20060026170 Kreitler et al. Feb 2006 A1
20060031108 Oran Feb 2006 A1
20060036588 Frank et al. Feb 2006 A1
20060040719 Plimi Feb 2006 A1
20060047563 Wardell Mar 2006 A1
20060047615 Ravin Mar 2006 A1
20060053058 Hotchkiss et al. Mar 2006 A1
20060069612 Hurt et al. Mar 2006 A1
20060069616 Bau Mar 2006 A1
20060069749 Herz et al. Mar 2006 A1
20060074853 Liu et al. Apr 2006 A1
20060085392 Wang et al. Apr 2006 A1
20060085419 Rosen Apr 2006 A1
20060089876 Boys Apr 2006 A1
20060106847 Eckardt et al. May 2006 A1
20060116924 Angeles et al. Jun 2006 A1
20060123053 Scannell, Jr. Jun 2006 A1
20060129313 Becker Jun 2006 A1
20060129605 Doshi Jun 2006 A1
20060161894 Oustiougov et al. Jul 2006 A1
20060168591 Hunsinger et al. Jul 2006 A1
20060173838 Garg et al. Aug 2006 A1
20060173985 Moore Aug 2006 A1
20060178822 Lee Aug 2006 A1
20060184508 Fuselier et al. Aug 2006 A1
20060184579 Mills Aug 2006 A1
20060212330 Savilampi Sep 2006 A1
20060212401 Amerally et al. Sep 2006 A1
20060227945 Runge et al. Oct 2006 A1
20060235816 Yang et al. Oct 2006 A1
20060236257 Othmer et al. Oct 2006 A1
20060242126 Fitzhugh Oct 2006 A1
20060242139 Butterfield et al. Oct 2006 A1
20060242178 Butterfield et al. Oct 2006 A1
20060242259 Vallath et al. Oct 2006 A1
20060258368 Granito et al. Nov 2006 A1
20060282455 Lee Dec 2006 A1
20070013560 Casey Jan 2007 A1
20070015519 Casey Jan 2007 A1
20070032244 Counts et al. Feb 2007 A1
20070043766 Nicholas et al. Feb 2007 A1
20070067104 Mays Mar 2007 A1
20070067267 Ives Mar 2007 A1
20070072591 McGary et al. Mar 2007 A1
20070073583 Grouf et al. Mar 2007 A1
20070073641 Perry et al. Mar 2007 A1
20070086061 Robbins Apr 2007 A1
20070087756 Hoffberg Apr 2007 A1
20070088852 Levkovitz Apr 2007 A1
20070100956 Kumar May 2007 A1
20070112762 Brubaker May 2007 A1
20070115373 Gallagher et al. May 2007 A1
20070121843 Atazky et al. May 2007 A1
20070130137 Oliver et al. Jun 2007 A1
20070136048 Richardson-Bunbury et al. Jun 2007 A1
20070136235 Hess Jun 2007 A1
20070136256 Kapur et al. Jun 2007 A1
20070136689 Richardson-Bunbury et al. Jun 2007 A1
20070143345 Jones et al. Jun 2007 A1
20070150168 Balcom et al. Jun 2007 A1
20070150359 Lim et al. Jun 2007 A1
20070155411 Morrison Jul 2007 A1
20070161382 Melinger et al. Jul 2007 A1
20070162850 Adler Jul 2007 A1
20070168430 Brun et al. Jul 2007 A1
20070173266 Barnes Jul 2007 A1
20070179792 Kramer Aug 2007 A1
20070185599 Robinson et al. Aug 2007 A1
20070185858 Lu Aug 2007 A1
20070192299 Zuckerberg et al. Aug 2007 A1
20070198506 Attaran Rezaei et al. Aug 2007 A1
20070198563 Apparao et al. Aug 2007 A1
20070203591 Bowerman Aug 2007 A1
20070219708 Brasche et al. Sep 2007 A1
20070233585 Ben Simon et al. Oct 2007 A1
20070239348 Cheung Oct 2007 A1
20070239517 Chung et al. Oct 2007 A1
20070259653 Tang et al. Nov 2007 A1
20070260508 Barry et al. Nov 2007 A1
20070260604 Haeuser et al. Nov 2007 A1
20070271297 Jaffe et al. Nov 2007 A1
20070271340 Goodman et al. Nov 2007 A1
20070273758 Mendoza et al. Nov 2007 A1
20070276940 Abraham et al. Nov 2007 A1
20070282621 Altman et al. Dec 2007 A1
20070282675 Varghese Dec 2007 A1
20070288278 Alexander et al. Dec 2007 A1
20080005313 Flake et al. Jan 2008 A1
20080005651 Grefenstette et al. Jan 2008 A1
20080010206 Coleman Jan 2008 A1
20080021957 Medved et al. Jan 2008 A1
20080026804 Baray et al. Jan 2008 A1
20080028031 Bailey et al. Jan 2008 A1
20080040283 Morris Feb 2008 A1
20080046298 Ben-Yehuda et al. Feb 2008 A1
20080070588 Morin Mar 2008 A1
20080086356 Glassman et al. Apr 2008 A1
20080086431 Robinson et al. Apr 2008 A1
20080091796 Story et al. Apr 2008 A1
20080096664 Baray et al. Apr 2008 A1
20080102911 Campbell et al. May 2008 A1
20080104061 Rezaei May 2008 A1
20080104227 Birnie et al. May 2008 A1
20080109761 Stambaugh May 2008 A1
20080109843 Ullah May 2008 A1
20080114751 Cramer et al. May 2008 A1
20080120183 Park May 2008 A1
20080120308 Martinez et al. May 2008 A1
20080120690 Norlander et al. May 2008 A1
20080133750 Grabarnik et al. Jun 2008 A1
20080147655 Sinha et al. Jun 2008 A1
20080147743 Taylor et al. Jun 2008 A1
20080148175 Naaman et al. Jun 2008 A1
20080154720 Gounares Jun 2008 A1
20080163284 Martinez et al. Jul 2008 A1
20080172632 Stambaugh Jul 2008 A1
20080177706 Yuen Jul 2008 A1
20080270579 Herz et al. Oct 2008 A1
20080285886 Allen Nov 2008 A1
20080301250 Hardy et al. Dec 2008 A1
20080320001 Gaddam Dec 2008 A1
20090005987 Vengroff et al. Jan 2009 A1
20090006336 Forstall et al. Jan 2009 A1
20090012934 Yerigan Jan 2009 A1
20090012965 Franken Jan 2009 A1
20090043844 Zimmet et al. Feb 2009 A1
20090044132 Combel et al. Feb 2009 A1
20090063254 Paul et al. Mar 2009 A1
20090070186 Buiten et al. Mar 2009 A1
20090073191 Smith et al. Mar 2009 A1
20090076889 Jhanji Mar 2009 A1
20090100052 Stern et al. Apr 2009 A1
20090106356 Brase et al. Apr 2009 A1
20090125517 Krishnaswamy et al. May 2009 A1
20090132941 Pilskalns et al. May 2009 A1
20090144141 Dominowska et al. Jun 2009 A1
20090150501 Davis et al. Jun 2009 A1
20090150507 Davis et al. Jun 2009 A1
20090165051 Armaly Jun 2009 A1
20090171939 Athsani et al. Jul 2009 A1
20090177603 Honisch Jul 2009 A1
20090187637 Wu et al. Jul 2009 A1
20090204484 Johnson Aug 2009 A1
20090204672 Jetha et al. Aug 2009 A1
20090204676 Parkinson et al. Aug 2009 A1
20090216606 Coffman et al. Aug 2009 A1
20090222302 Higgins Sep 2009 A1
20090222303 Higgins Sep 2009 A1
20090234814 Boerries et al. Sep 2009 A1
20090234909 Strandeil et al. Sep 2009 A1
20090249482 Sarathy Oct 2009 A1
20090265431 Janie et al. Oct 2009 A1
20090281997 Jain Nov 2009 A1
20090299837 Steelberg et al. Dec 2009 A1
20090313546 Katpelly et al. Dec 2009 A1
20090320047 Khan et al. Dec 2009 A1
20090323519 Pun Dec 2009 A1
20090328087 Higgins et al. Dec 2009 A1
20100002635 Eklund Jan 2010 A1
20100014444 Ghanadan et al. Jan 2010 A1
20100063993 Higgins et al. Mar 2010 A1
20100070368 Choi et al. Mar 2010 A1
20100118025 Smith et al. May 2010 A1
20100125563 Nair et al. May 2010 A1
20100125569 Nair et al. May 2010 A1
20100125604 Martinez et al. May 2010 A1
20100125605 Nair et al. May 2010 A1
20100185642 Higgins et al. Jul 2010 A1
Foreign Referenced Citations (17)
Number Date Country
1362302 Nov 2003 EP
2002312559 Oct 2002 JP
1020000036897 Jul 2000 KR
1020000054319 Sep 2000 KR
10-2000-0064105 Nov 2000 KR
1020030049173 Jun 2003 KR
10-0801662 Feb 2005 KR
1020060043333 May 2006 KR
102007034094 Mar 2007 KR
1020070073180 Jul 2007 KR
1020080048802 Jun 2008 KR
WO2006116196 Nov 2006 WO
WO-2006116196 Nov 2006 WO
WO 2007022137 Feb 2007 WO
WO 2007027453 Mar 2007 WO
WO 2007070358 Jun 2007 WO
WO2007113546 Oct 2007 WO
Non-Patent Literature Citations (198)
Entry
Carbonell, J. et al. (Aug. 24-28, 1998). “The Use of MMR, Diversity-Based Reranking for Reordering Documents and Producing Summaries,” SIGIR '98: Proceedings of the 21st Annual International ACM SIGIR Conference on Research and Development in Information Retrieval: Melbourne, Australia W.B. Croft et al. eds., pp. 335-336.
Davis, M. et al. (Oct. 10-16, 2004). “From Context to Content: Leveraging Context to Infer Media Metadata,” MM'04 New York, New York.
Davis, M. et al. “From Context to Content: Leveraging Context for Mobile Media Metadata.”
Davis. M. et al. (Apr. 2-7, 2005). “MMM2: Mobile Media Metadata for Media Sharing,” CHI 2005 Portland, Oregon.
Davis, M. et al. “Mobile Media Metadata for Mobile Imaging.”
Davis, M. et al. “Using Context and Similarity for Face and Location Identification.”
Flickr. “Welcome to Flickr—Photo Sharing,” located at <http://www.flickr.com> visited on Feb. 26, 2007, one page.
Goldberger, J. et al. “The Hungarian Clustering Method,” located at <http://scholar.googles.com/scholar?num=20&hl=en&lr=&9=cache:vbwslsm1CisJ:www.openu.ac.il/Personal—sites/tamirtassa/Publications/hcm.pdf+goldberger+clustering+method+hungarian> visited on Mar. 1, 2007, twelve pages.
Graham, A. et al. (Jul. 13-17, 2002). “Time as Essence for Photo Browsing Through Personal Digital Libraries,” JCDL '02 Portland, Oregon.
Jaffe, A. et al. (May 23-26, 2006). “Generating Summaries for Large Collections of Geo-Referenced Photographs,” WWW 2006 Edinburgh, Scotland.
Jaffe, A. et al. (Oct. 26-27, 2006). “Generating Summaries and Visualization for Large Collections of Geo-Referenced Photographs,” MIR '06 Santa Barbara, California.
Joshi, D. et al. (Oct. 15-16, 2004). “The Story Picturing Engine: Finding Elite Images to Illustrate a Story Using Mtitual Reinforcement,” MIR '04 New York, New York.
Naaman, M. et al. (Nov. 2003). “From Where to What: Metadata Sharing for Digital Photographs with Geographic Coordinates,” In on the Move to Meaningful Internet Systems 2003: CooplS, DOA, and ODBASE R. Meersman et al. eds., pp. 196-217.
Nair, R. et al. (Nov. 6-11, 2005). “Photo LOI: Browsing Multi-User Photo Collections,” MM'05 Singapore, pp. 223-224.
O' Hare, N. et al. “Combination of Content Analysis and Context Features for Digital Photograph Retrieval.”
Pigeau, A. et al. (Jun. 17, 2005). “Organizing a Personal Image Collection with Statistical Model-Based ICL Clustering on Spatio-Temporal Camera Phone Meta-Data.”
Sarvas, R. et al. (Jun. 6-9, 2004). “Metadata Creation System for Mobile Images,” MobiSys'04 Boston, Massachusetts, pp. 36-48.
Toyama, K. et al. (Nov. 2-8, 2003). “Geographic Location Tags on Digital Images,” MM '03: Berkeley: California.
U.S. Appl. No. 11/593,668, filed Nov. 6, 2006, for Naaman et al.
U.S. Appl. No. 11/593,869, filed Nov. 6, 2006, for Naaman et al.
U.S. Appl. No. 12/409,867, filed Mar. 24, 2009, King.
U.S. Appl. No. 12/540,098, filed Aug. 12, 2009, Martinez.
U.S. Appl. No. 12/536,892, filed Aug. 6, 2009, King.
U.S. Appl. No. 12/540,588, filed Aug. 13, 2009, Tendjoukian.
U.S. Appl. No. 12/015,115, filed Jan. 16, 2006, Higgins.
U.S. Appl. No. 12/180,486, filed Jul. 25, 2008, Higgins.
U.S. Appl. No. 12/180,499, filed Jul. 25, 2008, Higgins.
U.S. Appl. No. 12/015,146, filed Jan. 16, 2008, Higgins.
U.S. Appl. No. 12/041,088, filed Mar. 3, 2008, Higgins.
U.S. Appl. No. 12/041,062, filed Mar. 3, 2008, Higgins.
U.S. Appl. No. 12/041,054, filed Mar. 3, 2008, Higgins.
U.S. Appl. No. 12/540,269, filed Aug. 12, 2009, Kalaboukis.
U.S. Appl. No. 11/969,815, filed Jan. 4, 2004, Davis.
U.S. Appl. No. 12/182,111, filed Jul. 29, 2008, Davis.
U.S. Appl. No. 12/434,575, filed May 1, 2009, O'Sullivan.
U.S. Appl. No. 12/434,580, filed May 1, 2009, O'Sullivan.
U.S. Appl. No. 12/407,690, filed Mar. 19, 2009, Davis.
U.S. Appl. No. 12/407,681, filed Mar. 19, 2009, Athsani.
International Search Report (PCT/US2009/030405) dated Sep. 23, 2009; 2 pages.
U.S. Appl. No. 12/041,054, filed Mar. 3, 2008; 64 pgs.
U.S. Appl. No. 12/041,062, filed Mar. 3, 2008; 66 pgs.
U.S. Appl. No. 12/041,088, filed Mar. 3, 2008; 66 pgs.
U.S. Appl. No. 12/169,931, filed Jul. 9, 2008; 66 pgs.
U.S. Appl. No. 12/170,025, filed Jul. 9, 2008; 67 pgs.
U.S. Appl. No. 12/180,499, filed Jul. 25, 2008; 67 pgs.
U.S. Appl. No. 12/180,486, filed Jul. 25, 2008; 65 pgs.
International Search Report PCT/US2009/030406 dated Sep. 29, 2009; 5 pages.
International Search Report and Written Opinion PCT/US2009/034445 dated Oct. 12, 2009; 7 pages.
Office Action U.S. Appl. No. 12/041,054 dated Oct. 27, 2010; 15 pages.
Office Action U.S. Appl. No. 12/041,062 dated Oct. 28, 2010; 12 pages.
International Search Report PCT/US2009/034444 dated Sep. 18, 2009; 2 pages.
Office Action U.S. Appl. No. 12/041,088 dated Oct. 4, 2010; 18 pages.
U.S. Appl. No. 11/952,007, filed Dec. 6, 2007, Davis.
U.S. Appl. No. 11/958,157, filed Dec. 17, 2007, Hayashi.
U.S. Appl. No. 11/952,875, filed Dec. 7, 2007, Davis.
U.S. Appl. No. 11/960,368, filed Dec. 19, 2007, Madsen.
U.S. Appl. No. 11/953,454, filed Dec. 10, 2007, Davis.
U.S. Appl. No. 11/953,494, filed Dec. 10, 2007, Davis.
U.S. Appl. No. 12/236,668, filed Sep. 24, 2008, Davis.
U.S. Appl. No. 12/595,594, filed Mar. 31, 2008, Martinez.
U.S. Appl. No. 12/057,878, filed Mar. 28, 2008, Martinez.
U.S. Appl. No. 12/057,943, filed Mar. 28, 2008, Martinez.
U.S. Appl. No. 11/969,751, filed Jan. 4, 2008, Martinez.
U.S. Appl. No. 12/145,145, filed Jun. 24, 2008, Davis.
U.S. Appl. No. 12/163,249, filed Jun. 27, 2008, Kalaboukis.
U.S. Appl. No. 12/182,969, filed Jul. 30, 2008, Higgins.
U.S. Appl. No. 12/182,813, filed Jul. 30, 2008, Higgins.
U.S. Appl. No. 12/163,314, filed Jun. 27, 2008, Higgins.
U.S. Appl. No. 12/163,396, filed Jun. 27, 2008, Higgins.
U.S. Appl. No. 12/195,969, filed Aug. 21, 2008, Martinez.
U.S. Appl. No. 12/234,000, filed Sep. 19, 2008, Martinez.
U.S. Appl. No. 12/241,590, filed Sep. 30, 2008, Athsani.
U.S. Appl. No. 12/241,687, filed Sep. 30, 2008, Davis.
U.S. Appl. No. 12/206,172, filed Sep. 8, 2008, Higgins.
U.S. Appl. No. 12/273,291, filed Nov. 18, 2008, Nair.
U.S. Appl. No. 12/273,345, filed Nov. 18, 2008, Nair.
U.S. Appl. No. 12/241,198, filed Sep. 30, 2008, Higgins.
U.S. Appl. No. 12/273,259, filed Nov. 11, 2008, Martinez.
U.S. Appl. No. 12/339,355, filed Dec. 19, 2008, Higgins.
U.S. Appl. No. 12/329,038, filed Dec. 5, 2008, Higgins.
U.S. Appl. No. 12/326,553, filed Dec. 2, 2008, Churchill.
U.S. Appl. No. 12/242,656, filed Sep. 30, 2008, Burgener.
U.S. Appl. No. 12/273,371, filed Nov. 18, 2008, Nair.
U.S. Appl. No. 12/357,311, filed Jan. 21, 2009, Higgins.
U.S. Appl. No. 12/357,332, filed Jan. 1, 2009, Higgins.
U.S. Appl. No. 12/357,345, filed Jan. 1, 2009, Higgins.
U.S. Appl. No. 12/357,285, filed Jan. 21, 2009, Higgins.
Axup, Jeff et al., “Conceptualizing New Mobile Devices by Observing Gossip and Social Network Formation Amongst the Extremely Mobile”, ITEE Technical Report #459, Dec. 19, 2005, pp. 1-71.
Conhaim, Wallys W., “Social networks: the Internet continues to evolve: where is the money in all this? That is what venture capitalists are asking. (Perspectives)”, Information Today, 22, 9, 35(2), Oct. 2005, (pp. 1-5 of attached).
Davis, Marc et al., “From Context to Content: Leveraging Context to Infer Media Metadata”, ACM Press, Oct. 10, 2004, pp. 1-8.
Kaasinen, E., “Behaviour & Information Technology”, Taylor & Francis, vol. 24, No. 1, Jan./Feb. 2005, pp. 37-49, (Abstract only attached).
Konomi, Shin'ichi et al., “Supporting Colocated Interactions Using RFID and Social Network Displays”, Pervasive Computing, Jul.-Sep. 2006 , vol. 5, No. 3, pp. 48-56 (pp. 1-4 of attached).
Lin, F. et al., “A unified framework for managing Web-based services.”, Information Systems and e-Business Management, vol. 3, Oct. 2005, p. 299, (pp. 1-15 of attached).
Metz, Cade, “MySpace Nation”, PC Magazine, Jun. 21, 2006, pp. 1-10 attached.
Perkowitz, Mike et al., “Utilizing Online Communities to Facilitate Physical World Interactions”, The International Conference on Communities and Technologies, Sep. 19, 2003, Amsterdam, pp. 1 6.
Roush, Wade, “Social Machines”, Continuous Computing Blog, Jul. 5, 2005, pp. 1-21.
Roush, Wade, “Social Machines”, Technology Review, Aug. 2005, pp. 45-51.
Sheppard, Brett, “The Rights Stuff: The Integration of Enterprise Digital Rights Management Into an Enterprise Architecture”, ECantent, vol. 29, No. 9, Nov. 2006, p. 38, 40-44, (pp. 1-7 of attached).
Voight, Joan et al., “Lessons for Today's Digital Market”, ADWEEKCOM, Oct. 2, 2006, pp. 1-6.
“Companies add new communication features to photo sharing.”, Digital Imaging Digest, Feb. 2006, pp. 1-2.
“Dave.TV and Eye Music Network Empower Users to Create Their Own Music TV Channel on Their Sites With New IPTV Channel”, www.davenw.com/2006, Sep. 13, 2006, pp. 1-2.
“Digital rights management: a primer: developing a user-friendly means of protecting content.(Profile)”, Screen Digest, No. 420, p. 305, Sep. 2006, (pp. 1-9 of attached).
“Emerging Markets: What media 2.0 can offer advertisers.”, Campaign, Oct. 27, 2006, p. 26, (pp. 1-5 of attached).
“Reality Digital Debuts Opus”, www.lightreading.com. Sep. 25, 2006, pp. 1.
“Reality Digital—Making Media Move”, www.realitydigital.com, Nov. 28, 2006, pp. 1-2.
Nedos, A; Singh K., Clarke S, Proximity Based Group Communications for Mobile Ad Hoc Networks, Proximity-Based Group Communication; Global Smart Spaces; D.14; Oct. 3, 2003; 31 pages.
Brunato, M; Battiti R. “Pilgrim: A Location Broker and Mobility-Aware Recommendation System”; Technical report DIT-02-0092, Universita di Trento, Oct. 2002; 8 pages.
Backstrom et al., Spatial Variation in Search Engine Queries, WWW•2008, Beijing, China (Apr. 21-25, 2008).
Gan et al., Analysis of Geographic Queries in a Search Engine Log, LocWeb 2008, Beijing, China (Apr. 22, 2008).
Jones et al., Geographic Intention and Modification in Web Search, International Journal of Geographical Information Science, vol. 22, No. 3, pp. 1-20 (Jul. 2008).
Sanderson et al., Analyzing Geographic Queries; Department of Information Studies; University of Sheffield, UK; 2 pages.
Go With the Flow, The Economist Technology Quarterly, vol. 382, Issue 8519, 4 pages, (Mar. 10, 2007).
International Search Report and Written Opinion (PCT/US2009/060476) dated May 4, 2010; 12 pages.
International Search Report and Written Opinion (PCT/US2009/060374) dated Apr. 30, 2010; 12 pages.
International Search Report (PCT/US2009/060379) dated Apr. 30, 2010; 3 pages.
International Search Report and Written Opinion (PCT/US2008/085135) dated May 25, 2009; 7 pages.
International Search Report (PCT/US2009/055503) dated Apr. 8, 2010; 3 pages.
Written Opinion (PCT/US2008/085915) dated Jun. 29, 2009; 4 pages.
Written Opinion (PCT/US2008/086948) dated May 21, 2009; 5 pages.
International Search Report and Written Opinion (PCT/US2009/051247) dated Jan. 25, 2010; 9 pages.
International Search Report and Written Opinion (PCT/US2009/046258) dated Dec. 23, 2009; 7 pages.
Almieda, R.B. et al. “A Community-Aware Search Engine,” WWW2004, New York., NY, May 17-22, 2004, pp. 413-421.
Anonymous. (Jul. 16, 2006). MyFantasyLeague Fantasy Football League Management—Features, located at <http://web.archive.org/web/20060716072900/www.myfantasyleague.com/features.htm >, last visited on Feb. 10, 2009, four pages.
Anonymous. (Jul. 17, 2006). “Fantasy Football Lineup Analyzer—Tips for Who to Start & Who to Bench each Week,” located at http://web.archive.org/web/200607171633529/www.fantasyfootballstarters.com/lineupAnalyzer.jsp>, last visited on Feb. 10, 2009, one page.
Bharat, K. (Date Unknown). “SearchPad: Explicit Capture of Search Context to Support Web Search,” located at <http://www9.org/w9cdrom/173/173.html >, last visited Aug. 1, 2007, 13 pages.
Budzik, J. et al. (2000). “User Interactions with Everyday Applications as Context for Just-in-Time Information Access,” Proceedings of the 2000 Conference on Intelligent User Interfaces, eight pages.
Finkelstein, L. et al. (2001). “Placing Search in Context: The Concept Revisited,” WWW/O, Hong Kong, May 2-5, 2001, pp. 406-414.
Freyne, J. et al. (2004). “Further Experiments on Collaborative Ranking in Community-Based Web Search,” Artificial Intelligence Review, pp. 1-23.
Lieberman, H. (1995) “Letizia: An Agent that Assists Web Browsing,” Proceedings of the Fourteenth International Joint Conference on Artificial Intelligence, Aug. 20-25, 1995, six pages.
Mitra, M. et al. (1998). “Improving Automatic Query Expansion,” Proceedings of the AMC SIGIR, nine pages.
Rhodes, B.J. et al. (1996). “Remembrance Agent: A Continuously Running Automated Information Retrieval System,” Proceedings of the First International Conference on the Practical Application of Intelligent Agents and Multi Agent Technology (PAAM), pp. 487-495, located at <http://www.cc.gatech.edu/fac/Thad.Starner/p/032—40—agents&ubicomp/remembrance-agent . . .>, last visited Aug. 1, 2007, six pages.
Sansbury, C. (Sep. 13, 2005). “Yahoo! Widget for BBC Sports News—Scotland,” 32. located at <http://widgets.yahoo.com/gallery/view.php?widget=37220 >, last visited on Feb. 7, 2007, one page.
Yahoo! Inc. (Dec. 7, 2005). “Yahoo! Widget Engine 3.0 Reference Manual Version 3.0,” 300 pages.
U.S. Appl. No. 12/407,690, filed Mar. 19, 2009; 50 pages.
U.S. Appl. No. 12/407,681, filed Mar. 19, 2009; 56 pages.
International Search Report PCT/US2008/088228 dated Sep. 30, 2009—2 pages.
Written Opinion PCT/US2008/088228 dated Sep. 30, 2009—5 pages.
U.S. Appl. No. 11/562,973, filed Nov. 22, 2006, Martinez.
U.S. Appl. No. 11/562,974, filed Nov. 22, 2006, Martinez.
U.S. Appl. No. 11/562,976, filed Nov. 22, 2006, Martinez.
U.S. Appl. No. 11/593,869, filed Nov. 6, 2006, Naaman.
U.S. Appl. No. 12/237,709, filed Sep. 25, 2008, Martinez.
U.S. Appl. No. 11/353,657, filed Feb. 13, 2006, Naaman.
U.S. Appl. No. 11/562,979, filed Nov. 22, 2006, Martinez.
U.S. Appl. No. 12/273,317, filed Nov. 18, 2008, Rahul Nair.
U.S. Appl. No. 11/593,668, filed Nov. 6, 2006, Naaman.
Allen James F., “Maintaining Knowledge About Temporal Intervals”, Communications of the ACM, Nov. 1983, vol. 26, No. 11 pp. 832-843; 12 pages.
Press Release, “QUALCOMM Conducts First Live Demonstration of FL Technology on a Wireless Handset”, Qualcomm Inc., San Diego, Sep. 27, 2005; 3 pages.
MediaFlo, FLO Technology Overview, Qualcomm Inc. Copyright 2007; 24 pages.
Notification of Transmittal of the International Search Report and the Written Opinion of the International Search Authority, or Declaration (PCT/US2007/'084797) dated Mar. 21, 2008; 11 pages.
International Search Report (PCT/US2007/084807) dated May 27, 2008; 3 pages.
International Preliminary Report on Patentability (PCT/US2007/084807) dated May 26, 2009; 5 pages.
International Search Report (PCT/US2010/026063) dated May 27, 2008; 3 pages.
Rekimoto, et al., “CyberCode: designing augmented reality environments with visual tags.” Proceedings of DARE 2000 on Designing augmented reality environments, Elsinore, Denmark, pp. 1-11 Apr. 12-14, 2000.
“Semacode-URL Barcodes-practical ubiquitous computing”, located at http://semacode.org visited on Apr. 13, 2007; 3 pages.
“Technical White Paper: Choosing the best 2D barcode format for mobile apps,” Semacode, Jul. 15, 2006; pp. 1-7 located at http://semacode.org/about/technical/whitepaper/best2—d—code.pdf.
Carbonell, J. et al. (Aug. 24-28, 1998). “The Use of MMR, Diversity-Based Reranking for Reordering Documents and Producing Summaries,” SIGIR '98: Proceedings of the 21 S Annual International ACM SIGIR Conference on Research and Development in Information Retrieval: Melbourne, Australia W.B. Croft et al. eds., pp. 335-336.
Cooper, M. et al. (Nov. 2-8, 2003). “Temporal Event Clustering for Digital Photo Collections,” MM'03 Berkeley, California, pp. 364-373.
Davis, M. et al. (Oct. 10-16, 2004). “From Context to Content: Leveraging Context to Infer Media Metadata,” MM'04 New York, New York. 9 pages.
Davis, M. et al. “From Context to Content: Leveraging Context for Mobile Media Metadata.” 9 pages.
Davis. M. et al. (Apr. 2-7, 2005). “MMM2: Mobile Media Metadata for Media Sharing,” CHI 2005 Portland, Oregon. 4 pages.
Davis, M. et al. “Mobile Media Metadata for Mobile Imaging.” Jun. 27-30, 2004; 4 pages.
Davis, M. et al. “Using Context and Similarity for Face and Location Identification.” 10 pages.
Flickr. Welcome to Flickr—Photo Sharing, located at <http://www.flickr.com > visited on Feb. 26, 2007, one page.
Gargi, U. (Aug. 7, 2003). “Consumer Media Capture: Time-Based Analysis and Event Clustering,” Technical Report HPL-2003-165 HP Laboratories Palo Alto, pp. 1-15.
Goldberger, J. et al. The Hungarian Clustering Method, located at <http://scholar.googles.com/scholar?num=20&h1=en&lr=&9=cache:vbwslsm1CisJ:www.openu .acil/Personal—sites/tarnirtassa/Publications/hcm.pdf+goldberger+clustering+method+hungarian> visited on Mar. 1, 2007, twelve pages.
Graham, A. et al. (Jul. 13-17, 2002). Time as Essence for Photo Browsing Through Personal Digital Libraries, JCDL '02 Portland, Oregon. 11 pages.
Jaffe, A. et al. (May 23-26, 2006). “Generating Summaries for Large Collections of Geo-Referenced Photographs,” WWW 2006 Edinburgh, Scotland. 2 pages.
Jaffe, A. et al. (Oct. 26-27, 2006). “Generating Summaries and Visualization for Large Collections of Geo-Referenced Photographs,” MIR '06 Santa Barbara, California. 11 pages.
Joshi, D. et al. (Oct. 15-16, 2004). “The Story Picturing Engine: Finding Elite Images to Illustrate a Story Using Miitual Reinforcement,” MIR '04 New York, New York. 9 pages.
Naaman, M. et al. (Nov. 2003). “From Where to What: Metadata Sharing for Digital Photographs with Geographic Coordinates,” In on the Move to Meaningful Internet Systems 2003: Coop/S, DOA, and ODBASE R. Meersman et al. eds., pp. 196-217.
Naaman, M. et al. (Jun. 7-11, 2004). “Automatic Organization for Digital Photographs with Geographic Coordinates” Proceedings of the Fourth ACM/IEEE Joint Conference on Digital Libraries Global Reach and Diverse Impact: Tucson, Arizona, pp. 53-62.
Nair, R. et al. (Nov. 6-11, 2005). “Photo L01: Browsing Multi-User Photo Collections,” MM'05 Singapore, pp. 223-224.
0' Hare, N. et al. “Combination of Content Analysis and Context Features for Digital Photograph Retrieval.” 7 pages.
Pigeau, A. et al. (Jun. 17, 2005). “Organizing a Personal Image Collection with Statistical Model-Based ICL Clustering on Spatio-Temporal Camera Phone Meta-Data.” 25 pages.
Sarvas, R. et al. (Jun. 6-9, 2004). “Metadata Creation System for Mobile Images,” MobiSys'04 Boiton, Massachusetts, pp. 36-48.
Toyama, K. et al. (Nov. 2-8, 2003). “Geographic Location Tags on Digital Images,” MM '03'Berkeley: California. 12 pages.
U.S. Appl. No. 11/593,668, filed Nov. 6, 2006 for Naaman, et al.
U.S. Appl. No. 11/593,869, filed Nov. 6, 2006 for Naaman, et al.
“Gutenkarte” Book Catalog, 2006 MetaCarta, Inc., www.gutenkarte.org 11pgs.
Baron, N.S. et al. (Aug. 30, 2005). “Tethered or Mobile? Use of Away Messages in Instant Messaging by American College Students,” Chapter 20.1 in Mobile Communication, Springer: London, England, 31:293-297.
Jones, C. et al. (2004). “Ad-Hoc Meeting System,” Final Presentation from Project Group #7, SIMS 202, Fall 2004 Class, UC Berkley School of Information Management & Systems, located at <http://www2.sims.berkeley.edu/academics/courses/is202/f04/phone—project/Group7/ >, last visited on Feb. 2, 2010, thirteen pages.
Manguy, L. et al. (2006). “iTour—Packing the World Into Your Mobile Device,” Final Presentation from Project Group #6, SIMS 202, Fall 2004 Class, UC Berkley School of Information Management & Systems, located at <http://www2.sims.berkeley.edu/academics/courses/is202/f04/phone—project/Group6/index.h > . . ., last visited on Feb. 2, 2010, ten pages.
Mitnick, S. et al. (2004). “Pillbox,” Final Presentation from Project Group #8, SIMS: 02: Fall 2004 Class, UC Berkley School of Information Management & Systems, located at <http://www2.sims.berkeley.edu/academics/courses/is202/f04/phone—project/Group8/about.p. . .,> last visited on Feb. 2, 2010, seventeen pages.
Wooldridge, M. et al. (2005). “STALK. The Camera-phone Scavenger Hunt!” located at <http://www.stalk.com >, last visited on Dec. 28, 2009, two pages.
www.stalk.com (retrieved on Dec. 29, 2009) pp. 1-2.
Anonymous. (Date Unknown). “CommunityWalk—About,” located at <http://www.communitywalk.com/about >, last visited on Mar. 3, 2008, one page.
Anonymous. (Date Unknown). “CommunityWalk Mapping Made Easy,” located at <http://www.communitywalk.com/>, last visited on Mar. 3, 2008, one page.
Anonymous. (Date Unknown). “Google Earth User Guide” located at <http://earth.google.com/userguide/v4/>, last visited on Feb. 27, 2008, twelve pages.
Anonymous. (Date Unknown). “Google Earth—Wikipedia, the Free Encyclopedia,” located at <http://en.wikipedia.org/wiki/Google—earth >, last visited on Mar. 3, 2008, fourteen pages.
Anonymous. (Date Unknown). “Google Earth User Guide—Using Image Overlays and 3D Models,” located at <http://earth.google.com/userguide/v4/ug—imageoverlays.html >, nine pages.
Anonymous. (Date Unknown). “Google Maps,” located at <http://en.wikipedia.org/wiki/Google—maps >, last visited on Feb. 27, 2008, eleven pages.
Anonymous. (Date Unknown). “Live Search Maps,” located at <http://en.wikipedia.org/wiki/Windows—live—maps >, last visited on Mar. 3, 2008, six pages.
Anonymous. (Date Unknown). “WikiMapia,” located at <http://en.wikipedia.org/wiki/WikiMapia >, last visited on Mar. 3, 2008, three pages.
Anonymous. (2007). “Ask.com Maps & Directions,” located at <http://maps.ask.com/maps >, last visited on Mar. 3, 2008, one page.
Anonymous. (2007). “Wayfaring Follow You, Follow Me,” located at <http://www.wayfaring.com/>, last visited on Mar. 3, 2008, three pages.
Anonymous. (2008). “Platial the People's Atlas,” located at <www.platial.com >, last visited on Mar. 3, 2008, one page.
Anonymous. (2008). “Wikimpaia.org ,” located at <http://wikimpaia.org/>, last visited on Mar. 3, 2008, one page.
Related Publications (1)
Number Date Country
20070271297 A1 Nov 2007 US