Adaptive hypergraph learning and its application in image classification
- Publication Type:
- Journal Article
- Citation:
- IEEE Transactions on Image Processing, 2012, 21 (7), pp. 3262 - 3272
- Issue Date:
- 2012-07-01
Closed Access
| Filename | Description | Size | |||
|---|---|---|---|---|---|
 | 2011005478OK.pdf | 1.95 MB |
Copyright Clearance Process
- Recently Added
- In Progress
- Closed Access
This item is closed access and not available.
Recent years have witnessed a surge of interest in graph-based transductive image classification. Existing simple graph-based transductive learning methods only model the pairwise relationship of images, however, and they are sensitive to the radius parameter used in similarity calculation. Hypergraph learning has been investigated to solve both difficulties. It models the high-order relationship of samples by using a hyperedge to link multiple samples. Nevertheless, the existing hypergraph learning methods face two problems, i.e., how to generate hyperedges and how to handle a large set of hyperedges. This paper proposes an adaptive hypergraph learning method for transductive image classification. In our method, we generate hyperedges by linking images and their nearest neighbors. By varying the size of the neighborhood, we are able to generate a set of hyperedges for each image and its visual neighbors. Our method simultaneously learns the labels of unlabeled images and the weights of hyperedges. In this way, we can automatically modulate the effects of different hyperedges. Thorough empirical studies show the effectiveness of our approach when compared with representative baselines. © 2012 IEEE.
Please use this identifier to cite or link to this item: