Abstract

Discriminative dictionary learning has been widely used in many applications such as face retrieval / recognition and image classification, where the labels of the training data are utilized to improve the discriminative power of the learned dictionary. This paper deals with a new problem of learning a dictionary for associating pairs of images in applications such as face image retrieval. Compared with a typical supervised learning task, in this case the labeling information is very limited (e.g. only some training pairs are known to be associated). Further, associated pairs may be considered similar only after excluding certain regions (e.g. sunglasses in a face image). We formulate a dictionary learning problem under these considerations and design an algorithm to solve the problem. We also provide a proof for the convergence of the algorithm. Experiments and results suggest that the proposed method is advantageous over common baselines.

Original languageEnglish (US)
Title of host publication2017 IEEE International Conference on Multimedia and Expo, ICME 2017
PublisherIEEE Computer Society
Pages1410-1415
Number of pages6
ISBN (Electronic)9781509060672
DOIs
StatePublished - Aug 28 2017
Event2017 IEEE International Conference on Multimedia and Expo, ICME 2017 - Hong Kong, Hong Kong
Duration: Jul 10 2017Jul 14 2017

Other

Other2017 IEEE International Conference on Multimedia and Expo, ICME 2017
CountryHong Kong
CityHong Kong
Period7/10/177/14/17

Keywords

  • Constrained dictionary learning
  • Face retrieval
  • Non-negative

ASJC Scopus subject areas

  • Computer Networks and Communications
  • Computer Science Applications

Fingerprint Dive into the research topics of 'Non-negative dictionary learning with pairwise partial similarity constraint'. Together they form a unique fingerprint.

Cite this