Learning graph structure for multi-label image classification via clique generation

Files

RA_hdl_107641.pdf (288.08 KB)
  (Restricted Access)

Date

2015

Authors

Tan, M.
Shi, Q.
Van Den Hengel, A.
Shen, C.
Gao, J.
Hu, F.
Zhang, Z.

Editors

Advisors

Journal Title

Journal ISSN

Volume Title

Type:

Conference paper

Citation

Proceedings / CVPR, IEEE Computer Society Conference on Computer Vision and Pattern Recognition. IEEE Computer Society Conference on Computer Vision and Pattern Recognition, 2015, vol.07-12-June-2015, pp.4100-4109

Statement of Responsibility

Mingkui Tan, Qinfeng Shi, Anton van den Hengel, Chunhua Shen, Junbin Gao, Fuyuan Hu, Zhen Zhang

Conference Name

IEEE Conference on Computer Vision and Pattern Recognition (CVPR) (7 Jun 2015 - 12 Jun 2015 : Boston, MA)

Abstract

Exploiting label dependency for multi-label image classification can significantly improve classification performance. Probabilistic Graphical Models are one of the primary methods for representing such dependencies. The structure of graphical models, however, is either determined heuristically or learned from very limited information. Moreover, neither of these approaches scales well to large or complex graphs. We propose a principled way to learn the structure of a graphical model by considering input features and labels, together with loss functions. We formulate this problem into a max-margin framework initially, and then transform it into a convex programming problem. Finally, we propose a highly scalable procedure that activates a set of cliques iteratively. Our approach exhibits both strong theoretical properties and a significant performance improvement over state-of-the-art methods on both synthetic and real-world data sets.

School/Discipline

Dissertation Note

Provenance

Description

Access Status

Rights

Copyright © 2015, IEEE

License

Grant ID

Call number

Persistent link to this record