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

Benjamin J. Culpepper

dblp:75/8774 · also Benjamin Jackson Culpepper · DBLP profile ↗
← Back
2ranked-venue papers
2as first author
0since 2021 · last 2011
—ORCID · none

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

Artificial intelligence and machine learning · 2 · 2 first-authorGraphics, computer vision, multimedia, augmented reality and games · 1 · 1 first-author

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
2 papers
Probabilistic and Bayesian machine learning · 49% Representation and self-supervised learning · 43% Image recognition and object detection · 7%
Computer graphics and multimedia
1 paper
Image and video coding · 77% Computer animation and physical simulation · 23%

Topics — the 6 heaviest of 8, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Machine learning › Probabilistic and Bayesian machine learning › structured models › latent variable model › latent factor model
bilinear model
0.112011
Building a better probabilistic model of images by factorization · ICCV 2011
Machine learning › Representation and self-supervised learning › representation learning › dimensionality reduction › feature selection
feature grouping
0.112011
Building a better probabilistic model of images by factorization · ICCV 2011
Machine learning › Probabilistic and Bayesian machine learning › structured models
latent variable model
0.112011
Building a better probabilistic model of images by factorization · ICCV 2011
Machine learning › Representation and self-supervised learning › representation learning › dimensionality reduction
manifold learning
0.112009
Learning transport operators for image manifolds · NIPS 2009
Image and video coding
transform coding
0.112009
Learning transport operators for image manifolds · NIPS 2009
Computer vision › Image recognition and object detection
image classification
0.012011
Building a better probabilistic model of images by factorization · ICCV 2011

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

infinitesimal generator · 0.2basis adaptation · 0.2factorized representation · 0.1directed bilinear model · 0.1
YearPublicationVenuePosition
2011 Building a better probabilistic model of images by factorization
abstract
We describe a directed bilinear model that learns higher-order groupings among features of natural images. The model represents images in terms of two sets of latent variables: one set of variables represents which feature groups are active, while the other specifies the relative activity within groups. Such a factorized representation is beneficial because it is stable in response to small variations in the placement of features while still preserving information about relative spatial relationships. When trained on MNIST digits, the resulting representation provides state of the art performance in classification using a simple classifier. When trained on natural images, the model learns to group features according to proximity in position, orientation, and scale. The model achieves high log-likelihood (-94 nats), surpassing the current state of the art for natural images achievable with an mcRBM model.
Benjamin J. Culpepper, Jascha Sohl-Dickstein, Bruno A. Olshausen
ICCV1
2009 Learning transport operators for image manifolds
abstract
We describe a method for learning a group of continuous transformation operators to traverse smooth nonlinear manifolds. The method is applied to model how natural images change over time and scale. The group of continuous transform operators is represented by a basis that is adapted to the statistics of the data so that the infinitesimal generator for a measurement orbit can be produced by a linear combination of a few basis elements. We illustrate how the method can be used to efficiently code time-varying images by describing changes across time and scale in terms of the learned operators.
Benjamin J. Culpepper, Bruno A. Olshausen
NIPS1