Classification using concept ranking according to negative exemplars

US9619521B1 · US · B1

Patent metadata
FieldValue
Publication numberUS-9619521-B1
Application numberUS-201314142976-A
CountryUS
Kind codeB1
Filing dateDec 30, 2013
Priority dateDec 30, 2013
Publication dateApr 11, 2017
Grant dateApr 11, 2017

How to read this patent

A practical reading order for non-experts. Skip the full description unless you need deep technical detail.

  1. Title

    What the patent document calls the invention.

  2. Abstract

    A short plain-language summary of the technical disclosure.

  3. Assignees and inventors

    Who owns or filed the patent and who is credited as inventor.

  4. Key dates

    Filing, priority, publication, and grant dates set the timeline.

  5. First independent claim

    The legal scope of protection — read this for what is actually claimed.

  6. CPC / IPC classifications

    Technology tags used to group this patent with similar filings.

  7. Citations and related patents

    Prior art links and similar publications in this corpus.

Abstract

Official abstract text for this publication.

A segmentation annotation technique for media items is disclosed herein. Given a weakly labeled media item, spatiotemporal masks may be generated for each of the concepts with which it is labeled. Segments may be ranked by the likelihood that they correspond to a given concept. The ranked concept segments may be utilized to train a classifier that, in turn, may be used to classify untagged or new media items.

First claim

Opening claim text (preview).

The invention claimed is: 1. A system comprising: a database for storing a plurality of media items; one or more computers connected to the database and configured to: obtain the plurality of media items, each of the plurality of media items being identified as either (i) a concept media item that has been classified as a media item in which a particular visual concept appears or (ii) a non-concept media item that has been classified as a media item in which the particular visual concept does not appear; obtain a plurality of concept segments, wherein each of the concept segments is a segment that has been extracted from a concept media item; obtain a plurality of non-concept segments, wherein each non-concept segment is a segment that has been extracted from a non-concept media item, wherein each concept segment and each non-concept segment is represented in a feature space; for each non-concept segment, identify a closest concept segment, wherein the closest concept segment is the concept segment that is closest to the non-concept segment of any of the plurality of concept segments, wherein the closest concept segment is identified based upon pairwise distances between all of the concept segments and all of the non-concept segments in the feature space; determine, for each concept segment, a respective count of instances in which the concept segment is identified as the closest concept segment to one of the non-concept segments; rank each concept segment such that the ranking reflects a respective likelihood that the concept segment contains the particular visual concept by ranking the concept segments such that concept segments having lower counts are favored over concept segments having higher counts; and label concept segments that are below a threshold rank in the ranking as not containing the particular visual concept. 2. The system of claim 1 , the one or more computers further configured to: train a classifier based on at least a portion of the ranked concept segments and the non-concept segments; and classify a new media item using the classifier. 3. The system of claim 2 , wherein the classifier is trained based on all of the ranked concept segments, and wherein the concept segments that are below the threshold rank are used as non-concept segments to train the classifier. 4. The system of claim 1 , wherein each of the plurality of media items is identified as either a concept media item or a non-concept media item based on a weak label assigned to the media item before the obtaining of the media item. 5. The system of claim 1 , the one or more computers further configured to segment the plurality of media items to generate the concept and non-concept segments. 6. The system of claim 1 , wherein: each of the media items in the plurality of media items is a video; and each segment obtained for each of the videos is a spatiotemporal (3D) volume that is represented as a point in a high-dimensional feature space using a set of standard features computed over the segment. 7. A computer-implemented method, comprising: obtaining, by one or more computers, a plurality of media items, each of the plurality of media items being identified as either (i) a concept media item that has been classified as a media item in which a particular visual concept appears or (ii) a non-concept media item that has been classified as a media item in which the particular visual concept does not appear; obtaining, by the one or more computers, a plurality of concept segments, wherein each of the concept segments is a segment that has been extracted from a concept media item; obtain a plurality of non-concept segments, wherein each non-concept segment is a segment that has been extracted from a non-concept media item, wherein each concept segment and each non-concept segment is represented in a feature space; for each non-concept segment, identify a closest concept segment, wherein the closest concept segment is the concept segment that is closest to the non-concept segment of any of the plurality of concept segments, wherein the closest concept segment is identified based upon pairwise distances between all of the concept segments and all of the non-concept segments in the feature space; determine, by the one or more computers and for each concept segment, a respective count of instances in which the concept segment is identified as the closest concept segment to one of the non-concept segments; ranking, by the one or more computers, each concept segment such that the ranking reflects a respective likelihood that the concept segment contains the particular visual concept by ranking the concept segments such that concept segments having lower counts are favored over concept segments having higher counts; and labeling, by the one or more computers, concept segments that are below a threshold rank in the ranking as not containing the particular visual concept. 8. The method of claim 7 , further comprising: training a classifier based on at least a portion of the ranked concept segments and the non-concept segments; and classifying a new media item using the classifier. 9. The method of claim 8 , wherein the classifier is trained based on all of the ranked concept segments, and wherein the concept segments below the threshold rank are used as non-concept segments to train the classifier. 10. The method of claim 7 , wherein each of the plurality of media items is identified as either a concept media item or a non-concept media item based on a weak label assigned to the media item before the media item was obtained. 11. The method of claim 7 , further comprising segmenting the plurality of media items to generate the concept and non-concept segments. 12. The method of claim 7 , wherein: each of the media items in the plurality of media items is a video; and each segment obtained for each of the videos is a spatiotemporal (3D) volume that is represented as a point in a high-dimensional feature space using a set of standard features computed over the segment. 13. One or more non-transitory computer storage media storing instructions that when executed by one or more computers cause the one or more computers to perform operations comprising: obtaining, by one or more computers, a plurality of media items, each of the plurality of media items being identified as either (i) a concept media item that has been classified as a media item in which a particular visual concept appears or (ii) a non-concept media item that has been classified as a media item in which the particular visual concept does not appear; obtaining, by the one or more computers, a plurality of concept segments, wherein each of the concept segments is a segment that has been extracted from a concept media item; obtain a plurality of non-concept segments, wherein each non-concept segment is a segment that has been extracted from a non-concept media item, wherein each concept segment and each non-concept segment is represented in a feature space; for each non-concept segment, identify a closest concept segment, wherein the closest concept segment is the concept segment that is closest to the non-concept segment of any of the plurality of concept segments, wherein the closest concept segment is identified based upon pairwise distances between all of the concept segments and all of the non-concept segments in the feature space; determine, by the one or more computers and for each concept segment, a respective count of instances in which the concept segment is identified as the closest concept segment to one of the non-concept segments; ranking, by the one or more computers, each concept seg

Assignees

Inventors

Classifications

  • Physics · mapped topic

  • Physics · mapped topic

  • G06N20/00Primary

    Machine learning · CPC title

  • G06F16/75Primary

    Clustering; Classification · CPC title

  • using objects detected or recognised in the video content · CPC title

Patent family

Related publications grouped by family.

External sources

Frequently asked questions

Answers are generated from the same data shown on this page.

What does patent US9619521B1 cover?
A segmentation annotation technique for media items is disclosed herein. Given a weakly labeled media item, spatiotemporal masks may be generated for each of the concepts with which it is labeled. Segments may be ranked by the likelihood that they correspond to a given concept. The ranked concept segments may be utilized to train a classifier that, in turn, may be used to classify untagged or n…
Who is the assignee on this patent?
Google Inc
What technology area does this patent fall under?
Primary CPC classification G06F17/3053. Mapped technology areas include Physics.
When was this patent published?
Publication date Tue Apr 11 2017 00:00:00 GMT+0000 (Coordinated Universal Time) (B1). Legal status and post-grant events are not shown on this page.
What related patents are in patentsdb?
We list 8 related publications on this page (citations in our corpus or others sharing the same primary CPC).