← Back to Patent Explorer
US7203669B2 Expired / Lapsed US ⏱️ 0.0 years remaining

Detector tree of boosted classifiers for real-time object detection and tracking

Assignee: Intel Corp
•
Filing: 2003-03-26
•
Granted: 2007-04-10
•
Expires: 2023-03-26
📄 Original PDF 🌐 Google Patents 🔄 Sync Now

Abstract

Abstract A tree classifier may include a number of stages. Some stages may include monolithic classifiers, and other stages may be split into two or more classifiers.

Inventors

  • 👤 Rainer W. Lienhart
  • 👤 Luhong Liang
  • 👤 Alexander Kuranov

Bibliographic Details

Application Number —
Jurisdiction US
Data Source google_patents
Last Synchronized 2026-11-09 09:49
CPC Classifications
G; G06; G06N; G06N20/00; G06F; G06F18/00; G06F18/20; G06F18/21; G06F18/214; G06F18/2148; G06V; G06V40/00; G06V40/20

Claims Analysis

Total Claims: 17
Claim 1
Independent Claim 159 words
A method comprising: building a tree classifier, which rejects non-object patterns in input data representing real world objects, including a plurality of parent nodes, wherein the tree classifier is stored on a machine-readable medium and is trained to perform human south detection and tracking in video sequences; and for a parent node in the tree classifier, selecting between a monolithic classifier as a child node and a plurality of specialized classifiers as child nodes for said parent node; wherein said selecting comprises: determining a computational complexity of a monolithic classifiers trained with a plurality of positive and negative samples; and determining a computational complexity of a plurality of specialized classifiers trained with the plurality of positive and negative samples, each of the specialized classifiers being trained with the plurality of negative samples and a different subset of the plurality of positive samples; and wherein human mouth detection and tracking in video sequences occurs when other tree classifier is executed.
Claim 2
Independent Claim 159 words
A method comprising: building a tree classifier, which rejects non-object patterns in input data representing real world objects, including a plurality of parent nodes, wherein the tree classifier is stored on a machine-readable medium and is trained to perform human south detection and tracking in video sequences; and for a parent node in the tree classifier, selecting between a monolithic classifier as a child node and a plurality of specialized classifiers as child nodes for said parent node; wherein said selecting comprises: determining a computational complexity of a monolithic classifiers trained with a plurality of positive and negative samples; and determining a computational complexity of a plurality of specialized classifiers trained with the plurality of positive and negative samples, each of the specialized classifiers being trained with the plurality of negative samples and a different subset of the plurality of positive samples; and wherein human mouth detection and tracking in video sequences occurs when other tree classifier is executed.
Claim 3
Dependent Claim 53 words
The method of claim 1 , wherein said determining a computational complexity of the monolithic classifier comprises determining a number of features used by the monolithic classifier, and wherein said determining a computational complexity of the plurality of specialized classifiers comprises determining a number of features used by the plurality of specialized classifiers.
Claim 4
Dependent Claim 22 words
The method of claim 1 , further comprising training the monolithic classifier and the plurality of specialized classifiers with a boosting algorithm.
Claim 5
Dependent Claim 29 words
The method of claim 1 , further comprising training the monolithic classifier and the plurality of classifiers to have a selected hit rate and a selected false alarm rate.
Claim 6
Independent Claim 199 words
A method comprising: building a tree classifier, which rejects non-object patterns in input data representing real world objects, wherein the tree classifier is stored on a machine-readable medium and is trained to perform human mouth detection and tracking in video sequences, the building including: identifying a plurality of positive samples and the plurality of negative samples in a plurality of patterns; passing the plurality of positive samples and the plurality of negative samples to a node in the tree classifier; determining a number of features used by a monolithic classifier trained with said plurality of positive samples and said plurality of negative samples; clustering the plurality of positive samples into a plurality of subsets; training each of a plurality of specialized classifiers with the plurality of negative samples and a different one of said plurality of subsets; determining a number of features used by the plurality of specialized classifiers; and selecting the plurality of specialized classifiers in response to the number of features used by the plurality of specialized classifiers being smaller than the number of features used by the monolithic classifier; and wherein human mouth detection and tracking in video sequences occurs when the tree classifier is executed.
Claim 7
Independent Claim 199 words
A method comprising: building a tree classifier, which rejects non-object patterns in input data representing real world objects, wherein the tree classifier is stored on a machine-readable medium and is trained to perform human mouth detection and tracking in video sequences, the building including: identifying a plurality of positive samples and the plurality of negative samples in a plurality of patterns; passing the plurality of positive samples and the plurality of negative samples to a node in the tree classifier; determining a number of features used by a monolithic classifier trained with said plurality of positive samples and said plurality of negative samples; clustering the plurality of positive samples into a plurality of subsets; training each of a plurality of specialized classifiers with the plurality of negative samples and a different one of said plurality of subsets; determining a number of features used by the plurality of specialized classifiers; and selecting the plurality of specialized classifiers in response to the number of features used by the plurality of specialized classifiers being smaller than the number of features used by the monolithic classifier; and wherein human mouth detection and tracking in video sequences occurs when the tree classifier is executed.
Claim 8
Dependent Claim 20 words
The method of claim 5 , further comprising: training each of the plurality of specialized classifiers with a boosting algorithm.
Claim 9
Dependent Claim 19 words
The method of claim 5 , further comprising repeating elements of the method until a desired depth is achieved.
Claim 10
Dependent Claim 186 words
An article, comprising a machine-readable medium including machine-executable instructions operative to cause a machine to perform operations comprising: build a tree classifier, which rejects non-object patterns in input data representing real world objects, including a plurality of parent nodes, wherein the tree classifier is stored on a machine-readable medium and is trained to perform human mouth detection and tracking in video sequences; and for a parent node in the tree classifier, select between a monolithic classifier as a child node and a plurality of specialized classifiers as child nodes for said parent node; wherein the instructions operative to cause the machine to select comprise instructions operative to cause the machine to: determine a computational complexity of a monolithic classifier trained with a plurality of positive and negative samples; and determine a computational complexity of a plurality of specialized classifiers trained with the plurality of positive and negative samples, each of the specialized classifiers being trained with the plurality of negative samples and a different subset of the plurality of positive samples; and perform human mouth selection and tracking in video sequences using the trained tree classifier.
Claim 11
Dependent Claim 186 words
An article, comprising a machine-readable medium including machine-executable instructions operative to cause a machine to perform operations comprising: build a tree classifier, which rejects non-object patterns in input data representing real world objects, including a plurality of parent nodes, wherein the tree classifier is stored on a machine-readable medium and is trained to perform human mouth detection and tracking in video sequences; and for a parent node in the tree classifier, select between a monolithic classifier as a child node and a plurality of specialized classifiers as child nodes for said parent node; wherein the instructions operative to cause the machine to select comprise instructions operative to cause the machine to: determine a computational complexity of a monolithic classifier trained with a plurality of positive and negative samples; and determine a computational complexity of a plurality of specialized classifiers trained with the plurality of positive and negative samples, each of the specialized classifiers being trained with the plurality of negative samples and a different subset of the plurality of positive samples; and perform human mouth selection and tracking in video sequences using the trained tree classifier.
Claim 12
Dependent Claim 80 words
The article of claim 8 , wherein the instructions operative to cause the machine to determine a computational complexity of the monolithic classifier comprise instructions operative to cause the machine to determine a number of features used by the monolithic classifier, and the instructions operative to cause the machine to determine a computational complexity of the plurality of specialized classifiers comprise instructions operative to cause the machine to determine a number of features used by the plurality of specialized classifiers.
Claim 13
Dependent Claim 40 words
The article of claim 8 , wherein the instructions operative to cause a machine to perform operations further comprise instructions operative to cause the machine to train the monolithic classifier and the plurality of specialized classifiers with a boosting algorithm.
Claim 14
Dependent Claim 47 words
The article of claim 8 , wherein the instructions operative to cause a machine to perform operations further comprise instructions operative to cause the machine to train the monolithic classifier and the plurality of classifiers to have a selected hit rate and a selected false alarm rate.
Claim 15
Dependent Claim 212 words
An article comprising a machine-readable medium including machine-executable instructions operative to cause a machine to perform operations comprising: build a tree classifier, which rejects non-object patterns in input data representing real world objects, wherein the tree classifier is stored on a machine-readable medium and is trained to perform human mouth detection and tracking in video sequences, the building including: identify a plurality of positive samples and a plurality of negative samples in a plurality of patterns; pass the plurality of positive samples and the plurality of negative samples to a node in the tree classifier; determine a number of features used by a monolithic classifier trained with said plurality of positive samples and said plurality of negative samples; cluster the plurality of positive samples into a plurality of subsets; train each of a plurality of specialized classifiers with the plurality of negative samples and a different one of said plurality of subsets; determine a number of features used by the plurality of specialized classifiers; and select the plurality of specialized classifiers in response to the number of features used by the plurality of specialized classifiers being smaller than the number of features used by the monolithic classifier; and perform human mouth detection and tracking in video sequences using the trained tree classifier.
Claim 16
Dependent Claim 212 words
An article comprising a machine-readable medium including machine-executable instructions operative to cause a machine to perform operations comprising: build a tree classifier, which rejects non-object patterns in input data representing real world objects, wherein the tree classifier is stored on a machine-readable medium and is trained to perform human mouth detection and tracking in video sequences, the building including: identify a plurality of positive samples and a plurality of negative samples in a plurality of patterns; pass the plurality of positive samples and the plurality of negative samples to a node in the tree classifier; determine a number of features used by a monolithic classifier trained with said plurality of positive samples and said plurality of negative samples; cluster the plurality of positive samples into a plurality of subsets; train each of a plurality of specialized classifiers with the plurality of negative samples and a different one of said plurality of subsets; determine a number of features used by the plurality of specialized classifiers; and select the plurality of specialized classifiers in response to the number of features used by the plurality of specialized classifiers being smaller than the number of features used by the monolithic classifier; and perform human mouth detection and tracking in video sequences using the trained tree classifier.
Claim 17
Dependent Claim 27 words
The article of claim 12 , further comprising instruction operative to cause the machine to: train each of the plurality of specialized classifiers with a boosting algorithm.

USPTO Annuity & Maintenance Windows

Annuity Stage Window Opens Payment Deadline Surcharge Period Until Estimated Fee Status
3.5 Years (Year 4) 2010-04-09 2010-10-09 2011-04-10 $2000.00 Window Closed / Lapsed
7.5 Years (Year 8) 2014-04-09 2014-10-09 2015-04-10 $3760.00 Window Closed / Lapsed
11.5 Years (Year 12) 2018-04-09 2018-10-09 2019-04-10 $7700.00 Window Closed / Lapsed

Assigned Categories & Tags

No categories assigned to this patent yet.

Assign Category Tag