Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Chuck Fleming

dblp:06/6838 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
0since 2021 · last 2007
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 1Graphics, computer vision, multimedia, augmented reality and games · 1

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Artificial intelligence
1 paper
3D vision · 33% Image recognition and object detection · 33% Representation and self-supervised learning · 33%

Topics — the 3 heaviest of 4, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Computer vision › Image recognition and object detection › part-based model
deformable template
0.112007
Deformable Template As Active Basis · ICCV 2007
Computer vision › 3D vision
object representation
0.112007
Deformable Template As Active Basis · ICCV 2007
Machine learning › Representation and self-supervised learning › representation learning › unsupervised representation learning
sparse coding
0.112007
Deformable Template As Active Basis · ICCV 2007

Methods — techniques the papers use, named apart from their topics

shared pursuit algorithm · 0.1random field · 0.1probabilistic generative model · 0.1
YearPublicationVenuePosition
2007 Deformable Template As Active Basis
abstract
This article proposes an active basis model and a shared pursuit algorithm for learning deformable templates from image patches of various object categories. In our generative model, a deformable template is in the form of an active basis, which consists of a small number of Gabor wavelet elements at different locations and orientations. These elements are allowed to slightly perturb their locations and orientations before they are linearly combined to generate each individual training or testing example. The active basis model can be learned from training image patches by the shared pursuit algorithm. The algorithm selects the elements of the active basis sequentially from a dictionary of Gabor wavelets. When an element is selected at each step, the element is shared by all the training examples, in the sense that a perturbed version of this element is added to improve the encoding of each example. Our model and algorithm are developed within a probabilistic framework that naturally embraces wavelet sparse coding and random field.
Ying Nian Wu, Zhangzhang Si, Chuck Fleming, Song-Chun Zhu
ICCV3