Patent application number | Description | Published |
20140101195 | INCREMENTAL VISUAL QUERY PROCESSING WITH HOLISTIC FEATURE FEEDBACK - To reduce communication costs and computational complexity, only a subset of ranked SIFT points within a query image for a visual search request is transmitted to the visual search server in each iteration of an incremental search. For each candidate match, a flag identifying the matching points is returned by the server for use in computing holistic (e.g., histogram) information for a bounding box within the query image including the matching points. Distance from that query image holistic information is used to reject images from a short list used for a subsequent iteration, if any. If all images are rejected or a match criteria is met during one iteration, the search may terminate early without consideration of remaining SIFT points. | 04-10-2014 |
20140185941 | ROBUST KEYPOINT FEATURE SELECTION FOR VISUAL SEARCH WITH SELF MATCHING SCORE - To improve feature selection accuracy during a visual search, interest points within a query image are two-way matched to features in an affine transformed image or otherwise transformed version of the query image. A user device implements a method for selecting local descriptors in the visual search. The method includes: detecting a first set of interest points for the original image; computing an affine transform matrix; computing a new image as a transformation of the original image using the affine transform matrix; detecting a second set of interest points from the and new image; performing a two-way matching between the first set of interest points and the second set of interest points; sorting matching pairs according to a specified self-matching score (SMS); assigning an infinite value to SMS of unmatched interest points from the original image; selecting the interest points based on SMS. Significant performance gains reduce false positive matches. | 07-03-2014 |
20140195560 | TWO WAY LOCAL FEATURE MATCHING TO IMPROVE VISUAL SEARCH ACCURACY - To improve precision of visual search processing, SIFT points within a query image are forward matched to features in each of a plurality of repository images and SIFT points within each repository image are backward matched to features within the query image. Forward-only, backward-only and forward-and-backward matches may be weighted differently in determining an image match. Two way matching may be triggered by query image bit rate in excess of a threshold or by a sum of weighted distances between matching points exceeding a threshold. Significant performance gains in eliminating false positive matches are achieved. | 07-10-2014 |
20140198998 | NOVEL CRITERIA FOR GAUSSIAN MIXTURE MODEL CLUSTER SELECTION IN SCALABLE COMPRESSED FISHER VECTOR (SCFV) GLOBAL DESCRIPTOR - A wireless communication device includes a processor configured to execute an image query. The image query utilizes cluster selection criteria for a cluster-aggregation based vectorization of a set of local features based on a quantity of top local features having the highest posteriori probability values. The cluster selection criterion is measured as the summation of the posteriori probability values of the top local features. The quantity of top local features is determined by a predetermined integer value greater than one. | 07-17-2014 |
20140201200 | VISUAL SEARCH ACCURACY WITH HAMMING DISTANCE ORDER STATISTICS LEARNING - Global descriptors for images within an image repository accessible to a visual search server are compared based on order statistics processing including sorting (which is a non-linear transform) and heat kernel matching. Affinity scores are computed for Hamming distances between Fisher vector components corresponding to different clusters of global descriptors from a pair of images and normalized to [0, 1], with zero affinity scores assigned to non-active cluster pairs. Linear Discriminant Analysis is employed to determine a sorted vector of affinity scores to obtain a new global descriptor. The resulting global descriptors produce significantly more accurate matching. | 07-17-2014 |
20140201368 | METHOD AND APPARATUS FOR ENFORCING BEHAVIOR OF DASH OR OTHER CLIENTS - A method for obtaining content includes determining that a playout of one or more other pieces of content is dependent upon a playout of a first piece of content. The method also includes obtaining the first piece of content and identifying a forced content token associated with the first piece of content. The method further includes obtaining an access token using the forced content token. In addition, the method includes using the access token to obtain the one or more other pieces of content. The forced content token could be identified as a hash of the first piece of content or as a watermark extracted from the first piece of content. The forced content token could also be identified by creating a thumbnail for each of one or more frames in the first piece of content and calculating a differential trace signature for each of the one or more frames. | 07-17-2014 |
20140310314 | MATCHING PERFORMANCE AND COMPRESSION EFFICIENCY WITH DESCRIPTOR CODE SEGMENT COLLISION PROBABILITY OPTIMIZATION - A method and apparatus include extracting a global descriptor from a query image with a plurality of segments. The method also includes identifying segments with a desirable discriminating potential by analyzing data of the plurality of segments based on an available image database. The method also includes creating a bitmask where the identified segments are active. The method also includes masking any segment of the plurality of segments of the global descriptor that are inactive according to the bitmask | 10-16-2014 |
20150281801 | ENHANCED DISTORTION SIGNALING FOR MMT ASSETS AND ISOBMFF WITH IMPROVED MMT QOS DESCRIPTOR HAVING MULTIPLE QOE OPERATING POINTS - A method for providing media content in a computer network includes storing the media content, where the media content includes a segment having a group of frames. The method also includes determining a transmission rate for traffic to a client device. The method further includes selecting a subset of frames to drop from the group of frames based on (i) the transmission rate and (ii) a frame difference distortion (FDIFF) metric of each frame in the subset of frames. The method also includes shaping the segment by dropping the selected subset of frames from the group of frames, where the shaped segment has a lower bitrate than the segment. In addition, the method includes transmitting the shaped segment to the client device. | 10-01-2015 |