Article ID Journal Published Year Pages File Type
6958256 Signal Processing 2016 42 Pages PDF
Abstract
In this paper we propose an original sparse vector model for symbol retrieval task. More specifically, we apply the K-SVD algorithm for learning a visual dictionary based on symbol descriptors locally computed around interest points. Results on benchmark datasets show that the obtained sparse representation is competitive related to state-of-the-art methods. Moreover, our sparse representation is invariant to rotation and scale transforms and also robust to degraded images and distorted symbols. Thereby, the learned visual dictionary is able to represent instances of unseen classes of symbols.
Related Topics
Physical Sciences and Engineering Computer Science Signal Processing
Authors
, , ,