Computer Science – Learning
Scientific paper
2010-11-16
Computer Science
Learning
Scientific paper
Recently, considerable research efforts have been devoted to the design of methods to learn from data overcomplete dictionaries for sparse coding. However, learned dictionaries require the solution of an optimization problem for coding new data. In order to overcome this drawback, we propose an algorithm aimed at learning both a dictionary and its dual: a linear mapping directly performing the coding. By leveraging on proximal methods, our algorithm jointly minimizes the reconstruction error of the dictionary and the coding error of its dual; the sparsity of the representation is induced by an $\ell_1$-based penalty on its coefficients. The results obtained on synthetic data and real images show that the algorithm is capable of recovering the expected dictionaries. Furthermore, on a benchmark dataset, we show that the image features obtained from the dual matrix yield state-of-the-art classification performance while being much less computational intensive.
Basso Curzio
Santoro Matteo
Verri Alessandro
Villa Silvia
No associations
LandOfFree
PADDLE: Proximal Algorithm for Dual Dictionaries LEarning does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with PADDLE: Proximal Algorithm for Dual Dictionaries LEarning, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and PADDLE: Proximal Algorithm for Dual Dictionaries LEarning will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-464750