Abstract: A user can capture image information about an object in order to identify the object. In addition to obtaining information about the object, the user can obtain additional views of the object. For example, if the user captures an image of packaging containing the object, the user can receive views of the object when out of the packaging, as well as a view showing the relative size of the object within the packaging. If the object requires assembly, the views can include views of the object at the component, part, or ingredient level, as well as views during assembly and one or more views of the finished product. A user also can obtain a virtual x-ray view that enables the user to move the client device with respect to the object in order to obtain different views of what is contained within the packaging.

Abstract: In one exemplary aspect, a sorted list of scored media content episodes is received with a computing device of a user. Each respective media content episode is scored by an iterative autotuning prediction algorithm, and wherein each element of the sorted list of scored media content episodes comprises a value that represents a likelihood of a user listening to the respective media content episode and a reference to a location of the respective media content episode. A number of bytes of a download iteration for each media content episode is determined based on value that represents a likelihood of the user listening to the respective media content episode and an index of the respective media content episode in the sorted list. It is detected that a mobile device is in the preferred network. The download iteration is implemented for each media content episode when it is detected that the mobile device is in the preferred network.

Abstract: Systems and approaches for searching a content collection corresponding to query content are provided. In particular, false positive match rates between the query content and the content collection may be reduced with a minimum content region test and/or a minimum features per scale test. For example, by correlating content descriptors of a content piece in the content collection with query descriptors of the query content, the content piece can be determined to match the query content when a particular region of the content piece and/or a particular region of a query descriptor have a proportionate size meeting or exceeding a specified minimum. Alternatively, or in addition, the false positive match rate between query content and a content piece can be reduced by comparing content descriptors and query descriptors of features at a plurality of scales. A content piece can be determined to match the query content according to descriptor proportion quotas for the plurality of scales.

Abstract: Various embodiments provide a user with a capability to customize multiple image data stores, where each data store can be used to provide content tailored to different users having different interests, setting, or notification demands. For example, users can submit images and modify processing parameters to tune an image matching system to their, or their customer's, individual desires. Accordingly, content can be delivered to a computing device in response to a query image sent by the computing device to a matching system containing the customized image data stores. The delivered content can be related to, or derived from, an image in a respective data store that matches the provided query image.

Abstract: In one exemplary aspect, a sorted list of scored media content episodes is received with a computing device of a user. Each respective media content episode is scored by an iterative autotuning prediction algorithm, and wherein each element of the sorted list of scored media content episodes comprises a value that represents a likelihood of a user listening to the respective media content episode and a reference to a location of the respective media content episode. A number of bytes of a download iteration for each media content episode is determined based on value that represents a likelihood of the user listening to the respective media content episode and an index of the respective media content episode in the sorted list. It is detected that a mobile device is in the preferred network. The download iteration is implemented for each media content episode when it is detected that the mobile device is in the preferred network.

Abstract: In one exemplary aspect, a sorted list of scored media content episodes is received with a computing device of a user. Each respective media content episode is scored by an iterative autotuning prediction algorithm, and wherein each element of the sorted list of scored media content episodes comprises a value that represents a likelihood of a user listening to the respective media content episode and a reference to a location of the respective media content episode. A number of bytes of a download iteration for each media content episode is determined based on value that represents a likelihood of the user listening to the respective media content episode and an index of the respective media content episode in the sorted list. It is detected that a mobile device is in the preferred network. The download iteration is implemented for each media content episode when it is detected that the mobile device is in the preferred network.

Abstract: Systems and approaches for searching a content collection corresponding to query content are provided. In particular, false positive match rates between the query content and the content collection may be reduced with a minimum content region test and/or a minimum features per scale test. For example, by correlating content descriptors of a content piece in the content collection with query descriptors of the query content, the content piece can be determined to match the query content when a particular region of the content piece and/or a particular region of a query descriptor have a proportionate size meeting or exceeding a specified minimum. Alternatively, or in addition, the false positive match rate between query content and a content piece can be reduced by comparing content descriptors and query descriptors of features at a plurality of scales. A content piece can be determined to match the query content according to descriptor proportion quotas for the plurality of scales.

Abstract: In one exemplary aspect, a sorted list of scored media content episodes is received with a computing device of a user. Each respective media content episode is scored by an iterative autotuning prediction algorithm, and wherein each element of the sorted list of scored media content episodes comprises a value that represents a likelihood of a user listening to the respective media content episode and a reference to a location of the respective media content episode. A number of bytes of a download iteration for each media content episode is determined based on value that represents a likelihood of the user listening to the respective media content episode and an index of the respective media content episode in the sorted list. It is detected that a mobile device is in the preferred network. The download iteration is implemented for each media content episode when it is detected that the mobile device is in the preferred network.

Abstract: Systems and approaches for searching a content collection corresponding to query content are provided. In particular, false positive match rates between the query content and the content collection may be reduced with a minimum content region test and/or a minimum features per scale test. For example, by correlating content descriptors of a content piece in the content collection with query descriptors of the query content, the content piece can be determined to match the query content when a particular region of the content piece and/or a particular region of a query descriptor have a proportionate size meeting or exceeding a specified minimum. Alternatively, or in addition, the false positive match rate between query content and a content piece can be reduced by comparing content descriptors and query descriptors of features at a plurality of scales. A content piece can be determined to match the query content according to descriptor proportion quotas for the plurality of scales.

Abstract: Various algorithms are presented that enable an image of a machine-readable code, captured by a camera of an electronic device, to be decoded on the device without need to upload the image information to a server for processing. The algorithms can account for variations in focus of the image, as may result in blur due to move movement or auto-focus features. The approaches can handle multiple machine-readable code formats, and can handle machine-readable code on curved surfaces, machine-readable code with damaged areas, or machine-readable code that are otherwise uneven. Such algorithms are highly accurate while being fast and lightweight enough to execute on portable electronic devices, such as tablet computers and smart phones.

Abstract: Multiple paths of an index tree may be traversed to discover a set of content descriptors that are match candidates for a set of query descriptors. A size of the set of candidate content descriptors may be optimized, for example, to reduce false positive matching errors, query latencies and/or index tree traversal times, at least in part by determining a number of child nodes to traverse based at least in part on current traverse level and/or traverse neighborhood thresholds. Index trees for large content descriptor sets may be built in resource constrained environments with approximation and/or refining build techniques.

Abstract: Various algorithms are presented that enable an image of a barcode, captured by a camera of an electronic device, to be analyzed and decoded for use in obtaining information about an object or item associated with the barcode. The algorithms can account for variations in focus of the image, as may result in blur due to movement or a lack of auto-focus features. An offline training phase can be used to generate a set of possible symbol appearance templates, where at least some of the templates reflect simulations for varying levels and types of noise in an image. A decoding phase compares these templates to a captured image and performs a sequence-wide optimization to determine the overall most likely sequence of digits.

Abstract: The present invention provides a method and system for image matching. The method includes receiving a query image at a query-server. Further, the method includes, sending a request to one or more image-matching servers of a set of distributed image-matching servers to conduct an image-search corresponding to the query image. Furthermore, the method includes receiving at the query-server, a list of identified matches from the image-matching servers corresponding to the query image, wherein the list of matches is identified based on the image-search at the image-matching servers. Moreover, the method includes selecting one or more matches from the list of identified matches based on a score corresponding to the identified matches.

Abstract: Systems and approaches for searching a content collection corresponding to query content are provided. In particular, false positive match rates between the query content and the content collection may be reduced with a minimum content region test and/or a minimum features per scale test. For example, by correlating content descriptors of a content piece in the content collection with query descriptors of the query content, the content piece can be determined to match the query content when a particular region of the content piece and/or a particular region of a query descriptor have a proportionate size meeting or exceeding a specified minimum. Alternatively, or in addition, the false positive match rate between query content and a content piece can be reduced by comparing content descriptors and query descriptors of features at a plurality of scales. A content piece can be determined to match the query content according to descriptor proportion quotas for the plurality of scales.

Abstract: Various algorithms are presented that enable an image of a barcode, captured by a camera of an electronic device, to be decoded on the device without need to upload the image information to a server for processing. The algorithms can account for variations in focus of the image, as may result in blur due to move movement or auto-focus features. The approaches can handle multiple barcode formats, and can handle barcodes on curved surfaces, barcodes with damaged areas, or barcodes that are otherwise uneven. Such algorithms are highly accurate while being fast and lightweight enough to execute on portable electronic devices, such as tablet computers and smart phones.

Abstract: Multiple paths of an index tree may be traversed to discover a set of content descriptors that are match candidates for a set of query descriptors. A size of the set of candidate content descriptors may be optimized, for example, to reduce false positive matching errors, query latencies and/or index tree traversal times, at least in part by determining a number of child nodes to traverse based at least in part on current traverse level and/or traverse neighborhood thresholds. Index trees for large content descriptor sets may be built in resource constrained environments with approximation and/or refining build techniques.

Abstract: False positive match rates between query content and content in a collection may be reduced with a minimum content region test and/or a minimum features per scale test. The quality of correlations between query descriptors and content descriptors may be improved with a modified sub-region descriptor construction. Content regions associated with detected content features may be partitioned into disjoint sets of sub-regions that cover the content regions, the sub-regions modified so as to at least partially overlap, and descriptor components generated for the modified sub-regions. Matching of feature-sparse content may be improved by adding blurred versions to the collection.

Abstract: The present invention provides a method and system for image matching. The method includes receiving a query image at a query-server. Further, the method includes, sending a request to one or more image-matching servers of a set of distributed image-matching servers to conduct an image-search corresponding to the query image. Furthermore, the method includes receiving at the query-server, a list of identified matches from the image-matching servers corresponding to the query image, wherein the list of matches is identified based on the image-search at the image-matching servers. Moreover, the method includes selecting one or more matches from the list of identified matches based on a score corresponding to the identified matches.