Abstract: An autonomous blog engine is implemented to enable the autonomous generation of a blog. The autonomous blog engine receives media objects that are captured by an electronic device during a trip session. The autonomous blog engine determines a place of interest based on photographs selected from the media objects. The autonomous blog engine then generates textual content using one or more pre-stored knowledge items that include information on the place of interest. The autonomous blog engine further autonomously publishes a blog entry on the place of interest that includes one or more photographs from the photograph cluster and the textual content.

Abstract: Dominant color names may be extracted from an image by analyzing spatial-context of pixels contained in the image. A dominant color region may be defined by taking a double-threshold approach that addresses ambiguous color regions and a degree of confidence that each pixel belongs in the dominant color region. Affiliation maps and binary maps may be used to generate the dominant color region. Images may be converted to a saliency map, from which a region of interest may be assigned a dominant color name. Image search results may be filtered by the dominant color name associated with the image.

Abstract: Image-based semantic distance technique embodiments are presented that involve establishing a measure of an image-based semantic distance between semantic concepts. Generally, this entails respectively computing a semantic concept representation for each concept based on a collection of images associated with the concept. A degree of difference is then computed between two semantic concept representations to produce the aforementioned semantic distance measure for the pair of corresponding concepts.

Abstract: Techniques for constructing an optimized kd-tree are described. In an implementation, an optimized kd-tree process receives input of a set of data points applicable for large-scale computer vision applications. The process divides the set of the data points into subsets of data points with nodes while generating hyperplanes (e.g., coordinate axes). The process identifies a partition axis for each node based on the coordinate axes combined in a binary way. The optimized kd-tree process creates an optimized kd-tree that organizes the data points based on the identified partition axis. The organization of the data points in the optimized kd-tree provides efficient indexing and searching for a nearest neighbor.

Abstract: Some implementations provide techniques and arrangements to perform image retrieval. For example, some implementations identify an object of interest and a visual context in a first image. In some implementations, a second image that includes a second object of interest and a second visual context may be compared to the object of interest and the visual content, respectively, to determine whether the second image matches the first image.

Abstract: Supervised re-ranking for visual search may include re-ordering images that are returned in response to a text-based image search by exploiting visual information included in the images. In one example, supervised re-ranking for visual search may include receiving a textual query, obtaining an initial ranking result including a plurality of images corresponding to the textual query, and representing the textual query by a visual context of the plurality of images. A query-independent re-ranking model may be trained based on visual re-ranking features of the plurality of images of the textual query in accordance with a supervised training algorithm.

Abstract: Colors of images and videos are modified to make differences in the colors more perceptible to colorblind users. An exemplary recoloring process utilizes a color space transformation, a local color rotation and a global color rotation to transform colors of visual objects from colors which may not be distinguishable by the colorblind user to colors which may be distinguishable by the colorblind user.

Abstract: Methods and systems for in-image accessibility indication are described herein. These methods and systems are usable to receive an image being designed, locate colorblind inaccessible regions of the image based on located colorblind inaccessible points, and indicate the located colorblind inaccessible regions in the image to a designer while the designer is creating the image. As such, the designer is able to quickly identify regions of the designed image that may be difficult for colorblind viewers to see and, with this information, the designer is able to modify the image accordingly.

Abstract: Techniques for recommending music and advertising to enhance a user's experience while photo browsing are described. In some instances, songs and ads are ranked for relevance to at least one photo from a photo album. The songs, ads and photo(s) from the photo album are then mapped to a style and mood ontology to obtain vector-based representations. The vector-based representations can include real valued terms, each term associated with a human condition defined by the ontology. A re-ranking process generates a relevancy term for each song and each ad indicating relevancy to the photo album. The relevancy terms can be calculated by summing weighted terms from the ranking and the mapping. Recommended music and ads may then be provided to a user, as the user browses a series of photos obtained from the photo album. The ads may be seamlessly embedded into the music in a nonintrusive manner.

Abstract: Functionality is described for forming a summary representation of a video item to help a user decide whether to obtain a full version of the video item. The functionality operates by: (a) receiving a video item; (b) dividing the video item into a plurality of segments; (c) extracting at least one key frame from each of the plurality of segments to form a plurality of key frames; and (d) organizing the video segments into one or more groups corresponding to one or more respective scenes based on the plurality of key frames, to thereby form the representation of the video item. The functionality can be used to communicate search results to a user, to provide a sample of the video item in a message, etc.

Abstract: Methods and systems for object-sensitive image searches are described herein. These methods and systems are usable for receiving a query for an image of an object and providing a ranked list of query results to the user based on a ranking of the images. The object-sensitive image searches may generate a pre-trained multi-instance learning (MIL) model trained from free training data from users sharing images at websites to identify a common pattern of the object, and/or may generate a MIL model “on the fly” trained from pseudo-positive and pseudo-negative samples of query results to identify a common pattern of the object. As such, the user is presented with query results that include images that prominently display the object near the top of the results.

Abstract: An initial ranked list of a first plurality of visual documents is obtained from a first source in response to a query, and a second plurality of visual documents relevant to the query is gathered from a plurality of second sources. Visual patterns identified from the second plurality of visual documents are compared with the first visual documents for reranking the first visual documents.

Abstract: Techniques described herein enable better understanding of the intent of a user that submits a particular search query. These techniques receive a search request for images associated with a particular query. In response, the techniques determine images that are associated with the query, as well as other keywords that are associated with these images. The techniques then cluster, for each set of images associated with one of these keywords, the set of images into multiple groups. The techniques then rank the images and determine a representative image of each cluster. Finally, the tools suggest, to the user that submitted the query, to refine the search based on user selection of a keyword and a representative image. Thus, the techniques better understand the user's intent by allowing the user to refine the search based on another keyword and based on an image on which the user wishes to focus the search.

Abstract: Techniques for construction of a visual codebook are described herein. Feature points may be extracted from large numbers of images. In one example, images providing N feature points may be used to construct a codebook of K words. The centers of each of K clusters of feature points may be initialized. In a looping or iterative manner, an assignment step assigns each feature point to a cluster and an update step locates a center of each cluster. The feature points may be assigned to a cluster based on a lesser of a distance to a center of a previously assigned cluster and a distance to a center derived by operation of an approximate nearest neighbor algorithm having aspects of randomization. The loop terminates when the feature points have sufficiently converged to their respective clusters. Centers of the clusters represent visual words, which may be used to construct the visual codebook.

Abstract: Colorblind accessible image search technique embodiments are presented that re-rank the results of a relevance-ranked image search to account for the accessibility of the images to a colorblind person. This is accomplished by first computing a colorblind accessibility quantity for each image of interest in the search results. A colorblind accessibility quantity quantizes the degree to which color information is preserved when an image is perceived by a colorblind person viewing the image. It is computed by generating a colorblind version of an image that simulates how the image would appear to the colorblind person. An amount quantifying the loss of color information between the image and the colorblind version of the image is then estimated. This estimate is used to compute the colorblind accessibility quantity for the image. Once the colorblind accessibility quantities have been computed, the image search results are re-ranked based on these quantities.

Abstract: This disclosure describes various exemplary user interfaces, methods, and computer program products for the interactively ranking image search results refinement method using a color layout. The method includes receiving a text query for an image search, presenting image search results in a structured presentation based on the text query and information from an interest color layout. The process creates image search results that may be selected by the user based on color selection palettes or color layout specification schemes. Then the process ranks the image search results by sorting the results according to similarity scores between color layouts from the image search results and the interest color layout from a user based on the color selection palettes and the color layout specification schemes.

Abstract: The concept-structured image search technique described herein pertains to a technique for enabling a user to indicate their semantic intention and then retrieve and rank images from a database or other image set according to this intention. The concept-structured image search technique described herein includes a new interface for image search. With this interface, a user can freely type several key textual words in arbitrary positions on a blank image, and also describe a region for each keyword that indicates its influence scope, which is called concept structure herein. The concept-structured image search technique will return and rank images that are in accordance with the concept structure indicated by the user. One embodiment of the technique can be used to create a synthesized image without actually using the synthesized image to perform a search of an image set.

Abstract: This disclosure describes various exemplary user interfaces, methods, and computer program products for the interactively ranking image search results refinement method using a color layout. The method includes receiving a text query for an image search, presenting image search results in a structured presentation based on the text query and information from an interest color layout. The process creates image search results that may be selected by the user based on color selection palettes or color layout specification schemes. Then the process ranks the image search results by sorting the results according to similarity scores between color layouts from the image search results and the interest color layout from a user based on the color selection palettes and the color layout specification schemes.

Abstract: Video advertising overlay technique embodiments are presented that generally detect a set of spatio-temporal nonintrusive positions within a series of consecutive video frames in shots of a digital video and then overlay contextually relevant ads on these positions. In one general embodiment, this is accomplished by decomposing the video into a series of shots, and then identifying a video advertisement for each of a selected set of the shots. The identified video advertisement is one that is determined to be the most relevant to the content of the shot. An overlay area is also identified in each of the shots, where the selected overlay area is the least intrusive among a plurality of prescribed areas to a viewer of the video. The video advertisements identified for the shots are then respectively scheduled to be overlaid in the identified overlay area of a shot, whenever the shot is played.

Abstract: A hybrid search method may be used to identify information responsive to a query. A search may be performed utilizing a neighborhood graph and a partitioning tree. The partitioning tree may be searched to select one or more pivots that may be used to guide a subsequent search in the neighborhood graph. Once the search in the neighborhood graph is unable to identify nearest neighbors in closer proximity to the query, the search may be switched to the partitioning tree. The partitioning tree may then be searched to select pivots that may be used to guide subsequent searches in the neighborhood graph. The searches performed in the partitioning tree and/or the neighborhood graph may be conducted utilizing an iterative algorithm.