Learning Hypergraph-regularized Attribute Predictors

Abstract

We present a novel attribute learning framework named Hypergraph-based Attribute Predictor (HAP). In HAP, a hypergraph is leveraged to depict the attribute relations in the data. Then the attribute prediction problem is casted as a regularized hypergraph cut problem in which HAP jointly learns a collection of attribute projections from the feature space to a hypergraph embedding space aligned with the attribute space. The learned projections directly act as attribute classifiers (linear and kernelized). This formulation leads to a very efficient approach. By considering our model as a multi-graph cut task, our framework can flexibly incorporate other available information, in particular class label. We apply our approach to attribute prediction, Zero-shot and $N$-shot learning tasks. The results on AWA, USAA and CUB databases demonstrate the value of our methods in comparison with the state-of-the-art approaches.

This is an attribute learning paper accepted by CVPR 2015

References in corpus (1)

• Caffe: Convolutional Architecture for Fast Feature Embedding

Cited by in corpus (7)

• Latent Embeddings for Zero-shot Classification
• From Zero-shot Learning to Conventional Supervised Classification: Unseen Visual Data Synthesis
• Learning Attributes Equals Multi-Source Domain Generalization
• Open-World Visual Recognition Using Knowledge Graphs
• An Empirical Evaluation of Visual Question Answering for Novel Objects
• Regression-based Hypergraph Learning for Image Clustering and Classification
• Few-Shot Adaptation for Multimedia Semantic Indexing