Discriminative Dictionary Learning with Pairwise ConstraintsOpen Website

Published: 2012, Last Modified: 28 Apr 2023ACCV (1) 2012Readers: Everyone
Abstract: In computer vision problems such as pair matching, only binary information - ‘same’ or ‘different’ label for pairs of images - is given during training. This is in contrast to classification problems, where the category labels of training images are provided. We propose a unified discriminative dictionary learning approach for both pair matching and multiclass classification tasks. More specifically, we introduce a new discriminative term called ‘pairwise sparse code error’ for the discriminativeness in sparse representation of pairs of signals, and then combine it with the classification error for discriminativeness in classifier construction to form a unified objective function. The solution to the new objective function is achieved by employing the efficient feature-sign search algorithm. The learned dictionary encourages feature points from a similar pair (or the same class) to have similar sparse codes. We validate the effectiveness of our approach through a series of experiments on face verification and recognition problems.
0 Replies

Loading